NarsinghDeo, Science" PHT 5. Charles §. gi : rim Kai lai Chung, "A Cours lanohar, "Di ad, J. Laurie Snell 6 IP Tremblay eet Brebability theary Computer Science" Meciragy ipioe" ete Mathematical Structure with Applications to Introduction to Probability” Course | ] Type | subj i Code | ject lL) T/ P| Credits | cA| ms} eS | CA| es cee | ——— cacscoz | cc pee) is) hla lone Weoeeires 4 | 15 | 18 {ee 1s |15 COURSE ouTCOMES problem solving | (COURSE CONTENT UNIT-L Candidate will be able 10 choose the appropriate data structure for a specified 2 pegblem and determine the same in different scenarios of real world problems | 2 Become familiar with writing recursive methods and reducing larger problems | recursively in smaller problems with applications to practical problems. 3 Be abie to understand the abstract properties of various dat as stacks, queues, lists, trees and graphs and apply the same to real life \ problems of sorting, searching, and traversals for skill enhancement in structures such 4 Be able to implement various data structures in more than one manner | S Understand the advantages and disadvantages of the different implementations by using efficient representation of problems. Introduction; Basic Terminology: Elementary Data Organization, Data Structure | Operations, Algorithms Complexity and Time-Space Trade off Arrays: Array Definition and Ani Traversing, Insertion And De! ysis. tion in Representation of Linear Arrays in Memory ray, Single Dimensional Arrays, TWo Dimensional Arrays, Bubble Sorting, Selection Sorting, Linear Search, Binary Search, Multidimensional Arrays, Function Associated with Arrays, Character String in C, Character String Operations, Arrays as parameters, implementing One Dimensional | | Array, {UNIT- \ | \ Stacks and Queues: Introduction to Operations Associated with Stacks Push & Pop, Array representation of stacks, Operation associated with stacks: Create, Add, Delete, | Application of stacks recursion polish expression and their compilation conversion of | infix expression to prefix and postfix expression, Tower of Hanoi problem Representation of Queues, Operations of queues: Create, Add, Delete, Front, Empty, Priority Queues and Heaps, Dequeue ie as\p\2'4 | \Recursion: Recursive thinking, Recursive Arr Res | Bak Tene ay Sennen ine, Recursive Definition of Matnematicny rorrgulae, | Linked Lists: 2 Structure, Problem Solving Wi? Recursion | doubly vine: "More operstions nh ieee nodes ats JUNTA. Trees:Trees mathematical Getrencr eco oonnt Beatie es Cor mlnasy seasnirpessana shor reeresentene” binary trees, Sacrine Pra Binary trees, Extended ee ce traversing , Insertion and Deletion in binary search eeeg, Complexity OF arching algori \ gorithm, Path length, Hufiman's ‘UNIT caded trees, B trees, Trie data structure meanness A Sorting: Insert Insertion Sort, Quick sort, v Ber oe ater Gui eor tows Merge sort, Heap sort, sorting oF Sagi cenenial spree tatcn of graphs. A 8 4 Bee sacks Seon of graphs, Adjacend) trices, Search an re queens eased on sorting and searching, implementing stacks, dUe0Ct simple oes ig postfix expression, command line caleulator change infix 19 partie isl Se Paar otlinked lets -a simple editor program, tTave:s¢ of binery tee binary aech tree creation, insertion, deletion, traversal Sorting. AVL tree erator saiations, Traversal of graphs using BFS and DFS implementation of ccaloulesl sorting. Termplaice and Contaumers Survey of nev data structures Suggestive List of Experiments jl. Write @ program to find: the mean and the median of the numbers stored in an orray, DiiWeltea prosrats to insert-one element in an Oo Sid deleve an element from an array Be yjitersaronram to search (or a number in an Orray 2 Write a program to sort an array S. Write a program to merge (wo Sorted 271! @ Wate a program to store the marks ays ea by. 10 students in 9 courses in two dimensional array >. Wane a program to implement a linked ist 6. Write a program to insert a node In & a td list and delete a node from a Wt ked list © Write a program to print the elements vg linked list in reverse order vatnout disturbing the linked lis Jo. waite a program to reverse a linked list 11 Write a program to add ovo polynomials using linked ists Write a program to implement doubly-linked list 13 Write’a program to implemen’ & stack using an array nya stack using a linked list J Waite a program co implemé © write a'progtam to implemen’ & queue using an array fo Write a program to implement a queue using @ linked list 7 Write a program toimpleme™’ & Gircular queue using an array program a linked list. am to implement & double-ende* 2 implement a priority queue O08 i a 4 linked listPO'Write a program to Construct a binary tree and diaplay ite preorder, inorder andl ‘_ postorder traversals 2) Write a program t ren tree \ 2 Writea Program to construct a graph 3. Write a program to calculate the distance between two vertices in a graph aol 4. Write a program to calculate the distances between every pairs of vertices in a grap S.Write a program to construct a minimal spanning tree of a graph. +S 0 Construct 4 binary sea |References and Text Books; \ 1. Nell B Dale,“C++ data structures", ISBN-10: 1449646751, 5-th edition boc 1 i tructures, 4 2 etsy a cainsircnutes: | bert’ Lafore,“Data structures in Java". Data Structures ~ Horowitz Sahani PHI \ 5. Data Structures — Lipshutz TMH Ca eta otrctures = Lipsn : 3.