Scribd
Upload
13 views

MSC 2 Sem Cs Data Structures and Algorithms Using C 8118 Dec 2018

MSC CS

Uploaded by

cbyervirus
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
13 views

MSC 2 Sem Cs Data Structures and Algorithms Using C 8118 Dec 2018

MSC CS

Uploaded by

cbyervirus
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/ 4

Roll No. .......................................

(73) 8118
Printed Pages—4] 2M.Sc.(CS)1

Master of Science (CS) (Second Semester)


Examination, Dec. 2018/Jan. 2019
DATA STRUCTURES AND ALGORITHMS USING C

/Duration /Hours /Max. Marks

/Min. Pass Marks

Instructions :

1. The Question Paper is divided in five Units. Each unit carries an internal

choice.

2. Attempt one question from each Unit. Thus attempt five questions in all.

3. All questions carry equal marks.

4. Assume suitable data wherever necessary.

5. English version should be deemed to be correct in case of any anomaly in

translation.

6. Candidate should write his/her Roll Number at the prescribed space on the

question paper.

8118 1 P.T.O.

http://www.mcubhopal.com
I (Unit I)

STACK PUSH POP C 8

(a) Explain the different operations to be performed on the data structures.

(b) Write ‘C’ programs to perform PUSH and POP operations in STACK.

(Or)

4×4=16

Explain with suitable examples :

(a) Circular Queue

(b) Priority Queues

(c) Double ended queues

(d) Prefix and postfix expressions.

II (Unit II)

Circular doubly linked list 8

(a) Discuss various operations performed on the linked list.

(b) Explain circular doubly linked list with all the operations.

(Or)

C 8

(a) Write a ‘C’ program to insert or delete the nodes from a circular linked

list.

(b) Discuss application of linked list.

8118 2

http://www.mcubhopal.com
III (Unit III)

Strictly binary tree Array

expression conversion 8

(a) What is strictly binary tree ? Explain Array representation of binary

trees.

(b) Explain the technique of conversion of an expression into binary tree.

(Or)

4×4=16

Write notes on :

(a) Threaded binary tree

(b) Balanced tree

(c) AVL tree and

(d) B-Tree.

(Unit IV)

Insertion sort C 8

(a) Define algorithm. Discuss analysis of an algorithm. What do you mean

by complexity of an algorithm ? Explain.

(b) Write a C program to implement the insertion sort. Analyse its timing

requirements.

8118 3 P.T.O.

http://www.mcubhopal.com
(Or)

Sequential search Binary search 8

Quick Sort C 8

(a) Discuss sequential search and binary search with example.

(b) Write a C program to implement the Quick Sort.

(Unit V)

Directed, Undirected Weighted 8

Path matrix 8

(a) What is graph ? Discuss directed, undirected and weighted graph.

(b) Discuss Warshall’s algorithm for path matrix.

(Or)

Depth first search Breadth first search

(a) Write and explain Kruskal’s and Prism’s algorithm.

(b) Write and compare depth first and breadth first search.

8118 4

http://www.mcubhopal.com

You might also like