SMU BSCIT SEM 2 FALL 2014 ASSIGNMENTS

Get Fully solved assignments of SMU, IGNOU and other universities at nominal cost.

Email Address: assignmentsolutionshelp@gmail.com

Cost: Rs.150 Per Subject or Rs.600 per Semester

BT0068, Computer Organization and Architecture

1. a) Subtract (76425-28321) using 10’s complement. Show the steps. B) Subtract (28531-345620) using 10’s complement. Show the steps.

2 What do you mean by bus in computer system? Explain the bus structure.

3 Explain the instruction format with diagram and examples.

4 Explain the non-negative integers and negative integers representation.

5 Explain the mapping functions between the main memory and CPU.

6 Write a short note on DMA controller. Draw the diagram of it.

BT0069, Discrete Mathematics

1 A bit is either 0 or 1: a byte is a sequence of 8 bits. Find the number of bytes that, (a)can be formed (b)begin with 11 and end with 11

(c)begin with 11 and do not end with 11

(d) begin with 11 or end with 11.

2 (i) State the principle of inclusion and exclusion.

(ii) How many arrangements of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 contain at least one of the patterns 289, 234 or 487?

3 If G is a group, then

The identity element of G is unique.

Every element in G has unique inverse in G.

For any a  G, we have (a-1)-1 = a.

For all a, b  G, we have (a.b)-1 = b-1.a-1.

4 (i)Define valid argument

(ii) Show that  (P  Q) follows from  P  Q.

5 (i)Construct a grammar for the language.

(ii)Find the highest type number that can be applied to the following productions:

1. S  A0, A  1  2  B0, B  012.

2. S  ASB  b, A  bA  c ,3. S  bS  bc.

6 (i) Define tree with example

(ii) Any connected graph with ‘n’ vertices and n -1 edges is a tree.

BT0070, Operating Systems

1 Describe the mechanism of process creation in an OS.

2 Suppose that the following processes arrive for execution at the times indicated.

Process Burst Time

P1 24

P2 3

P3 3

1. Suppose the process arrives in the order P1, P2, P3 and

2. Suppose the process arrive in the order P2, P3, P1.

For both the above situation draw the Grantt Chart and calculate the waiting time for each process and average waiting time.

3 Write short notes on:

1. Critical section problem

2. Buffering

4 What are TLBs? Why they are required in paging?

5 Describe the techniques of free space management of free space list.

6 What are computer viruses? How do they affect our system?

BT0071- TECHNICAL COMMUNICATION – THEORY

1 What’s Audience Analysis? Explain its significance in Technical Communication

2 Explain the role of a technical editor. Differentiate between Micro and Macro editing.

3 Explain the various phases involved in System Development Life Cycle (SDLC).

BT0072, COMPUTER NETWORKS

1 What is Message switching and Packet switching?

2 What is Framing? Briefly explain Fixed-Size Framing, Variable Size Framing,

3 What is Stop-and-Wait Automatic Repeat Request? Briefly explain.

4 What is the role of Internet Protocol version 4 (IPV4) in addressing and routing packets between hosts? Briefly explain the structure of an IPV4 packet.

5 How SMTP works? Briefly explain applications of SMTP.

6 What is SSL protocol? How SSL handles a message?