|
HU Credits:
3
Degree/Cycle:
2nd degree (Master)
Responsible Department:
Programming Instruction Unit
Semester:
1st Semester
Teaching Languages:
Hebrew
Campus:
E. Safra
Course/Module Coordinator:
Dr. Roie Knaanie
Coordinator Office Hours:
See moodle
Teaching Staff:
Dr. Roie Knaanie
Course/Module description:
Introduction to basic Data Structures and Algorithms: Sorting, arrays, heaps, Binary Search Trees etc. Asymptotic analysis of running time
Course/Module aims:
Familiarize students with the basic concepts and methods related to the development of algorithms and data structures
Learning outcomes - On successful completion of this module, students should be able to:
Learn and understand some basic algorithms and data structures: sorting, pseudo-code, trees, graphs, arrays, heaps.
Analysis of efficiency and running times of existing algorithms and data structures.
Developing algorithms and solving computational problems in programming.
Attendance requirements(%):
0
Teaching arrangement and method of instruction:
The 2020-2021 academic year will open using distance learning, online. Classes will be conducted on Zoom; access to Zoom classes will be through the course website in Moodle.
Weekly programming assignments
Course/Module Content:
1. Sorting: Merge-sort, quick-sort.
2. Asymptotic analysis of running time
3. Recursion programming
4. Recurrence relations, and the divide and conquer paradigm
5. Dynamic data structures
6. Heaps, Heapsort
7. Binary Search Trees.
8. Hash tables
9. Greedy algorithms: Huffman code
10. Dynamic programming: Edit distance
Required Reading:
Introduction to Algorithms, Second Edition . Thomas H. Cormen, Charles E. Leiserson, .Ronald L. Rivest
Additional Reading Material:
Course/Module evaluation:
End of year written/oral examination 85 %
Presentation 0 %
Participation in Tutorials 0 %
Project work 0 %
Assignments 15 %
Reports 0 %
Research project 0 %
Quizzes 0 %
Other 0 %
Additional information:
Submission of 9 exercises with a score of "passing" is a condition for eligibility to be tested in the final exam at the end of the course.
Submission of 10 exercises earns 15 points in the final score.
In case an examination is not possible
In the standard format on campus in the classroom (written exam, not in front of a computer) there will be a home exam or a timed online exam.
|
