Basic Information
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: Mathematics
|Undergraduate Studies
Pre-required courses
(104286 - Combinatorics and 104824 - Introduction to Systems Programming) or (104286 - Combinatorics and 234124 - Introduction to Systems Programming)
Course with no extra credit
Semestrial Information
Weekly Hours
3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Lab Hours
Registration Groups
|
|
Weekly Hours
3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Lab Hours
Notes
-
קבוצה 77 סגורה לסיניים בלבד.
Registration Groups
|
|
Weekly Hours
3 Academic Credit • 2 Lecture Hours • 1 Discussion Hours • 1 Lab Hours
Notes
-
קבוצה 77 סגורה לסיניים בלבד
Registration Groups
|
|