m.tech. degree examination, may - 2013 …... define s - grammar. q2) a) construct dfa equivalent to...

��Total No. of Questions : 9] [Total No. of Pages : 02

M.Tech. DEGREE EXAMINATION, MAY - 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

Q1) a) Write an algorithm to find the maximum subsequence sum.

b) Differentiate queue and deque.

c) Define threaded binary tree. What are its advantages?

d) Explain the concept of rehashing.

e) Define minimum spanning tree. Give an example.

UNIT - I

Q2) Define stack. Explain stack operations and write routine for each of the operations.

OR

.

Q3) Define binary search tree. Explain insertion operation in binary search tree with an example.Write a routine to for this operation.

UNIT - II

Q4) Write an algorithm for insertion sort and trace it for the data: 34 , 8, 64, 51, 32, 21.

OR

Q5) Write a routine for quick sort. Trace the program for the list:

33,72,45,19,27,31,82,9,5,12

N-7012 P.T.O.

��

N-7012 2

UNIT - III

Q6) Explain oscillating sorting with an illustrative example.

OR

Q7) Describe the indexed sequential files.

UNIT - IV

Q8) Explain different types of representing a graph and describe the procedure to implementDFS.

OR

.Q9) Describe Kruskals algorithm and write a program for it.

��




Computer Science

(Paper - II) : DISCRETE MATHEMATICAL STRUCTURES


Answer Question No. 1 compulsory. (15 � 1 = 15) Answer one question from each unit. (4 � 15 = 60)

Q1) a) Define Singleton.

b) Write the DeMorgan’s laws.

c) Define equal sets.

d) Let A = {1, 2, 3} and B = {a, b, c}. Then find A�� B.

e) State the involution law for sets.

f) State Inclusion - Exclusion principle.

g) How many permutations can be formed with n distinct objects.

h) In how many ways can a committee of 5 be chosen from 9 people.

i) What is recurrence relation?

j) Define a lattice.

k) Define multiple graph.

l) Define spanning tree.

m) Define path in a graph G.

n) Define degree of a vertex in graph G.

o) Define Hamiltonian graph.

UNIT - I

Q2) a) Construct the truth table for the formula.

( ) ( ) ( )p q r q r∨ ∧ ↔ →⎡ ⎤⎣ ⎦� .

b) Prove that ( ) ( ) ( )p r q r p q r⎡ ⎤⎣ ⎦→ ∧ → → ∨ →⎡ ⎤⎣ ⎦ is a tautology.

OR

N-7013 P.T.O.

��

N-7013 2

Q3) a) Discuss the methods of proof of an implication.

b) If an integer a is such that a – 2 is divisible by 3, then show that a2 – 1 is divisibleby 3.

UNIT - II

Q4) a) Prove by mathematical induction that 2 2 16 7n n+ ++ is divisible by 43 for each positive

integer n.

b) How many different license plates are there that involve 1,2 or 3 letters followed by 4digits?

OR

Q5) a) How many 5-card hands have 2 cards of one suit and 3 cards of a different suit.

b) In how many ways can the letters {5.a, 4.b, 3.c} be arranged so that all the letters ofthe same kind are not in a single block?

UNIT - III

Q6) Solve the recurrence relation 1 2 39 26 24 0for 3n n n na a a a n− − − = ≥− + − .

OR

Q7) a) Prove that the operations +, –, and. on Zm

are well - defined functions.

b) If A = (V, E) is a digraph, then prove that for 1,n≥ ( ), Enx y ∈ iff there is a directed

path of length n from x to y in A.

UNIT - IV

Q8) a) Prove that in a graph G, every u – v path contains a simple u – v path.

b) Prove that if G is a nontrivial tree then G contains at least 2 vertices of degree 1.

OR

Q9) a) Prove that a graph G is a tree if and only if G has no cycles and E = V 1− .

b) Prove that a complete bipartite graph Km,n

is planar iff 2m≤ or 2n≤ .

��




COMPUTER SCIENCE

(Paper - III) : Computer Architecture and Organization


Answer all questions

(15 � 1 = 15)

Q1) a) State Demorgan’s Theorem.

b) Draw logic diagram for F = x + y'z.

c) What is flipflop?

d) Draw the block diagram of ROM.

e) Convert 7562 to octal.

f) Define 9’s complement.

g) What is Gray code?

h) State the purpose of parity generator.

i) Define register transfer language.

j) Define control function.

k) What is high-impedance state?

l) What is selective - clear?

m) Define logical shift.

n) What is Isolated I/O.

o) What is rotating-dairy-chain?

Q2) a) Differentiate combinatorial circuit with sequential circuit. [5]

b) Draw the logic diagram of an EX-OR gate using only four NAND gates and verifythe truth table. [10]

OR

N-7014 P.T.O.

��

N-7014 2

Q3) Draw the logic diagram of a 3 to 8 line deco using two 2 to 4 line decoders with enable inputand explain. Give the truth table for the drawn circuit. [15]

Q4) a) What are the three types of CPU organizations? Discuss the instruction formats usedunder each type of CPU organization. [10]

b) What is addressing mode? State various types of addressing modes. [5]

OR

Q5) What is instruction cycle? Draw the flow chart for initial configuration and explain in detail. [15]

Q6) What is program control? Explain. [15]

OR

Q7) What is RISC? Discuss the features of RISC in detail. [15]

Q8) Explain asynchronous data transfer with neat diagrams. [15]

OR

Q9) What is associative memory? Explain in detail. [15]

��




COMPUTER SCIENCE

(Paper - IV) : OPERATING SYSTEMS


Answer Question No. 1 compulsory

Answer one question from each unit

Q1) a) Define interrupt and what are the functions of interrupt in operating systems. (2)

b) What is clustered systems? How it is different from multiprocessor systems. (2)

c) Define PCB. Represent with a diagram and state the process associated. (2)

d) What is Pthread? Explain in brief. (2)

e) Define compaction. Explain the method of solving using this technique. (2)

f) Explain segmentation in brief with a neat diagram. (2)

g) Define file concept and the various operations on files. (2)

h) Define the term STREAM. (1)

UNIT - I

Q2) a) Give an abstract view of the components of a computer system in detail.

b) Discuss in detail about computer - system organization.

OR

.Q3) a) Discuss in detail about the system calls and types of system call.

b) Explain about operating -system structure in detail.

UNIT - II

Q4) a) Discuss in detail about scheduling algorithms [any five].

b) Explain Multiple - Processor Scheduling.

N-7015 P.T.O.

��

N-7015 2

OR

Q5) Discuss in detail about Deadlock Characterization, Methods for Handling Deadlock,Prevention, Avoidance Detection & Recovery from deadlock.

UNIT - III

Q6) a) Discuss in detail about Paging Concepts with page table structure.

b) Discuss Demand paging in detail.

OR

.

Q7) Discuss in detail Page Replacement Algorithm. Define thrashing in detail.

UNIT - IV

Q8) a) Discuss in detail Directory structure and different schemes for defining logical structure.

b) Give various allocation methods in detail.

OR

.

Q9) a) Explain about I/O Hardware in detail.

b) Discuss about design techniques in operating system.

��




Computer Science

(Paper - V) : AUTOMATA THEORY AND FORMAL LANGUAGES



All questions carry equal marks

Q1) a) Define 2DFA.

b) What is prefix and suffix for the string ‘toc’?

c) What is NFA with ε -transition?

d) Write the regular expression for the language of all strings containing exactly two O’s.

e) State Ardens theorem.

f) What is homomorphism?

g) Define left most derivation.

h) What is parse tree?

i) What is GNF?

j) Define PDA.

k) What is recursively enemurable language?

l) What is nondeterministic turing machine?

m) What is LR(O) grammar?

n) Give applications of finite automata.

o) Define s - grammar.

Q2) a) Construct DFA equivalent to the NFA M = ({p,q,r,s}, {0,1}δ , p,{s})

Where δ is as given below

0 1

→p p,q p

q r r

r s –

s s s

b) Differentiate Moore and Mealy machine?

N-7016 P.T.O.

��

N-7016 2

OR

Q3) Explain the procedure to convert NFA with ε -transition to NFA without ε -transitions andapply the same for the following diagram.

Q4) a) Give the NFA for the regular expression (a+b)* b(a+bb)*.

b) Explain closure properties of regular sets.

OR

Q5) Explain about derivations and derivation trees. Show that the following grammar isambigeous grammar.

S AA

A AAA

A a

A b A

A Ab

→

→

→

→

→

Q6) Design PDA for the language { }{ }R *L w w / w 0,1= ⊂ ∈ .

OR

Q7) What is turing machine? Explain various models of turing machines.

Q8) a) Explain post correspondence problem with suitable example.

b) State and prove RICE theorem.

OR

Q9) a) Write about Chomsky hierarchy of languages.

b) Write a short notes on church hypothesis.

��



(Examination at the end of FirstYear)

Computer Science

(Paper - VI) : DATABASE MANAGEMENT SYSTEMS



Q1) a) What is data?

b) Define Schema.

c) What is relation?

d) Define weak entity.

e) What is partial participation?

f) What is derived attribute?

g) Define degree of a relation.

h) Define natural join.

i) Define conceptual design.

j) What is query language?

k) Define integrity.

l) What is dirty read?

m) Define transaction.

n) Define log.

o) What is ARIES?

Q2) What is ER model? Explain the features of ER model with suitable example. [15]

OR

Q3) What is logical database design? Explain with suitable example. [15]

N-7019 P.T.O.

��

N-7019 2

Q4) a) What is the purpose of schema refinement? Why is decomposition necessary? Statethe importance of functional dependencies. [9]

b) Classify the languages used to query DBMS. [6]

OR

Q5) a) What is normalization? Explain 3NF, BCNF with appropriate examples. [10]

b) What are multivalued dependencies? Define 4NF. [5]

Q6) Discuss the concepts of transaction management. What are the advantages of interleavedtransactions. Also list out the anomalies that arise due to interleaved transactions. [15]

OR

Q7) a) What is dead lock? How can it be resolved. [7]

b) Discuss concurrency control without locking. [8]

Q8) Explain the concept of query optimization. [15]

OR

Q9) Discuss the features of relational algebra with suitable examples. [15]

��




Computer Science

(Paper - VII) : SOFTWARE ENGINEERING


Answer Question No. 1 compulsory (15) Answer one question from each unit (4 � 15 = 60)

Q1) a) Explain the software characteristics.

b) Explain the software quality assurence activities.

c) Build a proper prototype of safehome.

d) Write about Mccall’s quality factors.

e) What are the principles of business process reengineering.

UNIT - I

Q2) Briefly explain different evolutionary software process models.

OR

Q3) Discuss about the software measurement metrics.

UNIT - II

Q4) Describe the mechanics of structured analysis.

OR

Q5) What is user interface design? List and elaborate the golden rules of interface design.

N-7017 P.T.O.

��

N-7017 2

UNIT - III

Q6) Explain control structure testing in White Box testing techniques.

OR

Q7) Explain Top-Down and Bottom-up integration testing with an example.

UNIT - IV

Q8) Explain the cleanroom approach and discuss about its functional specification.

OR

Q9) Explain the structure of client /server systems.

��

Total No. of Questions : 9] [Total No. of Pages : 01



COMPUTER SCIENCE

(Paper - VIII) : E-COMMERCE


Answer any Five questionsAll questions carry equal marks

Q1) a) e-market place technologies.

b) e-data interchange.

c) On line e-cash.

d) Enterprise networking.

e) MIME.

f) Web based EP.

Q2) Explain the process of advertising on internet.

Q3) Discuss the internet tools relevant for commerce.

Q4) Elucidate secure e-mail technologies for e-commerce.

Q5) Describe the antivirus programmes available for internet.

Q6) Enumerate different schemes for e-cash payment.

Q7) Explain different approaches for sofeo e-commerce.

Q8) What are the e-commerce opportunities in India.

Q9) Bring out multi purpose internet mail extensions.

��

N-7018

��

m.tech. degree examination, may - 2013 …... define s - grammar. q2) a) construct dfa equivalent to...

Documents