Credit points: 3.0
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.
The grade consists of homeworks (mandatory) and final exam:
12% - 2 dry works (6% each)
18% - 2 wet works (9% each)
70% - final exam (you must get at least 55 to pass the course)
Important:
1) You are requested to submit all your works in pairs (except for the final exam, of course).
2) You are requested to submit all your works with a title page. A "Title Page Generator" is available from the "Handouts" tab. Points will be reduced to those submitting without any title page.
3) Please do not submit your papers in a nylon folder.
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.
The grade consists of homeworks (mandatory) and final exam:
12% - 2 dry works (6% each)
18% - 2 wet works (9% each)
70% - final exam (you must get at least 55 to pass the course)
Important:
1) You are requested to submit all your works in pairs (except for the final exam, of course).
2) You are requested to submit all your works with a title page. A "Title Page Generator" is available from the "Handouts" tab. Points will be reduced to those submitting without any title page.
3) Please do not submit your papers in a nylon folder.