This subject develops a thorough understanding of program design using data structures. It extends CSCI114 and presents pointers, dynamic memory management and exception handling. To pass a unit, a student must obtain at least : 50 % of the Final Examination Component (i.e. 25 / 50) and 50% of the OVERALL marks for at least 50 / 100.
This subject develops a thorough understanding of program design using data structures. It extends CSCI114 and presents pointers, dynamic memory management and exception handling. To pass a unit, a student must obtain at least : 50 % of the Final Examination Component (i.e. 25 / 50) and 50% of the OVERALL marks for at least 50 / 100.
Direitos autorais:
Attribution Non-Commercial (BY-NC)
Formatos disponíveis
Baixe no formato PDF, TXT ou leia online no Scribd
This subject develops a thorough understanding of program design using data structures. It extends CSCI114 and presents pointers, dynamic memory management and exception handling. To pass a unit, a student must obtain at least : 50 % of the Final Examination Component (i.e. 25 / 50) and 50% of the OVERALL marks for at least 50 / 100.
Direitos autorais:
Attribution Non-Commercial (BY-NC)
Formatos disponíveis
Baixe no formato PDF, TXT ou leia online no Scribd
Objectives: Provide experience in the use of pointers, dynamic memory management and exception handling Investigates implementation of Sorting and Searching Algorithms Explores the implementation of data structures: queues, stacks, linked lists, dequeues, trees Explores the implementation structure – hashing, radix sort, heaps and Heapsort Provide experience in the use Random Access files and internal I/O
10 x Laboratory sessions 20% Individual Each week from Week 2 – 12 (10
each worth 2 marks weeks total) During Lab time.
5 x Assignments each 30% Individual Assignment 1 Due end of Week 3.
worth 6 marks due roughly Assignment 2 Due end of Week 5. fortnightly. Assignment 3 Due end of Week 8. Assignment 4 Due end of Week 11. Assignment 5 Due end of Week 13.
Examination 50% Individual Formal Examination Period
50 % of the Final Examination Component (i.e. 25 / 50) AND 50% of the OVERALL marks for at least P grade (i.e. 50 / 100). A student who fails must REPEAT the respective unit (i.e. to study the unit again). There is no resit examination.
Notes on Assessment All assignments are expected to be completed independently. Plagiarism may result in a FAIL grade being recorded for that assignment.
IMPORTANT: ALL of the assessment items listed in the above
table must be completed successfully in order to pass the subject.
References The following are REFERENCES for the subject. It is up to you to decide if you need them. 1. Savitch, Walter, Absolute C++, Addison-Wesley, 2002 2. Malik, D.S., C++ Programming: From Problem Solving to Program Design, Thomson Learning, 2002 3. Sedgewick, Robert, Algorithms in C++, Addison-Wesley Pub. Co., c1992 The list is not exhaustive. You can even find useful material in some of the websites.
Class room etiquette The materials builds upon one another If you don’t understand the concept, ASK right away! Be pro-active in class! No hand phones , BB s and Laptops/Notebooks unless asked for . Do not talk while the lecture is going on. If you have any doubt please raise your hand. Don’t be late! Maximum allowed time is 20 minutes! Remember, 2 Absents: First warning letter 4 Absents: Second warning letter 6 Absents or more: BARRED from FINALS