SE-IT DSA LAB SYLLABUS
0 likes268 views
This document provides information on the Data Structure Lab course including teaching scheme, examination scheme, objectives, outcomes, prerequisites, hardware/software requirements, syllabus, and references. The key details are: - The course is 1 credit with 2 hours of practical sessions per week. Assessment includes an internal test and an end semester exam worth 50 marks total. - The lab aims to teach fundamental data structures like stacks, queues, linked lists, trees, and graphs and their applications. Students will learn to implement various operations and solve real-world problems. - On completion, students will be able to understand and apply concepts of data structures, implement basic and advanced trees, use graphs, and apply searching, hashing
SE-IT DSA LAB SYLLABUS
- 1. Lab Code Lab Name Teaching Scheme (Contact Hours) Credits Assigned Theory Practical Tutorial Theory Practical Tutorial Total ITL301 Data Structure Lab -- 02 -- -- 01 -- 01 Lab Code Lab Name Examination Scheme Theory Marks Term Work Pract. /Oral Total Internal assessment End Sem. Exam Test1 Test 2 Avg. ITL301 Data Structure Lab -- -- -- -- 25 25 50 Lab Objectives: Sr. No. Lab Objectives The Lab experiments aims: 1 To use data structures as the introductory foundation for computer automation to engineering problems. 2 To use the basic principles of programming as applied to complex data structures. 3 To learn the principles of stack, queue, linked lists and its various operations. 4 To learn fundamentals of binary search tree, implementation and use of advanced tree like AVL, B trees and graphs. 5 To learn about searching, hashing and sorting. 6 To learn the applications of linked lists, stacks, queues, trees and graphs. Lab Outcomes: Sr. No. Lab Outcomes Cognitive levels of attainment as per Bloom’s Taxonomy On successful completion, of course, learner/student will be able to: 1 Understand and use the basic concepts and principles of various linked lists, stacks and queues. L1, L2, L3 2 Understand the concepts and apply the methods in basic trees. L1, L2 3 Use and identify the methods in advanced trees. L3, L4 4 Understand the concepts and apply the methods in graphs. L2, L3 5 Understand the concepts and apply the techniques of searching, hashing and sorting L2, L3 6 Illustrate and examine the methods of linked lists, stacks, queues, trees and graphs to various real time problems L3, L4
- 2. Prerequisite: C Programming Hardware & Software Requirements: Hardware Requirement: PC i3 processor and above Software requirement: Turbo/Borland C complier DETAILED SYLLABUS: Sr. No. Module Detailed Content Hours LO Mapping 0 Prerequisite Introduction of C programming language. 02 ---- I Stacks, Queues and Linked Lists Array Implementation of Stack and Queue. Insertion, deletion operations with Singly linked lists Insertion, deletion operations Doubly linked lists Insertion, deletion operations Circular linked lists. Reversing a singly linked list. * Linked List implementation of Stack and Queue 04 LO 1 II Trees * Implementation of operations (insertion, deletion, counting of nodes, counting of leaf nodes etc.) in a binary search tree. Implementation of insertion, deletion and traversal for fully in-threaded binary search tree. 04 LO 2 III Advanced Trees * Implementation of AVL tree. Implementation of operations in a B tree. 04 LO 3 IV Graphs Implementation of adjacency matrix creation. Implementation of addition and deletion of edges in a directed graph using adjacency matrix. Implementation of insertion and deletion of vertices and edges in a directed graph using adjacency list. 04 LO 4 V Searching and Sorting Implementation of Heap Sort Implementation of Binary Search. Implementation of Selection sort, Bubble sort, Insertion sort, Quick sort 04 LO 5
- 3. VI Applications of Data Structures * Implementation of infix to postfix conversion and evaluation of postfix expression * Implementation of Josephus Problem using circular linked list * Implementation of traversal of a directed graph through BFS and DFS. Implementation of finding shortest distances using Dijkstra’s algorithm *Implementation of hashing functions with different collision resolution techniques 04 LO 6 Text Books: 1. S. K Srivastava, Deepali Srivastava; Data Structures through C in Depth; BPB Publications; 2011. 2. Yedidya Langsam, Moshej Augenstein, Aaron M. Tenenbaum; Data Structure Using C & C++; Prentice Hall of India; 1996. 3. Reema Thareja; Data Structures using C; Oxford. References: 1. Ellis Horowitz, Sartaj Sahni; Fundamentals of Data Structures; Galgotia Publications; 2010. 2. Jean Paul Tremblay, Paul G. Sorenson; An introduction to data structures with applications; Tata McGrawHill; 1984. 3. Rajesh K. Shukla; Data Structures using C and C++; Wiley India; 2009. Term Work: Term Work shall consist of at least 10 to 12 practical’s based on the above list. Also Term work Journal must include at least 2 assignments. Term Work Marks: 25 Marks (Total marks) = 15 Marks (Experiment) + 5 Marks (Assignments) + 5 Marks (Attendance) Practical& Oral Exam: An Oral & Practical exam will be held based on the above syllabus.