B C2B003 Pages: 2

Reg. No. Name:
APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SECOND SEMESTER MCA DEGREE EXAMINATION, AUG 2017

RLMCA104: DATA STRUCTURES
Max Marks: 60 Duration: 3 hours

PARTA

Answer all questions. Each question carries 3 marks.

1. Explain the advantages of linked lists over arrays.
List any 6 application of stack.

What is a Dequeue?

Define Linked list. List any four types of linked list.
Define an AVL tree.

What do you mean by minimum cost spanning tree?

What is the difference between Binary Search and Linear Search?

9० > ಲ ಆ >+ YN

Compare selection sort and insertion sort.

PART B
Answer any one question from each module. Each question carries 6 marks
MODULE I
9. What is meant by time complexity of an algorithm? Explain any 2 asymptotic notations.
OR
10. How are arrays represented in the memory? Explain.
MODULE 11

11. Write an Algorithm to convert an Infix expression to a Postfix expression. Trace the algorithm

using example data set.
OR

12. Define Stack. Write the insertion and deletion algorithm for stack.

Page 1 of 2