Scribd
Upload
9 views1 page

DS Ap 1

Data structs

Uploaded by

rvkaushal.jntuk
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
9 views1 page

DS Ap 1

Data structs

Uploaded by

rvkaushal.jntuk
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

Code No: R1921054 R19 SET - 1

II B. Tech I Semester Supplementary Examinations, September - 2021


DATA STRUCTURES
(Com to CSE, IT)
Time: 3 hours Max. Marks: 75
Answer any FIVE Questions each Question from each unit
All Questions carry Equal Marks
~~~~~~~~~~~~~~~~~~~~~~~~~
1 a) Describe about different type of Asymptotic notation with suitable example? [8M]
b) Explain the iterative merge sort and recursive merge sort algorithms with an [7M]
example.
Or
2 a) Write Abstract Data Type for an array implementation of polynomial addition. [8M]
b) Discuss about distribution sort with suitable example. [7M]
3 a) Write an algorithm to insert and delete an element from circular linked list with [8M]
suitable example?
b) Write an algorithm for representing the polynomial 10x6 + 5x3 – 4x + 6 using [7M]
linked lists.
Or
4 a) Explain the procedure to insert and delete element from sparse matrix. [8M]
b) Write an algorithm to insert new node at the beginning, at middle position and at [7M]
the end of a Reversing Singly Linked List.
5 a) Explain the ADT operations for linked list implementation stack? [8M]
b) Discuss about implementation of queues using linked list. [7M]
Or
6 a) Convert the given infix expression A+B^C+(D*E/F)*G into its postfixexpression, [8M]
and evaluate the same using stack. Here A=4, B=6, C=3, D=5, E=6,F=2, G=7.
b) Write an algorithm to push and pop an element from linked stack. [7M]
7 a) Prove the properties of a binary tree of height h has (2 h+1– 1) nodes. [8M]
b) Explain about representation of AVL trees in detailed? [7M]
Or
8 a) Explain about different type of tree traversal techniques. Explain each with suitable [8M]
example.
b) What is Balanced Binary tree? Explain about representation of Balanced Binary [7M]
treeusing linked list.
9 a) Explain Warshall’s algorithm to find transitive closure of a graph with a suitable [8M]
Example.
b) Explain about Graph Isomorphism and its properties. [7M]
Or
10 a) Write an algorithm to find non-recursive Breadth first search with suitable [8M]
example?
b) Consider G= (V,E,W) be undirected graph, connected weighted graph. Let ‘M’ be [7M]
feasible subset of E ϵ G, and (Vs,V-Vs) be any cut that respect M. Also, an edge
(Vi,Vj) be a light edge crossing the cut. Then the edge (Vi,Vj) is a safe edge for the
subset M.

1 of 1

|''|''|||''|'''|||'|

You might also like