Scribd
Upload
127 views1 page

QP 2011 Oct Advanced+Problem+Solving

The document contains questions from an exam on advanced problem solving for information technology, image processing, computer science, and computer science engineering students. It includes 8 questions related to topics like exceptions in Java, comparing vectors and arrays, data structures, applications of stacks, binary trees, search trees, skip lists, radix sort, graph traversal techniques, B*-trees, the KMP algorithm, and expressions in Java.

Uploaded by

Yerri Swamy
Copyright
© Attribution Non-Commercial (BY-NC)
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
127 views1 page

QP 2011 Oct Advanced+Problem+Solving

The document contains questions from an exam on advanced problem solving for information technology, image processing, computer science, and computer science engineering students. It includes 8 questions related to topics like exceptions in Java, comparing vectors and arrays, data structures, applications of stacks, binary trees, search trees, skip lists, radix sort, graph traversal techniques, B*-trees, the KMP algorithm, and expressions in Java.

Uploaded by

Yerri Swamy
Copyright
© Attribution Non-Commercial (BY-NC)
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

www.jntuworld.

com

Code No: C4001, C6301, C0501, C5801 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M.Tech I - Semester Examinations, October/November 2011 ADVANCED PROBLEM SOLVING (COMMON TO INFORMATION TECHNOLOGY, IMAGE PROCESSING, COMPUTER SCIENCE, COMPUTER SCIENCE AND ENGINEERING) Time: 3hours Max. Marks: 60 Answer any five questions All questions carry equal marks --1. 2.a) b) 3. 4.a) b) What is an exception? How is it handled in Java? Explain with examples. [12] Compare and contrast vectors with arrays. What is a data structure? Give the classification of data structures. Discuss in detail the applications of stacks.

R09

List the differences between a binary tree and a tree. The nodes of a binary tree are labeled a-l. The post order listing is abcdefghijkl and the in order listing is backdejifghl. Draw the binary tree. Also, list the nodes of the binary tree in pre order and level order. [4+8] What is a search tree? List various types of search trees and compare them. [12] Explain skip list representation of dictionary ADT. Discuss radix sort with example. With the help of examples explain graph traversal techniques in detail. Write short notes on the following (a) B*- tree (b) KMP algorithm (c) Expressions in JAVA.

5. 6.a) b) 7. 8.

T N

W U
******

R O

D L

[5+7]

[12]

[6+6] [12]

[12]

www.jntuworld.com

You might also like