Scribd
Upload
7 views1 page

CS 303 DSA Set-A

The document outlines the Mid Semester Examination I for the Data Structure subject at Sagar Institute of Science and Technology, detailing the structure of the exam, including question types and marks distribution. It includes questions on algorithms, array storage, data structures like queues and stacks, and their applications. Additionally, it specifies the course outcomes for students in understanding various data structures and their concepts.

Uploaded by

anshulsarawagi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views1 page

CS 303 DSA Set-A

The document outlines the Mid Semester Examination I for the Data Structure subject at Sagar Institute of Science and Technology, detailing the structure of the exam, including question types and marks distribution. It includes questions on algorithms, array storage, data structures like queues and stacks, and their applications. Additionally, it specifies the course outcomes for students in understanding various data structures and their concepts.

Uploaded by

anshulsarawagi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Sagar Institute of Science and Technology, Gandhi Nagar

Bhopal
Affiliated to RGPV and BU Bhopal|Accredited by NAAC & NBA |Approved by AICTE

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

MID SEMESTER EXAMINATION – I (November 2024) Set-A


Enrollment No: _____________
Subject:Data Structure Question Subject Code: CSTaxonomy
Bloom’s 303 Marks COs
Duration: -1:30 Hours Maximum Marks:- 28
Level

Note: All questions are compulsory.


All questions carry equal marks.
Q.
No.
1. (a) Define algorithm? Explain the various characteristic of algorithm.
Or 2(Understand) 7 CO1
(b) Explain how to derive complexity of algorithm with the help of
all three notations.
2. (a) An array VAL [1…15][1…10] is stored in the memory with each
element requiring 4 bytes of storage. If the base address of the array
VAL is 1500, determine the location of VAL [12][9] when the array
3(Apply) 7 CO1
VAL is stored (i) Row wise (ii) Column wise.
Or
(b) Write an algorithm to insert a node at the end of given linked list.
3. (a) Define Queue data structure? Explain all types of Queue data
structure.
Or 2(Understand) 7 CO2
(b) Define Stack data structures? Explain Applications of Stack data
structure.
4. (a) Write an algorithm to push and pop an element into stack. Also
covert the following infix expression to postfix form:
A+B*[(C*D)+(E/F)]+G^H/I
Or 3(Apply) 7 CO2
(b) Assume that the operators +, -, × are left associative and ^ is right
associative. The order of precedence (from highest to lowest) is ^, x ,
+, -. The Prefix and Postfix expression corresponding to the infix
expression a + b × c - d ^ e ^ f is.
Course Outcome Statements:

Student will be able to:

CO1 Remember the various types of data structures and understand the concepts of arrays, linked lists.
(Remember/Level 1)
CO2 Explain the concept of ADT like stacks, queues, and recursion. And select the appropriate one for
solving problems. (Understand/ Level 2)

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