JNTU QUESTION PAPER 2015 DS

© All Rights Reserved

11 views

JNTU QUESTION PAPER 2015 DS

© All Rights Reserved

- IB Computer Science Essay
- CDAC Technical
- Maven Tic
- Learning With Python
- Linked List
- MELJUN CORTES CS2210S1 Data Structure File Organization Updated Hours
- Collections 1 - Answers
- DataStruct
- Unit 1final(1)
- Greedy Part 2
- Crack the Interview
- Exercise 3 Tree
- PDC95
- Final Theory
- Catalan Problems
- Data Structure throuh cpp lab manual.pdf
- TREES AND GRAPHS
- CS3330 Problem Set 1_ Recursion and Complexity Analysis _ Complete Solution
- 4iXLnF3hExw
- Data Structure Lec13 Handout

You are on page 1of 8

R13

SET - 1

DATA STRUCTURES

(Com. to ECE, CSE, EIE, IT, ECC)

Time: 3 hours

Max. Marks: 70

Note: 1. Question Paper consists of two parts (Part-A and Part-B)

2. Answer ALL the question in Part-A

3. Answer any THREE Questions from Part-B

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART A

3M

4M

4M

4M

3M

f)

4M

PART -B

8M

example.

8M

a) "Queues can be implemented using two stacks" - Support this statement with

8M

b) Write an algorithm to convert infix expression into a postfix expression.

8M

a) Explain how linked list can be used for representing polynomials using a

8M

suitable example.

b) Write an algorithm to implement queue using linked list.

1 of 2

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

8M

5

R13

SET - 1

8M

8M

a) With the help of diagrams construct a Binary Search Tree (BST) with the

8M

following keys: 86, 12, 42, 69, 38, 57, 74, 6, 49, 71. Also delete 42 from the

constructed BST.

8M

8M

example.

b) Define the following terms with respect of a graph:

i) Degree of vertex

ii) Incident edge

iii) Directed edge

iv) Path

,

2 of 2

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

8M

R13

SET - 2

DATA STRUCTURES

(Com. to ECE, CSE, EIE, IT, ECC)

Time: 3 hours

Max. Marks: 70

Note: 1. Question Paper consists of two parts (Part-A and Part-B)

2. Answer ALL the question in Part-A

3. Answer any THREE Questions from Part-B

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART A

4M

3M

4M

3M

4M

f)

4M

(a) Is it cyclic?

(b) Is it connected?

PART -B

2

their significance.

b) Write an algorithm to implement Binary Search technique. Use the algorithm

to search 32 in the following list of elements. Explain the process at each step.

12, 16, 17, 19, 20, 22, 24, 29, 30, 32, 37

8M

8M

example.

b) Write the algorithm for evaluating a postfix expression using stack. Evaluate

8M

the following postfix notation 5 6 2 + * 8 4 / -

a) What is linked list? Write an algorithm for inserting an element E at the given

position P of the linked list.

b) What is a sparse matrix? Write an algorithm for finding the transpose of a

sparse matrix.

1 of 2

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

8M

8M

R13

SET - 2

a) What is a binary tree? Construct a binary tree given the pre-order traversal and

in-order traversals as follows:

Pre-Order Traversal: G B Q A C K F P D E R H

In-Order Traversal: QB K C F A G P E D H R

b) Define the following terms with suitable examples

i. Binary Tree

ii. Strictly Binary Tree

iii. Complete Binary Tree

iv. Almost Complete Binary Tree

8M

8M

8M

a) Write an algorithm to traverse the graph using Breadth First Search with a

suitable example?

b) What is Adjacency Matrix? Draw the Adjacency Matrix of the following

graph. Also give adjacency list representation for the same.

8M

2 of 2

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

8M

8M

R13

SET - 3

DATA STRUCTURES

(Com. to ECE, CSE, EIE, IT, ECC)

Time: 3 hours

Max. Marks: 70

Note: 1. Question Paper consists of two parts (Part-A and Part-B)

2. Answer ALL the question in Part-A

3. Answer any THREE Questions from Part-B

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART A

4M

3M

c) List out the advantages and disadvantages of using linked list over an array

4M

4M

e) Draw the BST for the given list of elements 46, 21, 56, 89, 9, 12.

4M

f)

3M

1

1

0

0 1

1 0

0 1

PART -B

8M

8M

a) List out the applications of stack. Consider the usual algorithm for determining

whether a sequence of parentheses is balanced. What is the maximum number

of parentheses that will appear on the stack AT ANY ONE TIME when the

algorithm analyzes: ( ( ) ( ( ) ) ( ( ) ) )?

b) Explain various operations that are performed on queue with suitable

algorithms.

8M

a) Write algorithms for swapping two successive elements in a singly linked list

with the first element placed at position P.

b) What is a circular linked list? Write an algorithm to merge two circular linked

lists.

8M

1 of 2

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

8M

8M

R13

5

SET - 3

8M

10

11

ii. How many of the nodes have at least one sibling?

iii. List out the nodes that are siblings to node 5?

iv. How many descendants does the root have?

v. What is the depth of the tree?

vi. How many children does the root have?

vii. "Is it a complete binary tree" - Justify

b) Write the iterative procedures for

i. Post-Order Traversal of a binary tree

ii. Level-Order Traversal of a binary tree

6

8M

a) Define threaded binary tree. Explain inorder threading using suitable example.

Discuss advantages of the threaded binary tree.

b) Write a procedure to find the maximum and minimum elements of a Binary

Search Tree (BST).

8M

a) Write the Prims algorithm for finding the minimum-spanning tree of a graph

with an example.

b) What is transitive closure of a graph. Explain Warshalls algorithm to find the

transitive closure of the graph with a suitable example

8M

2 of 2

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

8M

8M

R13

SET - 4

DATA STRUCTURES

(Com. to ECE, CSE, EIE, IT, ECC)

Time: 3 hours

Note: 1. Question Paper consists of two parts (Part-A and Part-B)

2. Answer ALL the question in Part-A

3. Answer any THREE Questions from Part-B

~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

PART A

a) List out some examples for linear and non-linear data structures.

3M

3M

c) What is singly linked list? Mention any two advantages of singly linked lists.

4M

4M

4M

f)

4M

Does the minimal spanning tree of a graph give the shortest distance between

any two specified nodes? Justify your answer.

PART -B

a) Arrange the list of elements in ascending order using quick sort 45, 26, 31, 55,

77, 24, 42, 63, 99, 22, 88, 72 ? Write the value of left pointer l, right pointer r

and pivot at each step and also draw the current scenario after each step?

b) Write a recursive procedure to compute the nth Fibonacci number.

8M

8M

algorithm.

b) List out various applications of queues. Explain how queue is used in Round

8M

Robin Algorithm with neat diagrams wherever necessary?

an array versus a linear linked list.

b) Write an algorithm to insert a node at the end of a doubly linked list.

1 of 2

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

8M

8M

5

R13

SET - 4

a) Find the inorder, preorder and postorder traversals for the given binary tree.

8M

8M

search tree.

b) Write a short note on Balanced Binary Trees. Also discuss on the applications

of Balanced Binary Trees.

10 M

8M

b) What are connected components of a graph? Is there a method to find out all

the connected components of a graph? Explain.

8M

2 of 2

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

6M

- IB Computer Science EssayUploaded byAbhi Agarwal
- CDAC TechnicalUploaded byheenadhingra98
- Maven TicUploaded byNarendra Reddy
- Learning With PythonUploaded byDreamtech Press
- Linked ListUploaded byiamsayan03
- MELJUN CORTES CS2210S1 Data Structure File Organization Updated HoursUploaded byMELJUN CORTES, MBA,MPA
- Collections 1 - AnswersUploaded byanand.pasunoori
- DataStructUploaded bydearmohseen
- Unit 1final(1)Uploaded byrammar147
- Greedy Part 2Uploaded byjay desai
- Crack the InterviewUploaded bySanthosh Nagabandi
- Exercise 3 TreeUploaded byHải Nam
- PDC95Uploaded byAmmar Haj Hamad
- Final TheoryUploaded byManu Mishra
- Catalan ProblemsUploaded byDeusExMacchiato
- Data Structure throuh cpp lab manual.pdfUploaded byGary Dejesus
- TREES AND GRAPHSUploaded byMAYA
- CS3330 Problem Set 1_ Recursion and Complexity Analysis _ Complete SolutionUploaded byteacher.theacestud
- 4iXLnF3hExwUploaded byAkshay Babbar
- Data Structure Lec13 HandoutUploaded byJʋŋaiɗ Aĸɓar
- L02-TreesTerminologyRootedTreesTraversalsLabeledandExpressionTreesTreeADTTreeImplementationsBinarySearchTreesUploaded byAndrei Ardelean
- Data Structure 1Uploaded bymagisraj
- dp1.pdfUploaded byPintu Das
- 2-3-4 Tree , Order StatsUploaded bypritish
- bitstream_1668020Uploaded byyekych
- ParamicsV4-ProcessorUserManualUploaded byFarhan
- Single Linked List CopyUploaded byHoh Joey
- msUploaded byHappy Anand
- QUESTIONS.rtfUploaded byY.Neeraja
- DSC Manual 18-19Uploaded byAshish Kapgate

- Tutorial problems of EMF II year KLUUploaded bynaga01013ee022
- Root LocusUploaded bynaga01013ee022
- cpp_notesUploaded bynaga01013ee022
- Mrac Pid DocumentationUploaded bynaga01013ee022
- Optimal Control Systems (Electrical Engineering Handbook) - MalestromUploaded bynguyenvanthoaqb
- Mock Gate EEEUploaded bynaga01013ee022
- 15i3position Control of Servo Motor Using Sliding Mode Fuzzy Controller Copyright IjaetUploaded bynaga01013ee022

- MB0031Uploaded byMithesh Kumar
- Acoustic B450 B600HUploaded byJulián Cañaveral
- A Guide for Law EnforcementUploaded bycliftoncage
- DELL N5040 DV15_CP 10263-1 48.4IP01.011_A00_MB_0422_INSUploaded bySadiq Al-Mohandis
- Catalogo Square D MCBUploaded byHugo Palencia
- Suman CV 2075_5-Uploaded bySuman Jyoti
- Edu Cat en Nci Ff v5r20 ToprintUploaded byVictor Yañez
- HEC HMS Manual Costa CountyUploaded byHéctor M. Pauth
- GuideUploaded byganeshasatu3836
- Esp32 Technical Reference Manual EnUploaded byr.veenaa
- OBIEE Activity GuideVol1Uploaded byGangadri524
- GP80Uploaded byAntonio Colmenares
- Siemens Tcpip EthernetUploaded byRaphael Palacios
- 805 SW4 Installation InstructionsUploaded byLucianoDosSantos
- Automatic License Plate RecognitionUploaded bykavithekiran
- Storing Image in MysqlUploaded bysayem72936
- May_Jun_06_Toyota_MotorUploaded bysmohadikar
- Big Data Analytics and Use CasesUploaded bybsvbraja
- EDU Trike Instructor 2013 ENG.pdfUploaded bybalint
- TetdffdUploaded bymojo
- Automated Backup Solution for Uponor North AmericaUploaded bydannoxyz
- TMN-Lect8.pptUploaded byUsman Khan
- General overview deep learningUploaded byMıghty Itauma
- BSEN 10204 - Type 3.2 Inspection Certification FactsheetUploaded bylluisvs5931
- Packet Tracer 9.6.5.5 - Router CommandsUploaded byCelia King
- JAVA NotesUploaded bygouse1210
- Diseñando compiladorUploaded byemelcin
- Solving Polynomial EquationsUploaded byint0
- Analysis of Large Reverse Osmosis MembranesUploaded byYoussef
- BestPracticesForCatSwitches.pdfUploaded byvsnarasimhan

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.