Scribd
Upload
2 views1 page

Module 2 Csa2500 Data Structure Question Bank

The document is a question bank for Module 1 of CSA2500 Data Structure, containing 21 questions related to linked lists, recursion, and algorithms. Each question is assigned a specific mark value, ranging from 2 to 10 marks. Topics include the differences between data structures, advantages of linked lists, and algorithms for inserting and deleting nodes.

Uploaded by

Kunal Kumar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
2 views1 page

Module 2 Csa2500 Data Structure Question Bank

The document is a question bank for Module 1 of CSA2500 Data Structure, containing 21 questions related to linked lists, recursion, and algorithms. Each question is assigned a specific mark value, ranging from 2 to 10 marks. Topics include the differences between data structures, advantages of linked lists, and algorithms for inserting and deleting nodes.

Uploaded by

Kunal Kumar
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

MODULE 1 CSA2500 DATA STRUCTURE

QUESTION BANK
SR. QUESTION MARKS
NO
1 Differentiate between recursion and iteration. 2
2 Explain general structure of a singly linked list node. 2
3 Discuss one advantage of a circular linked list over a singly linked list. 2
4 Explain base condition in recursion. 2
5 Discuss any two advantages of a linked list over an array. 2
6 What is the role of the head pointer in a linked list? 2
7 How is the last node represented in a singly linked list? 2
8 What is the difference between singly linked list and circular linked list? 2
9 What happens if the base condition is missing in recursion? 2
10 Give one example problem solved using recursion. 2
11 Write an algorithm to delete a node from the circular linked list with help 10
of a suitable diagram.
12 Write an algorithm to insert a node in the singly linked list with help of a 10
suitable diagram.
13 Explain the concept of recursion and the recursive process with help of the 10
suitable programming example.
14 Discuss the applications of linked list. Also compare circular linked list with 10
singly linked list.
15 Write an algorithm to delete a node in the singly linked list with help of a 10
suitable example.
16 Write an algorithm to insert a node in the circular linked list with help of a 10
suitable diagram.
17 Discuss Linked List along with its types. 10
18 Discuss Circular Linked List along with its types. 10
19 Discuss various applications of linked lists with suitable examples. 10
20 Write a recursive program to find the factorial of a number and explain the 10
execution steps.
21 write a recursive program to generate Fibonacci series and explain its 10
working.

You might also like