GODAVARI INSTITUTE OF ENGINEERING &TECHNOLOGY

(An Autonomous Institution)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Descriptive Examination –I
Subject: Database Management Systems Max Marks: 40
Class: I M.TECH - I SEM (2019-20) Max Time: 120mins
Branch: CSE Date: 04-11-2019
Answer All Questions. All Questions carry Equal marks.
1. (a) List four significant differences between a file-processing system and a DBMS.
(b) With a neat diagram describe the overall system structure of DBMS
2. (a) Define Specialization and aggregation with the help of an example. Explain its
purpose.
(b) Differentiate among candidate key, primary key, super key and foreign key.
3. Explain the following terms:
(i) Entity and Entity set (ii) Attribute and Attribute sets
(iii) Relationship and Relationship sets.
4. (a) Explain the following SQL constructs with examples:
(i) Order by (ii) group by and having (iii) Schema
(b) Discuss the problems caused by redundancy and the purpose of normalization.

GODAVARI INSTITUTE OF ENGINEERING &TECHNOLOGY

(An Autonomous Institution)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Descriptive Examination –I
Subject: Data Warehousing and Data Mining Max Marks: 40
Class: I M.TECH - I SEM (2019-20) Max Time: 120mins
Branch: CSE Date: 05-11-2019
Answer All Questions. All Questions carry Equal marks.
1. What is need of Data Warehousing? Explain Mapping the Data Warehouse to
Multiprocessor Architecture?
2. Define Metadata? Describe Various DBMS Schemas for Decision Support.
3. Explain five categories of Decision Support Tools.
4. Write about Online Analytical Processing (OLAP) guidelines and Explain
multidimensional data model.

GODAVARI INSTITUTE OF ENGINEERING &TECHNOLOGY

(An Autonomous Institution)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Descriptive Examination –I
Subject: Mathematical Foundations of Computer Science Max Marks: 40
Class: I M.TECH - I SEM (2019-20) Max Time: 120mins
Branch: CSE Date: 09-11-2019
Answer All Questions. All Questions carry Equal marks.
1. (a) Explain Well Formed Formula and it's rules.
(b) Explain Tautology and Contradiction with suitable examples.
2. (a) Show that P → S can be derived from the premises, ~P V Q, ~Q V R, and R → S .
(b) If there was a ball game, then traveling was difficult. If they arrived on time, then
traveling was not difficult. They arrived on time. Therefore, there was no ball game. Show
that these statements constitute a valid argument.
3. (a) Prove that the relation "Similarity between two triangles" is an Equivalence relation.
(b) Define Partial Order relation and Draw the Hasse Diagram for {D36;<=} D36 is the
divisors of 36.
4. (a) Discuss Pigeon hole principle and its Applications.
(b) Prove that the set={0,1,2,3,4} is an abelian group with respect to "addition modulo 5".
 GODAVARI INSTITUTE OF ENGINEERING &TECHNOLOGY
(An Autonomous Institution)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Descriptive Examination –I
Subject: Advanced Operating Systems Max Marks: 40
Class: I M.TECH - I SEM (2019-20) Max Time: 120mins
Branch: CSE Date: 06-11-2019
Answer All Questions. All Questions carry Equal marks.

1. Discuss different system architecture types in distributed systems.

2. What are vector clocks and lamp port logical clocks? Explain their necessity.
3. What is the architecture mechanism of building distributed file systems?
4. Explain centralized and distributed deadlock detection algorithms and where they are
applicable.

GODAVARI INSTITUTE OF ENGINEERING &TECHNOLOGY

(An Autonomous Institution)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Descriptive Examination –I
Subject: Advanced Data Structures Max Marks: 40
Class: I M.TECH - I SEM (2019-20) Max Time: 120mins
Branch: CSE Date: 07-11-2019
Answer All Questions. All Questions carry Equal marks.
1. Explain about Singly Linked list operations with suitable example.
2. Explain about Binary search and linear search techniques with example.
3. Write an algorithm and explain the quick sort with suitable example?
4. Discuss about different Graph traversals (BFS, DFS) with examples.

GODAVARI INSTITUTE OF ENGINEERING &TECHNOLOGY

(An Autonomous Institution)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Descriptive Examination –I
Subject: Computer Organisation and Architecture Max Marks: 40
Class: I M.TECH - I SEM (2019-20) Max Time: 120mins
Branch: CSE Date: 08-11-2019
Answer All Questions. All Questions carry Equal marks.

1. (a) What is a flip-flop? Design the basic flip-flop using NOR gates and explain.
(b) What is an excitation table? Write the excitation tables for JK and T flip-flops.
2. (a) Convert the following (i) (AB)16 = (___)10 (ii) (1234)8 =(____)10
(b) Find the 2’s complement and 1’s complement of 101101
3. (a) Simplify each of the following expressions i) ab +a'bc' +bc ii) (ab' +c) (a +b')c
iii)ab' +c +(a'+b)c'
(b) Find both the Minterm expansion and Maxterm expansion for the following function
using algebraic manipulations f (X,Y,Z,W) =XY +X'ZW
4. (a) Find the minimum sum-of-products expression for
f (x,y,z,w) =∑ m (1,2,4,15) +∑ d(0,3,14) using K -map
(b) Make a K-map for the function f (x,y,z,w) =xy +xz' +z +xw +xy'z +xyz and realize the
minimized expression using NAND gates only.