1
Seat No.: Enrolment
GUJARAT TECHNOLOGICAL UNIVERSITY
MCA SEMESTER- III• EXAMINATION WINTER 2017
Subject Code:3630003 Date:02/01/2018
Subject Name: Basic Computer Science 2
Time: 10.30 AM TO 01.00PM Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.
Q.1

Define Process State.
ii) What is User-visible registers?
iii) Define Interrupts.
iv) Define five major achievements for developing OS.
Define memory fault.
02
01
01
02
01

Differentiate between "asleep in memory" and "sleep, swapped"
state in UNIX process state diagram.
ii) What is "fork()" function in UNIX process management?
iii) Differentiate between "Fixed partition" and "Dynamic partition" term
used in OS.
02
02
03
Q.2

Explain principles of concurrency with the help of suitable example.
ii) Define compaction.
05
02

List down the conditions for Deadlock.
ii) Define semaphore with its' three operations. Define also binary semaphore.
03
04
OR

Define below mentioned terms: Mutual Exclusion and Starvation
ii) Define "thrashing".
05
02
Q.3

What is the difference between Round Robin scheduling and Feedback scheduling.
ii) What are the difference between preemptive and non-preemptive uni-processor scheduling. Which scheduling are under non-preemptive and which are under preemptive?
03
04

Define "virtual memory". Explain "Fetch policy" in memory management.
ii) When will internal and external fragmentation be occurred?
05
02
OR
Q.3

Explain user-level thread and kernel-level thread.
ii) Differentiate between ready state and block state of a process.
05
02

Explain Dining philosophers' algorithm for freeing deadlock and starvation.
ii) Define page and page frame.
05
02
Q.4

Differentiate between the following:
a. Literal vs Declare Constant
b. Scanning vs Parsing
ii) Construct the Operator Precedence Parser for the string: a b c d.
04
03

What do you understand by Triple and Quadruple forms for expressions? Explain with appropriate example.
07
OR
Q.4

List the various Assembly statements. Explain Declarative statements in details.
ii) Define the following:
Language processor, Compiler, Abstract Syntax Tree
04
03
2

Write a brief account on Code Optimization.
07
Q.5

Answer any two of the following:
Write a brief account in Front end of the compiler.
ii) Write a note on Dynamic memory allocation in terms of Program controlled and Automatic allocation.
iii) Explain the various Assembler Directives.
10

Write notes on any two of the following:
Scope rules
ii) Top-down parsing
iii) Activation Record Base
04
OR
Q.5

Explain in detail The back end of a toy compiler with an appropriate example
07

Write a short note on classification of grammar
04
Regular expression
03