SAGAR GROUP OF INSTITUIONS

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Semester: - 4th
Assignment Questions
Subject Name/ Code: -ADA (CS-4002)
UNIT-1

Q.1Why worst case analysis of algorithms is most important than average case analysis? [CO1]

Q.2 Solve the recurrence relation, where T(1)=1 and T(n) for n>=2 satisfies [CO1]

1. T(n)=3T(n/2)+n

2. T(n)=2T(n/2)+n

3. T(n)=7T(n/3)+ cn

Q.3 Explain various asymptotic methods used to represent the rate of growth of running time of
algorithms. [CO2]

Q.4 Explain a sorting algorithm that use divide and conquer method. [CO3]

Q.5 Write an algorithm to search an item in a linear list. If there are n nodes in the list, what is
the running time of your algorithm? [CO1, CO2]

Q.6 Sort the following item by Quick sort [CO4]

66, 33, 22, 55, 88, 99, 11, 77, 44

 UNIT-2

Q.1 Write a greedy algorithm for the knapsack problem. Apply it on the following instance of the
knapsack problem. [CO3]

Item Weight Value

1 2 3

2 3 4

3 4 5

4 5 6

Q.2 Construct a Huffman code for the following data : [CO2]

Char A B C D E

Probability 0.4 0.1 0.25 0.2 0.15

i) Encode the text ABACABAD using generated code

ii) Decode the text whose encoding is 10001011100101.

Q.3 Explain the concepts of job sequencing with deadlines. [CO1]

Q.4 Find an Optimal merge pattern for 11 files whose length are: 28,32,12,5,84,5,3,9,35,3,11.
[CO1]

Q.5 Write prim’s algorithm for MCST. [CO2]

 UNIT -3

Q.1 Define dynamic programming. Write the general procedure of dynamic programming. What
are the features of dynamic programming? [CO3,CO1]

Q. 2 Consider five items along with their respective weights and values [CO2]
I=<I1, I2,I3, I4,I5> W=<5,10,20,30,40> V=<30,20,100,90,160>
and W=60. Find the solution to the 0/1knapsack problem

Q.3 What s Multistage graph problem? Discuss its solution based on dynamic programming
approach. [CO1]

Q.4 Design a 3-stage with devices D1, D2 and D3. The cost are Rs. 30,15 and 20 respectively.
Total system cost cannot be more than Rs 105. Reliability of each device is 0.9, 0.8 and 0.5
respectively. Determine the best design, its reliability and cost of the system using dynamic
programming. [CO3]

Q.5 Explain Floyd warshal algorithm. [CO3,CO1]

Assignment Questions
Subject Name/ Code: - Software engineering (CS-4003)
UNIT-1

1. Explain prototyping model? Under what circumstances is it beneficial to construct a

prototype model?(CO1)

2. Discuss the problem might a S/W development organization face when it does not follow
any life cycle model during development of large S/W products?(CO1)

3. Compare the advantages and disadvantages of all S/W process models.(CO1,CO2)

4. Define agile process? Explain the RUP model based on it.(CO1,CO2)

5. Explain how a S/W development effort is initiated and finally terminated in the Spiral
Model.(CO1)

6. Differentiate between incremental model and evolutionary model? (CO1)

 UNIT -2

1. Differentiate between Functional and Non Functional Requirements.(CO2)

2. Explain requirement engineering? Give the steps involved in it. (CO2)

3. Identify the principles that are used in developing a good software requirement
specification (SRS)?(CO2,CO3)

4. Describe the Requirement Elicitation Techniques in detail?(CO2)

5. Draw the Use-Case Diagram for Hotel Management System.(CO2,CO3)

6. Define traceability in the context of SRS? How is traceability achieved?(CO2)

UNIT-3

1. Explain the design concept. Discuss its issues.(CO3)

2. Describe UML? How UML is used for software designing?(CO2,CO3)

3. Differentiate between Cohesion and Coupling.(CO3)

4. Develop and draw DFD for at least three levels of Library Management
System.(CO2,CO3)

5. Elaborate design matrix.(CO3)

6. Explain the following :- (CO2,CO3)

7. Class Diagram

8. Sequence Diagram

9. Activity Diagram
 Assignment Questions
Subject Name/ Code: - CSO (CS-4004)
UNIT-1

1. Describe the basic instruction types in assembly language programming? [CO-1]

2. Define the register transfer languages? Explain few RTL statements with example
[CO-1]

3. Explain addressing modes in detail with the help of example [CO-1]

4. Define an instruction format. Explain different types of instruction formats in detail

[CO-1]
5. Differentiate between micro programmed control unit and hardwired control unit
[CO-1]

6. Examine a program to evaluate the arithmetic statement [CO-1]

X = (A + B) *(C + D).
i. Using a general register computer with two address instructions.
ii. Using stack organized computer with zero address operation instruction

UNIT-2

1. Define Addition and subtraction arithmetic operations with examples

[CO-2]
2. Describe the multiplication procedure of fixed point numbers with block diagram
[CO-2]
3. Explain the process of multiplication by Booths algorithm. Multiply 8 by (-6) using
Booths method
[CO-2]
4. How multiplication is done in computer? Explain it with the help of diagram.
[CO-1, 2]
5. Describe the process of division with the help of example
[CO-2]

6. Draw a composite arithmetic circuit that implements all arithmetic micro operations.
Explain the same clearly
[CO-2]
 UNIT-3

1. Explain strobe control in asynchronous data transfer along with hand shaking
problem?
[CO-3]
2. Define different modes of data transfer between central computer and I/O device.
[CO-1,3]
3. Describe the function of USB, SCSI and PIC bus.
[CO-1,3]
4. Explain Daisy chaining with diagram.
[CO-3]
5. Explain DMA Controller with the block diagram?
[CO-3]
6. List out the major function of I/O processor
[CO-3]

Assignment Questions
Subject Name/ Code: - Operating System (CS-4005)
UNIT I

1. Define an operating system. State and explain the basic functions or services of an
operating system. CO-1

2. Discuss the features of following types of OS: CO-1/CO-5

(i)Batch Processing OS.
(ii)Time Sharing OS
(iii)Multi programming
(iv)Real time operating system

3. Define buffering and spooling? CO-1

4. Define system calls. Explain briefly about various types of system calls provided by an
operating system. CO-1

5. Explain Layered architecture of Operating system. CO-1

 UNIT II
1. Explain the following file concepts: CO-2
a) File attributes
b) File operations
c) File types
d) Internal file structure

2. Describe how a file directory system can be organized into one level, two level and tree
structure directories. CO-2

3. Discuss various disk allocation and access methods. CO-2

4. Discuss in detail the performance issues of secondary storage management. CO-2

5. Consider that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive is
currently serving request at cylinder 143, and the previous request was at cylinder 125.
The queue of pending requests in FIFO order is: 86, 1470, 913, 1774, 948, 1509, 1022,
1750, 130
Starting from the current head position, what is the total distance (in cylinders) that the
disk arm moves to satisfy all pending requests for each of the following disk scheduling
algorithms?
A. FCFS CO-2
B. SSTF
C. SCAN
D. C-SCAN
E. LOOK
F. C-LOOK
UNIT III
1. Define process and process control block. Draw the process state transition diagram and
explain it. CO-4

2. Consider the following set of processes with the length of the CPU burst time given in
milliseconds: CO-4
Process Burst Time Priority Arrival Time
P1 10 3 0
P2 1 1 1
P3 2 3 2
P4 1 4 3
P5 5 2 4
The processes are assumed to have arrived in the order p1, p2, p3, p4, p5 all at time 0.
a) Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF,
pre-emptive priority and RR (quantum=1) scheduling.
b) Calculate average turnaround time and average waiting time of each process for each
of the scheduling algorithms in part. CO-4
3. (a)Define thread? Differentiate between user level and kernel level threads. CO-4

(b)Define thrashing along with various causes of thrashing. CO-3

4. (a)Discuss various free space management techniques with their advantages and
disadvantages. CO-3
(b)Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how
would each of the First-fit, Best-fit, and Worst-fit algorithms place processes of 212K,
417K, 112K, and 426K (in order). Explain Which algorithm makes the most efficient use
of memory. CO-3

5. Consider a logical address space of eight pages of 1024 words each mapped onto a
physical memory of 32 frames CO-3
a) How many bits are in the logical address.
b) How many bits are in the physical address

6. (a)Consider the main memory with capacity of 3 frames .Assume that the pages of a
process are referenced in the order as given below: CO-3
1,2,3,4,2,1,5,6,2,1,2,3,7,6,3,2,1,2,3,6
Which one is better page repleacement algorithm :FIFO or LRU or optimal?

(b)Define virtual memory. Explain the concept of demand paging. CO-3