Jahangirnagar UnviersityCSE-156: Data Structures Lab
Undergraduate Laboratory, Jahangirnagar University, Department of Computer Science and Engineering, 2019
Objectives
After successful completion of this course, students should be able to:
- Understand and apply basic data structures for storage and retrieval of ordered and unordered data.
- Implement and characterize algorithms for creation and manipulation of data structures like stacks, queues, linked list, etc.
- Interpret and apply appropriate data structures for implementing problem solving algorithms such as searching, insertion, deletion, traversing mechanism, etc., on various data structures.
- Compute and characterize the efficiency of data structures for complex problem-solving algorithms; perform and demonstrate this knowledge and write report for realistic problem solving.
| Lecture# | Description |
|---|---|
| Lec-1 | String Processing (Insert, Delete, Search) |
| Lec-2 | Arrays (Indexing, Searching, Sorting) |
| Lec-3 | Linked List (Insert, Delete, Update) |
| Lec-4 | Recursion |
| Lec-5 | Stack |
| Lec-6 | Queue |
| Lec-7 | Tree-Part-I(Binary Tree, BST, Insert, Delete, Update) |
| Lec-8 | Tree-Part-II (Heap, Priority Queue) |
| Lec-9 | Graph Algorithms-Part-I (BFS) |
| Lec-10 | Graph Algorithms-Part-I (DFS) |
| Lec-11 | Union Find |
| Lec-12 | Minimum Spanning Tree |