Vous êtes sur la page 1sur 4

# Set No.

## Code No. 220104 1

II Year II-Semester Supplementary Examinations November 2003
DATA STRUCTURES THROUGH ‘C’
(Civil Engineering)
Time: 3 hours Max. Marks: 80
All question carry equal marks
---

## 1. a) Name different data structures. Explain applications of multidimensional arrays.

b) Write a ‘C’ program to multiply two matrices.

## 2. a) Compare a linear linked list with a linear array.

b) Write a ‘C’ program that merges two sorted linear linked lists.

## 3. a) Explain different operations on stacks. Show how a stack is represented on

memory.
b) Write a ‘C’ program to convert into a expression to post fix expression.

## 4. a) Define queue. Write a ‘C’ program to count number of elements in a circular

queue.
b) Describe applications of queues.

## 5. a) Describe different types of trees.

b) Write ‘C’ program to implement various operations on a binary tree.

## 6. a) What are applications of trees and graphs.

b) Write ‘C’ program to describe one application of tree.

## 7. a) Define sorting. Name different sorting techniques.

b) Write ‘C’ program to implement binary search.

## 8. Write short notes on the following:

(a) Representation of graphs
(b) Representation Vs Implementation.
(c) Minimum spanning tree.

###
Set No.

## Code No. 220104 2

II Year II-Semester Supplementary Examinations November 2003
DATA STRUCTURES THROUGH ‘C’
(Civil Engineering)
Time: 3 hours Max. Marks: 80
All question carry equal marks
---

## 1. a) Differentiate between one dimensional and multidimensional arrays. Explain why

array called as dense list.
b) Write a ‘C’ program that test a matrix whether it is a magic square or not.

## 2. a) Define ‘list’. What are different types of lists?

b) Write a ‘C’ program to traverse a circular linked list.

## 3. a) Differentiate between stacks and queues.

b) Write a ‘C’ program to implement various operations on stacks.

## 4. a) Name different types of queues. Show representation of circular queue in

computer memory.
b) Write ‘C’ function to show basic operations on a queue.

## 5. a) Define binary tree.

b) Write ‘C’ function to implement binary search tree.

## 6. a) Explain all tree traversals with an example.

b) Write ‘C’ function to in-order and post-order traversals of a binary tree.

## 7. a) Define searching. Describe binary searching technique.

b) Write ‘C’ program to implement quick sort.

## 8. Write short notes on the following:

(b) Representation of circular queue.
(c) Graph traversals.

###
Set No.

## Code No. 220104 3

II Year II-Semester Supplementary Examinations November 2003
DATA STRUCTURES THROUGH ‘C’
(Civil Engineering)
Time: 3 hours Max. Marks: 80
All question carry equal marks
---

1. a) What is an array? What are different types of arrays? What are limitations of
each?
b) Write a ‘C’ function that interchanges the first element with the last element,
second element with the second last element and so on.

lists over others?
b) Write ‘C’ function to perform various operations on a linear linked list.

## 3. a) Define stacks and queues. What are the applications of each?

b) Write a ‘C’ program to evaluate post fix expression.

## 4. a) Write a ‘C’ program to implement various operations on a queue.

b) Differentiate between queue and circular queue.

## 5. a) Describe how a binary tree can be represented using linked lists.

b) What are different tree traversal methods? Write ‘C’ functions for them.

## 6. a) Describe different graph traversals with suitable example.

b) Construct a binary tree for the given traversals.
Pre A B D G E C F
order:
In order: G D B E A C F
7. a) Name different sorting and searching methods.
b) Write ‘C’ program to implement partition exchange sort.

## 8. Write short notes on the following:

a) Basic operations on data structures
c) Minimum spanning tree.

###
Set No.

## Code No. 220104 4

II Year II-Semester Supplementary Examinations November 2003
DATA STRUCTURES THROUGH ‘C’
(Civil Engineering)
Time: 3 hours Max. Marks: 80
All question carry equal marks
---

1. a) What are different types of arrays? How they are represented in memory.
b) Write a program to check for all odd numbers in a matrix.

## 2. a) Explain different basic operations on data structures.

b) Write ‘C’ program to convert infix notation to postfix form.

## 3. a) Translate the following expression in to its equivalent postfix expression.

i) ( A + B / D ) / ( E −F ) + G
ii) A*B−(C+D)/(E −F)+G/ H
b) Write a ‘C’ program to count number of nodes in a doubly linked list.

## 4. a) Define queue. Describe applications of queues.

b) Write a ‘C’ program to implement circular queue.

## 5. a) Write a ‘C’ program for traversing a binary tree.

b) Describe how a binary tree can be represented using an array.

6. a) For a binary tree the preorder and inorder traversal sequences are as follows.
Pre order: A B L M K N P Q
In order : L B M A N K Q P
Draw the binary tree.
b) Differentiate between Tree and graph in terms of representations.

## 7. a) Among linear and binary search methods which is efficient? Why?

b) Write ‘C’ program to implement quick sort.

## 8. Write short notes on the following.

a) Applications of stacks.