Scribd
Upload
145 views2 pages

CMPC-201 Data Structures and Algorithms

This document provides information about the CMPC-201 Data Structures and Algorithms course. The 3 credit course has prerequisites in Object Oriented Programming. It aims to teach students about various data structures and algorithms and how to apply them to solve problems. The course covers topics like sorting techniques, stacks, queues, linked lists, trees, hashing, and graphs. Students will be assessed through exams, assignments, projects and presentations. The document lists several recommended reference materials to support student learning.

Uploaded by

M Naveed Shakir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
145 views2 pages

CMPC-201 Data Structures and Algorithms

This document provides information about the CMPC-201 Data Structures and Algorithms course. The 3 credit course has prerequisites in Object Oriented Programming. It aims to teach students about various data structures and algorithms and how to apply them to solve problems. The course covers topics like sorting techniques, stacks, queues, linked lists, trees, hashing, and graphs. Students will be assessed through exams, assignments, projects and presentations. The document lists several recommended reference materials to support student learning.

Uploaded by

M Naveed Shakir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CMPC-201 Data Structures and Algorithms

Credit Hours: 3+1 Prerequisites: Object Oriented Programming

Course Learning Outcomes (CLOs):


At the end of the course the students will be able to: Domain BT
Level*
1. Acquire the basic knowledge of data structures & algorithms and
understand the concepts of various data structures and use them C 1,2
in different applications.
2. Solve, analyze and evaluate the problems using different data
C 3
structures and algorithms.
3. Demonstrate& apply independently the various forms of data
P 3,4
structures and algorithms
* BT= Bloom’s Taxonomy, C=Cognitive domain, P=Psychomotor domain, A= Affective
domain

Course Content:
1. Introduction to Course, Basic Object Orientation concepts, Properties of Algorithm,
Introduction to Algorithm's Performance Analysis and Measurement (Big Oh Notation)
2. ADT, Basic Operations, Reading, Writing, Insertion, Deletion, Merging, Binary Search.
3. Introduction to Sorting types and Techniques, Logical and Algorithmic Implementation
of Bubble, Selection Sort, Insertion, Quick Sort, Merge Sort.
4. The Stack ADT, Expressions, Postfix Notation, Infix to postfix, postfix evaluation,
Applications of stack
5. Introduction to Recursion, Examples of Recursion, Writing Recursive Programs
6. The Queue ADT and Its Applications, Variation of Queue ADT i.e. Circular and Double
Ended Queue
7. Priority Queues, Introduction to Pointers, Linear single Link
8. Linked Stacks and Queues, Linear Doubly Linked list
9. Circular Lists: Implementation of queues and stacks, Doubly Link List
10. Introduction to Trees, Tree Terminology, Logical construction and Representation of
Trees, Introduction to Binary Tree ADT, Mathematical properties, Linked
Implementation of Binary Trees (Insertion, Traversing, Searching and deletion in Binary
Trees)
11. Binary Search Tree, Implementation and Applications of BSTs
12. Heaps and Heaps as Priority Queues, Introduction to Balanced and AVL Trees, Heap
Sort.
13. Hashing, Overflow Handling, Open Addressing, Chaining
14. Introduction to graph and related terminology, Adjacency Matrix representation of graph
and Adjacency list
15. Elementary Graph Operations, DFS, BFS, Spanning Trees
16. Shortest path algorithms: Dijkstra Algorithm, Minimum Cost Spanning Trees.
Teaching Methodology:
Lectures, Written Assignments, Practical labs, Semester Project, Presentations
Course Assessment:
Sessional Exam, Home Assignments, Quizzes, Project, Presentations, Final Exam
Reference Materials:
1. Data Structures and Algorithms in C++ by Michael T. Goodrich, Roberto Tamassia, and
David Mount (2nd Edition) : ISBN-13: 978-0470383278
2. Data Structures and Algorithms in C++ 4th Edition by Adam Drozdek : ISBN-13: 978-
1133608424
3. Data Structures and Algorithm Analysis in Java (3rd Edition) 3rd Edition by Mark A.
Weiss : ISBN-13: 978-0132576277
4. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein,
“Introduction to Algorithms”, 2nd Ed, MIT Press, 2001, ISBN 0-07-013151-1
5. Data Structures and Abstractions with Java (5th Edition) (What's New in Computer
Science) 5th Edition by Frank M. Carrano (Author), Timothy M. Henry (Author) : ISBN-
13: 978-0134831695
6. Data Structures & Algorithm Analysis in C++ 4th Edition by Mark A. Weiss : ISBN-
13: 978-0132847377

You might also like