INFORMATION TECHNOLOGY 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)
Academic Year 2024-25
INFORMATION TECHNOLOGY 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.
INFORMATION TECHNOLOGY 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 Array, Matrix, 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 Array, Matrix, Stack, Queue and Linked List
3 Tree and Graph
4 Sorting and Searching
5 Hashing and File Organizations
INFORMATION TECHNOLOGY DEPARTMENT, CKPCET, Surat.
Data Structures (3130702)
Assignment –I: Introduction to Data Structures
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 Differentiate the following terms: A
Linear and Non-Linear Data Structures
Primitive and Non-Primitive Data Structures
Q.4 Explain time complexity and space complexity with examples. A
Q.5 Explain Asymptotic notation with an example. A
INFORMATION TECHNOLOGY DEPARTMENT, CKPCET, Surat.
Data Structures (3130702)
Assignment –II: Array, Matrix, Stack, Queue
and Linked List
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Q.1 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).
Q.2 What is a sparse matrix? Explain memory representation of sparse matrices. U
Q.3 Define Algorithms. Write an algorithm to multiply two matrices. Also U+A
Perform Time Analysis for the same.
Q.4 What is Sparse matrix? Write efficient vector representation of following U
Sparse matrix.
1 0 0
0 2 0
0 0 3
Q.5 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.6 Write an algorithm for stack operations Push, Pop and Empty. Assume stack U
is implemented using array.
Q.7 Write an algorithm to convert infix expression to postfix expression. U
Q.8 Explain Difference between Stack and Queue. A
Q.9 Write an algorithm to evaluate postfix expression. Explain working of the A
algorithm using appropriate example.
Q.10 Write a ‘C’ program to reverse a string using stack. E
Q.11 Write an algorithm for postfix expression evaluation and evaluate the E
following expression showing every stack status in tabular form.
a. 5 4 6 + * 4 9 3 / + *
b. 7 5 2 + * 4 1 1 + / -
c. 8 2 / 6 7 * +
Q.12 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
c. (A-B)/C*D^(E/F)^(G+H)
Q.13 Evaluate the prefix expression in tabular forms: E
a. * / - 8 2 3 4
Q.14 Enlist and explain any 3 applications of stack in computer science. U
Q.15 Write an algorithm for Double Ended Queue that insert an element at front U
end.
Q.16 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.17 Define queue. Write algorithms for INSERT, DELETE and DISPLAY U
operations of queue.
Q.18 Write algorithm to (i) insert, and (ii) delete elements in circular queue. A+U
Q.19 Write an advantage of link list , doubly link list and circular link list.
Q.20 Write an algorithm to insert an element into a singly link list. U
Q.21 Write a short note on the doubly link list. U
Q.22 Discuss advantages and disadvantages of linked list over array. A
Q.23 Write an algorithm to insert,delete an element from a doubly link list. U
Q.24 Enlist and explain any 3 applications of linked list. U
Q.25 Compare array and linked list. A
Q.26 Write user defined ‘C’ function to insert node at a specific location in singly A
linked list.
Q.27 Write user defined ‘C’ function to delete node from end in circular linked A
list.
Q.28 Write a ‘C’ program to implement queue using linked list. A
or
Write a ‘C’ program to implement stack using linked list.
Q.29 Write user defined ‘C’ function to insert node at the end in circular linked A
list.
Q.30 Write user defined ‘C’ function to delete node from a specific location in A
doubly linked list.
Q.31 What is the Tower of Hanoi? Explain it with n=3. U+E
INFORMATION TECHNOLOGY DEPARTMENT, CKPCET, Surat.
Data Structures (3130702)
Assignment –III: Tree and Graph
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Q.1 How many null branches does a binary tree possess? U
Q.2 What is a binary search tree? Create a binary search tree for the R+E
following 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.
Q.3 With a suitable example, explain steps for conversion of a general tree U
into a binary tree.
Q.4 How can a directed tree be represented? R
Q.5 Draw a Binary expression tree for the following and perform E
pre-order traversal: (A $ B $ C) + (D – E * F)
Q.6 Write recursive ‘C’ functions for (1) in-order (2) pre-order and U
(3) post-order traversals of binary search tree.
Q.7 Construct a binary search tree from the following traversals: E
In-order: 3, 4, 5, 6, 7, 9, 17, 20, 22
Pre-order: 9, 4, 3, 6, 5, 7, 17, 22, 20
Q.8 Construct a binary tree from the traversals given below: E
In-order: 1, 10, 11, 12, 13, 14, 15, 17, 18, 21
Post-order: 1, 11, 12, 10, 14, 18, 21, 17, 15, 13
Q.9 Explain AVL tree with an example. U
Q.10 Explain the structure of threaded binary tree, right-in-threaded, R
left-in-threaded and full-in-threaded binary trees.
Q.11 Mention the properties of a B-Tree. R
Q.12 Insert the following letters into an empty B-tree of order 5: E
CNGAHEKQMFWLTZDPRXYS
Q.13 Discuss different representations of a graph. U
Q.14 Explain Depth First Search and Breadth First Search in graphs with an U
example.
Q.15 A communications network is represented by a graph. Each node U
represents 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.
Q.16 Write Prim’s algorithm for minimum spanning tree with an example. U
Q.17 What is a minimum spanning tree? Explain Kruskal’s algorithm for U
finding a minimum spanning tree.
Q.18 Apply Dijkstra’s algorithm for the following graph with Node S as U
the starting node.
INFORMATION TECHNOLOGY DEPARTMENT, CKPCET, Surat.
Data Structures (3130702)
Assignment – IV: Sorting and Searching
Q. Questions (Total Marks: 10) Level of
No Bloom’s
Taxonomy
Q.1 Apply merge sort algorithm to the following elements. 20, 10, 5, 15, 25, E
30,50, 35
Q.2 Construct a binary search tree from the following numbers. 38, 13, 51, 10, E
12,40, 84, 25, 89, 37, 66, 95
Q.3 “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
Q.4 Explain the difference between insertion sort and selection sort
U+N
with an example. What is the time complexity of these algorithms?
How?
Q.5 Sort following with Selection Sort Method : 20, 50, 30, 75, 90, 60, 25, 10, E
40
Q.6 Apply a merge sort algorithm for the following data and show the steps. E
66, 33, 40, 22, 55, 88, 11, 80, 20, 50, 44, 77, 30.
Q.7 Write a C program for bubble sort. E
Q.8 Write a ‘C’ program for selection sort. E
Q.9 differentiate sequential search and binary search. U
Q.10 Do as directed below: U+E
i) Sort following elements using quick sort.: 10 15 28 09 40 35 29 12 06
07 ii) State time and space complexity of quick sort.
Q.11 Compare sequential and binary search methods. A
Q.12 Apply quick sort for the following data: 9, 7, 5, 11, 12, 2, 14, 3, 10, 6 A+U
INFORMATION TECHNOLOGY 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
Q.1 How do the following hash functions work? (i) The mid-square method U
(ii) Digit analysis
Q.2 Explain Sequential file organizations and list its advantages R+U
and disadvantages.
Q.3 What is hashing? What are the qualities of a good hash function? Explain R+U
any two hash functions in detail.
Q.4 Explain file in terms of fields, records and database. R
Q.5 How access of record is performed in multi key file A
organization?
Q.6 Explain various Hash collision resolution techniques with U
examples.
Q.7 Explain Indexed Sequential and Random file organizations. U
