Scribd
Upload
41 views2 pages

NCS301 2021-2022

Uploaded by

Aryan Dixit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
41 views2 pages

NCS301 2021-2022

Uploaded by

Aryan Dixit
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
PAPER I0-417696, Roll No: BTECH (SEM II) THEORY EXAMINATION 2021-22 DATA STRUCTURE USING C Time: 3 Hours Total Marks: 100 Note: Attempt all Sections. If require any mis ing data; then choose SECTION A italy. Attempt all questions in brief. 2x10=20 Define Data Structures and also the need of data structure, ‘What do you mean by time space trade off? Differentiate between linked list and array. ‘What do you mean by collision in hashing? What is the advantage of using Circular Queue over linear Queue? Define priority queue and its use List any two difference between graph and We ‘What are the disadvantages of representing binary wee using array? What do you mean by in place sorting algorithm? List any wo difference between stack and queue? SECTION B Attempt any three of the following: 10x3=30 Explain asymptotic notations? Show relationship between f(n) and g(u) in each notation. Write the push and pop functions in © simulating push and pop operatio implemented using an array bs of stack Explain tree traversal techniques and also write algorithm of various wee techniques traversal Write algorithm of DFS. ‘Construct AVE tree with the Following keys 35, 44, 80, 85, 67,89,25,16,10,14. SECTION C Attempt any one part of the followin, Write © Tinctions to insert a node at the beginning and delete the last node from a doubly linked list, Also state the advantages and disadvantages of doubly linked list, ‘An artay ARR[30][20] is stored in the memory with each clement occupying 4 bytes and base address is 1000, Find out the address of the index ARR [22](15] using row major order (0 indexing is used). Attempt any one part of the following: 10x1 ‘Convert the following infix expression into postiix expression using stack X4(V*Z°D)=E/ WAC) Explain circular queue and write program of enqueue and dequeus operations of circular queue? Attempt any one part of the followi 10x1=10 Describe Huffiman algorithm with the help of example. Construct binary tree with following traversals: Inorder: BC AEGDHFIJ Preorder: ABC DEG F HIJ Also find Post order traversal of it Page 1 of 2 A 01 PAPER D418 6. BTECH (EM II) THEORY EXAMINATION 2021-22 DATA STRUCTURE USING C Attempt any one part of the following: 10x1=10 ‘Apply Kruskal algorithm fo calculate the cost of the minimum spanning Wee Tor below graph. Oe. 4 8 NAN ©o—— So Write Dijksira algorithm for single source shortest path, Attempt any one part of the following: 10x1=10 Write algorithm of quick sort? Trace your algorithm on the following data elements to sore the list in ascending order: 2, 16,5, 21, 7, 57, 52, 85, 69, 1,9, 10. Explain hashing and various collision resolution techniques with example? Page 2 of 2 Printed Page: 2 of 2 Subject Co 01 Roll No:

You might also like