BSC CSIT Semester 3 – Data Structure and Algorithms () Questions & Answers | Past TU Exam Papers

Question 1

How can you use linked list to implement stack? Explain.

Marks: 5

Year: 2080 Final TU

Definition A Stack is a linear data structure that follows the LIFO (Last In, First Out) principle, where the last element inserted is the first one to be removed. A Linked List is a dynamic data str

Question 2

Define list. How can you use linked list to implement stack? Explain circular linked list.

Marks: 10

Year: 2081 Final TU

1. Definition of List A List is a linear data structure that stores a sequence of elements. - Elements are arranged in a specific order. - Each element can be accessed, inserted, or deleted. -

Question 3

What is the algorithm for node insertion and deletion from specified position from doubly linked list.

Marks: 5

Year: 2081 Final TU

Definition A Doubly Linked List (DLL) is a linear data structure in which each node contains: - Data - A pointer to the previous node (prev) - A pointer to the next node (next) Traversal is possible

Question 4

How do you insert and delete a node at kth position of the doubly linked list? Describe the process of implementing stack and queue using linked list.

Marks: 10

Year: 2079 Final TU

Definition A Doubly Linked List (DLL) is a linear data structure in which each node contains: - Data - Previous pointer (prev) - Next pointer (next) Steps for Insertion at Kth Position 1. Create a ne

Question 5

Explain circular linked list with example. How do you implement linked list operation in singly linked list? Explain.

Marks: 10

Year: 2078 Final TU

1. Circular Linked List (CLL) Definition A Circular Linked List is a linked list in which the last node points back to the first node instead of pointing to NULL. - It can be singly or doubly linke

Question 6

Explain array implementation of list.

Marks: 5

Year: 2078 Final TU

Definition An Array is a collection of elements of the same type stored in contiguous memory locations. When a list is implemented using an array, it is called an array-based list. Array Implementa

Question 7

Differentiate between singly linked list and doubly linked list. How do you insert and delete a node from doubly linked list? Explain.

Marks: 10

Year: 2077 Final TU

1. Difference between Singly Linked List (SLL) and Doubly Linked List (DLL) | Feature | Singly Linked List (SLL) | Doubly Linked List (DLL) | |---------|-------------------------|---------------------

Question 8

What is linked list? How is it different from array?

Marks: 5

Year: 2077 Final TU

1. Definition of Linked List A Linked List is a linear data structure in which elements (called nodes) are stored non-contiguously in memory. Each node contains: - Data: the actual value - Link (Poi