Swami Keshvanand Institute of Technology, Management &Gramothan, Jaipur
Department of Computer Science & Engineering (IOT)
Assignment Sheet-I
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
(Set-I)
Q.No Question BL CO MM
1 Explain stack data structure as an ADT and Discuss briefly 3 1 10
applications of stack.. Convert the following infix expression to
postfix using stack (show all the steps properly): a+b*(c/d$a)/b
2 Consider following circular queue of characters and size 5. 3 1 10
Front point to A and Rear Points to C. Show the circular queue
contents as per the following operations at every step. i) F is added
to the queue. ii) Two letters are deleted. iii) K, L, M are added to
the queue iv) Two letters are deleted. v) R is added to the queue. vi)
Two letters are deleted.
3 Write an that removes elements with even indices from a singly 4 2 10
linked list.
Test Data and Expected Output :
Original linked list:
7654321
Linked list after removing even indices:
642
4 Two linked lists contain information of the same type in ascending 3 2 10
order. Write a module to merge them to a single linked list that is
sorted.
Swami Keshvanand Institute of Technology, Management &Gramothan, Jaipur
Department of Computer Science & Engineering (IOT)
Assignment Sheet-I
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
SET-II
Q.No Question BL CO MM
1 What are the applications of Stack. Represent stack for decimal to 3 1 10
binary conversion:(56)10 to (---)2
2 (i)Define Queue. What are conditions for ‘Queue empty’ and ‘Queue 4 1 10
full’ when queue is implemented using Array? Explain.
(ii) Write a ‘C’ function for deletion in a queue using an array
3 a.Explain the disadvantages of polynomial representation using an array. 3 2 10
Represent the following polynomial using a singly linked list.
b. Explain an efficient way of storing a sparse matrix in memory. Write
a module to find the addition of two sparse matrix stored in this way.
4 Given an array, arr[1:9, -4:1, 5:10] with a base value of 400 and the 4 2 10
size of each element is 2 Bytes in memory find the address of
element arr[5][-1][8] with the help of row-major order?
Assignment Sheet-I
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
SET-III
Q.No Question BL CO MM
1 Compare linked representation and array representation with reference 3 1 10
to the following aspects: [3] i) Accessing any element randomly ii)
Insertion & deletion of an element iii) Utilization of memory
2 Convert the given infix expression to a postfix expression using stack : 4 1 10
(a^b)*c–d/d Note : ^=Exponent operator
3 Write an that removes elements with odd indices from a singly linked 3 2 10
list.
Test Data and Expected Output :
Original linked list:
7654321
Linked list after removing even indices:
7531
Swami Keshvanand Institute of Technology, Management &Gramothan, Jaipur
Department of Computer Science & Engineering (IOT)
4 Write pseudo code for following function using Singly Linked List of 4 2 10
students (roll_number and name stored in every node)
i) Search given roll no and delete that record. Draw diagram of
operation.
ii) Add given number after specified number in the list. Draw
diagram of operation.
Assignment Sheet-3
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
SET-IV
Q.No Question BL CO MM
1 Identify the expression and convert them into the remaining two 3 1 10
forms : i) AB + C * DE – FG + + $ ii) – A / B * C $ DE
Note $ = Exponent operator
2 Define Queue. What are conditions for ‘Queue empty’ and ‘Queue 3 1 10
full’ when queue (Circular)is implemented using Array? Explain.
3 What is a singly linked list? Write C function/Algorithm for 4 2 10
inserting a node at a given location into a singly linked list.
4 3 2 10
Compare linked representation and array representation with
reference to the following aspects: i) Accessing any element
randomly ii) Insertion & deletion of an element iii) Utilization of
memory. Also write an algorithm to insert and delete a node from
the end of the list.
Assignment -1
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
SET-V
Q.No Question BL CO MM
1 Evaluate following postfix expression with the help of stack. 3 1 10
The postfix expression is :- 5 3 7 * + 40 8 / 7 + 2 * +
2 What is Doubly Ended Queue? Draw Diagram with labelling four 4 1 10
basic operations at appropriate places. Which two data structures
are combined in it and how?
Swami Keshvanand Institute of Technology, Management &Gramothan, Jaipur
Department of Computer Science & Engineering (IOT)
3 What is header linked list ? Compare with SLL. Write the 3 2 10
algorithm to insert and delete the node at end in header linked list.
4 Represent the following polynomials using linked list 4 2 10
Also write Algorithm /C_/C++ code for representation of
polynomial Write pseudocode to perform addition of two
polynomials using singly linked lists into third list. Write time
complexity of it.
Assignment Sheet-I
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
SET-VI
Q.No Question BL CO MM
1 Write rules to convert given infix expression to postflx expression 4 1 10
using stack. Convert expression (P * Q – (L + M * N) ^ (X * Y /
Z) stepwise using above rules. Where ^ is - exponential operator
b. Evaluate the following expression: 5 2 3 ^ + 40 2 / - 7 4 * +
2 What is Doubly Ended Queue? Draw Diagram with labelling four 4 2 10
basic operations at appropriate places. Which two data structures
are combined in it and how?
3 Write and explain node structure of Circular Singly Linked List 3 2 10
and Doubly Linked list. Write pseudocode for concatenation of
two doubly linked lists.
4 What is the role of stack in recursion? Explain Fibonacci Search 3 1 10
algorithm with recursion. What is time complexity of this
algorithm?
Assignment Sheet-I
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
SET-VII
Q.No Question BL CO MM
1 Convert the following infix expressions to postfix using stack. 3 1 10
Clearly indicate the contents of stack.
Swami Keshvanand Institute of Technology, Management &Gramothan, Jaipur
Department of Computer Science & Engineering (IOT)
2 Write an algorithm/C/C++ code to determine whether the infix 3 1 10
expression has balanced parenthesis or not using stacks.
3 Is it possible to implement binary search using linked list. Justify 4 2 10
your answer. Also Discuss the time complexity of algorithm in
best case and worst case, if the answer is yes. Write a code to
delete alternate elements from Linked List.
4. Draw and explain implementation of Linear Queue using Singly 4 2 10
Linked List. Explain Add, Remove, Queue Full and Queue Empty
operations
Assignment Sheet-I
(Set-VIII)
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
Q.No Question BL CO MM
1 Consider the priority queue ,Which is maintained by a two - 3 1 10
dimensional array Queue,consider the figure (a) Describe the
structure ftre (RRR, 3), (SSS,4)(TTT,1),(UUU,4) and VVV,2) are
added to the queue (b) Describe the structure if, after the preceding
insertion ,three elements are deleted.
2 An array X [-15……….10, 15……………40] requires one byte of 3 1 10
storage. If beginning location is 1500 determine the location of X
[15][20]. Also Compare SSL and DLL with respect to all the basic
operation.
3 Write an algorithm to implement searching a given element and 3 2 10
delete the record using doubly circular linked list.
4 Write a program to perform sorting on linked list. 3 2 10
Swami Keshvanand Institute of Technology, Management &Gramothan, Jaipur
Department of Computer Science & Engineering (IOT)
Assignment Sheet-I
(Set-IX)
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
Q.No Question BL CO MM
1 Write an algorithm to implement infix to postfix conversion using 3 1 10
stack. Convert expression *-A/BC-/AKL to infix and postfix
notation.
2 What is the disadvantage associated with stack using single array? 3 1 10
Write a program to implement multiple stacks using single array.
3 Write a program to reverse a doubly linked list. How the same 4 2 10
algorithm extended for palindrome checking of string?
4 A Dictionary stores keywords &its meaning. Provide facility for 5 2 10
adding new keywords, Deleting Keywords & updating Keywords
values of any entry. Also Provide facility to display whole data
stored in ascending /Descending order.
Assignment Sheet-I
(Set-X)
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
Q.No Question BL CO MM
1 Write an algorithm to check for balanced parenthesis using stack. 3 1 10
2 Write a C program to implement a student queue in which the 4 1 10
marks of students are inserted in FIFO order. Display the
maximum, minimum, average marks of the students in queue
using array.
3 Write and algorithm to add 1 to a lniked list. 4 2 10
Example:
Input:9999
Output: 10000
4 Write a program to perform searching a specific element and 3 2 10
delete that node in a doubly linked list.
Swami Keshvanand Institute of Technology, Management &Gramothan, Jaipur
Department of Computer Science & Engineering (IOT)
Assignment Sheet-I
(Set-XI)
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
Q.No Question BL CO MM
1 Evaluate prefix expression - + 2* 3 4 / 16 ^ 2 3 3 1 10
2 Write a program to implement Queue using two stack. 4 1 10
3 Write an algorithm/ C program to find the intersection of two 4 2 10
singly linked lists.
Test Data and Expected Output :
Case 1:Original lists:
1234
534
Intersection found at 3.
Case 2: Original lists:
1234
534
Intersection not found.
4 Write an algorithm to search element in a sorted linked list, 3 2 10
Compare the time complexity of both, if the same operation
performs with doubly linked list
(Set-XII)
Session 2024-25(Odd Semester)
Subject: Data Structure & Algorithm (3CIT4-05)
Max Marks- 40
Q.No Question BL CO MM
1 Write an algorithm to evaluate postfix expression. Evaluate 3 1 10
following expression: X= 4,5,4,2,^,+,*,2,2,^,9,3,/,*,-
2 What is priority queue? Write an algorithm to implement priority 4 1 10
queue.? Explain an application of priority queue.
3 Represent polynomial expression using linked list and write an 4 2 10
algorithm to add two polynomial expressions using linked list.
4 Compare the SLL and DLL.Write an algorithm to delete Nth 3 2 10
position element from last in linked list.How the same algorithm
implement in DLL.what is the complexity for both.
