B BC201 Pages: 2

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

Course Code: RLMCA104
Course Name: DATA STRUCTURES

Max: Marks: 60 Duration:3 Hours
PART A
Answer all questions. Each question carries 3 marks
1. Differentiate Recursion and Iteration.
Write short notes on applications of queues.
Write short notes on Linked Stacks and Queues.
How are polynomials represented using Linked lists?
Write short notes on Binary tree traversals.
Write short notes on AVL Trees.

Differentiate Linear search and Binary search.

90 > nn PF ‏تع لئ‎

Compare the time complexities of Sorting algorithms.

PART 8

Answer any one question from each module. Each question carries 6 marks

MODULE I

9. What is meant by analysis of an algorithm? Explain Asymptotic Notations.
OR
10. Explain how Arrays are represented in Memory.
MODULE II

11. Write an algorithm to perform postfix expression evaluation using stack.
OR

12. Discuss an algorithm to convert an infix expression to postfix.
MODULE III

13. Discuss operations on a Circular Queue with algorithms

OR

Page 1 of 2