Jawaharlal Nehru Technological University Hyderabad 2010-1st Sem M.C.A -ester Supplementary s DATA STRUCTURES - Question Paper

Code No: 21003
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
MCA-I Semester Supplementary exams July 2010
DATA STRUCTURES
Time: 3hours Max.Marks:60
ans any 5 ques.
All ques. carry equal Marks
- - -
1.a) describe ADT and Sparse matrix.
b) Write a 'C' program that implement complex numbers, using structures with real
and complex parts. Write routines to add, multiply and negate such numbers.
2. Write an algorithm to perform
i) append an element to the end of a Singly Linked List
ii) Return the number of elements in a Singly Linked List
iii) Delete 'n' the element from a Doubly Linked List.
3.a) What is Stack and elaborate its applications?
b) Write an algorithm to transform a String from prefix to postfix. Carefully state
any assumptions you make regarding the input.
4. What is a priority queue? elaborate the primitive operations applied to a queue?
Write 'C' routines for those operations.
5. presume the subsequent list of keys:
16,38,54,80,22,65,55,48,64,95,5,100,58,25,36
Use pivot as the middle element of the list. discuss clearly step-by-step how to
sort the list using quick sort.
6. Consider the subsequent list
2,10,17,45,49,55,68,85,92,98,110.
discuss step-by-step how many comparisons are needed to obtain item '98' in list
using binary search.
7.a) describe and differentiate Binary Tree and Binary Search Tree.
b) Write clearly the Heap-Sort-algorithm.
8.a) elaborate the operations that are performed on Binary Search Tree? Write a
function "Search" that searches the Binary Search Tree for a provided item.
b) Write an algorithm that implements the bubble-sort.
********
NR

Earning:   Approval pending.