(DMTCS 01)

M.Tech. DEGREE EXAMINATION, DEC. - 2013

(Examination at the end of First year)

Computer Science

Paper - I : DATA STRUCTURES

Time : 03 Hours Maximum Marks : 75

Answer question no: 1 compulsory

Answer one question from each unit

1) a) What is the significance of Data Structures

b) What do you mean by Algorithm?

c) Differentiate degue and circular queue.

d) Differentiate tree and Graph.

e) Define thread.

f) What is the purpose of hashing?

g) What is the significance of Binary tree.

h) What do you mean by length of the tree?

i) What do you mean by threaded binary tree?

j) Differentiate double linked list and circular list.

k) Define rehashing.

l) What is the significance of file structures?

m) Differentiate tree and Binary tree.

n) Define minimum spanning tree.

o) What is the importance of linked list?

Unit - I

2) a) Explain the routines to add and delete the nodes in double linked lists.

b) Explain the stack operations and write routines for each of the operations.

OR

3) Write the routines for creation, insertion and deletion of nodes in a binary tree.

Unit - II

4) Write an algorithm for quick sort and trace it for the data 14 21 93 41 0 11 20

OR

5) Explain hashing in detail

Unit - III

6) Explain any one External sorting technique with an appropriate example.

OR

7) Explain the following file operations

i) Insert a record

ii) Delete a record

Unit - IV

8) Explain Breadth first search and depth first search with an example.

OR

9) Explain minimum spanning trees with an example.

���

(DMTCS 02)

M.Tech. DEGREE EXAMINATION, DEC. - 2013

(Examination at the end of First year)

Computer Science

Paper - II : DISCRETE MATHEMATICAL STRUCTURES

Time : 03 Hours Maximum Marks : 75

Answer question no: 1 compulsory

Answer one question from each unit

1) a) What is tautology?

b) What do you mean by recurrence?

c) What do you mean by length of a tree?

d) In how many ways a group of 6 students be choosen from 10 students.

e) What is the significance of permutations?

f) Let A = {1,2} and B = {a,b,c,d}. Find A×B.

g) What is the path of a graph G

h) What do you mean by inference?

i) What is lattice?

j) What is spanning tree?

k) Define minimum spanning tree?

l) Differentiate tree and Binary tree?

m) What do you mean by closure?

n) Define Euler path.

o) Define Hamiltonian graph.

Unit - I

2) a) Construct the truth table for the following formula.

( ) ( ) ( )∨ ∧ ∧ ↔ → �p q q r p r

b) Determine whether the following formula is tautology or not

( ) ( ) ( ) ( )→ ∧ → → → ∧ ∧ p q r p p r q r .

OR

3) Explain all types of Relations and functions with suitable examples.

Unit - II

4) Prove by mathematical induction that

21

1 22

−

n

for all n greater than or equal to 0

OR

5) a) Explain principle of inclusion - Exclusion.

b) Explain Recurrence relations.

Unit - III

6) Explain the following

a) Directed graphs

b) Equivalence relations

c) Warshell’s algorithm.

OR

7) Discuss the following

a) Lattics

b) Paths and closures.

Unit - IV

8) a) Explain Euler path and Euler circuit with suitable example.

b) Discuss Isomorphism.

OR

9) a) Explain four colour problem with suitable example.

b) Explain Hamiltonian graph.

���

(DMTCS 03)

M.Tech. DEGREE EXAMINATION, DEC. - 2013

(Examination at the end of First Year)

Computer Science

Paper - III : COMPUTER ARCHITECTURE AND ORGANIZATION

Time : 03 Hours Maximum Marks : 75

Answer all questions

1) a) What do you mean by Computer Architecture?

b) What is register?

c) What is the purpose of Bus?

d) Differentiate RISC and CISC

e) Convert (6525)10

into hexadecimal

f) What do you mean by parellel processing

g) What is the importance of pipelining?

h) What is the importance of logical shift?

i) Differentiate multiprogramming and multiprocessing

j) What is an interrupt

k) Define Cache

l) What do you mean by Computer Configuration

m) What do you mean by Primary Memory?

n) What is the significance of control unit?

o) Define DMA

2) Explain the following

a) Register Transfer

b) Shift micro-operations

c) Timing and Control

Or

3) Explain the following

a) Computer Registers

b) Instruction cycle

4) a) Explain in detail about the various addressing modes

b) Discuss parellel processing

Or

5) a) Explain about RISC in detail

b) Explain vector processing

6) Explain pipelining in detail

Or

7) Explain in detail about micro programmed control unit

8) Explain in detail about Memory system

Or

9) Discuss DMA and interrupts

� � �

(DMTCS 04)

M.Tech. DEGREE EXAMINATION, DEC - 2013

(Examination at the end of First Year)

COMPUTER SCIENCE

Paper - IV : OPERATING SYSTEMS

Time : Three hours Maximum : 75 marks

Answer Question No. 1 compulsory.

Answer ONE question from each unit.

1) a) What is the importance of an operating system ? (2 M)

b) What do you mean by multi threading ? (2 M)

c) Define virtual Memory. (2 M)

d) What are the operations related to cache memory ? (2 M)

e) Define fragmentation. (2 M)

f) What is the significance of interupts ? (2 M)

g) What is the importance of secondary memory ? (2 M)

h) Define process. (1 M)

UNIT - I

2) Explain in detail about the operating system functionalities.

(Or)

3) Explain in detail about the components of computer.

UNIT - II

4) Explain the importance of scheduling in operating system. Discuss any two scheduling

techniques.

(Or)

5) Explain in detail about the Inter process communication.

UNIT - III

6) What is Deedlock ? Explain deedlock detection methods.

(Or)

7) Explain virtual memory systems in detail.

UNIT - IV

8) What is paging ? Explain in detail about the demand paging.

(Or)

9) Explain in detail about File system organization.

� � �

(DMTCS05)

M. Tech. DEGREE EXAMINATION, DEC. - 2013

(Examination at the end of First Year)

Computer Science

Paper - V : AUTOMATA THEORY AND FORMAL LANGUAGES

Time : 03 Hours Maximum Marks : 75

Answer Question No:1 is Compulsory. (15)

Answer ONE Question from each Unit. (4×15=60)

1) a) Define DFA.

b) Define PDA.

c) What is the significance of Context free language?

d) What is the importance of Tuning machine?

e) List out the applications of finite automata?

f) What do you mean by pumping lemma.

g) What is the importance of Context free grammar.

h) What do you mean by undecidability?

i) Define LR(0) Grammar.

j) What do you mean by NP-Complete problems.

k) Define NFA.

l) What is the significance of mealy and moore machines?

m) What is regular expression.

n) Define Sparse tree.

o) Define homomorphism.

Unit - I

2) Construct an NFA for the following

a) R = 01[((10)* + 1111)* +0]*1.

b) ((010 + 10)* 001)*.

OR

3) Design DFA which accepts language

L = { 0, 000, 00000 1 ……} over {0}

Unit - II

4) Construct a PDA generating L = { WWR |W a,b}*}

Such that L = L(M)

OR

5) Explain Context – Free Grammars and languages.

Unit - III

6) Design a Tuning Machine to add two integers.

OR

7) Convert the following grammar to GNF

A1 → A2 A3

A2 →A3 A1|b

A3 →A1 A2 |a

Unit - IV

8) Explain Chomsky Hierarchy.

OR

9) a) Explain Tuning Machines properties.

b) Discuss undecidability.

� � � �

(DMTCS 06)

M.Tech. DEGREE EXAMINATION, DEC. - 2013

(Examination at the end of First Year)

COMPUTER SCIENCE

Paper – VI : Database Management Systems

Time : 03 Hours Maximum Marks : 75

Answer Question No. 1 compulsory

Answer One Question from each Unit

1) a) What is tuple ?

b) Define Primary Key.

c) What do you mean by Query ?

d) What is transaction ?

e) What is record ?

f) What do you mean by Relational Database ?

g) Define relation.

h) What is the significance of Joint Operation ?

i) What do you mean by Metadate ?

j) What do you mean by Entity ?

k) What is log ?

l) Define Concurrency.

m) What is the importance of optimization ?

n) What is the function of object ?

o) What is attribute ?

UNIT - I

2) a) Explain the concepts of Database.

b) Explain all components in the architecture of DBMS.

OR

3) Discuss the following.

a) Relational Constraints.

b) SQL.

UNIT - II

4) Explain Index Structure for files.

OR

5) Explain Query Processing.

UNIT - III

6) Explain ER and EER models in detail.

OR

7) What is functional dependency ? Explain 1NF and 2NF.

UNIT - IV

8) Explain transaction processing in detail.

OR

9) Discuss concurrency control techniques.

����

(DMTCS07)

M. Tech. DEGREE EXAMINATION, DEC. - 2013

(Examination at the end of First Year)

Computer Science

Paper - VII : SOFTWARE ENGINEERING

Time : 03 Hours Maximum Marks : 75

Answer Question No. 1 Compulsory. (15)

Answer one Question from each unit. (4×15=60)

1) a) What is Software Engineering?

b) Define software Reengineering.

c) What is web engineering?

d) What do you mean by product in Software engineering?

e) What do you mean by Metrics in Software engineering?

Unit- I

2) Explain in detail about Software Quality assurance.

OR

3) Explain System Engineering.

Unit- II

4) Explain the Component level design in Software Engineering.

OR

5) Discuss the Concept and principles related to Designing the software

engineering Components.

Unit- III

6) Explain software testing techniques.

OR

7) Explain technical metrics for software.

Unit- IV

8) Explain client / server software engineering.

OR

9) Explain Component based Software engineering?

� � �

(DMTCS 08)

M.Tech. DEGREE EXAMINATION, DEC. 2013

(Examination at the end of First Year)

COMPUTER SCIENCE

Paper – VIII : E-COMMERCE

Time : 03 Hours Maximum Marks : 75

Answer any FIVE of the following

All Questions carry equal marks

1) a) Genesis of e-Commerce.

b) Web Commerce.

c) Purchase Order Process.

d) Security teams.

e) Multipurpose internet.

f) Issues in Electronic Publishing.

2) Give an account of relevant tools of internet for e-commerce.

3) What are the security requirements for internet monetary payment?

4) Bring out secure e-payment protocols.

5) Elucidate the features of e-commerce environment.

6) Trace out secure e-mail technologies for e-commerce.

7) Discuss the MIME and related facilities required for EDI over internet.

8) What are the technologies available for Web Servers?

9) Explain the issues relating to advertising on internet.

����