Data Structure and Algorithms
0%
Course Title: Data Structure and Algorithms
Course No: IT 238
Nature of the Course: Theory + Lab
Semester: 3
Full Marks: 60 + 40
Pass Marks: 30 + 20
Credit Hours: 3
Course Description
Course Objectives
Course Contents
2. Linked Lists
7 hrs
2.4. Types of Linked List
- Singly Linked List
- Doubly Linked List
- Circular Linked List
3. Stack
4 hrs
4. Queues
4 hrs
5. Recursion
2 hrs
6. Trees
9 hrs
7. Graphs
7 hrs
8. Sorting
6 hrs
8.3. Sorting Algorithms
- Bubble Sort
- Insertion Sort
- Selection Sort
- Heap Sort
- Quicksort
- Mergesort
- Radix Sort
Laboratory Works
- 1.Array and Linked List implementation of List
- 2.Stack operations and Queue operations
- 3.Recursion
- 4.Linked List implementation of Stack and Queues
- 5.Binary Search Tree
- 6.Graph Representation
- 7.Spanning Tree and Shortest Path Algorithms
- 8.Sorting, Searching and Hashing algorithms
Reference Books
- 1.M. T. Goodrich, R. Tamassia, M. H. Goldwasser, "Data Structures and Algorithms in Java", Wiley publication, Sixth Edition, 2014.
- 2.Drozdek Adam, "Data Structures and Algorithms in Java", Cengage Learning Asia, Third Edition, 2010.
- 3.Duncan A. Buell, "Data Structures Using Java" Jones & Bartlett Publishers, 2011
- 4.Robert Lafore, "Data Structures and Algorithms in Java", Sams Publishing;
- 5.Y. Langsam, M. J. Augenstein and A. M Tenenbaum, "Data Structures using C and C++", Pearson Education Inc, 2015