0% found this document useful (0 votes)
19 views

FDS Class Test 2 Set 2

Uploaded by

ravi2525
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views

FDS Class Test 2 Set 2

Uploaded by

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

Class Test-II (AY 2022-23) SEM-I

Branch: Computer Engineering Date: /23/2023

Class: S E C o m p u t e r Duration: 1 hour

Subject: FDS Max. Marks: 30

Instructions:
(1) Answer Q. No. 1 or Q. No. 2, Q. No. 3 or Q. No. 4
(2) Figures to the right indicate full marks.
(3) Neat diagrams must be drawn wherever necessary.
(4) Assume suitable data, if necessary

Q. N. Max. CO Bloom's
Questions Marks mapped Taxonomy
Level
Q1 a) Sort the sequence 08, 03,02,11,05,14,00,02,09,04,20
7 CO1 L3
using shell sort.?
b) Explain linear search & binary search algorithm in
8 CO1 L3
detail ?
OR
Q2 a) How data structures are classified in sorting and 7 CO1 L2
searching?
b) Write an algorithm to sort ‘n’ numbers using quicksort? 8 CO1 L3
Sort the following numbers: 42, 28, 90, 2, 56, 39, 12,
and 87?
Q3 a) Explain the types of Linked List in short? 7 CO2 L2

b) Define and explain the following terms 8 CO2 L5


1) Doubly Link list.
2) Primitive operation of Linked list.

OR
Q4 a) Give the pseudo code C/C++ code to insert a node to 7 CO2 L2
the beginning of a singly linked list?
b) List various objectives of Link list operation and 8 CO2 L3
Explain with example ?

Average of Bloom’s Taxonomy Level = 2.91

You might also like