Skip to main content
National College Credit Recommendation Service
Maalot Educational Network | Evaluated Learning Experience
Advanced Data Structures (COS342)
Classroom: 39 hours (13 weeks); Distance/Hybrid: Varies.
Traditional classroom-based offered at Maalot, Jerusalem, and other authorized locations. Distance learning and hybrid options available.
Instructional delivery format:
Traditional classroom model
Upon successful completion of the course, students will be able to: discuss the details of various types of advanced data structures, know how and when to use them, and evaluate their efficiency: implement bubble, selection, insertion, shell, quick, merge and heapsort; implement linear, binary and interpolation search; optimize sorts where possible; compare and contrast different searching and sorting algorithms; implement algorithms to find min and max of binary trees and predecessors and successors of given nodes; identify and define balanced binary trees, self-balancing binary search trees (red-black and AVL), multiway search trees, B trees, B+ trees; understand insertion and traversal algorithms for various self-balancing binary search trees and multiway search trees; differentiate between and understand practical applications of different trees; identify and list practical applications of heaps, hash tables and graphs; perform simple operations on heaps and graphs; represent heaps and graphs in multiple ways; address hash table collisions in multiple ways ; and analyze time complexities of all algorithms.
Topics include: evaluation of algorithms, Sorting algorithms – bubble, selection, insertion, merge, quick, shell, and tree sorts, heaps and heapsort, Searching techniques - linear, binary, interpolation, Trees – B-trees, B+trees, Red-Black trees, Hashing, Graphs., b-trees, b+ trees, red-black trees, hashing, and graphs. Methods of instruction include lecture and lab.
In the upper division baccalaureate degree category, 3 semester hours in Computer Science (2/11) (4/16 revalidation) (3/21 revalidation).