Scribd
Upload
26 views2 pages

Data Structures and Algorithms (Faisal Rehman) Course Break Up - BS SE - 3rd-R (Fall 2024)

Uploaded by

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

Data Structures and Algorithms (Faisal Rehman) Course Break Up - BS SE - 3rd-R (Fall 2024)

Uploaded by

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

University of Mianwali

Department of Software Engineering

Data Structures and Algorithms (COMP-5106)


Lecture Given in Time Table Semester BS Software Engineering (3rd-R)
Schedule [2023-2027]
Fall 2024

Pre-requisite Credit Hours 4

Instructor Faisal Rehman (Data Science) Contact [email protected]


[email protected]

Mobile
+92 304 3878330

Office New Block (or Block -III), Office Hours Monday – Friday
Ground Floor, Data Science Lab 8:00 A.M. – 04:00 P.M.

Course The course is designed to teach students structures and schemes, which allow them to
Description write programmer to efficiently manipulate, store, and retrieve data. Students are
exposed to the concepts of time and space complexity of computer programs.

Expected Course Learning Outcomes (CLOs):


Outcomes
At the end of the course the students will be able to:

1. Implement various data structures and their algorithms and apply them in . . . . . . . . .
. implementing simple applications.

2. Analyze simple algorithms and determine their complexities.

3. Apply the knowledge of data structure to other application domains.

4. Design new data structures and algorithms to solve problems.

Text and
Reference  Data Structures Using C and C++ (2nd Edition) by Yedidyah Langsam
Books

Grading
Policy
Course Schedule
Reference Page
Week Day Date Topic
Book no(s).
1
Mentioned
Week 1 2 Abstract Data Types, Complexity Analysis
above
3
1 //
Week 2 2 Big Oh Notation
3
1 Stacks (Linked Lists and Array Implementations), //
Week 3
2 Recursion and Analyzing Recursive Algorithms,
3 Divide And Conquer Algorithms
1 //
Sorting Algorithms (Selection, Insertion, Merge,
Week 4 2
Quick, Bubble, Heap, Shell, Radix, Bucket)
3
1 Sorting Algorithms (Selection, Insertion, Merge, //
2 Quick, Bubble, Heap, Shell, Radix, Bucket)
Week 5
3
Continue …
1 //
Queue, Dequeuer, Priority Queues (Linked and
Week 6 2
Array Implementations Of Queues)
3
1 //
Week 7 2 Linked List & Its Various Types
3
1 //
Week 8 2 Sorted Linked List
3

Week 9 Mid Term Exams


1 //
Week 10 2 Searching an Unsorted Array, Binary Search For
Sorted Arrays
3
1 //
Week 11 Hashing and Indexing, Open Addressing and
2
Chaining
3
1 //
Week 12 2 Trees and Tree Traversals
3
1 //
Week 13
2 Binary Search Trees, Heaps
3
1 //
Week 14 2 M-Way Tress, Balanced Trees, Graphs
3
1 //
Breadth-First and Depth-First Traversal,
Week 15 2
Topological Order, Shortest Path
3
1 //
Adjacency Matrix and Adjacency List
Week 16 2 Implementations
3
1 //
Week 17 2 Memory Management and Garbage Collection
3
1
Week 18 2 Final Term Exams
3

You might also like