Scribd
Upload
76 views

DS Test 01

This document contains a test paper for the course "Data Structures" for semester 3 of the B.E. program. The test has 3 questions for a total of 15 marks. Question 1 has 5 one-mark multiple choice questions testing different concepts of arrays, stacks, and infix expressions. Question 2 asks to explain the difference between arrays and linked lists, and provide an algorithm for implementing a circular queue. Question 3 asks to convert an infix expression to prefix and postfix forms, and implement a stack using a linked list with pseudocode.

Uploaded by

Test Ing
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
76 views

DS Test 01

This document contains a test paper for the course "Data Structures" for semester 3 of the B.E. program. The test has 3 questions for a total of 15 marks. Question 1 has 5 one-mark multiple choice questions testing different concepts of arrays, stacks, and infix expressions. Question 2 asks to explain the difference between arrays and linked lists, and provide an algorithm for implementing a circular queue. Question 3 asks to convert an infix expression to prefix and postfix forms, and implement a stack using a linked list with pseudocode.

Uploaded by

Test Ing
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ACAD-27 a) Iss. No.: 01, Rev. No.

: 00
Shri Ramdeobaba College of Engineering and
Ref. Clause(s): 9.1 Management, Nagpur -440013 Date of Rev: 01/01/2018

Department: Semester: III


Information Course Code: ITT252 Page: 01/01
Technology Course Name: Data Structures

Programme: B.E. Test: 1 Date of Exam: 29-12-2021


Max Marks: 15 Session: 2021-22 Time: 60 Mins.
Instructions:
 All questions are compulsory and carry equal marks.
 In question 1, marks will be awarded for correct justification only.
Write answers to the point and draw figures wherever necessary.
Que Marks COs EO
No.
Q1. Do as directed giving valid justification: (05) CO1, L4
CO2,
i. The total size of an integer array declared as int arr [9], assuming that int CO3
is of 4 bytes, is 9 bytes. State whether TRUE or FALSE
ii. A Stack can be used during Scheduling of Processes by Operating
System. State whether TRUE or FALSE
iii. Which of the following is (are) not the correct statement (s) for a stack
data structure?
a. Link List can be used to implement the stack
b. Stack follows FIFO
c. Stack is used to convert an Infix Expression to Prefix form
d. Elements are stored in a sequential manner
e. Top of the stack contains the last inserted element
iv. Execution speed of the algorithm is completely dominated by underlying
hardware. State whether TRUE or FALSE
v. Compiler can easily evaluate Infix expression. State whether TRUE or
FALSE
Q2. A) Explain the difference between Array and Link List. (02) CO3 L2

B) Write an algorithm for implementing a Circular Queue. The algorithm (03) CO3 L6
should ensure that no space is wasted. Show the queue and the position of
pointers initially and after the queue is full.
Q3. A) Convert the following Infix Expression to Prefix and Postfix form: (02) CO3 L3
A / B – C + D * E –A * C

B) Implement a Stack using Link List. Write a Pseudocode for implementation (03) CO3, L6
and the operations associated with Stack. CO4

You might also like