Bindura University of Science Education

Department of Computer Science

CS213 Data Structures and Algorithms
Course our! "ueday 13##$1%##& 'rid 1###$12##
(ecturer! )r* " +upere
,ffice - ours! 1#!##$11!##"uesdays& 12!##$1!## 'riday .or /y appointment0
E$mail! taurai*rupere1gmail*com

Course Aims and ,/2ectives!
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 assignmentsprogramming labs, !ui""es and oral presentation.
This will be as follows#
$ritten homework assignments, unannounced %ui""es, programming assignments
&'(. There will be ) programming assignments and these will be implemented in
C.
& Tests *'(
+inal comprehensive examination ,'(

Assignments3"ests!
-ssignments will include both written exercises and programming labs. The
programming labs will be intended to build upon concepts covered in class. -ll
assignments must be submitted on time in order to receive maximum credit. .nless
specific exceptions are granted due to extenuating circumstances, a penalty will be
assessed for late assignments at the rate of */ points per day.
,ther Comments!
Class attendance and participation are expected. 0owever, in the event of an absence, it
is the responsibility of the student to apprise himherself of any information missed.
$hen answering %uestions the correct syntax for C must be given. -cademic dishonesty
cannot be tolerated. 4,U )US" D, 4,U+ ,56 5,+7* C+ED8" CA66," BE
EA+6ED ',+ 5,+7 "A" 8S 6," 4,U+ ,56*
9reliminary 5ee:ly Schedule .su/2ect to change0!
5ee: ; "opic 5ee:s
*1&
Introduction, arrays, structures, recursion and recursive algorithms.
&
)
Searching Se%uential, Binary, Sorting1 Bubble, !uick, Binary, 2erge
*
31/
4ointers, 5ynamic memory allocation 6ists 6inked list, 5ouble linked list, circular list
&
71,
Stacks
&
819
!ueues
&
*'
:raphs
*
**1*&
5ynamic algorithms
&

"e<t/oo:!
*; Introduction to data structures by 6arry <yhoff
&; 5ata structures using C by - Tenenbaum
); 5ata structures Theory and problems by Seymour 6ipschut".
3; 4roblem solving and program design in C by 0anly and =offman.
/; Computer -lgorithmsC>> by ?llis 0orowit", Sarta@ Sahni, Aa@asekaran Computer
Science 4ress, *997
7; -lgorithms in C>> 11A. Sedgewick
,; Introduction to algorithmsB.di 2anber, -ddison $esley, *989