1
Seat No.: Enrollment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA SEMESTER-III • EXAMINATION SUMMER 2017
Subject Code: 3630003 Date: 05/06/2017
Subject Name: Basic Computer Science-2
Time: 02:30 Pm to 05:00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q.1

Answer in short.
1. Explain the following services provided by OS.
Error detection and response Accounting
2. Why monitor requires in batch processing scheme of OS.
3. Explain the terms:(1) Multiprocessing Starvation Critical Section
02
02
03

Answer the following questions.
1. What is the side effects if time quantum is larger than the longest-running process in round- robin? How?
2. Explain Resource Allocation Graph and its usage with example.
3. Explain the term Multitasking
03
03
01
Q.2

Answer in Short.
1. In general semaphore implementation if value of semaphore is at certain stage, how many processes are waiting to be unblocked?
2. Explain the term "Mutual Exclusion".
3. What is internal fragmentation.?
4. How page size affects the performance of OS?
5. What is meant by busy waiting or spin waiting?
6. Explain throughput time w.r.t. process scheduling.
7. State True or False "The deadlock avoidance strategy does not predict deadlock with certainty"
07

8M
12M
22M
18M Last allocated block
8M
6M
14M
36M
A dynamic partitioning scheme is being used. Consider the above memory status. First free block is 8 MB and Last free block is 36M of size. Shaded parts indicate Allocated Blocks and plain indicate Free Blocks of memory. Figure in the cell indicates the size of free Block of memory in MB. Answer the following questions.
1. Suggest you next allocation for 16-Mbyte allocation request, by applying Best-fit,
Next-fit and First-fit placement algorithm.
2. "Best -fit algorithm usually the worst performer". YES NO? Justify your answer.
03
04
OR
2

Apply Round Robin for q=1 and q=4 First come first serve (FCFS) and SPN algorithm for following set of processes.
1. Draw Gantt charts describing execution of these processes.
2. What is the turnaround time of each process for each of the scheduling
algorithms?
3. What is the waiting time of each process for each of the scheduling
algorithm?
4. What is the finish time of each process for each of the scheduling
algorithm?
Process
Arrival Time
Service Time
A
0
3
B
2
6
C
4
4
D
6
5
E
8
2
07
Q.3

How Internal Fragmentation and External Fragmentation takes place in memory? Explain with suitable example and diagram.
07

Total No of pages for the process are 5 and total number of frames allocated to this process are 3 (using Fixed frame allocation) .
The page address stream formed by executing the program is as follows:
3 2 1 5 2 4 5 3 2 5
Judge which page replacement algorithm among OPT, LRU and FIFO works better. Provide your justification for the same.
07
OR
Q.3

Explain Banker's algorithm with example.
07

Explain the Readers/Writers problem. Give a solution using semaphore if
writers heaving a priority.
07
Q.4

Write and explain an algorithm of 2-pass Assembler.
07

1. Explain Classification of Grammars.
2. Build the DFA and STT for regular expression
03
04
OR
Q.4

1. Explain Application Domain PL Domain Execution domain.
2. Explain different types of statement available in Assembly Language with
example.
03
04

1. Differentiate Variant-1 Vs Variant-II
2. Explain FRT and CRT wrt 1-Pass Assembler.
03
04
Q.5

Explain status of every stage of parsing operation for given string
using Operator precedence parser.
07
3

Define Local Optimization and Basic block. Explain with suitable example how value number technique is applied on basic block.
07
OR
Q.5

Write a short note of Code Optimization perform by Compiler applying optimizing transformation.
07

1. Differentiate between static memory allocation and dynamic memory
allocation.
2. Differentiate Assembly language Vs Machine language.
04
03