2 SASTRA UNIVERSITY (A University under section 3 of the UGC Act, 1956) B.Tech. Degree Examinations November 2017 End Semester Course Code: BCSCCS 303R03 / BITCIT 303R03 / BICCIC 303R03 Course: DATA STRUCTURES Question Paper No. : B0144 Duration: 3 hours Max. Marks: 100 PART-A 10 x 2=20 Marks values for cstart and clink so that they ing of the course names.6. What is the total number of binary trees having n nodes? 7. What is the maximum number of rotations required for an AVL tree with height “h” to fix the AVL property? 8. Define binary heap. 9. Find the number of leaves in a 2-3 tree with 3 levels. 10. How many edges are there for a complete graph with 5 vertices? PART-B Answer all the questions 4x 15=60 Marks 11. (@) Write a procedure to solve the Tower of Hanoi problem. (8) (b) Write the various steps involved in the execution of Hanoi (3, A, B, C) a) (OR) ee ONY Rann - 12. (a) Explain the various general list operations, (8) Write a procedure to remove the duplicate elements from a Ee (7) > a code in C-language to declare a node of a singly J stores an employee data. (Assume Employee and Designation as the fields) (5) 0 to print the elements of a double linked q (10) L Storing of storking a sparse matrix in 7 () of a sparse matrix. (10)15. (2) Write an algorithm to convert a binary tree into its mirror . image. (7) (b) For the binary tree given below, obtain (3) one way inorder threading and (4) (ii) perorder threading (4) preorder J ») (OR) 16. Write procedures for inserting and deleting a node from a binary search tree. Explain the procedures with an example. 1 (a) Write an algorithm to combine two heaps to produce a third heap. (8) (b) Write an algorithm to print all the data stored in a Trie. ) (OR) ¢ the Kruskal’s algorithm to find the minimum spanning (7) minimum spanning tree for the graph given below cal’s algorithm. (8)PA & Answer the following tai 10 Marke | 19, (a) Create a Student ADT with Helde fine satrings> studentNum integer = address: eating telNum eating : eatring» B Inclide methods to provide input to all the fields. Haeept student number, for the remaining felds you can directly assign the input, StudentNum is an Ackerman’s number with 1 input (i, iy where 1 = 1,2, 4,0 where n is the total number of records, You have to provide a separate method for generating studentNum using Ackerman’s finetion (use recursion), (Assume n= 10) (5) Create a linked list of records by inserting one by one in the empty list according to the increasing order of the _ studentNum. (4) a BST of the list of records with studentNum as the fe Check whether the constructed BST is balanced of not ; (5) p of the list of records using the studentNurm (5) beers | any wren date red Fron oe dren may be een or QageeretSASTRA UNIVERSITY (A University under section 3 of the UGC Act, 1956) B.Tech. Degree Examinations November 2017 End Semester Course Code: BCSCCS 302R04 / BITCIT 302R04 Course: DATABASE MANAGEMENT SYSTEMS ; Question Paper No. : B0149 Duration: 3 hours Max. Marks: 100 f in PART-A Answer all the questions 10 x 2=20 Marks _ 1. Define Canned Transactions. “ 2. How can DBMS be classified? 2. - List out the types of data model used. ent to find the second highest salary from the_ é Re: jon the characteristics of JSON. F PART-B : 4x 15 = 60 Marks Answer ail the questions Describe dvantages of using the DBMS approach. (8) wih Seedagrem, explain the three schema architecture of the DBMS. (7) (OR) ) i ious types of attributes with suitable examples. 12. (a) Explain the various types os (®) Draw an E-R diagram for a banking enterprise with all components and explain. (10) 43. Explain different type of joins in SQL. clearly highlighting each case giving relevant examples. (OR) otes on the following. Give suitable examples G) (5) (5) With necessary examples | for normalization has been with respect to INF, 2NFre 16. Why i$ concurrency control needed? Validate the same by : means of providing suitable examples. 17. Discuss the following: RcosaDD Vs RDBMS (8) @ CouchDB Features (7) (OR) in CURL utility in CouchDB. PART-C 1x 20 =20 Marks ENO, ENAME,DNO,AGE,BASIC) DNO,DNAME,CITY) the following queries in SQL. ne the tables, identify the keys and foreign keys. the employee name whose name start with ‘S’. I of employees whose basic pay is grater than f the basic pay of all the employees, the the minimum basic pay and the more than the average basic (15) DML actions to theSASTRA UNIVERSITY (A University under section 3 of the UGC Act, 195%) B.Tech. Degree Examinations November 2016 End Semester Course Code: BCSCCS 302R04 / BITCIT 302804 Course: DATABASE MANAGEMENT SYSTEMS on Paper No. : BO1S1 Duration; 3 hours Max, Marks: 100 tion with partial participation. with “ORDER BY” clause.file processing approach with example. () advantages of using database management system (8) (OR) database system environment with neat diagrams. the employee database where the primary keys are (employee name, street, city) works (employee name, company name, salary) ; (company name, city) Of residence of all employees who a G) and cities of residence of allSANTA UNIVERSITY (A Miva nity Unda section 4 0h He Gt het, VM) Teoh, Degree Kawminutions Hind Nementer Course Code WHICH MOHis / MHICHI Wi6HOt ‘Couric; RELATIONAL DATAHASE, MANAGEMENT SYSTEMS. May W017 Question Paper No, ; 0549 Duration: 3 hours Max. Marks: 10 PART ~ A Answer all the questions 10 x2 = 20 Marks + State the three implicit properties of a database. _ What is meant by “database manipulation”? erms tuple, attribute and relation. mpose of SELECT and PROJECT operations in(a) Show that every serial execution involving these two transactions preserves the consistency of the database, (5) (b) Show a concurrent execution of TI} and T14 that produces a non serializable schedule. @) (©) Is there a concurrent execution of T13 and T14 that produces a serializable schedule? (5) (OR) 16. Explain the following concurrency control schemes with examples (a) two-phase locking. (8) (®) Snapshot isolation. @ _ 17. What are the issues that affect the design of Federated Database Management Systems? (OR) Write a cursor program for inserting and deleting rows from a PART-—C 1x 20=20 Marks 2 queries for the following tables: (10) Empno, Ename, Salary, Designation) npno, Deptno.) play all the details of the employee whose salary is 10K. Deptno in which Employee “Seeta” is Deptname in table T2. gi n of Geeta from ‘Manager’ toSASTRA UNIVERSITY e (A University under section 3 of the UGC Act, 1956) B.Tech. Degree Examinations May 2017 End Semester ! Course Code: BCSCCS 302K04 / BITCIT 302R04 Course: DATABASE MANAGEMENT SYSTEMS Question Paper No. : B0156 Duration: 3 hours af Max. Marks: 100 PART—A Answer all the questions 10 x 2=20 Marks 1. Differentiate parametric end user with sophisticated end user. 2. Justify the use of data dictionary. 3. How will you calculate the cardinally ratio for binary relationship? 4. Write the syntax of SQL query with “GROUP BY” clause. 5. When do you use VIEWS? 6. Illustrate natural join. 7. When do we use NULL value? B. How will you prove that Y is functionally dependant on X? Z ‘When will you get HTTP 404 error?10. How do use _sum function in CouchDB? ) PART-B a Answer all the questions 4x15 = 60 Marks 11. (a) Justify the use of different classifications of database system with neat diagrams. 10 (b) Differentiate 2 tier model with 3 tier model. “3 (OR) Describe the three-schema architecture. Why do we need data independence? (10) (b) How is the data independence implemented in 3 schema architecture? (5) ‘Consider the bank database, where the primary keys are branch city, assets) mer street, customer city) _ customer (customer name, custo! . (Joan number, branch name, amount) rr joan number) , branch name, balance) (customer name, account number) nuct the following SQL queries for this relational database. ‘all customers of the bank who have an account but not a G) of all customers who live on the same street , i @) who have an ‘who live in “Harrison”. @) e an account at all the branches @) (@) amounts in the bank.