Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 3

Reg. No.

Question Paper Code :<< AJ7540>>


JAYAMUKHI INSTITUTE OF TECHNOLOGICAL SCIENCES
NARSAMPET, WARANGAL,
(Autonomous Institution)

B.Tech. EXAMINATION, FEB 2021

<<IV><<I>> Semester - <<Computer Science and Engineering>>


<< AJ7540>> - << MOBILE APPLICATION DEVELOPMENT>>(Regulations <<R-15>>

Time : Three Hours Maximum : 70 Marks

PART – A (Answer ALL questions) (5*4=20 Marks)

CO BTL
1a Define Asymptotic Notation and Give the commonly used asymptotic CO1 K1 4
. notation to calculate running time complexity of algorithm.
CO1 K4 4
b. List the types of analysis to perform on a particular algorithm.
CO2 K2 4
c. Outline the use of Min Max Heap.

d. Compare Binomial Heaps and Fibonacci Heaps. CO2 K5 4

e. Identify the basic properties of B-Tree. CO3 K3 4

PART – B (Answer ALL questions) (5*10=50 Marks)

List out the various operations on array ?Write a procedure to insert an


(a) CO1 K4 5
element in the middle of the array
2.
Define Recurrence equation and explain in detail about solving
(b) CO1 K1 5
recurrence equation

(OR)

Explain in detail about the Insertion operation in single and double


(a) CO1 K2 6
linked list with suitable code
3.
Analyze the complexity in circular linked list and discuss with an
(b) CO1 K4 4
example.

4. Construct a Min-Max heap with the elements 1,4,-5,6,7,9,3,40,20,2,70,100 CO2 K6 10

(OR)
Analyze the insert,delete and merge operations in leftist heap with
5. CO2 K4 10
suitable example

6. Elaborate how double rotation fix the problem found in single rotation 10
of AVL tree with an example. CO3 K6

(OR)

(a) Illustrate the operations of B-Tree using 2-3 CO3 K2 6


7.
(b) Assess the operations which are performed in splay tree CO3 K5 4

Develop the quick sort for the elements 10,80,30,90,40,50,70. Justify


8. K3& 10
the best sorting techniques CO4
K5
(OR)

9. Summarize about the Job sequencing with deadlines CO4 K2 10

10. Examine in detail about 0/1 knapsack dynamic programming CO5 K4 10

(OR)

11
Discuss in detail about knapsack using backtracking CO5 K6 10
.
Bloom’s Taxonomy Level (BTL)

BTL Remember Understand Apply Analyze Evaluate Create


(K1) (K2) (K3) (K4) (K5) (K6)
Percentage of
Questions

You might also like