Total No. of Questions 18] [Total No. of Pages 2
M.Sc. DEGREE EXAMINATION, MAY 2017
First Year
INFORMATION TECHNOLOGY
Data Structures With C
Time 3 Hours Maximum Marks 70
SECTION A × 15 45)
Answer any three questions.
Q1) What is two dimensional array? How to create, initialize and access array elements?
Consider the array int a and the base address 2000, then calculate the address
of the array in the row and column major ordering.
Q2) What is queue? Describe different queue operations. Write a subroutine to implement
queue operations using arrays.
Q3) How to create node in double lined list? Discuss different operations in double linked
list.
Q4) Write a routine for insertion sort illustrate for data n 10
10, 20, 13, 25, 17, 15, 4
Q5) Show how the following integers can be inserted in an empty binary search tree in the
order they are given 75, 36, 12, 91, 110, 45, 60, 20, 114, 8. Draw the tree in each
step and also mention its pseudo code.
SECTION B × 4 20)
Answer any Five questions
Q6) What is meant structure in How to create structure and access structure elements?
Q7) Write a C program to demonstrate concatenation of two strings.
Q8) Convert the following infix expression into equivalent post fix expression using stack
c
Q9) What is recursion? Write C program to implement factorial of given number using
recursion.
Q10) Write about circular linked list.
Q11) Construct binary tree from the following information.
In order 50, 10, 30, 90, 60, 80, 40, 20, 70
Pre order 60, 10, 50, 90, 30, 40, 80, 70, 20
Q12) Write C code to implement linear search.
Q13) Write about Bubble sort with example.
SECTION C × 1
Answer all questions
Q14) What is pointer?
Q15) Define de queue.
Q16) Define height and width of tree
Q17) Define complete binary tree
Q18) Define binary search.