COMPUTER ENGINEERING DEPARTMENT

C.K.PITHAWALA COLLEGE OF ENGINEERING &

TECHNOLOGY, SURAT

GUJARAT TECHNOLOGICAL UNIVERSITY

ASSIGNMENT
Name of Student

Enrollment No.

Subject Name Data Structures

Subject Code 3130702

Student Class 2nd Year (3rd Semester) A, B, C, D Division

Academic Year 2024-25

 COMPUTER ENGINEERING DEPARTMENT

C.K.PITHAWALA COLLEGE OF ENGINEERING AND TECHNOLOGY, SURAT

CO and PSO
Course Outcome (CO)
Students will be able to:
Course CO Statement
Outcome
CO1 Define and classify various data structures, storage structures and common operations on
them
CO2 Create various linear data structures with their representation and perform different
operations on them
CO3 Create various nonlinear data structures with their representation and perform different
operations on them
CO4 Apply various searching sorting techniques on data set
CO5 Solve the given a problem using an appropriate data structure to achieve optimal
performance and compare its performance with other possible data structures

Program Specific Outcome (PSO)

Students will be able to

Program Specific PSO Statement

Outcome
PSO1 Students will be able to analyze, innovate and design systems to solve real
world engineering challenges by applying the concepts of computer
engineering.
PSO2 Students will have the professional capabilities and adaptation of recent
trends in computer engineering for the betterment of society.
 COMPUTER ENGINEERING DEPARTMENT

C.K.PITHAWALA COLLEGE OF ENGINEERING AND TECHNOLOGY, SURAT

Name of Student

Enrollment No.

Subject name with code Data Structures (3130702)

List of Assignment with CO Mapping

Assignment No. Title CO

1 Introduction to Data Structures CO1

2 Stack, Queue and Linked List CO2
3 Tree and Graph CO3
4 Sorting and Searching CO4
5 Hashing and File Organizations CO5

INDEX
Sr.No Title Date Grade Sign
1 Introduction to Data Structures
2 Stack, Queue and Linked List
3 Tree and Graph
4 Sorting and Searching
5 Hashing and File Organizations
 COMPUTER ENGINEERING DEPARTMENT, CKPCET, Surat.

Data Structures (3130702)

Assignment –I: Introduction to Data Structures

[Batch 1]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Q.1 What does abstract data type mean? U

Q.2 Define data structure. List the various linear and non-linear data structures R
and explain them in brief with its applications .

Q.3 Define Algorithms. Write an algorithm to multiply two matrices. Also U+A
Perform Time Analysis for the same.
Q.4 Given a two dimensional array Z1(2:9, 9:18) stored in column-major order E
with base address 100 and size of each element is 4 bytes, find the address of
the element Z1(4, 12).

[Batch 2]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Differentiate the following terms: A
Linear and Non-Linear Data Structures
Q.1
Primitive and Non-Primitive Data Structures

Q.2 What is a sparse matrix? Explain memory representation of sparse matrices. U

Q.3 Explain time complexity and space complexity with examples. A

[Batch 3]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Q.1 Discuss the basic operations performed with linear structure. U+R

Q.2 Explain storage representation of 2 Dimensional arrays. U

Q.3 Given a two dimensional array Z1(2:9, 9:18) stored in column-major order E
with base address 100 and size of each element is 4 bytes, find the address of
the element Z1(4, 12).
 COMPUTER ENGINEERING DEPARTMENT, CKPCET, Surat.

Data Structures (3130702)

Assignment –II: Stack, Queue and Linked List

[Batch 1]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Q.1 Write an algorithm to convert infix expression to postfix expression. U

Q.2 What is the Tower of Hanoi? Explain it with n=3. U+E

Q.3 Convert following infix expressions to the postfix expressions. E

Shows stack trace. a. A/B$C+D*E/F-G+H
b. (A+B)*D+E/(F+G*D)+C

Q.4 Write an algorithm for circular queue that insert an element at rear end. U

Q.5 Write an advantage of link list , doubly link list and circular link list.

[Batch 2]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Q.1 Write an algorithm for stack operations Push, Pop and Empty. Assume stack U
is implemented using array.

Q.2 E
Write an algorithm for evaluation of postfix expression and evaluate the
following expression showing every status of stack in tabular form.

a. 5 4 6 + * 4 9 3 / + *
b. 7 5 2 + * 4 1 1 + / -

Q.3 Write an algorithm for Double Ended Queue that insert an element at front U
end.

Q.4 Write an algorithm to insert an element into a singly link list. U

Q.5 Write a short note on the doubly link list. U

 [Batch 3]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Q.1 Explain Difference between Stack and Queue. A

Q.2 Trace the conversion of infix to postfix form in tabular form. E

a. ( A + B * C / D - E + F / G / ( H + I ) )
b. ( A + B ) * C + D / ( B + A * C ) + D

Q.3 Write an algorithm to implement ascending priority queue using singular A+U
linear linked list which has insert() function such that queue remains ordered
list. Also implement remove() function.

Q.4 Discuss advantages and disadvantages of linked list over array. A

Q.5 Write an algorithm to delete an element from a doubly link list. U

 COMPUTER ENGINEERING DEPARTMENT, CKPCET, Surat.

Data Structures (3130702)

Assignment –III: Tree and Graph

[Batch 1]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
1 How many null branches does a binary tree possess? U

2 Construct a binary search tree from the following traversals: In-order: 3, 4, 5, E

6, 7, 9, 17, 20, 22 Pre-order: 9, 4, 3, 6, 5, 7, 17, 22, 20

3 Explain Right-in-threaded, left-in-threaded and full-in-threaded binary trees. U

4 Insert the following letters into an empty B-tree of order 5: C N G A H E K E
QMFWLTZDPRXYS
5 Explain Depth First Search and Breadth First Search in graphs with an U
example.
6 What is a minimum spanning tree? Explain Kruskal’s algorithm for finding U
a minimum spanning tree.

[Batch 2]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
1 Mention the properties of a B-Tree. R

2 Explain the structure of threaded binary tree. R

3 Write recursive ‘C’ functions for (1) in-order (2) pre-order and (3) U
post-order traversals of binary search tree.

4 What is a binary search tree? Create a binary search tree for the following R+E
data. 14, 10, 17, 12, 10, 11, 20, 12, 18, 25, 20, 8, 22, 11, 23 Explain
deleting node 20 in the resultant binary search tree.

5 A communications network is represented by a graph. Each node represents U

a communication line and each edge indicates the presence of
interconnection between the lines. Which traversal technique can be used to
find breakdown in line? Explain.

6 Write Prim’s algorithm for minimum spanning tree with an example. U

 [Batch 3]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
1 How directed tree can be represented? R

2 Construct a binary tree from the traversals given below: In-order: 1, 10, 11, E
12, 13, 14, 15, 17, 18, 21 Post-order: 1, 11, 12, 10, 14, 18, 21, 17, 15, 13

3 With a suitable example, explain steps for conversion of a general tree into a U
binary tree.

4 Explain AVL tree with an example. U

5 Draw a Binary expression tree for the following and perform pre-order E
traversal: (A $ B $ C) + (D – E * F)

6 Discuss different representations of a graph. U

7 Apply Dijkstra’s algorithm for the following graph with Node S as the U
starting node.
 COMPUTER ENGINEERING DEPARTMENT, CKPCET, Surat.

Data Structures (3130702)

Assignment – IV: Sorting and Searching

[Batch 1]

Q. Questions (Total Marks: 10) Level of

No Bloom’s
Taxonomy
1 Apply merge sort algorithm to the following elements. 20, 10, 5, 15, 25, 30, E
50, 35
2 Construct a binary search tree from the following numbers. 38, 13, 51, 10, 12, E
40, 84, 25, 89, 37, 66, 95

[Batch 2]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
1 “If no interchanges occurred, then the table must be sorted and no further U+E
passes are required.” Which sorting method works on this principle? Apply
above sorting technique on the following data : 5, 1, 4, 2, 8

2 Explain the difference between insertion sort and selection sort with an U+N
example. What is the time complexity of these algorithms? How?

[Batch 3]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy

1 Sort following with Selection Sort Method : 20, 50, 30, 75, 90, 60, 25, 10, E
40

2 Apply a merge sort algorithm for the following data and show the steps. 66, E
33, 40, 22, 55, 88, 11, 80, 20, 50, 44, 77, 30.
 COMPUTER ENGINEERING DEPARTMENT, CKPCET, Surat.
Data Structures (3130702)
Assignment –V: Hashing and File Organizations

[Batch 1]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
1 How do the following hash functions work? (i) The mid-square method U
(ii) Digit analysis

2 Explain Sequential file organizations and list its advantages and R+U
disadvantages.

[Batch 2]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
1 What is hashing? What are the qualities of a good hash function? Explain R+U
any two hash functions in detail.

2 Explain file in terms of fields, records and database. R

3 How access of record is performed in multi key file organization? A

[Batch 3]
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
1 Explain various Hash collision resolution techniques with examples. U

2 Explain Indexed Sequential and Random file organizations. U