(DCS/DIT311) - AnucdeDCS/DIT311) B.Tech. DEGREE EXAMINATION, ... Explain operating system layered approach and micro kernel ... Unit -IV 5) a) Explain System log, ...

(DCS/DIT311)

B.Tech. DEGREE EXAMINATION, DEC. - 2013

(Examination at the end of Third Year Third Semester)

Computer Science & IT

Paper - I : OPERATING SYSTEMS

Time : 3 Hours Maximum Marks : 75

Answer question no.1 compulsory (15 × 1 = 15)

Answer ONE question for each unit (4 × 15 = 60)

1) Write short notes on :

a) Batch processing systems

b) Program counter

c) PCB

d) Pthread

e) Explain starvation

f) What is semaphore

g) Explain nopreemption

h) Explain limit register and relocation register

i) Define TLB

j) Describe NUMA

k) What are file attributes

l) What is virtual file system

m) What is bad block

n) Define domain structure

o) Define worm

UNIT-I

2) a) Describe parallel systems and real time systems.

b) Explain operating system layered approach and micro kernel

(OR)

3) Describe IPC. Explain its two modes of IPC.

UNIT-II

4) a) Describe SJF and Priority scheduling algorithms with examples.

b) Define about Peterson's solution.

(OR)

5) Explain the dining philosopher's problem. Explain its solution using monitors

UNIT-III

6) Explain deadlock avoidance using resource allocation graph and bankers algorithm.

(OR)

7) a) Explain logical versus physical address space.

b) Explain contiguous memory allocation.

c) Describe segmentation.

UNIT-IV

8) a) Explain demand paging and steps to handle page fault.

b) Explain the storage structure of file system.

(OR)

9) a) Explain SCAN scheduling algorithm.

b) Explain about access matrix and its utilization.

c) Define the pc bus structure.

* * * *

(DCS/DIT 312)

B.Tech. DEGREE EXAMINATION, DEC 2013


Computer Science and IT

(Paper - II) : SYSTEMS SOFTWARE


Answer question no.1 compulsory (5×3=15)

Answer any four questions from Part-B (4×15=60)

Part-A

1) Explain the following:

a) Symbol table

b) Indirect addressing

c) Overlay

d) Debugging

e) Dynamic Linking

Part-B

2) a) Describe the machine structure of IBM 360 / 370.

b) Describe various data formats.

(OR)

3) Explain the design of one pass macro processor handling macro calls within macro definition.

4) a) Explain the functions of a loader.

b) Explain the different types of loaders.

(OR) 5) a) Describe the data bases used in the design of a direct linking loader.

b) Explain about Text Editors.

6) Discuss about Internal representation of files.

(OR)

7) a) Explain about UNIX kernel.

b) Explain buffer cache.

8) What is a system call. Discuss about various system calls used for file systems.

(OR)

9) Explain Inter Process Communication

* * * *

(DCS / DIT 313)

B.Tech. Degree Examination, DEC. - 2013



Paper – III : OPERATIONS RESEARCH

Time: 03 Hours Maximum Marks: 75

Answer Question No. 1 compulsory. [15]

Answer ONE question from each unit [4 × 15 = 60]

1) a) What are various models in OR?

b) Initial Basic Feasible solution.

c) Dual Simplex method.

d) Infeasible solution.

e) Degeneracy in Transportation problem.

f) Explain about Inventory control.

g) Characteristics of Queuing theory.

h) Probability considerations in PERT.

i) Critical Path.

j) Two-Person Zero-sum Game.

k) Max-min and Min-max principle.

l) Saddle point.

m) Characteristics of Dynamic programming model.

n) Payoff matrix.

o) What are the various methods to obtain solution of a transportation

problem?

UNIT - I

2) a) What is degeneracy in LPP?

b) Use simplex method to solve LPP :

Max Z = 3X1 + 2X2

Subject to constraints.

X1 + 2X2 < 6, 2X1 + X2 < 6, X1, X2 > 0

OR

3) a) Explain about Dual simplex method?

b) Write about Phases of OR?

UNIT – II

4) a) Write the procedure of Hungarian method of Assignment problem?

b) Solve the following transportation problem and obtain optimum

Transportation cost :

9 12 9 6 9 10 5

7 3 7 7 5 5 6

6 5 9 11 3 11 2

6 8 11 2 2 10 9

4 4 6 2 4 2 22

OR

5) a) Explain graphical method of 2 ×n and n×2 games.

b) Solve the game whose pay off matrix is given by :

B1 B2

A1 -5 2

A2 -7 -4

UNIT – III

6) Ram industry needs 5,400 units/year of a bought-out component which will be

used in its main product. The ordering cost is Rs. 250 per order and the carrying

cost per unit per year is Rs. 30. Find the economic order quality (EOQ), the

number of orders per year and the time between successive orders.

OR

7) Explain the following.

a) Quantity discounts.

b) ABC analysis of inventory.

UNIT - IV

8) a) Explain the differences between PERT and CPM.

b) The following table gives the activities in a project.

Activity Optimistic Time Normal Time Pessimistic Time

1-2 30 44 54

1-3 8 12 16

2-3 1 2 3

2-4 2 3 5

3-4 8 10 12

4-5 14 22 25

c) Draw a PERT diagram.

d) Find the probability that the project will be completed in less than 60 days.

OR

9) a) Explain about Monte-carlo Simulation?

b) Explain about Applications of Queuing theory?

��

(DCS 314)

B.TECH. DEGREE EXAMINATION, DEC - 2013

(Examination at the end of Third Year)


Paper - IV : DESIGN AND ANALYSIS OF ALGORITHMS

Time : Three hours Maximum : 75 marks

Answer Question No. 1 compulsorily.

Answer ONE question from each unit.


(a) Divide and conquer

(b) Spanning tree

(c) Graph

(d) Backtracking

(e) NP hard problem

UNIT - I

2) Explain Kruskal's algorithm with example.

Or

3) Explain single source shortest path algorithm.

UNIT - II

4) Explain travelling salesman problem with example.

Or

5) Explain all pairs shortest path problem.

UNIT - III

6) Discuss about 8-Queens problem.

Or

7) Explain (a) graph coloring (b) Hamiltonian cycle.

UNIT - IV

8) Explain Knapsack problem with example.

Or

9) Discuss about NP hard and NP complete problems.

* * *

(DCS/DIT315 )


(Examination at the end of Third Year Third semester)

COMPUTER SCIENCE & IT

Part-V : Database Management Systems


Answer Question No.1 is compulsorily (5x3=15)

Answer one question from each Unit (4x15=60)

1) Write short notes on:

a) Describe naive end users and canned transactions

b) Types of attributes

c) Boyce-codd normal form

d) Serializability

e) Cascading rollback

Unit -I

2) Describe the three schema architecture and data independence.

OR

Define about specialization and generalization with examples.

Unit -II

3) Describe join and explain about equi join and natural join with examples.

OR

Explain the steps in ER-to-Relational mapping algorithm.

Unit -III

4) What is normalization and explain any three normal forms.

OR

a) Dependency-preserving and non-additive join decomposition.

b) Dependency- preserving decomposition into 3 NF.

c) Lossless join Decomposition into BCNF Schemas.

Unit -IV

5) a) Explain System log, serial and non-serial schedules.

b) Explain Two-phase locking protocol.

OR

Explain how shadow paging and ARIES recovery algorithm works in data

recovery.

� � �

(DCS/DIT321)


(Examination at the end of Third Year Fourth Semester)


Paper - I : Automata Theory & Formal Languages


Answer Question No. 1 compulsory. (15)

Answer one question from each UNIT. (4×15=60)

1) a) Define Grammar.

b) Define Finite Automate.

c) Define transition Function.

d) Define Kleene’s theorem.

e) Define Leftmost Derivation.

f) Define Non-deterministic finite Automata.

g) Define pumping lemma.

h) Define pushdown Automata.

i) Define MYHILL – NERODE Theorem.

j) What do you mean by homomorphism.

k) Define regular expression for set of strings of a’s and b’s ending with either

a or bb.

l) What is the meaning of ab(a+b)*.

m) Define Recursive language.

n) Define universal Turing machine.

o) Define Context free language.

UNIT - I

2) a) Construct a DFA to accept string of o’s and I’s ending with the string oll.

b) Obtain an NFA with E- transitions to accept decimal numbers.

OR

3) a) Convert the following NFA into an equivalent DFA

UNIT - II

4) a) Explain closure properties of Regular language.

b) Write context free grammar for the regular expression 0*1(0+1)*

OR

5) a) State and prove pumping lemma.

b) Obtain regular expression for the finite Automata.

UNIT - III

6) Convert the following grammar into Greibach Normal form.

S → AB|/0, A → 00A/B, B → |A|

OR

7) a) Obtain the following grammar in Chomsky Normal form.

E → E+T/T, T → T*F/F F → (E)/I

I → a/b/c/Ia/Ib/Ic.

b) Explain about Context free languages.

UNIT- IV

8) a) Explain about Computable languages and functions.

b) Obtain a Turing machine to accept the language L=w/w is even and ∑=

{a,b}.

OR

9) a) Write differences between PDA and Turing machine.

b) Prove that halting problem is undecideble.

� � �

(DCS/DIT 322)

B. Tech. DEGREE EXAMINATION, DEC. 2013

(Examination at the end of Third Year)(Fourth Semester)


Paper – II : Principles of Programming Languages


Answer Question No. 1 compulsory [15]

Answer ONE question from each unit [4 x 15 = 60]


a) Type checking

b) Monitors

c) Threads

d) Concurrency

e) Associative arrays

UNIT - I

2) a) Explain the programming language paradigms.

b) Explain recursive descent parsing and dynamic semantics.

OR

3) Explain about primitive data types and type checking.

UNIT - II

4) Explain in detail about arrays and records with examples.

OR

5) a) Explain short circuit evaluation and guarded commands.

b) Explain various iterative statements.

UNIT - III

6) Discuss different parameter passing techniques.

OR

7) Explain how subprograms are implemented in Fortran 77 and Algol like

languages with example.

UNIT - IV

8) Explain concurrency in ADA-95.

OR

9) Discuss about exception handling in C++ and Java.

��

(DCS/DIT323)




Paper - III : SOFTWARE ENGINEERING


Answer Q.1 is compulsory [15]

Answer ONE question from each unit. [4 X 15 = 60]

1) a) What is an Agile process?

b) Explain CMMI Model?

c) Explain Data Modeling concepts?

d) What is a Component?

e) Explain about Black-Box Testing?

UNIT - I

2) a) Explain about the Changing nature of Software?

b) Explain about personal and Team process models?

OR

3) a) Explain about Unified process Model in detail?

b) Discuss in brief about process patterns?

UNIT - II

4) a) Discuss briefly about Eliciting Requirements?

b) Define Use Cases? Explain their purpose?

OR

5) a) Explain in brief about Data modeling Concepts?

b) Explain about Validating requirements?

UNIT - III

6) a) Discuss different elements in Desing Model?

b) Explain about Design Evaluation?

OR

7) a) Discuss Design process and Design Quality guidelines?

b) Explain about Component Level Design?

UNIT - IV

8) a) What are the Testing Strategies for Object-Oriented Software?

b) Discuss about Black Box and White Box testing?

OR

9) a) What are the Testing Strategies for Conventional Software?

b) Discuss in brief about the metrics for testing?

��

(DCS/DIT324 )




Paper - IV : DATA COMMUNICATIONS


Answer Question No.1 is compulsory (15)

Answer One question from each unit (4×15=60)


a) Digital signal

b) Radio waves

c) Bridge

d) LAN

e) Guided media.

Unit -I

2) Explain OSI reference model with a neat diagram.

OR

3) Explain guided transmission media in detail.

Unit -II

4) Explain polar encoding techniques.

OR

5) Explain about error detection and error correction methods.

Unit -III

6) Discuss (a) FDM (b) WDM

OR

7) Explain different types of ARQs.

Unit -IV

8) Explain various LAN topologies.

OR

9) Discuss different types of CSMA.

� � �

(DCS325)




Paper – V : COMPUTER GRAPHICS

Time: 03 Hours Maximum Marks: 75

Answer Question No.1 is Compulsory (15)

Answer any ONE question from each Unit (4x15=60)


a) CRT.

b) Homogeneous Coordinate system.

c) Rotation.

d) Window.

e) Display file structure.

UNIT - I

2) Explain the following:

a) Normalised device coordinates.

b) Character generation.

OR

3) Explain :

a) Displaying the frame buffer. b) Antialiasing of lines.

UNIT - II

4) Explain Bresenham’s line drawing algorithm with example.

OR

5) Explain the working of a CRT and storage tube display.

UNIT – III

6) Discuss the important features of segments.

OR

7) Explain :

a) Inside test.

b) Filling polygons.

UNIT - IV

8) Explain rotation about an arbitrary point.

OR

9) Discuss about Cohen-Sutherland line clipping algorithm with example.

��

(DCS/DIT326)

B. Tech. DEGREE EXAMINATION, DEC. - 2013

(Examination at the end of Final Year Fourth Semester)

Computer Science & It

Paper – VI: INTERNET PROGRAMMING


Answer Question No.1 compulsory. (15)

Answer one Question from each Unit. (4X15=60)

1) a) Explain the object oriented paradigm.

b) What is meant by constructor? What are the various types of

constructors that can be used in Java programming.

c) Define the term “Applet”. Explain the difference between Applets and

Applications.

d) What is RMI and RMI registry.

e) What is a BeanBox? Write the about BeanBox.

UNIT - I

2) a) Discuss the advantages and drawbacks of inheritance. And also

explain how a super class variable can refer a subclass object.

b) What is meant by polymorphism? Explain its usage with a sample

Java program.

OR

3) a) What are the benefits of exception handling? Discuss the usage of

‘throws’ and ‘finally’ keywords.

b) Discuss multithreading and also discuss about thread lifecycle.

UNIT - II

4) a) What is meant by event handling? Explain how the mouse and

keyboard events will be handled.

b) What are layout managers in Java? Explain them with suitable

examples.

OR

5) a) Discuss the importance and life cycle of Applets.

b) Explain with a sample Java program how to pass parameters to

applets.

UNIT – III

6) a) List and describe the interfaces provided javax.servlet package.

b) List and describe the classes provided javax.servlet.http package.

OR

7) Explain how JDBC performs mapping between JAVA and SQL data types.

UNIT – IV

8) a) Explain the following given classes and their usage:

i) Indexed Property Descriptor.

ii) Introspector.

iii) Property Change Support.

iv) Property Descriptor.

b) Write about the following beans:

i) Event Monitor Bean.

ii) Button Beans.

iii) TickTock Beans.

OR

9) Explain about the network classes and interfaces.

E E EE E EE E EE E E

(DCS/DIT311) - AnucdeDCS/DIT311) B.Tech. DEGREE EXAMINATION, ... Explain operating system layered approach and micro kernel ... Unit -IV 5) a) Explain System log, ...

Documents