Total No. of Questions :09] [Total No. of Pages : 02

Transcription

1 CS/IT 315 (CR) Total No. of Questions :09] [Total No. of Pages : 02 III/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CS/IT DESIGN ANALYSIS OF ALGORITHMS Time: Three Hours Answer Question No.1 Compulsory. Answer One Question from each Unit. 1. a) Concept of algorithmic efficiency b) Difference between Dynamic programming and divide and conquer c) Longest common sequence d) Spanning Tree e) Bi-connected components f) LC Searching bounding g) Complexity measures UNIT-I 2. a) Give your suggestion to refine merge sort to make it in-place. Maximum marks:70 7X2=14 M 4X14=56 M b) Define omega notation. Explain the terms involved in it. Give an example. 3. a) Show that f1(n) x f2(n)= 0(g1(n) x g2(n)) where f1(n)=0(g1(n) and f2(n)=0(g2(n)). b) Differentiate between priori analysis and posterior analysis. UNIT-II 4. a) Write an algorithm of Greedy Knapsack and also analyze its time complexity. b) Explain matrix chain multiplication with an example. 5. a) Solve the following 0/1 Knapsack problem using dynamic programming P(11,21,31,33), W=(2,11,22,15), C=40,n=4. b) Show that the greedy algorithm to minimize the mean completion time for multiprocessor Job scheduling. UNIT-III 6. a) Differentiate between Dynamic Knapsack and Branch and Bound Knapsack problem. b) Explain the BFS and DFS algorithms. 1 P.T.O

2 7. Write the control abstraction of backtracking. Write backtracking algorithm for 8-queen problem. UNIT-IV 8. a) Explain the method of reduction to solve TSP problem using Branch and Bound. b) Explain the general method of Branch and Bound. 9. a) Differentiate between Dynamic Knapsack and Branch and Bound Knapsack probelm. b) Explain the satisfiability problem and write the algorithm for the same. 2

3 CS/IT 315 (RR) Total No. of Questions :09] [Total No. of Pages : 02 III/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CS/IT DATABASE MANAGEMENT SYSTEMS Time: Three Hours 1. a) Role of DBA Answer Question No.1 Compulsory. Answer One Question from each unit b) Why null values not preferred in a relation? c) Define BCNF d) Define referential integrity constraints e) Mention operations on files f) Grant and revoke g) Database security issues UNIT-I Maximum marks:70 7X2=14 M 4X14=56 M 2. a) Explain the representation of entity, relation, keys, attributes, role and structural constraints in ER diagram based on an example. b) Give a brief on history of databse applications. 3. a) Distinguish the characteristics of centralized and client/server architectures of DBMS. b) What is a data model, different data models? Expalin the relational data model. UNIT-II 4. a) What is an unsafe query? Give an example and explain why it is important to disallow such queries. b) What are the different data types that are supported in SQL. Explain. 5. a) Consider the schema: Suppliers (sid, sname, saddress), Parts(pid, pname, color), Catalog (sid, pid, cost). Choose proper key attributes and write the following queries in relational algebra. i. Find the names of suppliers who supply blue part ii. Find the sides of suppliers who supply every red part iii. Find the pids of parts that are supplied by at least two different suppliers iv. Find all the pids of parts supplied by supplier with sid=20 v. Find the pids of parts supplied by every supplier at less than Rs.500. P.T.O

4 b) Give a brief on Join and types of joins. UNIT-III 6. a) Describe the properties of normalized and unnormalized relations. b) Give a comparison of characteristics of heap, sorted and index file organizations. 7. a) Construct a B tree of order 2 to maintain the keys 1,9,8,6,4,5 and 10. b) What is normalization? Discuss the 1NF, 2NF and 3NF Normal forms with exmaples. UNIT-IV 8. a) What information does the dirty page table and transaction table contain? b) Explain the concept of concurrency control based on time stamp ordering. 9. a) Describe the shadow paging recovery technique. Under what circumstances does it not require a log. Explain. b) Give a brief on granularity of data items and multiple granularity locking. 2

5 CS/IT 315 (CR) Total No. of Questions : 09 ] [ Total No.of Pages : 02 III/IV B. Tech. DEGREE EXAMINATIONS, MARCH/APRIL First Semester CS/IT DESIGN ANALYSIS OFALGORITHMS Time : Three Hours Maximum Marks : a) Runtime analysis b) Optimized solution c) Approximate solution d) Longest common sequence e) Connected components f) Complexity measures g) Problem state, Solution state Answer Question No. 1 Compulsory. 7x2=14 M Answer ONE question from each Unit. 4x14=56 M UNIT - I 2. a) Show that f(n)+g(n) = O(n 2 ) where f(n) = 3n 2 - n + 4 and g(n) = nlogn+5. b) Write and explain the control abstraction for Divide and conquer. 3. a) Explain how time complexity of an algorithm is computed. b) Write the non recursive algorithm for finding the Fibonacci sequence and derive its time complexity. UNIT - II 4. a) What is spanning tree? Explain the prim's algorithm with an example. b) Find one problem for which the principle of optimality does not hold. Explain why the principle does not hold. P.T.O.

6 CS/IT 315 (CR) 5. a) Write a greedy algorithm to the Job sequencing with deadlines. b) Prove that the edge with the smallest weight will be part of every minimum spanning tree. UNIT - III 6. a) Prove or disprove an undirected graph G=(V, E) is biconnected if and only if for each pair of distinct vertices u and v there are two distinct paths from u to v that have no vertex in common except u and v. b) Draw and explain the portion of the tree for 4-queens problem that is generated during backtracking. 7. a) Write an algorithm to solve the Knapsack problem with the Branch and Bound. b) Explain the applications of DFS. UNIT - IV 8. a) Explain the general method of Branch and Bound. b) Explain the principles of LIFO Branch and Bound. 9. a) Differentiate between NP-complete and NP-Hard. b) Describe clique decision problem and write the algorithm for the same. 2

7 CS/IT 315 (RR) Total No. of Questions : 09 ] [ Total No.of Pages : 02 III/IV B. Tech. DEGREE EXAMINATIONS, MARCH/APRIL First Semester CS/IT DATABASE MANAGEMENT SYSTEMS Time : Three Hours Maximum Marks : a) Explain the importance of Null values. b) Mention different database users. c) Brief on RAID d) Deadlock e) Metadata f) Granularity Locking g) Transaction Answer Question No. 1 Compulsory. 7x2=14 M Answer ONE question from each Unit. 4x14=56 M UNIT - I 2. Construct an ER diagram for Airport database. Identify entities, attributes for each entity, relationship among entities. Represent necessary constraints in this database design process in detail. 3. a) Give short note on Transaction management. b) What is Data Abstraction? Explain three levels of Abstraction. UNIT - II 4. Write the following queries in Relational Algebra and Tuple relational calculus for following schema. Sailors (sid: integer, sname: string, rating: integer, age: real) Boats ( bid: integer, bname: string, color: string) Reserves (sid: integer, bid: integer, day: date) a) Find the names of sailors who have reserved a 'green' boat b) Find the names of sailors who have reserved at least one 'red' boat c) Find the names of sailors who have reserved at least two distinct colored boats d) Find the names of sailors who have reserved all boats. P.T.O.

8 CS/IT 315 (RR) 5. a) Define view and explain different types of views. b) Explain about the following clauses in SQL with examples: UNION, INTERSECT, EXCEPT, IN, EXISTS, LIKE, AS, DISTINCT. UNIT - III 6. a) Explain how multilevel indexing is implemented and give a brief on dynamic multilevel indexes. b) Write a brief on Files of unordered records. 7. a) Define functional dependency and write a brief on 1NF, 2NF and 3NF. b) Write brief on different secondary storage devices. UNIT - IV 8. a) What are the merits & demerits of using fuzzy dumps for media recovery. b) Write short notes on Serializability and Recoverability. 9. a) Explain optimistic concurrency control under timestamp. b) Discuss about deadlock detection & starvation. 2