B.Tech in Computer Science and Engineering Programme
Name of the Paper: Data Structures Lab
Paper Code: CS392
Contact (Periods/Week): L-T-P=0-0-3
Credit Point: 2
No. of Lab: 11
Perquisite
1. Computer Fundamentals and principal of computer programming Lab
Objectives:
1. To write and execute programs in C to solve problems using data structures such as arrays, linked lists, stacks, queues, trees, graphs, hash tables and search trees.
2. To write and execute write programs in C to implement various sorting and searching methods.
Outcomes:
CS392.1 Choose appropriate data structure as applied to specified problem definition.
CS392.2 Handle operations like searching, insertion, deletion, traversing mechanism on various data structures.
CS392.3 Have practical knowledge on the applications of data structures.
CS392.4 Able to store, manipulate and arrange data in an efficient manner.
CS392.5 Able to implement queue and stack using arrays and linked list. Implementation of queue, binary tree and binary search tree.
1. Write a C program to implement Single Link List
2. Write a C program to implement Double Link List
3. Write a C program to implement Single Circular Link List
4. Write a C program to implement Double Circular Link List
5.Write a C program to implement Polynomial addition and Polynomial multiplication using Linked List.
6.Write a C program to convert a given infix expression into its postfix Equivalent.
7.Write C programs to implement a queue ADT using i) array and ii) doubly linked list respectively.
8.Write a C program to implement Binary Search Tree (BST).
9.Write C programs for implementing the following sorting methods to arrange a list of integers in ascending order:
Insertion sort
Merge sort
10.Write C programs for implementing the following sorting methods to arrange a list of integers in ascending order:
Quick sort
Selection sort
11.Write C programs for implementing the following searching methods:
Linear Search
Binary Search
12.Write a C program to implement all the functions of a dictionary (ADT) using hashing.
13.Write C programs for implementing the following graph traversal algorithms:
Depth first search
Breadth first search
Text Books:
Data Structures using C, R. Thareja, 2nd Edition, Oxford University Press.
Data Structures Using C E. Balagurusamy, Mcgraw Hill
Reference Books:
Data Structures in C by Aaron M. Tenenbaum, 1st Edition, Pearson
Data Structures Through 'C' Language by Samiran Chattopadhyay, Debabrata Ghosh Dastidar, Matangini Chattopadhyay, Edition: 2001, BPB Publications
Data structures using C, A.K.Sharma, 2nd Edition, Pearson
Fundamentals of Data Structures of C by Ellis Horowitz, Sartaj Sahni, Susan Anderson-freed 2nd Edition, Universities Press
Comments