HamiIT
Sign inGet started
Home
ADD CONTENT

Sign in Required

Please sign in to add content

Sign In
ProgramsBsc CSITSemester 3Data Structure and AlgorithmsUnit 5: Lists (8 Hrs.)
Chapter Study

Bsc CSIT Semester 3 – Data Structure and Algorithms – Unit 5: Lists (8 Hrs.)

Comprehensive questions and detailed answers for Unit 5: Lists (8 Hrs.). Perfect for exam preparation and concept clarity.

8
Questions
60
Marks
Back to All Chapters
1

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

MediumTHEORY5 marks2080(TU Final)
2

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

HardTHEORY10 marks2081(TU Final)
3

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

MediumTHEORY5 marks2081(TU Final)
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.

HardTHEORY10 marks2079(TU Final)
5

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

HardTHEORY10 marks2078(TU Final)
6

Explain array implementation of list.

MediumTHEORY5 marks2078(TU Final)
7

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

HardTHEORY10 marks2077(TU Final)
8

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

MediumTHEORY5 marks2077(TU Final)
Showing 8 questions

Exam Years

Past question papers

2081
TU Final•2 questions
2080
TU Final•1 questions
2079
TU Final•1 questions
2078
TU Final•2 questions
2077
TU Final•2 questions

Questions in Unit 5: Lists (8 Hrs.)

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

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. -

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

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

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

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

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) | |---------|-------------------------|---------------------

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

About Unit 5: Lists (8 Hrs.) Questions

This page contains comprehensive questions from the Unit 5: Lists (8 Hrs.) chapter of Data Structure and Algorithms, part of the Bsc CSIT Semester 3 curriculum. All questions include detailed model answers from past TU exam papers.

Study Tips

  • Review concepts before attempting questions
  • Practice writing complete answers
  • Compare your answers with model solutions
  • Focus on questions from recent years
  • Use direct links (#question-ID) to bookmark and share specific questions

Related Resources

← Back to Data Structure and Algorithms Chapters

Unit 5: Lists (8 Hrs.) chapter questions with answers for Data Structure and Algorithms (Bsc CSIT Semester 3). Prepare for TU exams with our comprehensive question bank and model answers.

H
Hami IT

Empowering IT students with quality education resources and comprehensive exam preparation materials.

Programs

  • Flutter
  • Java
  • DevOps

Company

  • About Us
  • Contact

Contact

  • 📧hamiit.dev@gmail.com
  • 📞+977 9813706443
  • 📍Kathmandu, Nepal

© 2026 Hami IT. All rights reserved.