Algorithm Analysis
Bindura University of Science EducationDepartment of Computer
Science
CS213 Data Structures and Algorithms
Course Hour: Tueday 1300-1500; Frid 1000-1200
Lecturer: Mr. T RupereOffice & Hours: 10:00-11:00Tuesdays;
12:00-1:00 Friday (or by appointment) E-mail:
[email protected] Aims and Objectives:The course is
intended to give students an understanding of the data structure
and the algorithms used in C. It also aims to give a working
knowledge of various abstract data types and practically
implementing them in practice. Some of the basic algorithms for
searching, sorting, dynamic and graphs often used by programmers
are covered. By the end of the course, the students will be
expected to be familiar with these algorithms and data
structures.
Assessment: The course comprises of assignments/programming
labs, Quizzes and oral presentation. This will be as follows:
Written homework assignments, unannounced quizzes, programming
assignments 20%. There will be 3 programming assignments and these
will be implemented in C. 2 Tests 10% Final comprehensive
examination 70%
Assignments/Tests:Assignments will include both written
exercises and programming labs. The programming labs will be
intended to build upon concepts covered in class. All assignments
must be submitted on time in order to receive maximum credit.
Unless specific exceptions are granted due to extenuating
circumstances, a penalty will be assessed for late assignments at
the rate of 15 points per day.Other Comments:Class attendance and
participation are expected. However, in the event of an absence, it
is the responsibility of the student to apprise him/herself of any
information missed. When answering questions the correct syntax for
C must be given. Academic dishonesty cannot be tolerated. You must
do your own work. Credit cannot be earned for work that is not your
own.Preliminary Weekly Schedule (subject to change):Week
#TopicWeeks
1-2Introduction, arrays, structures, recursion and recursive
algorithms.2
3Searching Sequential, Binary, Sorting- Bubble, Quick, Binary,
Merge1
4-5Pointers, Dynamic memory allocation Lists Linked list, Double
linked list, circular list2
6-7Stacks2
8-9Queues2
10Graphs1
11-12Dynamic algorithms2
Textbook: 1) Introduction to data structures by Larry Nyhoff
2)Data structures using C by A Tenenbaum
3)Data structures Theory and problems by Seymour Lipschutz.
4)Problem solving and program design in C by Hanly and
Koffman.
5) Computer Algorithms/C++ by Ellis Horowitz, Sartaj Sahni,
Rajasekaran Computer Science Press, 1996
6) Algorithms in C++ --R. Sedgewick
7) Introduction to algorithmsUdi Manber, Addison Wesley,
1989
