[go: up one dir, main page]
Scribd
Upload
130 views3 pages

R23 - DS Important Questions

The document outlines a comprehensive curriculum on Data Structures, covering various units including Introduction to Data Structures, Linked Lists, Stacks, Queues & Deques, and Trees and Hashing. Each unit contains short and long answer questions that explore definitions, comparisons, implementations, and applications of different data structures. The focus is on understanding the fundamental concepts, operations, and significance of data structures in computer science.

Uploaded by

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

R23 - DS Important Questions

The document outlines a comprehensive curriculum on Data Structures, covering various units including Introduction to Data Structures, Linked Lists, Stacks, Queues & Deques, and Trees and Hashing. Each unit contains short and long answer questions that explore definitions, comparisons, implementations, and applications of different data structures. The focus is on understanding the fundamental concepts, operations, and significance of data structures in computer science.

Uploaded by

sarojinidevi.cse
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Data Structures

UNIT I – Introduction to Data Structures

Short Answer Questions:

1. Define data structure. List its types.


2. What are linear and non-linear data structures? Give examples.
3. Explain Abstract Data Types (ADTs).
4. Distinguish between time complexity and space complexity.
5. List any two differences between linear search and binary search.

Long Answer Questions:

1. Explain various types of data structures with examples.


2. Describe the implementation and significance of Abstract Data Types.
3. Compare and contrast bubble sort, selection sort, and insertion sort.
4. Write algorithms for linear and binary search. Compare their performance.
5. Discuss the importance of complexity analysis in algorithm design.

UNIT II – Linked Lists

Short Answer Questions:

1. Define singly linked list. How is it represented in memory?


2. What are the advantages of doubly linked list over singly linked list?
3. Mention the use of circular linked list.
4. Compare arrays and linked lists.
5. List any two applications of linked lists.

Long Answer Questions:

1. Explain the creation and basic operations (insert, delete, traverse) on singly linked lists.
2. Describe doubly and circular linked lists with diagrams.
3. Write a C program to perform insertion and deletion on a circular linked list.
4. Compare arrays and linked lists in terms of memory and performance.
5. Explain any three real-world applications of linked lists.

UNIT III – Stacks


Short Answer Questions:

1. What is a stack? Mention its properties.


2. Differentiate between stack implementation using arrays and linked lists.
3. Write any two applications of stacks.
4. What is expression evaluation using stack?
5. Define backtracking with an example.

Long Answer Questions:

1. Explain stack operations (push, pop, peek) using arrays.


2. Implement stack using linked list and discuss its advantages.
3. Discuss the role of stack in evaluating postfix expressions.
4. Describe backtracking and explain how it is supported by stack.
5. Explain how stack is used to reverse a list with an example.

UNIT IV – Queues & Deques

Short Answer Questions:

1. Define queue. State its properties.


2. What is a double-ended queue (deque)?
3. List two applications of queues.
4. Distinguish between circular queue and linear queue.
5. Define priority queue and give an example scenario.

Long Answer Questions:

1. Explain queue operations and its implementation using arrays and linked lists.
2. Write a program for breadth-first traversal of a graph using queue.
3. Discuss applications of queue in CPU scheduling.
4. Describe deque and its operations in detail.
5. Compare stack, queue, and deque with examples.

UNIT V – Trees and Hashing

Short Answer Questions:

1. What is a binary search tree (BST)?


2. Define hashing and hash function.
3. Mention two operations performed on a hash table.
4. What is the need for hashing?
5. List any two applications of hashing.

Long Answer Questions:

1. Explain insertion, deletion, and traversal in Binary Search Trees with examples.
2. Describe different types of tree traversal techniques with suitable examples.
3. What is hashing? Explain the different types of hash functions.
4. Write about collision resolution techniques in hashing.
5. Discuss the applications of hashing in real-world problems like unique ID generation.

You might also like