MANUAL DSA.pdf

(1)

Data Structures and Algorithms

i | P a g e

Data Structures and Algorithms

Laboratory Manual

School of Engineering

Department of Computer Science and Engineering

G D Goenka University

Gurgaon, Haryana

Name:

Roll Number:

Section/Group:

(2)

Data Structures and Algorithms

ii | P a g e

The document is for internal circulation only.

All materials on these pages are copyrighted by the G D Goenka University. All rights reserved. Reproduction, modification, retransmission, in any form or by any means, electronic, mechanical or otherwise, for reasons other than personal use, is strictly prohibited without prior written permission.

First Edition July, 2014

Published by:

SCHOOL OF ENGINEERING

Department of Computer Science and Engineering

G D Goenka University

(3)

Data Structures and Algorithms

iii | P a g e

PREFACE

The School of Engineering (SoE), GDGU has prepared this laboratory manual. It is designed as

an instruction book for purposes listed in order of importance as follows:

1.

To provide techniques, procedures and precautions related to the experiments.

2.

To provide the laboratory safety and general rules and instructions.

3.

To provide a general reference book that will give information which will assist in the

understanding of details about the laboratory and the experiment to be performed.

The manual is prepared with the idea that the revisions must be made periodically in order to

have the available text that represents the experiments. It has been tried to maintain the format

with diagrams, tables and illustrations.

It is believed that the information in the manual will enhance the practical skills of the students

along with developing the base of the subject.

Any suggestions and comments for further improvement of this manual will be gratefully

acknowledged.

Authors

G D Goenka University, Gurgaon

(4)

(5)

v | P a g e

General Rules and Instructions:

Instruction for Students

To complete all the experiments within time, to understand them completely and effectively, each student must obey the following points:

General discipline in the Lab

Discipline is always given the highest precedence for maintaining the quality standard of your lab. Any misconduct will be seriously dealt with and immediately responded without prior notification.

To ensure a pleasant, productive and comfortable experience for all of our users, you are directed to adhere to the following guidelines:

 Students will not be allowed after ten minutes from the scheduled time.

 Students will not leave the lab till the period is over.

 Attendance in the lab class is compulsory.

 Students should maintain silence while performing the experiments.

 Students should not attend a different lab group/section other than the one assigned at the beginning of the session.

 Please help us to keep the facility (Equipments- etc.) clean by discarding trash in the receptacles.

 Please respect the sensitivities of your peers and refrain from viewing any inappropriate content.

 Any attempt on Hacking information will be reciprocated with serious consequences.

Please abide by the rules and make appropriate use of all facilities. Users found to be damaging computer configurations, accessing content or systems illegally or attempting to compromise security may be deprived of the facility or will be fined.

Preparations and Performance

 Students should come to the lab thoroughly prepared on the experiments they are assigned to perform on that day.

(6)

Data Structures and Algorithms

vi | P a g e

 Students should save the results (Screenshots) of their programs performed during lab session.

 Students must bring the lab manual on each practical class with Algorithm, Flowchart, Program and Results (Screenshots) of the last experiments performed complete in all respect.

 Students without lab manual will not be allowed to do the experiments and hence lose their attendance.

Lab Report

 Each student is required to write a complete report of the experiment he has performed and bring to lab class for evaluation in the next working lab.

 Report should be written very clearly and lab record should be maintained neatly.

The lab report must contain the following:

 Duly completed title page

 Algorithms

 Flowcharts

 Code of Program

 Screenshots of Results

Safety Measures

 Do not leave your personal belongings unattended. The Computing Labs and Staff will not be responsible for any lost personal items.

(7)

Data Structures and Algorithms

vii | P a g e

Programs based on Pointers ………

3.1Write a program to test whether a given number is positive, negative or equal to zero.

3.2Write a program to pass a character array in a function and function should compute the total number of occurrences of a particular character in the character array.

5

4.

Programs based on Structures ………...

4.1Write a program to maintain the records of 50 students with the following details (name, age, roll no, branch, DOB) and print the details of only those students whose branch is computer science and engineering.

7

5.

Programs based on Stacks ………....

5.1Write a program for static implementation of various stack operations. 5.2Write a program for dynamic implementation of various stack operations

9

6.

Programs based on Queues ………..

6.1Write a program for static implementation of various operations on linear queue. 6.2Write a program for dynamic implementation of various operations on linear queue

11

7.

Programs based on Linked Lists ………..…….

7.1Write a program to create a linked list and perform insertion and deletion operation on it.

(8)

Data Structures and Algorithms

viii | P a g e

8.

Programs based on Sorting Techniques ………..

8.1Write a program to perform bubble sort. 8.2Write a program for insertion sort. 8.3Write a program for selection sort. 8.4Write a program for quick sort. 8.5Write a program for merge sort

15

9.

Programs based on Searching Techniques ………...

9.1Write a program to perform linear search on n elements in an array. 9.2Write a program to perform binary search on n elements in an array.

20

10.

Programs based on Trees ………..

10.1Write a program for preorder tree traversal techniques. 10.2Write a program for postorder tree traversal techniques. 10.3Write a program for inorder tree traversal techniques.

22

11.

Programs based on Graphs ………

11.1Write a program to implement graph traversal using BFS. 11.2Write a program to implement graph traversal using DFS.

25

12.

Value Added Programs ………

12.1Write a program to implement call by value and call by reference. 12.2Write a program to search an element in a 2-D array using linear search.

12.3Write a program to perform insertion, deletion and updating operations on BST (Binary Search Tree)

12.4Write a program to delete an element on the nth location in the array.

(9)

Data Structures and Algorithms

1 | P a g e

1.

Programs Based on Arrays

Date of Performance Date of Submission Faculty’s Signature ____

(10)

(11)

3 | P a g e

2.

Programs Based on Functions

Date of Performance Date of Submission Faculty’s Signature ____

(12)

(13)

5 | P a g e

3.

Programs Based on Pointers

Date of Performance Date of Submission Faculty’s Signature ____

3.1Write a program to test whether a given number is positive, negative or equal to zero.

(14)

(15)

7 | P a g e

4.

Programs Based on Structures

Date of Performance Date of Submission Faculty’s Signature ____

(16)

(17)

9 | P a g e

5.

Programs Based on Stacks

Date of Performance Date of Submission Faculty’s Signature ____

(18)

(19)

11 | P a g e

6.

Programs Based on Queues

Date of Performance Date of Submission Faculty’s Signature ____

(20)

(21)

13 | P a g e

7.

Programs Based on Linked Lists

Date of Performance Date of Submission Faculty’s Signature ____

(22)

(23)

15 | P a g e

8.

Programs Based on Sorting Techniques

Date of Performance Date of Submission Faculty’s Signature ____

(24)

(25)

(26)

(27)

(28)

20 | P a g e

9.

Programs Based on Searching Techniques

Date of Performance Date of Submission Faculty’s Signature ____

(29)

(30)

22 | P a g e

10.

Programs Based on Trees

Date of Performance Date of Submission Faculty’s Signature ____

(31)

(32)

(33)

25 | P a g e

11.

Programs Based on Graphs

Date of Performance Date of Submission Faculty’s Signature ____

(34)

(35)

27 | P a g e

12.

Value Added Programs

Date of Performance Date of Submission Faculty’s Signature ____

12.1 Write a program to implement call by value and call by reference. 12.2 Write a program to search an element in a 2-D array using linear search.

12.3 Write a program to perform insertion, deletion and updating operations on BST (Binary Search Tree)

(36)

(37)

(38)

Data Structures and Algorithms

(39)

(40)

32 | P a g e

(41)

(42)

34 | P a g e

MANUAL DSA.pdf

Data Structures and Algorithms

Data Structures and Algorithms

Roll Number:

SCHOOL OF ENGINEERING

G D Goenka University

Data Structures and Algorithms

PREFACE

To provide a general reference book that will give information which will assist in the

It is believed that the information in the manual will enhance the practical skills of the students

Authors

General Rules and Instructions:

Preparations and Performance

Data Structures and Algorithms

Lab Report

Safety Measures

Data Structures and Algorithms

Table of Contents

Programs based on Pointers ………

Programs based on Stacks ………....

Data Structures and Algorithms

Programs based on Sorting Techniques ………..

Programs based on Graphs ………

Data Structures and Algorithms

Programs Based on Arrays

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Functions

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Pointers

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Structures

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Stacks

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Queues

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Linked Lists

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Sorting Techniques

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Searching Techniques

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Trees

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Programs Based on Graphs

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Value Added Programs

Date of Performance__________ Date of Submission ____________Faculty’s Signature ______________

Data Structures and Algorithms

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____

Date of Performance Date of Submission Faculty’s Signature ____