Scribd
Upload
6 views

Modulewise Important Questions

The document outlines important questions related to data structures, specifically covering topics such as definitions, types, operations, and differences between various data structures in three modules: Introduction to Data Structure, Stack, and Queue. It includes specific questions about algorithms, pseudocode, and evaluations for stacks and queues, as well as applications and advantages of different structures. Each module contains multiple questions aimed at assessing understanding and application of data structure concepts.

Uploaded by

satyamkumarpatel2007
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
6 views

Modulewise Important Questions

The document outlines important questions related to data structures, specifically covering topics such as definitions, types, operations, and differences between various data structures in three modules: Introduction to Data Structure, Stack, and Queue. It includes specific questions about algorithms, pseudocode, and evaluations for stacks and queues, as well as applications and advantages of different structures. Each module contains multiple questions aimed at assessing understanding and application of data structure concepts.

Uploaded by

satyamkumarpatel2007
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
You are on page 1/ 2

Important Questions

Module no.1-Introduction to Data Structure


Q.1 Define Data Structure with example.
Q.2 Explain different types of data structures.
Q.3 Explain ADT with an example.
Q.4 Explain the list of Data structure operations.
Q.5 Differentiate Linear and Non-Linear Data structure.
Q.6 Differentiate Static and Dynamic Data structure.

Module no.2-Stack
Q.1 Define stack and explain the different operations perform on stack.
Q.2 Write an algorithm/pseudocode to perform the following operations on the stack
i) Push ii) Pop iii) Peek
Q.3 Write a function to perform the following operations on the stack
i) Push ii) Pop iii) Peek iv) isEmpty v) isFull
Q.4 Write the algorithm for the postfix evaluation and solve the given expression
Expression 1: 7 8 + 4 5 - *
Expression 2: 9 6 7 * 2 / -
Expression 3: 9 4 * 2 8 + -
Q.5 Evaluate the Following expression using stack
(2 – 3 + 4) * (5 + 6 * 7)
Q.6 Define Stack and List of applications of Stack

Module no.3-Queue
Q.1 Define Queue and explain the different operations perform on Queue
Q.2 Write an algorithm/pseudocode to perform the following operations on the Queue
i) enqueue ii) dequeue iii) getFront iv) getRear
Q.3 Write a function to perform the following operations on the Queue
i) enqueue ii) dequeue iii) getFront
iv) getRear v) isEmpty vi) isFull
Q.4 Write an algorithm/pseudocode to perform the following operations on the Circular Queue
i) enqueue ii) dequeue iii) getFront iv) getRear

Q.5 Write a function to perform the following operations on the Circular Queue
i) enqueue ii) dequeue iii) getFront
iv) getRear v) isEmpty vi) isFull
Q.6 Write a function to perform the following operations on the double ended Queue
i) Insert element at Front ii) Insert element at Rear
iii) Delete element from Front iv) Delete element from Rear
v) isEmpty vi) isFull
Q.7 Write an algoritm to perform the following operations on the double ended Queue
i) Insert element at Front ii) Insert element at Rear
iii) Delete element from Front iv) Delete element from Rear
Q.8 Write a short note on Priority Queue.
Q.9 Define Queue and List of applications of Queue.
Q. 10 Explain advantages of Circular queue over Linear queue.
OR
Q. 10 Justify the statement with example “ Circular Queue overcomes the disadvantages of
Linear Queue”

You might also like