Emphasis On Abstract Data Structures, Selection and Designing Data Structures For Efficient Solution of Given Problems. Various Data Structures, Their Properties, Implementations and Applications# Arrays, Stacks, Queues, Dequeues, Various Types of Lists, Search Trees, Heaps and Priority Queues, Hash-tables. Other Topics# Basic Concepts of Complexity, Garbage Collection, Memory Allocation, Internal and External Sorting and Searching.

Faculty: Computer Science
|Undergraduate Studies

Pre-required courses

(94412 - Probability (advanced) and 104286 - Combinatorics and 234122 - Introduction to Systems Programming and 234124 - Introduction to Systems Programming and 234141 - Combinatorics For Cs) or (94412 - Probability (advanced) and 104286 - Combinatorics and 234124 - Introduction to Systems Programming) or (104034 - Introduction to Probability H and 234124 - Introduction to Systems Programming and 234141 - Combinatorics For Cs) or (104034 - Introduction to Probability H and 104286 - Combinatorics and 234122 - Introduction to Systems Programming and 234124 - Introduction to Systems Programming and 234141 - Combinatorics For Cs) or (104222 - Probability Theory and 104286 - Combinatorics and 234124 - Introduction to Systems Programming) or (104222 - Probability Theory and 234124 - Introduction to Systems Programming and 234141 - Combinatorics For Cs)


Parallel course

94412 - Probability (advanced) 104034 - Introduction to Probability H 104222 - Probability Theory


Course with no extra credit

44268 - Int. to Data Structur and Algorithms 94223 - מבני נתונים ואלגוריתמים 94224 - Data Structures and Algorithms


Course with no extra credit (contained)

35015


Semestrial Information