Scribd
Upload
34 views

btech-cse-3-sem-data-structure-and-algorithms-pcc-cs301-2024 (1)

Dsa for semester

Uploaded by

divyanshuiit234
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
34 views

btech-cse-3-sem-data-structure-and-algorithms-pcc-cs301-2024 (1)

Dsa for semester

Uploaded by

divyanshuiit234
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/ 1

CS/B.

TECH(N)/ODD/SEM-3/3443/2023-2024/I019
MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL
Paper Code : PCC- CS301/PCC- CSBS301/PCC-CS301/PCCCS301 Data Structure & Algorithms
UPID : 003443

Time Allo ed : 3 Hours Full Marks :70


The Figures in the margin indicate full marks.
Candidate are required to give their answers in their own words as far as prac cable

Group-A (Very Short Answer Type Ques on)


1. Answer any ten of the following : [ 1 x 10 = 10 ]
(I) Which type of linked list contains a pointer to the next as well as the previous node in

the sequence?
(II) The me complexity of heap sort in worst case is-----------
(III) The running me complexity of a linear me algorithm is given as-------
(IV) A linear list in which elements can be added or removed at either end but not in the middle
is known as-----------
(V) If the elements of a data structure are stored sequen ally, then it is a ______.
(VI) Merge sort uses------------Technique
(VII) Where is linear searching used?
(VIII) Stack can be implemented using _________ and ________ ?
(IX) In C language, malloc( ) returns
(X) What is the number of edges present in a complete graph having n ver ces?
(XI) ________ nota on provides a ght lower bound for f(n).
(XII) Which data structures is used to implement recursion?

Group-B (Short Answer Type Ques on)


Answer any three of the following : [ 5 x 3 = 15 ]
2. Make a comparison between a linked list and a linear array. [5]
3. A graph contains 21 edges, 3 ver ces of degree 4 and all other ver ces of degree 2. Find [5]
total number of ver ces.
4. Write an algorithm for bubble sort technique. [5]
5. Write algorithms for push and pop opera ons of stack. [5]
6. What are the proper es a of b tree? What are the disadvantages of a binary search [5]
tree?

Group-C (Long Answer Type Ques on)


Answer any three of the following : [ 15 x 3 = 45 ]
7. (a) Explain what is ideal Sor ng algorithm? [5]
(b) Classify Sor ng Algorithms based on some parameter like stability, number of swap required, [ 10 ]
number of comparison, complexity, types, etc.
8. (a) Write merge sort algorithm. [7]
(b) Implement merge sort in C code. [8]
9. (a) Define hashing. [3]
(b) What are the different types of hashing technique explain. [6]
(c) What are the advantages of hashing. [6]
10. (a) Explain with a suitable example the principle of opera on of Quick Sort algorithm. [5]
(b) In which cases, Quick Sort becomes a ‘Slow Sort’ ? discuss the remedy in those cases. [5]
(c) Compare the performance and opera on of Bubble Sort and Selec on Sort. [5]
11. (a) Define recursion? Explain the usage of stack in recursive algorithm [5]
implementa on?
(b) What are types of Queues? Explain each. [ 10 ]

1/1

You might also like