Data Structure & Algorithms (December 2011)

Data Structure & Algorithms (December 2011)

(3 Hours)

[Total Mark 100]

N.B.: (1) Question No. 1 is compulsory.
(2) Attempt any four questions from remaining six questions.

1. (a) Explain the Asymptotic notations to measure the time complexity of algorithm.—5 Marks
(b) What are linear and non – linear data structures? ---- 5 Marks
(c) Explain vectors with at least five methods.—5 Marks
(d) Discuss circular and priority Queue.—5 Marks

2. (a) Write a program to create ‘QUEUE’ ADT using Linked list implementation . ADT should support                 following operations:--10 Marks

1. Create queue
2. Enqueue
3. Dqueue
4. Display

(b) Explain Huffman Coding Algorithm with example.—10 Marks

3. (a) Write a program to implement Quick Sort and comment on its complexity. –10 Marks
    (b) Implement the function to delete a node from Binary search tree. (Consider all possible cases).
         10 Marks
4. (a) Write a program to create Binary tree and inorder, preorder and postorder traversal of the tree.—
          10 Marks
(b) Write any pattern matching algorithm and explain it with suitable example.—10 Marks

5. (a) Using Prism’s and Kruskal’s algorithm, find minimum spanning tree for the following graph. –
          10 Marks

(b) What is Hashing ? What is meant by Collision? Hash the following in table of size 10. Use any two                 collision resolution techniques:--10 Marks

99

33

23

44

56

43

19

6. (a) Given a ‘INFIX’ expression, write a program to convert it to its ‘POSTFIXX’ form. – 10 Marks
    (b) Write an algorithm to traverse a graph using.—10 Marks

1. Breath First Search
2. Depth First Search

7. Write short notes on any four of the following :--20 Marks

1. Red Black Trees
2. Searching Algorithms
3. Recursion
4. Doubly Linked List
5. Expression Trees
6. Comparison of Sorting Algorithms

Also see Data structure & algorithms question papers for December 2013

Data Structure & Algorithms (Information Technology Sem III) JUNE 2010

Data Structure & Algorithms Information Technology   Sem III
June 2010	AN-2569
(3 Hours)	[Total Mrks : 100]
N.B: 1)  Question No. 1 is compulsory
2) Attempt any four questions from remaining SIX questions.
1. a) Write a program to implement a STACK ADT using Linked list.	10
b) Explin Huffman coding and construct huffman code for the following	10
"JAVA DATA STRUCTURES"
2. a) Construct the binary tree for the inorderd and post traversal sequence given below  `                 In oreder : "INFORMATION                   Post Order: "INOFMAINOTR"	10
b) Write and explain Radix sort algorithm with suitable example.	10
3. a) Write an algorithm for merge sort and comment on its complexity.	10
b) Calculate and draw the minimum cost spanning tree using Kruskal's algoritham for the          following graph.	10
4.  a)  Explain how interface and packages are created and accessed with their syntax.	10
b)  Write any pattern Matching Algoritham and explain it with suitable example.	10
5.  a) Write a program to implement queue using array.	10
b)  Write a program to search an element in an array using binary search technique.	10
6.  a)  Write algorithm for heap sort and explain Ascending heap with suitable example.	10
b)  Hash the following in a table of size 11. Use any two collision resolution technique              99     67     41     0     17     2     98     20     94     27	10
7.  a)  Write short note on any four of the following:-	20
i)  AVL Trees           ii)  Red and Black Trees          iii)  Asymptotic Notation          iv)  Recursion          v)  Graph traversal technique         vi)  Abstract data type.

Also see Data structure & algorithms question papers for May 2009

SE (IT) Semester III Data Structure & Algorithms May 2009.

S.E. (IT) Sem 3rd

Data Structure & Algorithms (May 2009)

Con. 2996-09.

VR-3393

(3 Hours)

[Total Mark 100]

N. B.:- (1) Question No. 1 is compulsory.
(2) Answer any four out of remaining six questions.
(3) All Programs are to be written in JAVA only.
1. (a) What is Recursion? Give disadvantage of recursion. Write a programme to implement Tower of Hanoi.--10 Marks
(b) Explain Asympotic Notations (0, Ω,.θ) and write the properties of asymptotic notations.--5 Marks
(c) Explain packages and how do we hide classes using packages.--5 Marks
2. (a) Write a program to implement Quick sort and comment on its complexity.--10 Marks
(b) Write an algorithm for binary search method with example.--6 Marks
(c) Explain vectors with at least five methods.--4 Marks
3. (a) Write a program to implement Circular queue using array.--10 Marks
(b) Explain Huffman Algorithm. Construct Huffman tree for “MALAYALAM” with its optimal code.--10 Marks
4. (a) Write an algorithm to traverse a graph using – (with example)-- 10 Marks

1. Breath First Search
2. Depth First search

(b) Implement the function to delete a node from Binary Search Tree.--10 Marks
(Consider all possible cases.)

5. (a) Draw the minimum cost spanning tree using Kruskal’s algorithm. Also find its cost with all intermediate steps.--10 marks

(b) Write a program to implement STACK using Linked List.--10 marks
6. (a) Explain in brief--10 marks

1. Ascending heap
2. Desending heap

Write a program to implement heap sort.
(b) What is hashing? Explain Hashing methods and collision avoiding techniques.--10 marks
7. Write short notes on any four of the following with example.--20Marks
(a) AVL Tress
(b) B- Tress
(c) Shortest Path Algorithm.
(d) Pattern matching.
(e) Comparison of sorting Algorithms.
(f) Expression and realization of ADT’s in JAVA.

Also see Data structure & algorithms question papers for December-2010

Data Structure & Algorithms ( Mumbai University Question Papers - Information Technology (IT) - Second Year (SE) - Semester 3 & 4 (December-2010)

Data Structure & Algorithms (3 Hours)
S.E./I.T./Sem - III		GT-6309 [Total Marks :- 100]
1	a) What are linear and non-linear data structures? b) Why is it necessary to analyze an algorithm? c) What are Asymptotic notation d) What is an Abstract data type?	20
2.	a) Explain how a stack can be used to execute computation of mathematical expressions. For example consider the expression (a+b) * (b-c) b) Write a program to create single link list and display the list	10 10
3.	a) Explain map abstract data type. b) What are circular and priority queues.	10 10
4.	a) What is binary search tree. Suppose the following list of letters is inserted      in order into an empty BST      J  R  D  G  T  E  M  P  A  F  Q. Find the final tree.	10 10
5.	a) Explain selection sort and write a program to implement selection sort. b) Write an algorithm and explain with an example radix sort method.	10 10
6.	a) Find out the minimum cost spanning tree for below graph using kruskals     and prims method. b) Write any pattern matching algorithm and explain it with suitable example.	10 10
7.	Write short notes on any four:-  b) Red-Black trees  c) Text Compression  d) Graph Traversals  e) Recursion  f) Comparison of sorting algorithms.  g) Searching algorithm	20

Also see Data structure & algorithms question papers for December 2010