Scribd
Upload
5 views4 pages

1stsessional Ds

ds

Uploaded by

Suraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
5 views4 pages

1stsessional Ds

ds

Uploaded by

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

SHAMBHUNATH INSTITUTE OF ENGINEERING AND TECHNOLOGY

Subject Code: BCS-301 Subject: Data Structure

Course: B.Tech. Semester: 3rd

FIRST SESSIONAL EXAMINATION, ODD SEMESTER, (2024-2025)

Branch: Computer Science & Engineering

Time–1hr30min Maximum Marks–30

QN QUESTION Marks CO BL
How do we know that any Algorithm or Program is efficient or not? L2
a. 2 CO1
Consider a 3D array Q declare as- Q [2:8, -4:1, 6:10]. Suppose Base L5
b. 2 CO1
Address(Q)=200 & W=4 words /memory cell. then find the location of an
element LOC Q [5, -1, 8] in both cases (Row and column order)

What is string. How it declares. Write down the 4 string functions in C L2


c. 2 CO1
What is data structure? Define primitive and non-primitive type of data L2
d. 2 CO1
structure.

Write down the condition for under flow for Deletion in linked list for L4
e 2 CO1
specified position.
Write down the pseudo code for insertion in Array for specified position. L4
f 2 CO1
NOTE:(Attempt all sections)

1. Attempt any FIVE questions.

2. Attempt any ONE of the following.

QN QUESTION Marks CO BL
Explain Asymptotic Notation with example L2
a. 5 CO1
Write down the insertion and deletion algorithm for Linked List L6
b. 5 CO1
Write down pseudo code for the insertion and deletion for Doubly Linked L3
c. 5 CO1
List
3. Attempt any FIVE questions.
QN QUESTION Marks CO BL
What is Tail Recursion. Brief it with suitable example L1
a. 2 CO1

L5
b. Let’s we have 5 discs. how many moves required to arrange all discs in descending 2 CO1
order, while we are using tower of Hanoi problem
Write down the condition for overflow and underflow of C-queue. L3
c. 2 CO1
Write down the condition for overflow and underflow of Stack. L3
d. 2 CO1
Write down the Difference between Priority queue and D-queue in term L4
e 2 CO1
of operations performed in queue.
How to represent a polynomial expression in linked list. L2
f 2 CO1

4.Attempt any ONE of the following.


QN QUESTION Marks CO BL
Arithmetic Expression P Written as: 5 X (6+2) - 12 / 4. Draw the STACK L5
a. 5 CO2
table for postfix expression oof given expression
Write down the algorithm for insertion of any element in queue L6
b. 5 CO2
Write down algorithm for the deletion of any element in Stack operation L6
c. 5 CO2

Bloom’sTaxonomyLevel(BL): -
Remember(L1), Understanding(L2), Apply(L3), Analyze(L4), Evaluating(L5), Creating(L6)
Bloom’sTaxonomyLevel(BL): -
Remember(L1), Understanding(L2), Apply(L3), Analyze(L4), Evaluating(L5), Creating(L6)

CO-CourseOutcome

ChartTitle
20
15
10 CO1
5
CO2
0

COWiseMarksDistribution

You might also like