Scribd
Upload
18 views

DSA Theory Course Pack

Uploaded by

seharamjadnuml
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
18 views

DSA Theory Course Pack

Uploaded by

seharamjadnuml
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/ 3

DATA STRUCTURES (SEDA-224)

I. Course Details
Credit Hours 4 (3+1)
Pre-requisites Programming Fundamentals
Course Leader Dr. Jaweria Kanwal
Recommended Data Structures and Algorithm Analysis in C++ by Mark Allen Weiss Fourth
Textbook(s) Edition, 2013
Recommended Reference 1. C++ Plus Data Structures by Nell Dale, 5th Edition.
(Books/Websites/Articles) 2. C++ Programming: Program Design including Data Structures by D. S.
Malik, 7th Edition.
3. Data Structures and Program Design in C++ by Robert L. Kruse and
Alexander J. Ryba
4. Introduction to Algorithms by Thomas, 2nd ed., MIT Press, 2007

II. Course Learning Outcomes (CLOs)


CLOs Description Domain Taxonomy PLOs Assessment
level Artifacts
CLO-1 Explain well known linear data structures Cognitive 2 2 A1, Q1,
to solve computing problems Mid Term
CLO-2 Apply well known algorithms: searching Cognitive 3 2 A2, Q2,
and sorting algorithms to new situations Midterm,
based on the requirements Final Term
CLO-3 Explain strategies for efficient storage of Cognitive 2 2 A3, Q3,
data with non-linear data structures and Final Term
analysis of the respective algorithms to
develop small systems

III. Course Assessment


Evaluation Methods Weight (%)
Quizzes 10
Assignments 10
Presentation/Project 5
Midterm 25
Final Term 50
Total 100

IV. Grading Policy


For students admitted in Fall 2021 and onwards
Grade A+ A B+ B C+ C D+ D F
%age >=90 80-89 75-79 70-74 65-69 60-64 55-59 50-54 <50
GPA 4.00 4.00 3.50-3.99 3.00-3.49 2.50-2.99 2.00-2.49 1.50-1.99 1.00-1.49 0.00

Grade A1 A2 A3 B1 B2 B3 C1 C2 D F
%age >=90 80-89 77-79 74-76 70-73 67-69 64-66 60-63 50-59 <50
GPA 4.00 4.00 3.66 3.33 3.00 2.66 2.33 2.00 1.50 0.00
For students admitted before Fall 2021

V. Course Contents
Abstract data types, Array and List, linked list & its various types, sorted linked list,
searching an unsorted array, binary search for sorted arrays,, Stacks (linked lists and array
implementations), Recursion and recursive algorithms, Sorting algorithms (selection,
insertion, merge, quick, bubble, radix, bucket), queue, dequeuer, priority queues (linked
and array implementations of queues), trees and tree traversals, binary search trees,
heaps, M-way tress, balanced trees, graphs, breadth-first and depth-first traversal,
topological order, shortest path, Divide & Conquer algorithms. Adjacency matrix and
adjacency list implementations and their tradeoffs, Analysis of Algorithm.

VI. Weekly Breakdown


Week CLO Topics Reference
No.
1 CLO-1 Introduction to Data structures, need for data structures, Chapter 2
Array data structure and its operations [Ref. Book 1]
Chapter 8
[Ref. Book 1]
2 CLO-2 Searching: Linear Search, Binary Search, Sorting Chapter 2, 7, 18
introduction: Bubble Sort [Ref. Book 2]
3 CLO-3 Analysis of Algorithm, Time Analysis, Asymptotic Notations Chapter 2
for algorithmic complexity analysis
4 CLO-1 Recursion, Generic Class: Template Class, Dynamic Memory Chapter 3
Allocation, Pointers concept, Stack: concepts,
operations, Array based Stack implementation
5 Application of Stacks, Stack and queue differentiation, Queue Chapter 3
concepts and operations, Array Based Queue Implementation

6 Circular Queue concepts and operations Chapter 3


7 Linked List Data structure, array and link list differentiation Chapter 3
and its operations (Insertion beginning, middle and end)
8 Doubly Linked List: concepts, operations Chapter 3
9 Midterm Exams
10 CLO-1 Linked List Based Stack and Queue Implementation Chapter 3
11 CLO-2 Divide and Conquer : Merge Sort, Bucket Sort, Radix Sort, Chapter 7
Quick Sort
12 Trees and Binary Trees: Basic Concepts and terminologies, Chapter 4
Tree Traversals (Inorder, postorder, preorder)
13 CLO-3 Binary Search tree concepts and different function (Search Chapter 4
insert, Traversal, Predecessor and successor etc.)
14 AVL Trees- Different balancing rotations Chapter 4
15 Hashing introduction, hash tables, Collision Resolution Chapter 5
techniques. (Open Addressing, Closed Addressing)
16 Graphs: Basic concepts and properties, types of graphs, Chapter 9
Graph representations matrix and linked implementations and
their tradeoffs. Graph Search algorithms: DFS, BFS

You might also like