Scribd
Upload
15 views2 pages

1 Ce4001

nicebook

Uploaded by

Nj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views2 pages

1 Ce4001

nicebook

Uploaded by

Nj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UKA TARSADIA UNIVERSITY

B.Tech (CE)/B.Tech (IT) ( Semester 3 )


CE4001(2020-21)
Data and File Structures
Date :16/05/2022 Time :9:30AM- 12:30PM
Max. Marks:60
Instructions :
1. Attempt all questions.
2. Write each section in a separate answer book.
3. Make suitable assumptions wherever necessary.
4. Draw diagrams/figures whenever necessary.
5. Figures to the right indicate full marks allocated to that question.
6. Follow usual meaning of notations/abbreviations.
SECTION - 1
Q 1 Answer the following in Detail (Any 2) [6]
I) Define: Algorithm. Write an algorithm for addition of two 1-D array.

II) Explain and differentiate array and linked list.

III) Explain best and worst-case analysis of an algorithm.

Q 2 A) Answer the following in brief. (Any 1) [2]


I) Write a matrix to represent following polynomial equations:
a. 2X2 - 5XY + 6Y2
b. X2Y2 + 4X2Y - 7XY2 - 8XY

II) Write down tower of Hanoi algorithm.

Q 2 B) Answer the following in detail. (Any 2) [10]


I) List out various operations of stack. Write algorithm for any two operations of stack.

II) Convert following infix expression into equivalent postfix expression by showing stack status after every
step in tabular form.
(A / (B + C) * D – E) / (F * G + H)

III) Explain use of stack for recursive calls to solve factorial(5).

Q 3 Answer the following in detail. (Any 2) [12]


I) Differentiate Array and linked list in detail.

II) Write an algorithm to insert an element in doubly linked list.

III) Write an algorithm to perform deletion operation in circular queue

SECTION - 2
Q 4 Answer the following (Any 1) [6]
I) Differentiate text file and binary file.

II) Enlist different types of indexes and explain anyone with an example.

Q 5 Answer the following in detail. (Any 2) [12]


I) Define binary tree. Explain types of binary tree with examples.

II) Construct an AVL search tree for the following data:


20, 25, 10, 15, 13, 9, 4, 30, 40

III) Construct a binary search tree from the given traversal of tree:
Inorder: Q B K C F A G P E D H R
Preorder: G B Q A C K F P D E R H
Q 6 Answer the following in detail. (Any 2) [12]
I) What is graph data structure? Explain vertex and edges in detail.

II) Explain basic operation on graph data structure.

III) What is adjacency node? explain it with example.

You might also like