(DMCS01)

Assignment-1
M.Sc. DEGREE EXAMINATION, MAY - 2017
First Year
COMPUTER SCIENCE
Data Structures
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) What is a linked list? Explain its types and write a program to create and
display the contents of a SLL.

Q2) What is a stack? Write a simple program to implement stack using arrays.

Q3) Explain Kruskal’s and Prim’s algorithms with the help of an example.

Q4) What is DQUEUE? Write pseudocode for implementing all its operations.

Q5) Explain the properties of Binary Trees and illustrate the Tree Traversal
algorithms with a suitable example.

Q6) State the applications of stack.

Q7) Explain a Balanced Binary tree.

Q8) Construct a binary search tree using the following data: 10,7,14,6,8,12,
15,4,5,9,18,16,11.

Q9) Define a graph and explain what is connectivity in graph.

 (DMCS01)
Assignment-2
M.Sc. DEGREE EXAMINATION, MAY - 2017
First Year
COMPUTER SCIENCE
Data Structures
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Explain about sparse matrix and its representations in detail.

Q2) State the advantages of Linked lists over arrys.

Q3) Explain Quick sort with the help of the following data : 38,81,22,48,13,69,93,
14,45,58,79,72.

Q4) What is a Circular Queue? Explain.

Q5) Define an array.

Q6) What is Hashing.

Q7) Define Priority Queue.

Q8) State the operations on arrays.

Q9) What is Recursion.



 (DMCS02)
Assignment-1
M.Sc. DEGREE EXAMINATION, MAY - 2017
(First Year)
COMPUTER SCIENCE
Object Oriented Programming
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Explain decision control structures along with suitable programs for each.

Q2) Write a short note on : Reference operator and scope resolution operator.

Q3) Define constructor? Explain different types of constructors.

Q4) Explain inheritance and elaborate its types.

Q5) Explain in detail the exception handling mechanism of C++ in detail.

Q6) Discuss about virtual class and its purpose.

Q7) What is an inline function? State its limitations.

Q8) Explain this pointer with a program.

Q9) Write a program to implement the concept of binary operator overloading.

 (DMCS02)
Assignment-2
M.Sc. DEGREE EXAMINATION, MAY - 2017
(First Year)
COMPUTER SCIENCE
Object Oriented Programming
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Explain different types of pointers in C++.

Q2) Write a program to read and display the contents of an existing file.

Q3) Explain function templates.

Q4) Explain the concept of call by reference.

Q5) Dangling pointer.

Q6) Polymorphism.

Q7) Operator overloading.

Q8) Namespaces.

Q9) Dynamic destructor.



(DMCS03)
 Assignment-1
M.SC. DEGREE EXAMINATION, MAY – 2017
First Years
COMPUTER SCIENCE
Computer organization
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Explain the design procedure of sequential circuits. With an example.

Q2) Explain about Hardwired control unit.

Q3) Explain interrupt driven I/O.

Q4) Explain about computer arithmetic.

Q5) Explain about various types of shift registers.

Q6) Differentiate Sequential and Combinational circuits.

Q7) Explain program control.

Q8) Explain Associative memory.

Q9) Explain Control memory.

 (DMCS03)
Assignment-2
M.SC. DEGREE EXAMINATION, MAY – 2017
First Years
COMPUTER SCIENCE
Computer organization
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Explain about multiplexers.

Q2) Explain about r-1’s complement.

Q3) Explain Bus and Memory transfers.

Q4) Explain about instruction cycle.

Q5)What is decoder.

Q6) What is priority interrupt.

Q7) What is register transfer.

Q8) What is cache memory.

Q9) What is virtual address and physical address.




 (DMCS04)
Assignment-1
M.SC. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Discrete Mathematical Structures
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) a) Construct the truth table for the formula

¬(𝑃 ∧ 𝑄 ∨ ¬𝑅) ∨ ( (Q ⇆ ¬𝑃) → 𝑅 ∨ ¬ 𝑆 ).

b) Show that R ∨ S 𝑓𝑜𝑙𝑙𝑜ws logically from the premises.

C ∨ D, (C ∨ D) → ¬ H, ¬ H → (A ∧ ¬ B), and (A ∧ ¬ B) → R ∨ S.

Q2) a) Define Primitive Recursive function and Show that the function f (x, y) = x +
y is a Primitive recursive function.

b) Define Transitive Closure of a relation R in X and find the Transitive Closure

of a Relation R = { (a, b) , (b, c), (c, d), (d, e), (e, a) } in X = {a, b, c, d, e}.

Q3) a) Show that, a Lattice ( L, * , ) is Distributive if and only if

 a * b   b * c    c * a    a  b  * b  c  *  c  a  for any a, b c ∈ L.
b) State and Prove, De Morgan Law’s in a Boolean Algebra.
Q4) a) State and Prove, Euler’s formula in Planar graphs.

b) Check whether the following graphs are isomorphic or not.

Q5) a) Let g be a homomorphism from a group (G, *) to a group (H, ∆) and Let K be
the Kernel of g and H1 ⊆ H be the image set of g in H. Then the quotient
1
group G/K is Isomorphic to H .

b) Show that, every Distributive lattice is Modular, but not conversely

Q6) Prove (P → Q) ⇔ (¬ P ∨ Q).

Q7) Define POSET and Draw the Hasse Diagram of a poset (D100, ≤)
where a ≤ b iff a divides b and D100 is the collection of all divisors of 100.

Q8) Obtain the product of sums canonical forms of the Boolean expression F
(x, y, z) = x + y.

Q9) Prove that, in any non directed graph there is an even number of vertices of odd
degree.
 (DMCS04)
Assignment-2
M.SC. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Discrete Mathematical Structures
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Let R = { (1, 2), (3, 4), (4, 1)} and S = {(1, 5), (3, 3), (2, 1), (1, 3)}.

Find R ∘ 𝑆, S ∘ 𝑅, 𝑅 ∘ 𝑅, 𝑆 ∘ ( R ∘ 𝑆), 𝑅 ∘ ( S ∘ 𝑅).

Q2) Define the terms, Group Homomorphism, Kernal of a function, Quotient Group.

Q3) Define the terms, Cyclic graph, Chromatic number and Cut set.

Q4) Let ( L, *, ) be a Distributive Lattice. Then for any a, b, c ∈ L

a * b  a * c and a ⨁ b = a ⨁ c implies b = c.

Q5) Define a Lattice.

Q6) Define a Group.

Q7) Define a Tautology.

Q8) Prove that, every lattice satisfies idempotent property.

Q9) Define Plane graph.


 (DMCS05)
Assignment-1
M.SC. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Software Engineering
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Explain different software myths.

Q2) What are requirements engineering tools? Explain the process of initiating the
requirements engineering.

Q3) Discuss about software reviews and formal technical reviews in connection with
SQA.

Q4) What is a metric? Discuss about process and product metrics.

Q5) Describe the architectural design metrics and MOOD metrics suit for design model.

Q6) Explain Personal and Team process models.

Q7) What are software engineering layers.

Q8) Develop different levels of DFD for safe home security function.

Q9) Debugging is an art? Explain.

 (DMCS05)
Assignment-2
M.SC. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Software Engineering
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Write about process frame work.

Q2) Describe class responsibility collaborator modelling of the analysis model.

Q3) Explain debugging strategies.

Q4) Explain function based metrics for analysis model.

Q5) What is Deployment?

Q6) What is validation?

Q7) What is cohesion?

Q8) Define Recovery Testing.

Q9) What is Refactoring?





 (DMCS06)
Assignment-1
M.SC. DEGREE EXAMINATION, MAY – 2017
First Years
COMPUTER SCIENCE
Distributed Operating Systems
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Explain in detail protocol layers and transfer mode networks.

Q2) Explain in detail about deadlocks.

Q3) Discuss about scheduling in Distributed system.

Q4) Write a detailed note on process synchronization in Distributed system.

Q5) State the design issues of a distributed file system.

Q6) What are the goals of distributed system?

Q7) What is a Thread? How is it different from process?

Q8) Explain client server Model.

Q9) Explain about message passing model.

 (DMCS06)
Assignment-2
M.SC. DEGREE EXAMINATION, MAY – 2017
First Years
COMPUTER SCIENCE
Distributed Operating Systems
MAXIMUM MARKS: 30
Answer ALL Questions

Q1)Write a note on thread scheduling.

Q2) Define thread? Explain the types of threads with a neat diagram.

Q3) Enumerate locking protocols in detail.

Q4) Explain 2-phase locking protocol.

Q5)What is fault tolerance.

Q6) Define mutual exclusion.

Q7) What is clock synchronization?

Q8) What is LAN.

Q9) State the purpose of session layer.





 (DMCS07)
Assignment-1
M.Sc. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Database Management System
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Define Database. Illustrate neatly the Database system structure.

Q2) What is an SQL? Explain DDL and DML commands in SQL.

Q3) Define Normalization. Explain any 3 Normal Forms.

Q4) Explain lock based protocols.

Q5) Write a short note on sequential storage and indexed storages.

Q6) Write a short note on Relational Algebra.

Q7) Explain the purpose of using an ER diagram.

Q8) Explain the SET operators in SQL.

Q9) Explain the ACID properties of a Transaction.

 (DMCS07)
Assignment-2
M.Sc. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Database Management System
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) What is a trigger? Write a sample trigger.

Q2) Write about B+ tree index files.

Q3) Differentiate between static and dynamic hashing.

Q4) Differentiate between 3NF and BCNF.

Q5) What is a composite key?

Q6) Define Schema.

Q7) What are spurious tuples.

Q8) What is a data dictionary.

Q9) What is a view.

EEE
 (DMCS08)
Assignment-1
M.SC. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Theory of Automata And Formal Languages
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Prove that if L be a set accepted by NFA, then there exists a DFA that
accepts L?

Q2) State and prove pumping lemma of regular expressions?

Q3) Define PDA and prove that if L is a context free language, then there exists a PDA
M such that L=N(M).

Q4) Explain the term Chomsky Normal Form and convert the following grammar to
CNF?

S→aB |Aa A→aS|bAA A→a B→bS|aBB|b

Q5) Define Turing machine and discuss different types of Turing machines?

Q6) Differentiate between Mealy Machine and Moore Machine with suitable example?

Q7) Construct the equivalent NFA without ^-moves

Q8) Construct a Finite Automata for the regular expression (a+b)*abb?

Q9) Design NFA for the language having strings ending with 00 over input= {0, 1} and
convert into DFA?
 (DMCS08)
Assignment-2
M.SC. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Theory of Automata And Formal Languages
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Prove the language L= {0n 1n 2n |n ≥ 1} is not a CFL?

Q2) Discuss the Closure Properties of Regular sets.?

Q3) Explain Chomsky hierarchy?

Q4) Draw a transition diagram for a Turing machine accepting the following
language? {aibj |i<j}.

Q5) Define NFA and DFA?

Q6) Define context free grammar and context free language?

Q7) Define context sensitive language?

Q8) Write the closure properties of CFL?

Q9) Define recursive enumerable language?


 (DMCS 09)
Assignment-1
M.Sc. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Paper – IX : Computer Networks
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Explain in detail the protocol layers and their service models.

Q2) Explain in detail at the HTTP and FTP Protocols.

Q3) Explain in detail the multiple access protocols.

Q4) Discuss about the Multiplexing and de-Multiplexing.

Q5) Explain in detail the Hierarchical routing algorithm.

Q6) Write about delay and loss in packet-switched networks.

Q7) Write about the principles of Application Layer Protocol.

Q8) What is connection-oriented transport.

Q9) Write about the services of Link Layer.

 (DMCS 09)
Assignment-2
M.Sc. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Paper – IX : Computer Networks
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Write a note on Internet and Internet Working.

Q2) What are the principles of reliable Data Transfer?

Q3) Write about the IPV6 with an example.

Q4) Write about LANs and ARP.

Q5)What is internet?

Q6)Write about world wide web.

Q7) Define Hubs and Bridges.

Q8) Write a short note on UDP.

Q9)What is meant by network edge?


 (DMCS10)
Assignment-1
M.SC. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Design & Analysis of Algorithms
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Read the sequence of integers as input, terminated by -1? Write an algorithm to
find the length of longest increasing consecutive subsequence? [NO use of
arrays]?

Q2) Explain the control abstraction of divide and conquer, dynamic programming
strategy?

Q3) Find an optimal solution to the knapsack instance n=7, m=15, (p 1,

p2, ….,p7)=(10, 5, 15, 7, 6, 18, 3) and (w1, w2, ……,w7)=(2, 3, 5, 7, 1, 4, 1)?

Q4) Solve the 4 queen’s problems with an algorithm and calculate its complexity?

Q5) Explain LC branch and bound technique on 15-puzzle problem?

Q6) Show that the following equalities are correct?

a) 5n2 -6n = Ѳ (n2)

b) b) 6*2n+n2 = O(2n)

c) c) 10n2+4n+2 = Ώ(n2)

Q7) Explain the quick sort sorting procedure with an algorithm and calculate its best
and worst case time complexity?

Q8) Explain the merge sort sorting procedure with an algorithm and calculate its best
and worst case time complexity?

Q9) What is the solution generated by job sequencing with deadlines when n=7 and (p1,
p2, …..,p7) =(3, 5, 20, 18, 1, 6, 30) and (d1, d2,….., d7)= (1, 3, 4, 3, 2, 1, 2)?
 (DMCS10)
Assignment-2
M.SC. DEGREE EXAMINATION, MAY – 2017
First Year
COMPUTER SCIENCE
Design & Analysis of Algorithms
MAXIMUM MARKS: 30
Answer ALL Questions

Q1) Use function OBST to compute w(i, j), r(i, j) and c(i, j), 0≤ i < j ≤ 4 for the

identifier set (a1, a2, a3, a4) =(cout, float, if while) with p(1) = 1/20, p(2)=1/5,

p(3)=1/10 and p(4)=1/20, q(0) 1/5, q(1) =1/10, q(2) = 1/5, q(3)=1/20 and

q(4)=1/20. Using the r(i, j)’s construct the optimal binary search tree?

Q2) Write the BFS and DFS algorithm? Solve the algorithm with an example graph?

Q3) Explain back tracking technique for solving Hamiltonian cycle problem on a
graph?

Q4) Solve TSP problem using LC-branch and bound technique

  20 30 10 11
15  16 4 2 
 
3 5  2 4
 
19 6 18  3 
16 4 7 16  

Q5) Define Time and Space complexity of an algorithm?

Q6) Write the recursive algorithm for binary search?

Q7) Explain Knapsack problem?

Q8) Explain travelling sales person problem?

Q9) Define Hamiltonian cycle?




