MMU/F/CIT-001

MULTIMEDIA UNIVERSITY OF KENYA

P.O. Box 15653 - 00503, Mbagathi, Nairobi Tel: +254 020 2071391, +254 020 724257083,
+254 020 735900008 Fax: +254 020 2071243Email:[email protected]
Leader in Innovative Technology
FACULTY OF COMPUTING AND INFORMATIN TECHNOLOGY

DEPARTMENT OF INFORMATION TECHNOLOGY

COURSE OUTLINE
UNIT CODE: CCS 2214 UNIT NAME: DATA STRUCTURES AND ALGORITHM
LECTURER NAME: MR. KELVIN KARIUKI
CONTACTS: +254 729 385 557 | [email protected] | [email protected]
Prerequisite: Introduction to Programming and Algorithms

Purpose;
To enable the learner to understand concepts and applications of data structures and algorithms.

Learning outcomes
By the end of this course unit the student should be able to:
1. Explain the concept of an abstract data type
2. Describe the various data structures and their implementation
3. Explain the different sorting and searching techniques
4. Implement data structures on large scale applications
Course Description;
Introduction to data structures and algorithms: definitions and uses of data structures and
algorithms, role of data structures and algorithms programming, choice of data structures and
algorithms. Elementary data structures: list, queue, stack, tree, records, arrays; types of list:
linear-linked list, doubly linked list, circular linked list, circular doubly linked list; types of
queue: circular queue; types of trees: AVL tree, red black trees, b-trees; graphs; array based and
pointer-based implementation of data structures, hashing, heap, linear, binary search algorithms;
sorting algorithms; depth-first, breadth, hill-climbing, least-cost search algorithms using either a
structured programming language or an OOP language such as C++, JAVA, C#, Python Practical
implementation of Data Structures and search strategies.

1
 MMU/F/CIT-001

Content Summary:
Lecture/Week Course content Remarks
1  Introduction to DSA Theory and
 Recursion Practical
 Big O Notation
2  Arrays Theory and
 Lists Practical
 Dictionaries
 Tuples
3  Linked Lists Theory and
 Circular Singly Linked Lists Practical
 Doubly Linked Lists
 Circular Doubly Linked Lists
4  Stack Theory and
 Queue Practical
5  Binary Tree Theory and
 Binary Search Tree Practical
 AVL Tree
 Binary Heap
6  Trie Theory and
 Hashing Practical
 Sort Algorithms
7  Search Algorithms Theory and
 Graph Algorithms Practical
 Graph Traversal Breadth First Search and Depth
First Search
8  Topological Sort Algorithm Theory and
 Single Source Shortest Path Practical
 Graph Algorithms Dijsktras Algorithm
9  Graph Algorithms Bellman Ford Algorithm Theory and
 All Pairs Shortest Path Practical

10  Graph Algorithms Floyd Warshall Algorithm Theory and

 Minimum Spanning Tree Disjoint Set Practical
11  Graph Algorithms Kruskal and Prims Algorithms Theory and
 Greedy Algorithms Practical

12  Divide and Conquer Algorithms Theory and

Practical
13  Dynamic Programming
14  Revision
15 & 16  End of Semester Exams
2
 MMU/F/CIT-001

Teaching Methodologies;
Lectures, practical sessions and tutorials.

Instructional Materials/Equipment;
1. LCD Projector
2. Whiteboard
3. Textbooks, Computers and Internet.

Course Assessment;
Continuous Assessment Tests 30%
End of Semester Examination 70%

Course Textbooks;

1. Parker, A. (2018). Data Structures and Algorithms in C++ (1st ed.) Routledge;
ISBN-10: 0849371716
2. Weiss, M. A. (2013). Data Structures and Algorithms in C++ (4th ed.) Pearson;
ISBN-10: 013284737X
3. Goodrich, M. T et al (2014). Data Structures and Algorithms in C++ (2nd ed.) Wiley;
ISBN-10: 9788126562923

Course Journals;
1. International Journal of Advanced Computer Science and Technology (IJACST)
2. Journal of Computer and System Sciences
3. Advances in Computational Sciences and Technology (ACST)

Reference Textbooks;
1. Karumanchi, N. (2016) Data Structures and Algorithms Made Easy (5th ed.) Career
Monk Publications; ISBN-10: 819324527X
2. Wittenberg, L. (2017). Data Structures and Algorithms in C++. Mercury Learning &
Information; ISBN-10: 1683920848

3
 MMU/F/CIT-001

3. Anggoro, W. (2018) C++ Data Structures and Algorithms. Packt Publishing; ISBN-10:
1788835212

Reference Journals;
1. International Journal of Computational Science and Engineering (IJCSE)
2. International Journal of Information Science and Education (IJISE)
3. Global Journal of Computational Intelligence Research (GJCIR)

4
 MMU/F/CIT-001

Reference Materials:
Reference Textbooks
1. Chisholm W. and May M. (2008). Universal Design for Web Applications: Web
Applications That Reach Everyone, (1st Ed.). O’Reilly Media. ISBN-13: 978-0596518738
2. Musciano C., and Kennedy B. (2006). HTML &XHTML: The definitive guide (6th Ed.).
O’Reilly Media. ISBN-13: 978-0596527327
3. Henick B. (2010). HTML &CSS: The Good Parts, (1st Ed.). O’Reilly Media. ISBN-13:
978-0596157609

Reference Journals
1. Knowledge and information systems. Springer. ISSN: 0219-3116
2. International Journal of Web Portals. ISSN: 1938-0194
3. Internet journal. ISSN: 1092-406X

Approved for use: Sign: (CoD) _______________________________Date________________

Approved for use: Sign: (Dean, FoST) _________________________Date________________