(DMSIT 01) M.Sc., FIRST YEAR (PREVIOUS) DEGREE · PDF fileM.Sc., FIRST YEAR (PREVIOUS) DEGREE EXAMINATION Computer Science ... FIRST YEAR (PREVIOUS) DEGREE EXAMINATION ... Prototyping

(DMSIT 01)

ASSIGNMENT - 1, MAY 2013.

M.Sc., FIRST YEAR (PREVIOUS) DEGREE EXAMINATION

Computer Science

Paper I — DATA STRUCTURES

Maximum : 25 MARKS

Answer ALL questions.

1. Explain the difference between single linked list and double linked list. Discuss about

different operations performed on double linked list.

2. What is queue? How do you represent a queue using linked list? Explain about

different types of queues.

3. What is height balanced binary tree? Explain in detail about AVL rotations.

4. Write the heap sort algorithm. Construct a heap tree for the numbers 23, 22, 8, 20, 18,

25, 11, 20, 12, 14, 17 and then trace the heap sort algorithm.

5. What is spanning tree? Explain Prim’s algorithm with an example.

————————

(DMSIT 01)



Computer Science

Paper I — DATA STRUCTURES

Maximum : 25 MARKS


1. Discuss about the overview of data structures.

2. What is stack? Explain about the stack operations.

3. Discuss about different hashing techniques.

4. Define binary tree. Explain how do you represent a binary tree.

5. Define B Tree. Write about B Tree indexing.

6. Explain bucket sorting with an example.

7. Describe the DFS traversal on a graph with an example.

8. Write about the connectivity in graph.

9. What is sparse matrix?

10. What is circular linked list?

11. What is threaded binary tree?

12. What is forest?

13. What is Hamiltonian circuit?

————————

(DMSIT 02)



Computer Science

Paper II — OBJECT ORIENTED PROGRAMMING

Maximum : 25 MARKS


1. (a) Briefly explain about storage classes.

(b) Explain the casting operators introduced in C++.

2. (a) Write a note on static function.

(b) Write about destructors.

3. (a) Write a program to demonstrate [ ] operator overloading.

(b) Write about class template.

4. (a) Explain the diamond problem and its solution.

(b) Briefly explain the working mechanism of virtual function.

5. (a) Explain briefly about random access of file.

(b) Write a program to demonstrate exception handling.

————————

(DMSIT 02)



Computer Science

Paper II — OBJECT ORIENTED PROGRAMMING

Maximum : 25 MARKS


1. Explain pointers to functions.

2. Explain about dynamic memory allocation and deallocation operators.

3. Define friend function and friend class.

4. Write a program to demonstrate function overloading.

5. Discuss about hierarchical inheritance.

6. Write about pure-virtual function.

7. Explain how can you handle errors during file operations.

8. Write about stack unwinding.

9. What is data abstraction?

10. How do you declare pointers?

11. What is void pointer?

12. What is default constructor?

13. What are pre-defined stream objects?

————————

(DMSIT 03)



Computer Science

Paper III — COMPUTER ORGANIZATION

Maximum : 25 MARKS


1. (a) What is a binary Adder? Explain about 4-bit binary adder with a neat diagram.

(b) What is a Register? Explain different types of compute registers and its functions.

2. Explain different addressing modes.

3. (a) Write a short notes on stored program organisation.

(b) Explain about the vector operations and super computers.

4. (a) Explain about microprogrammed control.

(b) What is an interrupt? Explain differt types of interrupts.

5. (a) What is cache memory? Explain about mapping concepts.

(b) What is the difference between RAM and ROM chips?

————————

(DMSIT 03)



Computer Science

Paper III — COMPUTER ORGANIZATION

Maximum : 25 MARKS


1. Write a short notes on three state bus buffers.

2. What is Binary incrementer.

3. Write a short notes on Two-Address instructions.

4. What is RISC?

5. What is subroutine call and return?

6. What is a pipeline? Explain about 5-stage pipeline.

7. Write about the characteristics of multiprocessors.

8. What is parallel processing?

9. What is shift micro operations?

10. What is an instruction cycle?

11. What is a memory?

12. What is delayed load?

13. What is DMA?

————————

(DMSIT 04)



Computer Science

Paper IV — DISCRETE MATHEMATICAL STRUCTURES

Maximum : 25 MARKS


1. (a) Prove that ( )[ ] ( )[ ]nqpnqp ∨→→∧ ~ is a Tautology.

(b) State all rules for logical Inference.

2. (a) Show that )(Q)()(p)())( Q)( p()( xxxxxxx ∃∨⇒∨ .

(b) Symbolize the following argument and check for its validity

(i) All men are falliable

(ii) All kings are men

(iii) There fore all kings are falliable.

3. (a) State and explain Recursion Theorem.

(b) Let f(x) = x + 2 g(x) = x – 2 and h(x) = 3x for Rx∈ where R is me set of real

numbers. Find gof, fog, gog, foh, hog, hof and fohog.

4. (a) Prove that "Every chain is a distributive lattice".

(b) Explain the following

(i) Finite state Machine

(ii) Machine of a monoid.

5. (a) Show that an undirected graph has an even number of vertices of odd degree.

(7)

(b) Find the shortest path between A and F of the following weighted graph by using

Dijkstrals Algorithm.

————————

(DMSIT 04)



Computer Science

Paper IV — DISCRETE MATHEMATICAL STRUCTURES

Maximum : 25 MARKS


1. Show that ~ ( pv(~p∧ q)) and ~p ∧ ~q are logically equivalent.

2. What is Ackerman's Functions?

3. Let A be a set. Define P(A) the power set of A. find P(A) when A ={1, 2, 3}.

4. Define homogenous Recurrence relation and give example.

5. What is Recursive Subroutine?

6. What is "Monoid of the Machine"? Explain.

7. Define and explain the Adjacency Matrix of the graph.

8. Explain about Eulerian path and Hamilton path.

9. Define Tautology.

10. What is Recursion?

11. What is Hasse Diagram?

12. Define biparite Graph.

13. What is a Karnough map?

————————

(DMSIT 05)



Computer Science

Paper V — SOFTWARE ENGINEERING

Maximum : 25 MARKS


1. Explain the following :

(a) Prototyping model (b) Spiral model.

2. What are design engineering concepts? Explain them in detail.

3. Explain the following software metrics :

(a) Object-oriented metrics (b) Size-oriented metrics.

4. What are the golden rules of interface design? Elaborate each of them.

5. Explain in detail the black-box testing technique.

———————–––

(DMSIT 05)



Computer Science

Paper V — SOFTWARE ENGINEERING

Maximum : 25 MARKS


1. Discuss about various characteristics of software.

2. Elaborate on software requirements document.

3. Discuss about architectural design using context diagram.

4. Explain the interface design evaluation cycle with the help of a diagram.

5. Explain the bottom up integration testing.

6. Discuss about the metrics for testing.

7. Write about formal technical review performed by software engineers.

8. Explain the object oriented design process.

9. What is system software?

10. What are software process frame work activities?

11. Write about architectural patterns.

12. What are various interface design steps?

13. What do you mean by validation?

———————–––

(DMSIT 06)



Computer Science

Paper VI— DISTRIBUTED OPERATING SYSTEM

Maximum : 25 MARKS


1. (a) What are the different goals of distributed system?

(b) Explain Layered protocols.

2. (a) Write about Two - Phase Locking.

(b) Write about Logical clocks.

3. (a) Differentiate between synchronous and asynchronous RPC.

(b) Differentiate between Nested Transaction and a distributed Transaction.

4. Write a notes on different data Centric consistency model.

5. Explain distributed file system implementation.

———————–––

(DMSIT 06)



Computer Science

Paper VI— DISTRIBUTED OPERATING SYSTEM

Maximum : 25 MARKS


1. Write about the advantages of distributed systems.

2. Explain synchronous transfer mode networks.

3. Explain client server model.

4. Discuss about processor pool model.

5. Explain election algorithms.

6. Discuss logical clocks of clock synchronization.

7. What is file server interface? Explain.

8. Explain fault tolerance.

9. What is LAN?

10. What is server?

11. Define distributed system.

12. State the purpose of session layer.

13. What is system model.

———————–––

(DMSIT 07)



Computer Science

Paper VII — DATA BASE MANAGEMENT SYSTEMS

Maximum : 25 MARKS


1. What is ER diagram? What are the symbols used to represent ER diagram? Construct

and ER diagram for a university process.

2. Explain the following :

(a) Aggregate functions

(b) Domain constraints.

3. What is the purpose of RAID? Explain about different RAID levels.

4. What is a normal form? Explain different normal forms based on functional

dependencies.

5. What is serializability? Discuss about testing for serializability.

———————–––

(DMSIT 07)



Computer Science

Paper VII — DATA BASE MANAGEMENT SYSTEMS

Maximum : 25 MARKS


1. Describe the database system structure.

2. Briefly explain about extended relational algebra operations.

3. Explain nested subqueries with examples.

4. What is the structure of B+ tree index file? Explain insertion operations in B+ trees.

5. Explain transaction atomicity and durability.

6. Write short notes on data dictionary storage.

7. Discuss timestamp-based protocols.

8. Write short notes on deadlock handling.

9. What do you mean by view of data?

10. What is database schema?

11. Write about outer join operation.

12. Give an example of transaction.

13. What is two-phase locking protocol?

———————–––

(DMSIT 08)



Computer Science

Paper VIII — THEORY OF AUTOMATA AND FORMAL LANGUAGE

Maximum : 25 MARKS


1. Explain Deterministic Finite automation and Non-Deterministic finite automation.

2. (a) Explain the Manipulation of Regular expressions.

(b) Explain closure properties of Regular sets and also discuss pumping lemma.

3. (a) Explain context free grammar. (b) Explain Derivation Trees.

4. (a) Explain the design of tuning Machine. (b) Explain context sensitive language.

5. (a) Explain Church's hypothesis. (b) Explain Chomsky hierarchy of languages.

———————–––

(DMSIT 08)



Computer Science

Paper VIII — THEORY OF AUTOMATA AND FORMAL LANGUAGE

Maximum : 25 MARKS


1. Explain on the applications of Melay and Moore machines.

2. Explain right linear and left linear grammars.

3. Explain Greibach Normal form.

4. Explain counter Machine.

5. Explain universal Tuning Machine.

6. Explain Recursive Enumerable language.

7. Explain push down automata.

8. Explain inter conversion between RE regular expressions and regular Grammars.

9. Define finite state machine.

10. What is context free grammar.

11. Define tuning machine.

12. What are the different types of tuning machines?

13. What is decidability?

———————–––

(DMSIT 09)



Computer Science

Paper IX — COMPUTER NETWORKS

Maximum : 25 MARKS


1. Explain the layers in Internet model.

2. (a) Explain about file transfer protocol (b) How is HTTP is similar to FTP?

3. (a) Discuss about the wireless TCP and UDP.

(b) What are the services provided by the Transport layers?

4. (a) What is Routing? Explain about Routing principles.

(b) Discuss about the IPV 6 addressing.

5. (a) Explain about different types of Error correction methods.

(b) Discuss about point-to-point protocol.

———————–––

(DMSIT 09)



Computer Science

Paper IX — COMPUTER NETWORKS

Maximum : 25 MARKS


1. Write a short notes on Internet Service providers.

2. Discuss about OSI model.

3. Write about the e-mail in internet.

4. What is FDM and WDM?

5. Write about the PPP stack.

6. Write a note on unicast Routing.

7. Write a short notes on Address Resolution protocol.

8. Discuss about the services of Data link layer.

9. What is a Protocol?

10. What is NAPS?

11. What is IP?

12. What is a Bridge and Hub?

13. What is Ethernet?

———————–––

(DMSIT 10)



Computer Science

Paper X — DESIGN AND ANALYSIS OF ALGORITHMS

Maximum : 25 MARKS


1. Explain divide and conquer strategy using quick sort.

2. Write an algorithm that finds all the solution to 8-queens problem.

3. Explain branch and bound method using travelling salesman problem.

4. Differentiate BFS and DFS algorithm.

5. Write a greedy algorithm on PPR routing.

———————–––

(DMSIT 10)



Computer Science

Paper X — DESIGN AND ANALYSIS OF ALGORITHMS

Maximum : 25 MARKS


1. Explain time complexity.

2. Write about NP hard problem.

3. Write the Kruskal’s algorithm.

4. What is OR graph?

5. What are different types of graphs?

6. Explain prim’s algorithm.

7. What is upper bound techniques?

8. Explain dynamic programming.

9. What is graph?

10. What is space complexity?

11. What is graph coloring?

12. What is algorithm?

13. What is dictionary?

———————–––

Documents

(DMSIT 01) M.Sc., FIRST YEAR (PREVIOUS) DEGREE · PDF fileM.Sc., FIRST YEAR (PREVIOUS) DEGREE EXAMINATION Computer Science ... FIRST YEAR (PREVIOUS) DEGREE EXAMINATION ... Prototyping