Scribd
Upload
12 views2 pages

DataStructures With CO-Level 2023

The document outlines the mid-semester examination for Data Structures at C V Raman Global University, detailing the structure of the exam, including types of questions and marks distribution. It includes questions on comparing data structures, evaluating expressions, and performing operations on queues and linked lists. Additionally, it specifies course outcomes and Bloom's taxonomy levels related to the questions.

Uploaded by

Ťecĥ Ìs Êverythinĝ
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
12 views2 pages

DataStructures With CO-Level 2023

The document outlines the mid-semester examination for Data Structures at C V Raman Global University, detailing the structure of the exam, including types of questions and marks distribution. It includes questions on comparing data structures, evaluating expressions, and performing operations on queues and linked lists. Additionally, it specifies course outcomes and Bloom's taxonomy levels related to the questions.

Uploaded by

Ťecĥ Ìs Êverythinĝ
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

C V RAMAN GLOBAL UNIVERSITY, BBSR

MID-SEM EXAM-2023
Subject: Data Structures (CSE23304)​ Time: 1 hr.
Semester: 3rd Sem CSE​ F.M-20

1.​ Answer All.​ [2 x 5=10]


a.​ Compare and contrast the array data structure over the linked list data structure.
b.​ Evaluate the following postfix expression using stack.
4, 16, 2, +, *, 24, 6, /, +
c.​ Consider a circular queue of size 6. At any instant of time, the following elements are present in the queue.
__ABC_
After performing enqueue(D), dequeue(), dequeue(), enqueue(E), enqueue(F) operations, what is the value of
front and rear? Show the Queue content after every operation.
d.​ Differentiate between Stack and Queue. Mention the applications of Stack and Queue data structure.
e.​ Mention the output generated by the following program if the condition for the while loop is ptr!=NULL and
ptr->next !=NULL for the single linked list 1->2->3->4->5. start is a pointer that holds the address of the
first node i.e. node 1 and 1,2,3,4,5 are the information part of the nodes of SLL.
void midSem( ){
struct node *ptr = start; while(​ ){
ptr = ptr->next; printf(“%d”, ptr -> info); }
2.​ Answer any two.​ [5 x 2 =10]
a)​ Convert the following infix expression A + (B * D) – ( ( E * F + O ) / G ) into post fix form by using
stack.
b)​ Write the algorithm / C function to perform deletion operations in a single linked list. (Write any two
possible deletion cases).
c)​ Define self-referential structure. Write a c-function or algorithm to insert a node at the beginning of the
double-linked list
d)​ List out the limitations of a linear queue. Which data structure overcomes such limitations? Write C
function/algorithm to perform dequeue operation on linear queue.

Course Outcomes

S.No CO Questions Marks


1 CO1Understand the Q1 a, d 14
fundamental concepts of Q2 c,d
various data structures and
their usage.
2 CO2: Solve problems using Q1 b,c,e 16
data structures such as linear Q2 a,b,
lists, stacks, queues, trees,
and graphs and write
programs for these solutions.

Blooms Taxonomy

Levels Question No.


Remembering 1(a),1(d),2(d)
Understanding 1(c),1(e),2(b)
Applying 2(a)
Analyzing 2(c)
Evaluating 1(b)
Creating

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy