CENTRE FOR DISTANCE EDUCATIOIN

ANNA UNIVERSITY, CHENNAI 600 025 044- 22357222

Date : 25/11/2019

Study Centre: CDE STUDY CENTRE

Attention: Students of 1st Semester MSc

The students of Set-26 of MSc Programme have to submit their first and second assignments on or before the last date as scheduled and communicated through their respective group e-mail. Further, the students are advised to adhere to the instructions communicated through e-mail/ notice board from time to time.

Co-ordinator- Set-26.

Note:

The subject Assignments shall be submitted to the CDE STUDY CENTRE OFFICE (2ND Floor), CDE, Anna University, and Chennai during office hours i.e. 10.00 am to 5.00 pm. Sunday is also a working (Lunch Time 1.00 pm to 2.00 pm).

DIRECTION TO THE STUDENTS:

1. Last date for submission of Assignments-I & II, is 22rd December 2019 2. Submit subject wise assignments. (No need for stick file) 3. Use the template for each First page (Top Sheet) of the assignment. 4. All the assignments should be of student’s own hand writing

5. Each assignment should be a minimum of five page of A4 size paper.

6. Each student shall submit the assignments of all their subjects at a stretch at the same time.

7. No request for delayed submission shall be entertained.

CENTRE FOR DISTANCE EDUCATIOIN

ANNA UNIVERSITY, CHENNAI 600 025

044- 22357222

ACKNOWLEDGEMENT

SET-26 SEMESTER : I

Name

Roll No

Course

MSc

Semester I

Sl.

No.

Sub. Code Subject Name Assignments

Submitted ( )

Assignments not

Submitted (X)

Total No. of Assignments submitted

Signature of Candidate Signature of the Staff

Set - 26 Name :

Roll No :

Course :

SUBJECT CODE

DCS XXXX

SUBJECT NAME:

Marks

Name and Signature (faculty)

CDE STUDY CENTRE

ANNA UNIVERSITY – CHENNAI 25

SET 26 (I MSc)

ASSIGNMENT QUESTIONS

ANSWER ALL THE QUESTIONS

SEMESTER : I MSc

SUBJECT : DMC 5101 Computer Organization

ASSIGNMENT I

1. Draw a NAND logic diagram that implements the complement of the following function:

퐹(퐴,퐵,퐶,퐷) = (0,1,2,3,4,8,9,12)

2. Simplify the following Boolean function in product-of-sums form by means of four-variable map. Draw the logic diagram with OR-AND gates and NOR gates.

퐹(퐴,퐵,퐶,퐷) = (0,2,8,9,10,11,14,15)

3. Construct a 16x1 multiplexer with two 8x1 and one 2x1 multiplexers. 4. Design a counter with T flip-flops that goes through the following binary repeated

sequence: 0,1,3,7,6,4. Show that when binary states 010 and 101 are considered as don’t care conditions, the counter may not operated properly. Find a way to correct the design.

5. Draw the logic diagram of a 2-to-4 decoder and explain.

ASSIGNMENT II 1. Discuss the various types of flip-flops with neat sketch and draw a truth a table for

their functions. 2. Explain various phases of instruction cycle in detail. 3. Write short notes on (i) Page replacement algorithms; (ii)Virtual memory; (iii) Cache

Memory. 4. Write short notes on (i) DMA; (ii) Interrupts; (iii) Serial and Parallel data transfers. 5. Describe the principle based on which the Cache memory works. What do you mean

by cache mapping? List the mapping techniques. Consider a 4-way set associative cache (initially empty) with total 16 cache blocks. The main memory consists of 256 blocks and the request for memory block in the following order: 0,255,1,4,3,8,133,159,216,129,63,8,48,32,73,92 and 155. Draw the cache with contents after satisfying the request.

SEMESTER : I MSc

SUBJECT : DMC 5102 Problem Solving and Programming

ASSESSMENT - I

1. Explain the different types of operator with suitable example. 2. Explain the top-down design in detail. 3. Discuss about different types of array with suitable example. 4. Discuss the parameter passing techniques of function with suitable example.

ASSESSMENT - II

1. What is recursion? Write a c program to find the factorial of n-numbers using

recursion. 2. Explain about pass by value and pass by reference with suitable example. 3. Discuss about the different types of storage classes with suitable example. 4. Explain the use of structure with a C program.

SEMESTER : I MSc

SUBJECT : DMC 5103 Database Management System

ASSIGNMENT I

1. Elaborate the operations in relational algebra with an example.

2. Deepthi bus Company owns a number of buses. Each bus is allocated to a particular

route, although some routes may have several buses. Each route passes through a

number of towns. One or more drivers are allocated to each stage of a route, which

corresponds to a journey through some or all of the towns on a route. Some of the

towns have a garage where buses are kept and each of the buses are identified by the

registration number and can carry different numbers of passengers, since the vehicles

vary in size and can be single or double-decked. Each route is identified by a route

number and information is available on the average number of passengers carried per

day for each route. Drivers have an employee number, name, address, and sometimes a

telephone number.

i. Model an entity relationship diagram for the above scenario.

ii. Map the entity relationship diagram you have modeled to relations.

ASSIGNMENT II

3. Elaborate indexing and hashing techniques with an example.

SEMESTER : I MSc

SUBJECT : DMC 5104 Software Engineering

Assignment –I

1. Explain the steps involved in process development model and briefly discuss about waterfall model and spiral model.

2. Write short notes on Agile System Development and Methods. 3. Describe the Software Requirement Process and develop the SRS for library

management system. 4. Explain clearly the concepts of coupling and cohesion. 5. Draw and explain Data flow diagrams and data dictionary for automation of restaurant.

Assignment –II

1. Discuss about a software configuration management process with an example. 2. Write short note on

a. Scope of Software Metrics b. Direct and Indirect measures. c. Software Quality Assurance

3. Brief on a. Top-down and Bottom-up b. Information Hiding c. Programming style

4. Write the Comparison of Fundamental Testing and Structural Testing. 5. Explain the terms in Test Planning and Test schedule.

SEMESTER : I MSc

SUBJECT : DMC 5105 Mathematical Foundations of Computer Science

Assignment – I

1. Show that (P (Q P)) ⇒ (~P (P Q)) 2. Establish the validity of the following arguments using the rule of contradictions.

[(pq) (~r s) (p r)] [q s] 3. Write each of the following in symbolic from by assuming that the universe consists of

literally everything. (i) All men are giants. (ii) No men are giants (iii) Some men are giants (iv) Some men are not giants.

4. Prove by mathematical induction that, 2n+1≤ 2n for n ≥ 3.

Assignment - II

1. State and Prove Lagrange’s theorem.

2. Let a = 1, 2, 3, 5, 6, 15, 30 . Show that divides is a partial ordering of A and draws the Hasse Diagram.

3. (i) Obtain PDNF of P (~ P ~ Q R)

(ii) Obtain PCNF of (~ P R) Q P) 4. Prove that subgroup of a cyclic group is cyclic.