Scribd
Upload
33 views2 pages

SAMPLE QUESTIONS DataStructure - 2022 - 2023

The document contains sample questions for the Data Structures course at K J Somaiya Institute of Engineering and Information Technology for the academic year 2022-23. It includes various topics such as abstract data types, stack operations, queue operations, linked lists, and polynomial representation. Each question is assigned a specific mark value, indicating its importance in the curriculum.

Uploaded by

ayushikadu01
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
33 views2 pages

SAMPLE QUESTIONS DataStructure - 2022 - 2023

The document contains sample questions for the Data Structures course at K J Somaiya Institute of Engineering and Information Technology for the academic year 2022-23. It includes various topics such as abstract data types, stack operations, queue operations, linked lists, and polynomial representation. Each question is assigned a specific mark value, indicating its importance in the curriculum.

Uploaded by

ayushikadu01
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

SOMAIYA

VIDYAVIHAR
K J Somaiya Institute of Engineering and Information Technology
An Autonomous Institute Affiliated to the University of Mumbai

Academic Year 2022-23

DEPARTMENT OF COMPUTER ENGINEERING

Data Structures Sample Questions

Sub
Module
Question Statement of Question
Number
No.
a) Explain Abstract data types 5M
b) Explain the concept of Data Structures 5M
1 c) Explain the types of Data Structures 5M
d) What do you understand by stack overflow and underflow? 5M

a) Evaluate a postfix expression 100 200 + 2 / 5 * 7 + (10M)

b) Convert it into postfix expression x^y/(5*z)+2 10M


Draw the stack structure in each case when the following
operations are performed on an empty stack. 10M
(a) Add A, B, C, D, E, F
(b) Delete two letters
c) (c) Add G
(d) Add H
(e) Delete four letters
(f) Add I

2 Consider the queue given below which has FRONT = 1 and


REAR = 5. 10M

A B C D E

Now perform the following operations on the queue:


d) (a) Add F
(b) Delete two letters
(c) Add G
(d) Add H
(e) Delete four letters
(f) Add I
Explain the concept of a circular
e) queue? How is it better than a linear
queue? 5M

Difference between linked list and linked array? EXPLAIN WITH


a)
EXAMPLE 10M
Perform insertion into linked list at the end and deletion in
b)
between two nodes in the linked list 10M
Why is a doubly linked list more useful than a singly linked list?
c)
10M
3 d) Specify the use of a header node in a header linked list. 5M
Give the linked representation of the following polynomial: 7x3y2
e) – 8x2y + 3xy + 11x – 4 5M

Write a algorithm to delete the first element of a doubly linked list.


f) Add this node as the last node of the list. 10M

You might also like