Scribd
Upload
5 views1 page

dsa 23

This document is an examination paper for B.Tech students at UKA Tarsadia University, focusing on Data Structures and Algorithms for Semester 4. It includes detailed instructions and six sections of questions covering various topics such as data structures, algorithms, tree traversal, sorting methods, and searching techniques. Students are required to attempt all questions, providing detailed answers and algorithms where necessary.

Uploaded by

Nik Patil
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
5 views1 page

dsa 23

This document is an examination paper for B.Tech students at UKA Tarsadia University, focusing on Data Structures and Algorithms for Semester 4. It includes detailed instructions and six sections of questions covering various topics such as data structures, algorithms, tree traversal, sorting methods, and searching techniques. Students are required to attempt all questions, providing detailed answers and algorithms where necessary.

Uploaded by

Nik Patil
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/ 1

UKA TARSADIA UNIVERSITY

B.Tech CE (Software Engineering)/B.Tech CSE/B.Tech CSE (Cloud Computing) ( Semester 4 )


CE4015(2022-23)
Data Structures and Algorithms
Date :17/04/2023 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) Discuss various types of data structures with example.

II) Solve following problems:


Given a two-dimensional array Z1(2:9, 9:18) stored in column-major order with base address 100 and
size of each element is 4 bytes, find address of the element Z1(4, 12).

III) Write an algorithm for compare two strings.

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


I) Convert following infix expression into postfix expression using stack.
(A-B)/C*D^(E/F)^(G+H)

II) Write algorithm to delete from circular queue and mention the advantage of circular queue over simple
queue?

III) What is linked list? States the advantages of linked list over array. Also list various types of the linked
list.

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


I) Write an algorithm for a non-recursive (Iterative) pre-order and in-order traversal of Binary search tree.

II) Create an AVL tree for the following sequence of numbers.


64,1,44,26,13,110,98,85

III) How are graphs represented inside a computer’s memory? Which method do you prefer and why?

SECTION - 2
Q 4 Answer the following in Detail (Any 2) [6]
I) Explain properties of red – black trees.
II) Write a short note on greedy algorithms.

III) Algorithm for left rotate in red - black trees.

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


I) What is time complexity? Explain with example.

II) Sort the list: 415, 213, 700, 515, 712, 615 using merge sort algorithm and also explain the time
complexity of merge sort algorithm.

III) Define Big-oh and Theta notations with graph.


Q 6 Answer the following in detail. (Any 2) [12]
I) Sort following data using quick sort.
10 15 28 09 39 31 30 14 07 08

II) What is hashing? What are the qualities of a good hash function? Explain any two hash functions in detail.

III) Compare sequential searching with binary searching in detail.

You might also like