Scribd
Upload
20 views2 pages

DSC Cie-2

The document is a continuous internal evaluation for a Data Structures course. It contains: 1) Instructions stating internal choice is provided in Part C of the evaluation. 2) Questions in Part A and B totalling 20 marks about stack, queue, linked lists applications and implementations. 3) In Part C, students can choose between two 10 mark questions - one on circular double linked lists and another on converting infix to postfix expressions using a stack. 4) Similarly, in Part D, students can choose a 10 mark question on implementing factorials recursively or on explaining circular queue concepts.

Uploaded by

learn something
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
20 views2 pages

DSC Cie-2

The document is a continuous internal evaluation for a Data Structures course. It contains: 1) Instructions stating internal choice is provided in Part C of the evaluation. 2) Questions in Part A and B totalling 20 marks about stack, queue, linked lists applications and implementations. 3) In Part C, students can choose between two 10 mark questions - one on circular double linked lists and another on converting infix to postfix expressions using a stack. 4) Similarly, in Part D, students can choose a 10 mark question on implementing factorials recursively or on explaining circular queue concepts.

Uploaded by

learn something
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

BMS COLLEGE OF ENGINEERING, BENGALURU-19

(Autonomous Institute, Amiliated to VTU)


DEPARTMENT OF MACHINE LEARNING
Continuous Internal Evaluation (CIE) -2

Course Code 20AM3PCDST | Course Title : Data Structures


Semester :3 Maximum Marks 40 Date:07-Mar -2022
MP
Faculty Handlingthe Course
Instructions: Internal Choice is provided in Part - C

Partk
Total 5 Marks (No Choice)
Q. No. Question Marks CO Level
1a List any 5 real time applications of Stack data structure. Can a compiler 5M 2
validate parenthesis matching of an expression in a program using Stack?|
| Justify your answer.

B
Total 15 Marks (No Choice)
Q. No. Question Marks co Level
2a Fibonacci analysis can be applied on stock market to analyze the 5M 2 2
movement of prices. Write a simple recursive program to show Fibonacci
series generation and explain how to find n" Fibonacci number.

2b Queue can be implemented using static and dynamic memory allocation 5M 2 2

techniques. For a Bus ticket reservation application that permits random


seat selection to the customers, which implementation technique best
suits? Infer your answer along with detailed explanation and pictorial
illustrations.
2c Given two Doubly Linked Lists (DLLs), using a user defined function, 5M 2 2
illustrate how the concatenation operation can be performed on them.
Make the moduleinteractivewith proper messages.

Total 20 Marks (Internal Choice)


Q. No. Question Marks CO Level

3a Data search applications require the control movement in both the 10M 2 3
directions to enhance the response time. Circular Double Linked List
(CDLL) is preferred for such applications. Write program modules to
depict the working of thefollowing CDLL operations:

Page 1 of 2
U.S.N.

i) Insert Front
ii) Delete Front
i) Display
OR
3b t is easy for a computer to solve mathematical expressions which are in 10M
10M 2 3
postfix forms rather than in infix representations. Write a
programmingB
sequence to convert an infix expression to its postfix form using the

concept of Stack. Show the stack trace conversion steps for the infix
expression: (a+b)*c
4a A mathematical application for computing factorial of a given number 10M 2 3
can be implemented using recursive function call. Construct an algorithm
for the same and determine its execution time efficiency.
OR
4b concept best suits for applications which allow memory
Circular Queue
reuse with stringent space restrictions. Write a program to model its
10M 2 3

working with simple logic and explain the same in detail.

You might also like