Department of Artificial Intelligence and Data Science DATA STRUCTURES 1 B.Tech., Il SEMESTER (Common to CE, EEE, CSE, IT, CSM, CSG & AIDS) Course Title: Data Structures Course Code: AS22-0SES07 ‘Teaching Scheme (L:T:P): 3:1:0 Credits: 3 ‘Type of Course: Lecture + Tutorial Total Contact Periods: 48Hrs + 16Hrs (Continuous Internal Evaluation: 40 Marks ‘Semester End Exam: 60 Marks Prerequisites: Programming for Problem Solving, COURSE OVERVIEW This course will deliver the knowledge in introducing the concepts of various data structures such as linked lists, stacks, queues, trees and graphs along with their applications. COURSE OBJECTIVES To understand the basic concepts such as linear and non-Linear data structures To understand the notations used to analyze the Performance of algorithms. To understand the behavior of data structures such as stacks, queues, trees, hash tables, search trees, Graphs and their representations. To choose an appropriate data structure for a specified application. ‘To understand and analyze various searching and sorting algorithms, To learn how to implement lists, stacks, queues, trees, graphs, search trees in C to solve problems COURSE OUTCOMES CO# [Course Outcomes (0123.1 Explain basic concepts of algorithms and Asymptotic Notations 123.2 Explain basic concepts of Data Types, Linear and Non-Linear Data structures. z C1233 | Explain Non-Linear Data structures like trees and graphs. C1234 C1235 Implements and know the application of algorithms for sorting. Understand and implement Searching and Sorting Techniques C1236 | Design programs using a variety of data structures, including Binary and general tree structures, search trees.Department of Artificial Intelligence and Data Science COURSE CONTENT (SYLLABUS) UNIT -1 Introduction to Data Structures: Data Structures Operations, What is an Algorithm, Importance of Time Complexity and Space Complexity, Mathematical Notations and Functions, Algorithmic Notations: Complexity of Algorithms, Omega Notation, Theta Notation, Little oh Notation, Explaining notations on Linear Search and Binary Search operations. UNIT-IE Introduction to Linear Data Structures: Arrays, Representation of linear array in memory, ‘Traversing Linear array, Inserting and Deleting elements in the array. Sorting and Searching Techniques: Sorting Techniques ~ Selection Sort, Bubble Sort, Recursive Bubble Sort, Insertion Sort, Merge Sort, Quick Sort, , Searching(Linear Search, Binary Search) UNIT-II Linked Lists: Introduction to Linked List, Representation of Linked List in memory. Traversing a Linked List, Searching a Linked list. Operations on Linked Lists: Algorithms to insert nodes into a linked list, Inserting ~ at the beginning of a list, Inserting — after a given node, Inserting ~ Into a sorted Linked list, Algorithms to delete a node from a linked list, Deleting — a node following a given node, Deleting — a node with a given item of information, Circular Linked List UNIT-IV Stacks: Introduction to Stacks, Array Representation of Stacks, Linked Representation of Stacks, Arithmetic Expression, Polish Notations, Evaluation of a Postfix expression, transforming infix expression into Postfix conversion of an expression, Importance of Stacks and Recursion, Solving ‘Towers of Hanoi Problem Queues: Introduction to Queues, Representation of Queues, Linked Representation of Queues, DeQueues, Priority Queues, Circular Queues. UNIT-V ‘Trees : Introduction to Binary Trees, Complete Binary Tree, Extended Binary Tree, Representing Binary Trees in memory. Linked Representation of Binary Tree. Sequential Representation of Binary Tree, Traversal Techniques. Binary Search Tree — operations (Insert, delete, search, traversal), AVL Trees — operations (Insert, delete, search, traversal). Graphs : graph Representations, Graph Traversal techniques- BFS & DFS. ‘Text Books 1. Data structures, Seymour Lipschutz, Tata MceGRAW Hill. 2. Cand Data Structures, Ashok N. Kamthane, Pearson Education. References Books: 1. Classic Data Structures, D. Samanta, 2nd edition.PHI. 2. C Programming and Data Structures, Balagurusamy, Tat McGRAW Hill. Online Resources (SWAY AM/NPTEL/MOOCS/COURSERA. 1. https://www.coursera.org/learn/data-structures 2. hitps://www.coursera.org/specializations/data-structures- algorithms 3. _http://nptel.ac.in/courses//data-structuresDepartment of Artificial Intelligence and Data Science Web Reference/E-Books http://svpesc.azureweh hup://www.snewgs.ac.in/wp-content/uploads/2015/1 1/Fundamental-Data- Structures.pdf http://www. learnerstv.com/Free-Computer-Science-Video-lectures-liv247- Page1.htm http://nptel_ac.in/courses/106102064/1Department of Artificial Intelligence and Data Science DATA STRUCTURES LAB 1 B.TECH., Il SEMESTER (Common to CE, EEE, CSE, IT, CSM, CSG & AIDS) Course Title: Data Structures Lab Course Code: AS22-05ESO8 ‘Teaching Scheme (L:T:P): 0:0:3 Credits: 1.5 ‘Type of Course: Practical Total Contact Periods: 48 Hrs Continuous Internal Evaluation: 40 Marks ‘Semester End Exam: 60 Marks Prerequisites: Mathematics Knowledge, Analytical and Logical skills COURSE OVERVIEW This course will deliver the knowledge in introducing the concepts of various data structures such as linked lists, stacks, queues, trees and graphs along with the applications. COURSE OBJECTIVES Covers various concepts of C programming language Introduces searching and sorting algorithms Provides an understanding of data structures such as stacks and queues Implementing all data structures covered in the theory. COURSE CONTENT (SYLLABUS) 1. Write a program that uses functions to perform the following operations on singlylinked list i) Creation ii) Insertion _ ili) Deletion _iv) Display 2. Write a program that uses functions to perform the following operations on doublylinked list. i) Creation ii) Insertion ii) Deletion _iv) Display 3. Write a program that uses functions to perform the following operations on circularlinked list i) Creation ii) Insertion iii) Deletion _iv) Display 4. Write a program that implement stack (its operations) using i) Arrays ii) Pointers 5. Write a program that implement Queue (its operations) using i) Arrays ii) Pointers 6. Write a program that implements the following sorting methods to sort a given listof integers in ascending order i) Bubble sortii) Selection sort iii) Insertion sort 7. Write a program that use both recursive and non-recursive functions to perform the following searching operations for a Key value in a given list of integers: j) Linear search _ii) Binary search(Recursive and Non-Recursive)Department of Artificial Intelligence and Data Science 8. Write a C program to perform Binary Search Tree operations (Insertion, Deletion, Traversal) 9, Write a C program to perform AVL Tree operations 10. Write aC Program wo perform Graph Traversal Techniques ~ BFS and DFS. TEXT BOOKS 1, Data Structures, Seymour Lipzchutz, Tata MeGRAW Hill. 2. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson Freed, Universities Press. 3. Data Structures using C ~ A. S. Tanenbaum, Y. Langsam, and M. J. Augenstein, PHW/Pearson Education. REFERENCE BOOK: 1. Data Structures: A Pseudocode Approach with C, 2nd Edition, 2. R.F. Gilberg and B. A. Forouzan, Cengage Learning.