School of Computing & Information Technology. Department of Computer Science & Engineering LAB MANUAL CS-1331 DATA STRUCTURES LAB

Transcription

1 School of Computing & Information Technology Department of Computer Science & Engineering LAB MANUAL CS-1331 DATA STRUCTURES LAB Program : B. Tech. Semester : III Semester CS/IT Session : Subject Code : CS 1331 Subject Name : DATA STRUCTURES LAB Credits : [ ] Mr. Mahesh Jangid, Mrs. Kuntal Gaur, Mr. Rahul Saxena, Dr. Vipin Pal, Mr. Vivek Singh Sikarwar Course Instructor(s) HOD (CSE/IT)

2 1. AIM Data Structures and algorithms form the base of computer science and hence this course is introduced at this level so that the students can gain the understanding of how the data gets stored into computer memory and how efficiently by making use of different storage structures, they can save space and time. At the end of the course, they can develop their own algorithms to solve a problem which performs well with respect to complexity analysis parameters. ASSESSMENT CRITERIA: Continuous Evolution through out the Semester Ratio of Internal and External : 60:40 Internal assesment :- performance in lab. Continous Evaluation comprises of lab records, viva, External assesment :- 2 Hr. lab exam followed by viva. 2. LAB OBJECTIVE: 1. Introduction to general programming terms and learning how to develop algorithms. 2. To gain practical experience of programming and model a general problem to computer domain. 3. To teach the student to select the best memory storage structure and develop a solution to the problem in programming terms. 3. GUIDELINES TO STUDENTS: 1. Equipment in the lab for the use of student community. Students need to maintain a proper decorum in the computer lab. Students must use the equipment with care. Any damage caused is punishable. 2. Students are required to carry their observation / programs book with completed exercises while entering the lab. 3. Students are supposed to occupy the machines allotted to them and are not supposed to talk or make noise in the lab. The allocation is put up on the lab notice board.

3 4. Lab can be used in free time / lunch hours by the students who need to use the systems should take prior permission from the lab in-charge. 5. Lab records need to be submitted on or before date of submission. 6. Students are not supposed to use pen drives/cd. 4. FORMAT OF INDEX S.No. Aim of the Program Date of Performance Date of Submission Remar k Signature write complete aim of the program that student has written in the aim section in every program DD/MM/YYY Y DD/MM/YYY Y Here faculty will write some remark/grade/ comment/etc. Signature of the faculty 5. HOW TO WRITE PROGRAM IN THE LAB RECORD Student will need to write program in following format. 1. Aim: write the complete aim of the program to be developed. 2. Software Used: what types of different software used to develop this program a. IDE/Compiler 3. Pseudo Code :- write the algorithm in informal way, 4. Source Code: write complete source code with name of the file in the middle of the sheet and program should be written in proper indentation. 5. Output: write the compete output with set of input entered by user during execution.

4 6. For example: 1. Aim : Write a program in C to display Hello World on to the computer Screen 2. Software Used: Code blocks, Dev C++ compiler, Linux programming platform. Operating System : Windows 2007 or Linux based OS. 3. Pseudo Code/Algo : 4. Source Code : #include<stdio.h> void main() { printf( Hello World ) } 5. Output Hello World

5 Department of Computer Science & Engineering Data Structures Lab Course Code: - CS1331 Credit: - [ ] List of Experiments Semester-Odd (III) 1. Write a program to implement following operations i) Array Insertion ii) Array Deletion iii) Searching (Linear Searching) iv) Sorting (bubble sort) 2. Write a program to implement 2-D Array operations such as addition, subtraction, multiplication and matrix transpose. 3. Write a program to implement simple linked-list operations such as creation, insertion, deletion and searching. 4. Write a program to implement doubly linked list operations such as creation, insertion, deletion and searching. 5. Write a program to implement stack operations using array and linked list. 6. Write a program to implement following stack applications i) Postfix expression evaluation ii) Infix to postfix conversion 7. Write a program to implement simple and circular queue operations using array and linked list. 8. Write a program to implement priority queue and deque operations 9. Write a program to implement following tree operations i) Binary Search Tree creation, insertion by array. ii) Binary Search Tree deletion, searching. iii) Binary Search Tree creation, insertion, deletion using linked list.

6 10. Write a program to implement AVL tree insertion and deletion operations. 11. Write a program to implement Graph implementation by array and linked list. 12. Write a program to implement Searching and Sorting i) Bubble Sort ii)insertion Sort iii)selection Sorting iv)quick sort v) Hashing Mr. Mahesh Jangid, Mrs. Kuntal Gaur, Mr. Rahul Saxena, Dr. Vipin Pal, Mr. Vivek Singh Sikarwar Course Instructor(s)