+ All Categories
Home > Documents > 5 Years Integrated M.Sc. (I T): 2nd Semester Practical...

5 Years Integrated M.Sc. (I T): 2nd Semester Practical...

Date post: 12-Oct-2020
Category:
Upload: others
View: 2 times
Download: 0 times
Share this document with a friend
92
5 Years Integrated M.Sc. (IT): 2 nd Semester Practical Problem 060010201: Data Structures Ms. NehalAdhvaryu Group Allocation For Practical Journal Div A Set A Set B Set C 201306100110006 201306100110011 201306100110016 201306100110018 201306100110021 201306100110033 201306100110038 201306100110044 201306100110053 201306100110058 201306100110061 201306100110068 201306100110072 201306100110081 201306100110093 201306100110099 201306100110110 201306100110128 201306100110133 201306100110140 201306100110143 201306100110001 201306100110009 201306100110013 201306100110017 201306100110019 201306100110028 201306100110037 201306100110039 201306100110046 201306100110054 201306100110064 201306100110073 201306100110083 201306100110087 201306100110107 201306100110115 201306100110129 201306100110134 201306100110136 201306100110141 201306100110145 201306100110147 201306100110002 201306100110008 201306100110012 201306100110022 201306100110024 201306100110036 201306100110043 201306100110045 201306100110052 201306100110057 201306100110059 201306100110069 201306100110078 201306100110084 201306100110085 201306100110089 201306100110092 201306100110100 201306100110108 201306100110114 201306100110116 201306100110138 Div B Set D Set E Set F 201306100110003 201306100110014 201306100110025 201306100110026 201306100110030 201306100110034 201306100110041 201306100110060 201306100110065 201306100110070 201306100110086 201306100110091 201306100110096 201306100110102 201306100110106 201306100110117 201306100110125 201306100110126 201306100110004 201306100110010 201306100110020 201306100110027 201306100110031 201306100110035 201306100110042 201306100110050 201306100110063 201306100110067 201306100110076 201306100110090 201306100110097 201306100110104 201306100110112 201306100110118 201306100110122 201306100110127 201306100110005 201306100110007 201306100110015 201306100110029 201306100110032 201306100110040 201306100110047 201306100110051 201306100110062 201306100110066 201306100110071 201306100110094 201306100110101 201306100110105 201306100110109 201306100110120 201306100110123 201306100110130
Transcript
Page 1: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Group Allocation For Practical JournalDiv A Set A Set B Set C

201306100110006201306100110011201306100110016201306100110018201306100110021201306100110033201306100110038201306100110044201306100110053201306100110058201306100110061201306100110068201306100110072201306100110081201306100110093201306100110099201306100110110201306100110128201306100110133201306100110140201306100110143

201306100110001201306100110009201306100110013201306100110017201306100110019201306100110028201306100110037201306100110039201306100110046201306100110054201306100110064201306100110073201306100110083201306100110087201306100110107201306100110115201306100110129201306100110134201306100110136201306100110141201306100110145201306100110147

201306100110002201306100110008201306100110012201306100110022201306100110024201306100110036201306100110043201306100110045201306100110052201306100110057201306100110059201306100110069201306100110078201306100110084201306100110085201306100110089201306100110092201306100110100201306100110108201306100110114201306100110116201306100110138

Div B Set D Set E Set F

201306100110003201306100110014201306100110025201306100110026201306100110030201306100110034201306100110041201306100110060201306100110065201306100110070201306100110086201306100110091201306100110096201306100110102201306100110106201306100110117201306100110125201306100110126

201306100110004201306100110010201306100110020201306100110027201306100110031201306100110035201306100110042201306100110050201306100110063201306100110067201306100110076201306100110090201306100110097201306100110104201306100110112201306100110118201306100110122201306100110127

201306100110005201306100110007201306100110015201306100110029201306100110032201306100110040201306100110047201306100110051201306100110062201306100110066201306100110071201306100110094201306100110101201306100110105201306100110109201306100110120201306100110123201306100110130

Page 2: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

201306100110131201306100110144201306100110148

201306100110135201306100110139

201306100110137201306100110146

Page 3: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 1 Enrollment No. Group : APractical Problem Write a program to create an array for 10 numbers where the value

for 10 numbers are given by user and find out average of elementin array.Display like: Average of 10 numbers=<sum>/10=<answer>.[NOTE: Create user define function for calculateaverage]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

½ Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How to declare array having size 25?2. What is the syntax to declare Array?3. What is the use of index?Canindexhave negative values?4. How many elements are there in array A[1:25]?5. Which data structure is used to store finite number of

same type?6. Modify program to initialize all elements of array using

random number.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 4: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 2 Enrollment No. Group : APractical Problem Write a program to create an array for 12 numbers and insert new

element to particular position where the value for new element andposition are given by user.[NOTE: Create User define function forinsert element]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Which are the operations are performed in an array?2. For 22 size of array, what are the changes needed in

program?3. What do you mean dynamic memory allocation?4. Which formula is used to calculate address in one-

dimensional array?5. What is difference between Replace and Insert

operation?6. What is ADT?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 5: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 3 Enrollment No. Group : APractical Problem Write a program for addition of two3x3 matrixes.

Display output as matrix format.For example1 2 3 1 2 2A[][]= 4 6 7 B[] []= 2 3 12 1 1 1 1 12 4 5

Addition= A+B = 6 9 83 2 2

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, Matrix concepts.Duration forcompletion

½ Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How many elements are there in A[13][21]?2. What is row major order?3. What is column major order?4. What is the formula to calculate address of 2-

dimensional array using row major and column major?5. What is the difference between row major and column

major in memory representation?6. Extend program to do C=(2A+B) on matrix.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 6: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 4 Enrollment No. Group : APractical Problem Write a program to find out total number of odd elements in 2-

dimensaional array. Where row, column and value of elements aregiven by user.Display Like:1st row has <n1> odd elements.2nd row has <n2> odd elements...Nth row has <nn> odd elements.Total number of odd elements:<n1+n2+….+nn>[NOTE: The value for Row and Column are given by user]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the condition for finding even elements?2. What is sparse matrix?3. If base address of A[1:17] is 1003 then what is address of

A[11] using row major?4. If base address of A[1:7,0:5] is 119 then what is address

of A[4,4] using row major and column major?5. Modify above program to count total odd element by

column.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 7: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 5 Enrollment No. Group : APractical Problem Write a menu driven program to demonstrate following operations

on stack of positive numbers [implement using array]:1. Push2. Pop3. Peep

Objective(s) Student shall be able to perform different operations on stack and

queue.

Pre-requisite Usage of Stack and arrayDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is stack?2. What is the meaning of push,pop and peep?3. When stack is said to be overflow? Write condition for

same.4. When stack is said to be underflow? Write condition for

same.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 8: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 6 Enrollment No. Group : APractical Problem Write a program to convert infix expression to postfix using stack

Display Like:Infix expression :< Expression>.Postfix expression :< Expression>.

[NOTE: implement stack using array].

Objective(s) Student shall be able to perform different operations on stack .

Pre-requisite Usage of Stack and arrayDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. List the application of stack.2. Convert (a*b)/(c+d)-e expression into postfix.3. Convert (a*b)/(c+d)-e expression into prefix.4. What is recursion?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 9: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 7 Enrollment No. Group : APractical Problem Write a menu driven program to demonstrate following operations

on queue. [NOTE: implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue.

Pre-requisite Usage of Queue and arrayDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is queue?2. When queue is said to be full?3. When queue is said to be empty?4. What is the difference between stack and queue?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 10: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 8 Enrollment No. Group : APractical Problem Write a menu driven program to demonstrate following operations

on circular queue[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of Queue and arrayDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the difference between queue and circularqueue?

2. What is the drawback of linear queue?3. What is the difference between deque and queue?4. List application of queue.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 11: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 9 Enrollment No. Group : APractical Problem Create a singly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to singly and

singly linked list.

Pre-requisite Usage of Singly Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the need for linked representations of list?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 12: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 10 Enrollment No. Group : APractical Problem Create a doubly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to doubly linked

list.

Pre-requisite Usage of Doubly Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the draw back of singly linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the difference between singly and doubly linked

list?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 13: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 11 Enrollment No. Group : APractical Problem Create a circular singly linked list of numbers and demonstrate

following operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to circular

linked list.

Pre-requisite Usage of circular Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is circular linked list?2. What is the difference between singly circular linked list

and doubly circular linked list?3. What is the node structure of circular singly linked list?4. What is the condition for knowing whether the node is

last node in the list or not?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 14: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 12 Enrollment No. Group : APractical Problem Assume that there is one existing singly linked list, which will

store information of employee like employee no, name and salary.Create menu driven program for following operations.

a) Remove method: which will ask user to insert employeeno and it will remove all the information of employeewhose employee no is match with inputted employee no.

b) Display method: Display information of employee fromsingly linked list.

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is object?2. How to access member function?3. What is the node structure of linked list?4. What is dynamic memory allocation?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 15: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 13 Enrollment No. Group : APractical Problem Write a simple railway ticket reservation program. The program

should display a menu with the following options: reserve a ticket,cancel a reservation, check whether a ticket is reserved for aparticular person, and display the passengers. The information ismaintained on an alphabetized linked list of names. In a simplerversion of the program, assume that tickets are reserved for onlyone train.(Use Singly Linked List)

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How you will traverse from one node to another?2. Is linked list non-linear data structure?3. What is the node structure of linked list?4. Which method you will take for cancellation of a

method?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 16: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 14 Enrollment No. Group : APractical Problem Create an array of 20 elements and apply following techniques to

sort it.1. Selection sort2. Bubble sort3. Insertion sort4. Merge sort5. Quick sort

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of sorting.

Pre-requisite Usage of Sorting.Duration forcompletion

09Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Can bubble sort ever perform better than quick sort?2. Which sorting techniques are an example of divide and

conquer?3. Which sorting techniques is an application of recursion?4. What is the time complexity of quick sort?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 17: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 15 Enrollment No. Group : APractical Problem Create an array of 20 elements and apply following techniques to

search it.1. Linear Search2. Binary Search

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of searching.

Pre-requisite Usage of SearchingDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the Complexity of worst case and best case inordered linear search?

2. What is the complexity of worst case and best case inunordered linear search?

3. What are the advantages of binary search over linearsearch?

4. In linked list, which searching technique is better linearsearch or binary search?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 18: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 1 Enrollment No. Group : BPractical Problem Write a program to create an array for 10 numbers where the value

for 10 numbers are given by user and find out the location of givennumber in array. If location was found then display “Location of<n> is :< answer >” else display “Element was not present”.[NOTE: Create User define function for Find location]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

½ Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

4. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill.

5. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

6. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is an array?2. What is the use of index?3. How many elements are there in array D[1:35]?4. If base address of A[-4:17] is 110 then what is address of

A[9]?5. Which data structure is used to store finite number of

same type?6. Modify program to initialize all elements of array using

random number.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 19: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 2 Enrollment No. Group : BPractical Problem Write a program to create an array for 12characters and replace

element to particular position where the value for replace elementand position are given by user. [NOTE: Create User definefunction for replace element]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Which are the operations are performed in an array?2. Which formula is used to calculate address in one-

dimensional array?3. What is the disadvantage of an array?4. What is ADT?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 20: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 3 Enrollment No. Group : BPractical Problem Write a program for subtraction of two3x3 matrixes.

Display output as matrix format. For example1 2 3 1 2 2

A[] []= 4 6 7 B[] []= 2 3 12 1 1 1 1 1

0 0 1Addition= A-B = 2 3 6

1 0 0Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How many elements are there in A[13][20]?2. What is row major order?3. What is column major order?4. If base address of A[1:17,-2:5] is 100 then what is

address of A[7,3]?5. Extend program to do C=(2A-3B) on matrix.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 21: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 4 Enrollment No. Group : BPractical Problem Write a program to find out total number of even elements in 2-

dimensaional array. Where row, column and value of elements aregiven by user. Display Like:1st column has <n1> even elements.2ndcolumn has <n2> even elements..Nth column has <nn> even elements.Total number of even elements:<n1+n2+….+nn>[NOTE: The value for Row and Column are given by user]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the condition for finding odd elements?2. What is sparse matrix?3. What is the formula to calculate address of 2-

dimensional array?4. What is the difference between row major and column

major?5. Modify above program to count total even element by

row.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 22: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 5 Enrollment No. Group : BPractical Problem Write a menu driven program to demonstrate following operations

on stack [implemented using array]:1. Push2. Pop3. Peep

Objective(s) Student shall be able to perform different operations on stack and

queue.

Pre-requisite Usage of Stack.Duration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is stack?2. What is the meaning of push,pop and peep?3. When stack is said to be overflow?4. When stack is said to be underflow?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 23: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 6 Enrollment No. Group : BPractical Problem Write a program to convert infix expression to prefix using stack

[implement stack using array]:

Objective(s) Student shall be able to perform different operations on stack .

Pre-requisite Usage of Stack.Duration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. List the application of stack.2. Convert (a*b)/(c+d)-e expression into postfix.3. Convert (a*b)/(c+d)-e expression into prefix.4. What is recursion?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 24: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 7 Enrollment No. Group : BPractical Problem Write a menu driven program to demonstrate following operations

on queue [implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is queue?2. When queue is said to be full?3. When queue is said to be empty?4. What is the difference between stack and queue?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 25: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 8 Enrollment No. Group : BPractical Problem Write a menu driven program to demonstrate following operations

on circular queue[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the difference between queue and circularqueue?

2. What is the drawback of linear queue?3. What is the difference between deque and queue?4. List application of queue.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 26: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 9 Enrollment No. Group : BPractical Problem Create a singly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to singly and

singly linked list.

Pre-requisite Usage of Singly Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the need for linked representations of list?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 27: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 10 Enrollment No. Group : BPractical Problem Create a doubly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to doubly

linked list.

Pre-requisite Usage of Doubly Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the draw back of singly linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the difference between singly and doubly linked

list?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 28: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 11 Enrollment No. Group : BPractical Problem Create a circular singly linked list of numbers and demonstrate

following operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to circular

linked list.

Pre-requisite Usage of circular Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is circular linked list?2. What is the difference between singly circular linked list

and doubly circular linked list?3. What is the node structure of circular singly linked list?4. What is the condition for knowing whether the node is

last node in the list or not?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 29: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 12 Enrollment No. Group : BPractical Problem Assume that there is one existing singly linked list, which will

store information of employee like employee no, name and salary.Create menu driven program for following operations.

a) Add method: create method Which will insert studentinformation in a singly linked list. Before insertion askuser on which position they want to insert and accordingto user’s choice insert information after given position.

b) Display method: Display information of employee fromsingly linked list.

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is object?2. How to access member function?3. What is the node structure of linked list?4. What is dynamic memory allocation?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 30: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 13 Enrollment No. Group : BPractical Problem Write a simple railway ticket reservation program. The program

should display a menu with the following options: reserve a ticket,cancel a reservation, check whether a ticket is reserved for aparticular person, and display the passengers. The information ismaintained on an alphabetized linked list of names. In a simplerversion of the program, assume that tickets are reserved for onlyone train.(Use doubly linked list)

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How you will traverse from one node to another?2. Is linked list non-linear data structure?3. What is the node structure of linked list?4. Which method you will take for cancellation of a

method?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 31: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 14 Enrollment No. Group : BPractical Problem Create an array of 20 elements and apply following techniques to

sort it.1. Selection sort2. Bubble sort3. Insertion sort4. Merge sort5. Quick sort

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of sorting.

Pre-requisite Usage of Sorting.Duration forcompletion

09 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Can bubble sort ever perform better than quick sort?2. Which sorting techniques are an example of divide and

conquer?3. Which sorting techniques is an application of recursion?4. What is the time complexity of quick sort?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 32: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 15 Enrollment No. Group : BPractical Problem Create an array of 20 elements and apply following techniques to

search it.1. Linear Search2. Binary Search

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of searching.

Pre-requisite Usage of SearchingDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the Complexity of worst case and best case inordered linear search.

2. What is the complexity of worst case and best case inunordered linear search.

3. What are the advantages of binary search over linearsearch?

4. In linked list, which searching technique is better linearsearch or binary search?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 33: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 1 Enrollment No. Group : CPractical Problem Write a program to create an array for 10 numbers where the value

for 10 numbers are given by userandfind the greatest number inarray.[NOTE: Create User define function as Greatest()]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the syntax to declare Array? anddeclare arrayhaving size 17.

2. What is the use of index? Can index have negativevalues?

3. How many elements are there in array A[-1:15]?4. Which data structure is used to store finite number of

same type?5. Modify program to initialize all elements of array using

random number.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 34: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 2 Enrollment No. Group : CPractical Problem Write a program to create an array for 12numbers and sort all

elements in ascending order where the values for all elements inarray are given by user. [NOTE: Create User define function forsort all elements]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Which are the operations are performed in an array?2. Which formula is used to calculate address in one-

dimensional array?3. What is the disadvantage of an array?4. What is ADT?5. Modify above program to perform sorting in descending

order.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 35: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 3 Enrollment No. Group : CPractical Problem Write a program for multiplication of two 2-dimensional array.Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How many elements are there in A[13][7]?2. What is row major order?3. What is column major order?4. If base address of A[1:17] is 110 then what is address of

A[7]?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 36: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 4 Enrollment No. Group : CPractical Problem Write a program to create 2-D array where row, column and value

of elements are given by user.Perform searching whether particularelement is available in 2-dimensional array or not displayappropriate message. Display like: Element <n> is in <r1> row and<c1>column.[NOTE: Create User define function for searching element]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the condition for finding even elements?2. What is sparse matrix?3. What is the formula to calculate address of 2-

dimensional array?4. What is the difference between row major and column

major?5. If base address of A[-1:6,1:5] is 119 then what is address

of A[3,4] using row major and column major?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 37: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 5 Enrollment No. Group : CPractical Problem Write a program to demonstrate following operations on stack

[implemented using array]:1. Push2. Pop3. Peep

Objective(s) Student shall be able to perform different operations on stack and

queue.

Pre-requisite Usage of Stack and array.Duration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is stack?2. What is the meaning of push, pop and peep?3. When stack is said to be overflow?4. When stack is said to be underflow?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 38: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 6 Enrollment No. Group : CPractical Problem Write a program of palindrome using stack [implement stack using

array]:Note: Punctuation, Capitalization, and Spaces are ignored. ForExample- Poor dan is in a droop.

Objective(s) Student shall be able to perform different operations on stack .

Pre-requisite Usage of Stack and array.Duration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. List the application of stack.2. Convert (a*b)/(c+d)-e expression into postfix.3. Convert (a*b)/(c+d)-e expression into prefix.4. What is recursion?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 39: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 7 Enrollment No. Group : CPractical Problem Write a program to demonstrate following operations on queue

[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of Queue and array.Duration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is queue?2. When queue is said to be full?3. When queue is said to be empty?4. What is the difference between stack and queue?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 40: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 8 Enrollment No. Group : CPractical Problem Write a program to demonstrate following operations on circular

queue[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the difference between queue and circularqueue?

2. What is the drawback of linear queue?3. What is the difference between deque and queue?4. List application of queue.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 41: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 9 Enrollment No. Group : CPractical Problem Create a singly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to singly and

singly linked list.

Pre-requisite Usage of Singly Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the need for linked representations of list?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 42: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 10 Enrollment No. Group : CPractical Problem Create a doubly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to doubly

linked list.

Pre-requisite Usage of Doubly Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the draw back of singly linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the difference between singly and doubly linked

list?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 43: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 11 Enrollment No. Group : CPractical Problem Create a circular singly linked list of numbers and demonstrate

following operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to circular

linked list.

Pre-requisite Usage of circular Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is circular linked list?2. What is the difference between singly circular linked list

and doubly circular linked list?3. What is the node structure of circular singly linked list?4. What is the condition for knowing whether the node is

last node in the list or not?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 44: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 12 Enrollment No. Group : CPractical Problem Assume that there is one existing singly linked list, which will

store information of student like student Enorllment No, Name andCourse. Create menu driven program for following operations.

a) Insert: create method Which will insert studentinformation in a singly linked list. Before insertion askuser on which position they want to insert and accordingto user’s choice insert information after given position.

b) Display: Create method which will display informationof student from singly linked list.

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is object?2. How to access member function?3. What is the node structure of linked list?4. What is dynamic memory allocation?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 45: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 13 Enrollment No. Group : CPractical Problem Write a simple airline ticket reservation program. The program

should display a menu with the following options: reserve a ticket,cancel a reservation, check whether a ticket is reserved for aparticular person, and display the passengers. The information ismaintained on an alphabetized linked list of names. In a simplerversion of the program, assume that tickets are reserved for onlyone flight. (Use Doubly Linked List)

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How you will traverse from one node to another?2. Is linked list non-linear data structure?3. What is the node structure of linked list?4. Which method you will take for cancellation of a

method?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 46: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 14 Enrollment No. Group : CPractical Problem Create an array of 20 elements and apply following techniques to

sort it.1. Selection sort2. Bubble sort3. Insertion sort4. Merge sort5. Quick sort

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of sorting.

Pre-requisite Usage of Sorting.Duration forcompletion

09 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Can bubble sort ever perform better than quick sort?2. Which sorting techniques are an example of divide and

conquer?3. Which sorting techniques is an application of recursion?4. What is the time complexity of quick sort?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 47: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 15 Enrollment No. Group : CPractical Problem Create an array of 20 elements and apply following techniques to

search it.1. Linear Search2. Binary Search

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of searching.

Pre-requisite Usage of SearchingDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the Complexity of worst case and best case inordered linear search.

2. What is the complexity of worst case and best case inunordered linear search.

3. What are the advantages of binary search over linearsearch?

4. In linked list, which searching technique is better linearsearch or binary search?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 48: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 1 Enrollment No. Group : DPractical Problem Write a program to create an array for 10 numbers andfind the

smallest number in an array.[NOTE: Create User define functionfor smallest number.]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How to declare array having size 25?2. What is the syntax to declare Array?3. What is the use of index? Can index have negative

values?4. How many elements are there in array A[1:25]?5. Which data structure is used to store finite number of

same type?6. Modify program to find the biggest number in an array.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 49: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 2 Enrollment No. Group : DPractical Problem Write a program to create an array of size 10 and delete element

from the particular position where the value for a deleting anelement is given by user. [NOTE: Create User define function fordeleting an element]

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Which operations are performed in an array?2. Which formula is used to calculate address in one-

dimensional array?3. What are the disadvantage of an array?4. What is ADT?5. Modify this program by inserting element at particular

position.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 50: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 3 Enrollment No. Group : DPractical Problem Write a program for transposition of one 3x3 matrixes.

Display output as matrix format. For example1 2 3

A[3][3]= 4 6 72 1 1

Transposition A [3][3]= 1 4 22 6 13 7 1

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, Matrix conceptsDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How many elements are there in A[3][2]?2. What is row major order?3. What is column major order?4. If base address of A[1:17] is 100 then what is address of

A[7]?5. Extend program to do c=2A`+A on matrix.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 51: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 4 Enrollment No. Group : DPractical Problem Write a program which will display position of element from 3x3

matrix, if element is available into the array otherwise displayappropriate message, element will be enter by user.For Example:A [3][3]= { {3,4,7},{8,10,21},{55,9,34}}If user enter element 10 then display “ Element 10 is in 1st row and2nd columnIf user enter element 99 then display “Element is not into thearray”

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is sparse matrix?2. What is the formula to calculate address of 2-

dimensional array?3. What is the difference between row major and column

major?4. If I want to display element of a particular position how I

will display?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 52: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 5 Enrollment No. Group : DPractical Problem Write a program to demonstrate following operations on stack

[implemented using array]:1. Push2. Pop3. Peep

Objective(s) Student shall be able to perform different operations on stack and

queue.

Pre-requisite Usage of Stack.Duration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is stack?2. What is the meaning of push,pop and peep?3. When stack is said to be overflow?4. When stack is said to be underflow?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 53: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 6 Enrollment No. Group : DPractical Problem Write a program to reverse all the characters of a given string

using stack [implement stack using array]:

Objective(s) Student shall be able to perform different operations on stack .

Pre-requisite Usage of Stack.Duration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. List the application of stack.2. Convert (a*b)/(c+d)-e expression into postfix.3. Convert (a*b)/(c+d)-e expression into prefix.4. What is recursion?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 54: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 7 Enrollment No. Group : DPractical Problem Write a program to demonstrate following operations on queue

[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is queue?2. When queue is said to be full?3. When queue is said to be empty?4. What is the difference between stack and queue?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 55: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 8 Enrollment No. Group : DPractical Problem Write a program to demonstrate following operations on circular

queue[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the difference between queue and circularqueue?

2. What is the drawback of linear queue?3. What is the difference between deque and queue?4. List application of queue.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 56: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 9 Enrollment No. Group : DPractical Problem Create a singly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to singly and

singly linked list.

Pre-requisite Usage of Singly Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the need for linked representations of list?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 57: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 10 Enrollment No. Group : DPractical Problem Create a doubly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to doubly

linked list.

Pre-requisite Usage of Doubly Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the draw back of singly linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the difference between singly and doubly linked

list?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 58: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 11 Enrollment No. Group : DPractical Problem Create a circular singly linked list of numbers and demonstrate

following operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to circular

linked list.

Pre-requisite Usage of circular Linked ListDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is circular linked list?2. What is the difference between singly circular linked list

and doubly circular linked list?3. What is the node structure of circular singly linked list?4. What is the condition for knowing whether the node is

last node in the list or not?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 59: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 12 Enrollment No. Group : DPractical Problem Write a program which will insert and display information of

employee like employee no, name, designation and salary indoubly linked list.

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is object?2. How to access member function?3. What is the node structure of linked list?4. What is dynamic memory allocation?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 60: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 13 Enrollment No. Group : DPractical Problem Write a simple airline ticket reservation program. The program

should display a menu with the following options: reserve a ticket,cancel a reservation, check whether a ticket is reserved for aparticular person, and display the passengers. The information ismaintained on an alphabetized linked list of names. In a simplerversion of the program, assume that tickets are reserved for onlyone flight. (Use Singly Linked List)

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How you will traverse from one node to another?2. Is linked list non-linear data structure?3. What is the node structure of linked list?4. Which method you will take for cancellation of a

method?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 61: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 14 Enrollment No. Group : DPractical Problem Create an array of 20 elements and apply following techniques to

sort it.1. Selection sort2. Bubble sort3. Insertion sort4. Merge sort5. Quick sort

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of sorting.

Pre-requisite Usage of Sorting.Duration forcompletion

09 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Can bubble sort ever perform better than quick sort?2. Which sorting techniques are an example of divide and

conquer?3. Which sorting techniques is an application of recursion?4. What is the time complexity of quick sort?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 62: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 15 Enrollment No. Group : DPractical Problem Create an array of 20 elements and apply following techniques to

search it.1. Linear Search2. Binary Search

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of searching.

Pre-requisite Usage of SearchingDuration forcompletion

2 Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the Complexity of worst case and best case inordered linear search.

2. What is the complexity of worst case and best case inunordered linear search.

3. What are the advantages of binary search over linearsearch?

4. In linked list, which searching technique is better linearsearch or binary search?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 63: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 1 Enrollment No. Group : EPractical Problem Write a program to create an array for 10 numbers andcount how

many odd numbers in array. [NOTE: Create User define functionfor calculating odd numbers]For Example:if A []= { 1,3,2,5,4,7,10,12,15,17}

Output will be “Total number of odd elements are 6 “Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argument.Duration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is an array?2. What is the use of index?3. How many elements are there in array a[0:10]?4. Which data structure is used to store finite number of

same type?5. If I want to find out total number of even elements then

what is the condition?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 64: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 2 Enrollment No. Group : EPractical Problem Write a program create array of 10 character and perform

reverseoperation in an array. [NOTE: Create User define functionfor reverse operation]For Example:if A []= {‘A’,’b’,’d’,’e’,’f’,’G’,’h’,’I’,’J’,’c’}

Output will be c J I h G f e d b AObjective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argument.Duration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Which are the operations are performed in an array?2. Which formula is used to calculate address in one-

dimensional array?3. What are the disadvantage of an array?4. What is ADT?5. What is the looping condition for reversing elements?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 65: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 3 Enrollment No. Group : EPractical Problem Write a program to find whether two 3x3 matrices are same or not.

For Example:A[3][3]=5 4 3 B[3][3] = 5 4 3

9 5 2 9 1 27 8 1 7 8 1

then output will be “Matrices are not same.”Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How many elements are there in A[3][3]?2. What is row major order?3. What is column major order?4. If base address of A[1:17] is 100 then what is address of

A[5]?5. Modify program by comparing A with B`.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 66: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 4 Enrollment No. Group : EPractical Problem Write a program to count occurrence of particular element in one

nxn matrix, where row, column and element are entered by user.Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is sparse matrix?2. What is the formula to calculate address of 2-

dimensional array?3. What is the difference between row major and column

major?4. Modify program by counting occurrence of all the

elements in an array.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 67: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 5 Enrollment No. Group : EPractical Problem Write a program to demonstrate following operations on stack

[implemented using array]:1. Push2. Pop3. Peep

Objective(s) Student shall be able to perform different operations on stack and

queue.

Pre-requisite Usage of Stack.Duration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is stack?2. What is the meaning of push,pop and peep?3. When stack is said to be overflow?4. When stack is said to be underflow?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 68: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 6 Enrollment No. Group : EPractical Problem Write a program of factorial using stack [implement stack using

array]:

Objective(s) Student shall be able to perform different operations on stack .

Pre-requisite Usage of Stack.Duration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. List the application of stack.2. Convert (a*b)/(c+d)-e expression into postfix.3. Convert (a*b)/(c+d)-e expression into prefix.4. What is recursion?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 69: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 7 Enrollment No. Group : EPractical Problem Write a program to demonstrate following operations on queue

[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is queue?2. When queue is said to be full?3. When queue is said to be empty?4. What is the difference between stack and queue?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 70: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 8 Enrollment No. Group : EPractical Problem Write a program to demonstrate following operations on circular

queue[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the difference between queue and circularqueue?

2. What is the drawback of linear queue?3. What is the difference between deque and queue?4. List application of queue.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 71: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 9 Enrollment No. Group : EPractical Problem Create a singly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to singly and

singly linked list.

Pre-requisite Usage of Singly Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the need for linked representations of list?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 72: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 10 Enrollment No. Group : EPractical Problem Create a doubly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to doubly

linked list.

Pre-requisite Usage of Doubly Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the draw back of singly linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the difference between singly and doubly linked

list?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 73: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 11 Enrollment No. Group : EPractical Problem Create a circular singly linked list of numbers and demonstrate

following operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to circular

linked list.

Pre-requisite Usage of circular Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is circular linked list?2. What is the difference between singly circular linked list

and doubly circular linked list?3. What is the node structure of circular singly linked list?4. What is the condition for knowing whether the node is

last node in the list or not?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 74: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 12 Enrollment No. Group : EPractical Problem Write a program which will insert and display information of bank

customer like account no,customername,account type and amountin doubly linked list.

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is object?2. How to access member function?3. What is the node structure of linked list?4. What is dynamic memory allocation?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 75: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 13 Enrollment No. Group : EPractical Problem Write a program for implementing queue operation(enqueue and

dequeue) using linked list and display it.Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. In which manner node will remove from the list?2. Is linked list non-linear data structure?3. What is difference between queue and linked list?4. Can we implement queue using circular linked list?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 76: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 14 Enrollment No. Group : EPractical Problem Create an array of 20 elements and apply following techniques to

sort it.1. Selection sort2. Bubble sort3. Insertion sort4. Merge sort5. Quick sort

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of sorting.

Pre-requisite Usage of Sorting.Duration forcompletion

09Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Can bubble sort ever perform better than quick sort?2. Which sorting techniques are an example of divide and

conquer?3. Which sorting techniques is an application of recursion?4. What is the time complexity of quick sort?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 77: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 15 Enrollment No. Group : EPractical Problem Create an array of 20 elements and apply following techniques to

search it.1. Linear Search2. Binary Seacr

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of searching.

Pre-requisite Usage of SearchingDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the Complexity of worst case and best case inordered linear search.

2. What is the complexity of worst case and best case inunordered linear search.

3. What are the advantages of binary search over linearsearch?

4. In linked list, which searching technique is better linearsearch or binary search?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 78: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 1 Enrollment No. Group : FPractical Problem Write a program to create an array for 12 numbers andcount how

many even numbers in array. [NOTE: Create User define functionfor calculating even numbers]For Example:if A []= { 1,3,2,5,4,7,10,12,15,17,55,99}

Output will be “Total number of even elements are 6 “Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of Array, pass array to function as an argumentDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is an array?2. What is the use of index?3. How many elements are there in array a[1:8]?4. Which data structure is used to store finite number of

same type?5. If I want to find out total number of odd elements what is

the condition?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 79: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 2 Enrollment No. Group : FPractical Problem Write a program which will search a particular element from an

array of size 15, where element will be inserted by user, anddisplay appropriate message.For Example:If A[]={67,321,12,99,54,33,31,23,56,76,95,3,78,67,23}If user enter element 10 then display “ Element 10 is not in array”If user enter element 99 then display “Element is in array”

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Which are the operations are performed in an array?2. Which formula is used to calculate address in one-

dimensional array?3. What are the disadvantage of an array?4. What is ADT?5. If I want to display element of a particular position how I

will display?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 80: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 3 Enrollment No. Group : FPractical Problem Write a program to compare elements of two 3x3 matrices using

position and store large value into another array.For Example:A [3][3]= 8 7 3 B[3][3] =9 10 1

3 6 9 4 2 110 -1 8 -2 1 10

then elements of C[3][3] areC[3][3]= 9 10 3

4 6 110 1 10

Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How many elements are there in A[3][2]?2. What is row major order?3. If base address of A[1:17] is 100 then what is address of

A[12]?4. Modify program by addition of two matrices and store it

into another array.Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 81: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 4 Enrollment No. Group : FPractical Problem Write a program to find largest number in 3x3 matrix and display

it.Objective(s) Student shall be able to perform different operations on array.

Pre-requisite Usage of ArrayDuration forcompletion

1 Hour

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO2: Calculate memory allocation of array and perform different

operations on array.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. How many elements are there in A[4][3]?2. What is the formula to calculate address of 2-

dimensional array?3. What is the difference between row major and column

major?4. What is sparse matrix?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 82: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 5 Enrollment No. Group : FPractical Problem Write a program to demonstrate following operations on stack

[implemented using array]:1. Push2. Pop3. Peep

Objective(s) Student shall be able to perform different operations on stack and

queue.

Pre-requisite Usage of Stack.Duration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is stack?2. What is the meaning of push,pop and peep?3. When stack is said to be overflow?4. When stack is said to be underflow?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 83: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 6 Enrollment No. Group : FPractical Problem Write a program of recursive power function using stack.

Objective(s) Student shall be able to perform different operations on stack .

Pre-requisite Usage of Stack.Duration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. List the application of stack.2. Convert (a*b)/(c+d)-e expression into postfix.3. Convert (a*b)/(c+d)-e expression into prefix.4. What is recursion?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 84: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 7 Enrollment No. Group : FPractical Problem Write a program to demonstrate following operations on queue

[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is queue?2. When queue is said to be full?3. When queue is said to be empty?4. What is the difference between stack and queue?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 85: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 8 Enrollment No. Group : FPractical Problem Write a program to demonstrate following operations on circular

queue[implemented using array]:1. Add an element(enqueue)2. Remove an element(dequeue)3. Display the queue

Objective(s) Student shall be able to perform different operations on queue .

Pre-requisite Usage of QueueDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and use appropriate data structures such as stacks,

queues.

Solution must contain Algorithm,Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the difference between queue and circularqueue?

2. What is the drawback of linear queue?3. What is the difference between deque and queue?4. List application of queue.

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 86: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 9 Enrollment No. Group : FPractical Problem Create a singly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to singly and

singly linked list.

Pre-requisite Usage of Singly Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the need for linked representations of list?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 87: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 10 Enrollment No. Group : FPractical Problem Create a doubly linked list of numbers and demonstrate following

operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to doubly

linked list.

Pre-requisite Usage of Doubly Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the draw back of singly linked list?2. How will I know whether the node is a fist node in the

list or not?3. How will I know whether the node is a last node in the

list or not?4. What is the difference between singly and doubly linked

list?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 88: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 11 Enrollment No. Group : FPractical Problem Create a circular singly linked list of numbers and demonstrate

following operation on it:1. Add a node(at the beginning)2. Remove a node(based on position)3. Update the value in the node(based on the position of the

node)4. Display the list.

Objective(s) To understand the working and application related to circular

linked list.

Pre-requisite Usage of circular Linked ListDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is circular linked list?2. What is the difference between singly circular linked list

and doubly circular linked list?3. What is the node structure of circular singly linked list?4. What is the condition for knowing whether the node is

last node in the list or not?Assessment

Solution achieves the desiredobjective(s)

Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 89: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 12 Enrollment No. Group : FPractical Problem Assume that there is one existing singly linked list, which will

store information of companies like company name, product name,quantity and rate, (one company may have multiple products).Create menu driven program for following operations.

a) Remove method: which will ask user to insert employeeno and it will remove all the information of employeewhose employee no is match with inputted employee no.

b) Display method: Display information of employee fromsingly linked list.

Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

PAI G A V., Data Structures and Algorithms-Concepts,Techniques and Applications, McGraw Hill

Post Laboratoryquestions

1. What is object?2. How to access member function?3. What is the node structure of linked list?4. What is dynamic memory allocation?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 90: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 13 Enrollment No. Group : FPractical Problem Write a program for implementing stack operation(push and pop)

using linked list and display it.Objective(s) To understand the working and application related to linked list.

Pre-requisite Usage of Linked ListDuration forcompletion

3Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO3: Implement and usage of linked list.

Solution must contain Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. In which manner node will remove from the list?2. Is linked list non-linear data structure?3. What is difference between stack and linked list?4. Can we implement stack using circular linked list?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 91: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 14 Enrollment No. Group : FPractical Problem Create an array of 20 elements and apply following techniques to

sort it.1. Selection sort2. Bubble sort3. Insertion sort4. Merge sort5. Quick sort

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of sorting.

Pre-requisite Usage of Sorting.Duration forcompletion

09Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. Can bubble sort ever perform better than quick sort?2. Which sorting techniques are an example of divide and

conquer?3. Which sorting techniques is an application of recursion?4. What is the time complexity of quick sort?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate

Page 92: 5 Years Integrated M.Sc. (I T): 2nd Semester Practical ...utu.ac.in/dcst/download/documents/PRMSCIT060010201.pdf · 5 Years Integrated M.Sc. (I T): 2nd Semester Practical Problem

5 Years Integrated M.Sc. (IT): 2nd SemesterPractical Problem

060010201: Data Structures

Ms. NehalAdhvaryu

Practical No. 15 Enrollment No. Group : FPractical Problem Create an array of 20 elements and apply following techniques to

search it.1. Linear Search2. Binary Search

Calculate the time taken by each sorting technique.Objective(s) To understand the implementation and usage of searching.

Pre-requisite Usage of SearchingDuration forcompletion

2Hours

PEO(s) to be achieved PEO2: To provide quality practical skill of tools and technologiesto solve industry problems.

PO(s) to be achieved PO6: Ability to use the techniques, skills and modern tools asnecessary for software development.

CO(s) to be achieved CO5: Implement and use searching and sorting techniques basedon comparative study of Bubble sort, Selection sort, Insertion sort,Quick sort, Linear search, Binary search.

Solution must contain Algorithm, Program and OutputNature of submission HandwrittenReferences for solvingthe problem

1. PAI G A V., Data Structures and Algorithms-Concepts, Techniques and Applications, McGraw Hill

2. Gilberg, R., Forouzan, B., Data Structures-A Pseudocode Approach with C++,Thomson.

3. A.M. Berman, Data Structures via C++ Objects byEvolution, Oxford.

Post Laboratoryquestions

1. What is the Complexity of worst case and best case inordered linear search.

2. What is the complexity of worst case and best case inunordered linear search.

3. What are the advantages of binary search over linearsearch?

4. In linked list, which searching technique is better linearsearch or binary search?

AssessmentSolution achieves the desired

objective(s)Viva

Out of Marks 10 5Secured by thestudentSignatureDate


Recommended