Spos Merged

A HA
SPOS
T SW
A
TE COMP (6th SEMESTER)
P H
O M
TATYA PDF
Join our Telegram channel
https://t.me/SPPU_BE_COMP_BOOKS_EXAMS
Seat No -
Total number of questions : 60
PWD10886_SYSTEMS PROGRAMMING AND OPERATING SYSTEM

Time : 1hr
Max Marks : 50
N.B
1) All questions are Multiple Choice Questions having single correct option.
2) Attempt any 50 questions out of 60.
3) Use of calculator is allowed.
AHA
4) Each question carries 1 Mark.
5) Specially abled students are allowed 20 minutes extra for examination.
S W
6) Do not use pencils to darken answer.
AT
7) Use only black/blue ball point pen to darken the appropriate circle.
H
8) No change will be allowed once the answer is marked on OMR Sheet.
P
9) Rough work shall not be done on OMR sheet or on question paper.
O M
10) Darken ONLY ONE CIRCLE for each answer.
Q.no 1. The last statement of the source program should be
A : Stop
B : Return
C : OP
D : End
Q.no 2. Grammar of the programming is checked at ________ phase of compiler
A : semantic analysis
B : code generation
C : syntax analysis
D : code optimization
Q.no 3. Which layer deals with the logical structure of files and with the
operations that can be specified by users such as open, close, read and write.
A : Physical organization
B : File system
C : Directory management
D : Scheduling and control
Q.no 4. Which amongst the following is not a valid page replacement policy?
A : LRU policy (Least Recently Use
AHA
B : FIFO policy (First in first out)
W
C : RU policy (Recurrently use
S
D : Optimal page replacement policy
AT
Q.no 5. which of the following is not a type of translator?
P H
A : assembler
O M
B : compiler
C : loader
D : interpreter
Q.no 6. A macro can be defined at
A : beginning of a program
B : end of a program
C : after initialisation of program
D : anywhere in a program
Q.no 7. The usual BUS structure used to connect the I/O devices is
A : Star BUS structure
B : Multiple BUS structure
C : Single BUS structure
D : Node to Node BUS structure

Q.no 8. The advantage of I/O mapped devices to memory mapped is
A : The former offers faster transfer of data
B : The devices connected using I/O mapping have a bigger buffer space
C : The devices have to deal with fewer address lines
D : No advantage as such
Q.no 9. A process is moved to wait queue when I/O request is made with
A : non-blocking I/O
A
B : blocking I/O
AH
C : asynchronous I/O
S W
D : synchronous I/O
T
Q.no 10. Which algorithm is defined in Time quantum?
H A
A : shortest job scheduling algorithm
M P
B : round robin scheduling algorithm
O
C : priority scheduling algorithm
D : multilevel queue scheduling algorithm
Q.no 11. Page fault frequency in an operating system is reduced when the
A : processes tend to the I/O-bound
B : size of pages is reduced
C : processes tend to be CPU-bound
D : locality of reference is applicable to the process
Q.no 12. Which command gives dynamic veiw of process states
A : PS
B : TOP
C : fork
D : kill
Q.no 13. Which of the following is used for grouping of characters into tokens?
A : Parser
B : Code optimization
C : Code generator
D : Lexical analyser
Q.no 14. Output file of Lex is _____ , if the input file is Myfile.
A : Myfile.e
A
B : Myfile.yy.c
AH
C : Myfile.lex
S W
D : Myfile.obj
T
Q.no 15. When expression sum=3+2 is tokenized then what is the token category of
A
3
P H
A : Identifier
O M
B : Assignment operator
C : Integer Literal
D : Addition Operator
Q.no 16. The output of a lexical analyzer is
A : Machine code
B : Intermediate code
C : A stream of tokens
D : A parse tree
Q.no 17. Virtual memory is
A : An extremely large main memory
B : An extremely large secondary memory
C : An illusion of extremely large main memory
D : A type of memory used in super computers

Q.no 18. The purpose of the ORIGIN directive is,
A : To indicate the purpose of the code
B : To indicate the starting of the computation code
C : To indicate the starting position in memory, where the program block is to be stored
D : To list the locations of all the registers used
Q.no 19. In priority scheduling algorithm, when a process arrives at the ready
queue, its priority is compared with the priority of
A : all process
AHA
B : currently running process
W
C : parent process
S
D : init process
AT
Q.no 20. In assembler design memory allocation to symbols is done in
P H
A : pass 1 of assembler
O M
B : pass 2 of assembler
C : In both the passes
D : at the time of synthesis
Q.no 21. Shell is the exclusive feature of
A : Dos
B : Unix
C : System software
D : Application software
Q.no 22. Each entry in a translation lookaside buffer (TL consists of
A : key
B : value
C : bit value
D : constant
Q.no 23. Input to code generator is
A : Source code
C : Target code
D : tokens
Q.no 24. Which of the following derivation a top-down parser use while parsing
an input string? The input is assumed to be scanned in left to right order ?
A : Leftmost derivation
AHA
B : Leftmost derivation traced out in reverse
W
C : Rightmost derivation
S
D : ightmost derivation traced out in reverse
AT
Q.no 25. In which disk information is recorded magnetically on platters.
P H
A : magnetic disks
O M
B : electrical disks
C : assemblies
D : cylinders
Q.no 26. Which one of the following cannot be scheduled by the kernel?
A : kernel level thread
B : user level thread
C : process
D : priority Process
Q.no 27. Which is the most optimal scheduling algorithm?
A : FCFS – First come First served
B : SJF – Shortest Job First
C : RR – Round Robin
D : priority
Q.no 28. The time taken to move the disk arm to the desired cylinder is called the
A : positioning time
B : random access time
C : seek time
D : rotational latency
Q.no 29. File type can be represented by
A : file extension
A
B : file identifier
AH
C : file name
S W
D : none of the mentioned
T
Q.no 30. The portion of the process scheduler in an operating system that
A
dispatches processes is concerned with
P H
A : assigning ready processes to CPU
O M
B : assigning ready processes to waiting queue
C : assigning running processes to blocked queue
D : assign prcess from wating to ready queue
Q.no 31. Orders are processed in the sequence they arrive if , this rule sequences
the jobs.
A : earliest due date
B : slack time remaining
C : first come, first served
D : critical ratio
Q.no 32. The policy used to select the disk I/O request that requires the least
movement of the disk arm from its current position is
A : Last in first out
B : Shortest service time first
C : Priority by process
D : Random scheduling
Q.no 33. Absolute loader loads object code in memory from
A : Fixed location given by proframmer
B : Any location which is free
C : Fixed location given by assembler
D : Any location and overwrites existing contents
Q.no 34. Operating system is
A
A : system software
AH
B : application software
S W
C : both 1 & 2
T
D : not a software
H A
Q.no 35. The offset ‘d’ of the logical address must be
M P
A : greater than segment limit
O
B : between 0 and segment limit
C : between 0 and the segment number
D : greater than the segment number
Q.no 36. In this policy, when the last track has been visited in one direction, the
arm is returned to the opposite end of the disk and the scan begins again.
C : SCAN
D : Circular SCAN
Q.no 37. Yacc resolves conflicts by of type ?
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
Q.no 38. Which of the following algorithms tends to minimize the process flow
time?
A : First come First served
B : Shortest Job First
C : Earliest Deadline First
D : Longest Job First
Q.no 39. Which one is a lexer Generator
AHA
A : YACC
W
B : BISON
S
C : FLEX
AT
D : Iburg
P H
Q.no 40. System programmer needs
O M
A : knowledge of only system
B : knowledge of only programming
C : knowledge of both system and application programming
D : knowledge of hardware
Q.no 41. If the wait for graph contains a cycle
A : then a deadlock does not exist
B : then a deadlock exists
C : then the system is in a safe state
D : either deadlock exists or system is in a safe state
Q.no 42. An assembler is
A : programming language dependent
B : syntax dependant
C : machine dependant
D : data dependant
Q.no 43. In free space management, which method has negligible space overhead
because there is no need for a disk allocation table, merely for a pointer to the
beginning of the chain and the length of the first portion.
A : Bit tables
B : Chained Free Portions
C : Indexing
D : Free Block List
A
Q.no 44. Static memory allocation is typically performed during
AH
A : compilation
S W
B : execution
T
C : loading
H A
D : linking
M P
Q.no 45. The essential content(s) in each entry of a page table is/are
O
A : Virtual page number
B : Page frame number
C : Both virtual page number and page frame number
D : Access right information
Q.no 46. A deadlock avoidance algorithm dynamically examines the state to

ensure that a circular wait condition can never exist.
A : resource allocation state
B : system storage state
C : operating system
D : resources
Q.no 47. The valid – invalid bit, in this case, when valid indicates?
A : the page is not legal
B : the page is illegal

C : the page is in memory
D : the page is not in memory
Q.no 48. A compiler bridges the semantic gap between …………
A : PL domain and storage domain
B : execution domain and syntax domain
C : PL domain and execution domain
D : PL domain only
A
Q.no 49. Segment replacement algorithms are more complex than page
AH
replacement algorithms because
W
A : Segments are better than pages
S
B : Pages are better than segments
AT
C : Segments have variable sizes
P H
D : Segments have fixed sizes
O M
Q.no 50. RLD in Direct linking loader stands for
A : Redirection and Load Directory
B : Relocation & Linkage Directory
C : Relocation and Load Directory
D : Redirection and Linkage Directory
Q.no 51. Using a pager
A : increases the swap time
B : decreases the swap time
C : decreases the swap time & amount of physical memory needed
D : increases the amount of physical memory needed
Q.no 52. An edge from process Pi to Pj in a wait for graph indicates that
A : Pi is waiting for Pj to release a resource that Pi needs
B : Pj is waiting for Pi to release a resource that Pj needs

C : Pi is waiting for Pj to leave the system
D : Pj is waiting for Pi to leave the system
Q.no 53. Each request requires that the system consider to decide whether the
current request can be satisfied or must wait to avoid a future possible deadlock.
A : resources currently available
B : processes that have previously been in the system
C : resources currently allocated to each process
D : future requests and releases of each process
AHA
Q.no 54. YACC stands for
W
A : yet accept compiler constructs
S
B : yet accept compiler compiler
AT
C : yet another compiler constructs
P H
D : yet another compiler compiler
O M
Q.no 55. Given a priori information about the number of resources of each type
that maybe requested for each process, it is possible to construct an algorithm
that ensures that the system will never enter a deadlock state.
A : minimum
B : average
C : maximum
D : approximate
Q.no 56. Which of the following page replacement algorithms suffers from
Belady’s Anomaly?
A : Optimal replacement
B : LRU
C : FIFO
D : Both optimal replacement and FIFO
Q.no 57. When expression "int var1,var2;' is tokenized then what is the token
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
Q.no 58. The minimum number of page frames that must be allocated to a
running process in a virtual memory environment is determined by
A : the instruction set architecture
B : page size
AHA
C : physical memory size
W
D : number of processes in memory
S
Q.no 59. When a program tries to access a page that is mapped in address space
T
but not loaded in physical memory, then what occurs
H A
A : page fault occurs
M P
B : fatal error occurs
O
C : segmentation fault occurs
D : no error occurs
Q.no 60. The translator which translates high level language to machine code is
A : compiler
B : assembler
C : loader
D : interpreter
Q.no 1. To access services from OS, an interface is provided Called as
A : System call
B : API
C : library
D : shell
Q.no 2. Which of the following is not an intermediate code form?
A : Postfix notation
B : Syntax trees
C : Three address codes
D : Prefix notation
Q.no 3. The memory allocation scheme subject to “external” fragmentation is
A : segmentation
A
B : swapping
AH
C : pure demand paging
S W
D : multiple fixed contiguous partitions
T
Q.no 4. The process wherein the processor constantly checks the status flags is
A
called as
P H
A : Polling
O M
B : Inspection
C : Reviewing
D : Echoing
Q.no 5. Effective access time is directly proportional to
A : memory access time
B : page-fault rate
C : hit ratio
Q.no 6. The data-in register of I/O port is
A : Read by host to get input
B : Read by controller to get input
C : Written by host to send output
D : Written by host to start a command

Q.no 7. The function of OS
A : Resource allocator
B : control program
C : create user friendly env.
D : All
Q.no 8. Assembly language programs are written using
A : Hex code
A
B : Mnenonics
AH
C : ASCII code
S W
D : C Language
T
Q.no 9. On a movable head system, the time it takes to position the head at the
A
track is known as
P H
A : seek time
O M
B : rotational delay
C : access time
D : Transfer time
Q.no 10. Task of the lexical analysis phase is
A : to parse the source program into basic elements or tockens of the language
B : checks that given statement is syntactically correct or not
C : removes comments and white spaces
D : Both 1 & 3
Q.no 11. Which technique is used for temporarily removing inactive programs
from the memory of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
Q.no 12. Relocatable programs
A : cannot be used with fixed partitions
B : can be loaded almost anywhere in memory
C : do not need a linker
D : can be loaded only at one specific location
Q.no 13. what consists of all processes whose memory images are in the backing
store or in memory and are ready to run.
AHA
A : wait queue
W
B : ready queue
S
C : cpu
AT
D : secondary storage
P H
Q.no 14. The end of a macro can be represented by the directive
O M
A : END
B : ENDS
C : MEND
D : ENDD
Q.no 15. Output of pass 1 assembler is
A : object code
B : intermediate code
C : assembly language code
D : machine code
Q.no 16. syntax analyzer or parser takes the input from a ______________
A : Lexical analyser
B : Syntactic Analyser
C : Semantic Analyser
D : None of the mentioned
Q.no 17. In memory-mapped I/O
A : The I/O devices and the memory share the same address space
B : The I/O devices have a separate address space
C : The memory and I/O devices have an associated address space
D : A part of the memory is specifically set aside for the I/O operation
Q.no 18. A set of techniques that allow to execute a program which is not entirely
in memory is called
AHA
A : demand paging
W
B : virtual memory
S
C : auxiliary memory
AT
D : secondary memory
P H
Q.no 19. Which of the following type of software should be used if you need to
M
create,edit and print document ?
O
A : word proccessor
B : spreadsheet
C : desktop publishing
D : Unix
Q.no 20. A system program that combines the separately compiled modules of a
program into a form suitable for execution ?
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
Q.no 21. Format of macro call is
A : <macro name> [<actual parameter spec>,…]
B : <macro name> [<formal parameter spec>,…]

C : <macro name>
D : <call macro>
Q.no 22. What is FIFO algorithm?
A : first executes the job that came in last in the queue
B : first executes the job that came in first in the queue
C : first executes the job that needs minimal processor
D : first executes the job that has maximum processor needs
A
Q.no 23. System softwares are used to
AH
A : bridge gap between different applications
S W
B : bridge gap between different users
T
C : bridge gap between programmer and system
H A
D : bridge gap between different systems
M P
Q.no 24. __________ a part of a compiler that takes as input a stream of characters
O
and produces output as a meaningful token .
A : Parser
B : Optimizer
C : Scanner
D : Loader
Q.no 25. Which of the following table is used to identify macro calls?
A : Macro Name table
B : Actual Parameter Table
C : Parameter Default table
D : Exapansion time variable Table
Q.no 26. a process is copied into the main memory from the secondary memory
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
Q.no 27. on free space management has the advantages that it relatively easy to
find one or a contiguous group of free blocks.
A : Bit table
B : Chained Free Portion
C : Indexing
D : Free Block List
AHA
Q.no 28. If a number of instructions are repeating through the main program,
then what is to be used to reduce the length of the program
S W
A : procedure
T
B : subroutine
H A
C : macro
M P
O
Q.no 29. Translator for low level programming language were termed as
A : Compiler
B : Interpreter
C : Assembler
D : Loader
Q.no 30. Linking is process of binding
A : Internal part of a program
B : external functional call
C : External reference to the correct link time address
D : None of the above
Q.no 31. Which of the following isn’t a part of the file directory?
A : Attributes
B : Protocol
C : Location
D : Ownership
Q.no 32. Assembler processes
A : any language
B : assembly language
C : c language
A
D : high level language
AH
Q.no 33. Which of the following is not a Lexemes?
S W
A : Identifiers
T
B : Constants
H A
C : Keywords
M P
D : context free grammar
O
Q.no 34. With round robin scheduling algorithm in a time shared system
A : using very large time slices converts it into First come First served scheduling
algorithm
B : using very small time slices converts it into First come First served scheduling
algorithm
C : using extremely small time slices increases performance
D : using very small time slices converts it into Shortest Job First algorithm
Q.no 35. START pseudo code is used for
A : setting initial value of LC and specifies start of program
B : Specifying start of a Register Table
C : specifies start of literal table
D : specifies start of symbol table
Q.no 36. Input of Lex is ?

A : set to regular expression
B : statement
C : Numeric data
D : ASCII data
Q.no 37. Recognition of basic syntactic constructs through reductions, this task is
performed by
A : Lexical analysis
B : Syntax analysis
AHA
C : . Semantic analysis
W
D : Structure analysis
S
Q.no 38. If the lexical analyser finds a lexeme with the same name as that of a
T
reserved word,it _________
H A
A : overwrites the word
M P
B : overwrites the functionality
O
C : generates an error
D : something else
Q.no 39. The concept in which a process is copied into the main memory from the
secondary memory according to the requirement.
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
Q.no 40. A multilevel page table is preferred in comparison to a single level page
table for translating virtual address to physical address because
A : it reduces the memory access time to read or write a memory location
B : it helps to reduce the size of page table needed to implement the virtual address
space of a process
C : it is required by the translation lookaside buffer

D : it helps to reduce the number of page faults in page replacement algorithms
Q.no 41. In a two pass assembler the object code generation is done during the ?
A : Second pass
B : First pass
C : Zeroth pass
D : Not done by assembler
Q.no 42. The linker is
A
A : is same as the loader
AH
B : is required to create a load module
S W
C : is always used before programs are executed
T
D : translator
H A
Q.no 43. Analysis which determines the meaning of a statement once its
P
grammatical structure becomes known is termed as
O M
A : Semantic analysis
B : Syntax analysis
C : Regular analysis
D : General analysis
Q.no 44. s free space management has the advantages that it relatively easy to
A : Bit tables
C : Indexing
D : Free Block List
Q.no 45. What are the two methods of the LRU page replacement policy that can
be implemented in hardware?
A : Counters
B : RAM & Registers

C : Stack & Counters
D : Registers
Q.no 46. An interpreter is
A : A program that places programs into

memory an prepares them for execution
B : A program that appears to execute a source

program as if it were machine language
C : A program that automate the translation of

assembly language into machine language
AHA
D : A program that accepts a program written in
high level language and produces an object
program
S W
Q.no 47. Which of the following software tool is parser generator ?
AT
A : Lex
P H
B : Yacc
M
C : Iburg
O
D : both 1 & 3
Q.no 48. which directive sets the LC with address specified with address
specification.
A : START
B : END
C : ORIGIN
D : Both START and ORIGIN
Q.no 49. How Sequential access method works on random access devices.
A : works well
B : doesnt work well
C : maybe works well and doesnt work well

Q.no 50. An imperative statement
A : Reserves areas of memory and associates names with them
B : Indicates an action to be performed during execution of assembled program
C : Indicates an action to be performed during optimization
D : allocate space for literals
Q.no 51. The FCFS algorithm is particularly troublesome for
A : time sharing systems
A
B : multiprogramming systems
AH
C : multiprocessor systems
S W
D : operating systems
T
Q.no 52. Which method on free space management, each block is assigned in a
A
reserved portion of the disk.
P H
A : Bit tables
O M
C : Indexing
D : Free Block List
Q.no 53. Libraries that are loaded and unloaded as and when needed is called as
A : Static Linking library
B : Dynamic linking library
C : load time linking library
D : Both 1 & 2
Q.no 54. In the optimized technique for sequential access removes a page from
the buffer as soon as the next page is requested.
A : write ahead
B : read ahead
C : free-behind
D : add-front
Q.no 55. These file are often used where very rapid access is required, where
fixed length records are used, and where records are always accessed one at a
time.
A : Indexed files
B : Direct files
C : Sequential files
D : Indexed Sequential files
A
Q.no 56. A grammar that produces more than one parse tree for some sentence is
AH
called
W
A : Ambiguous
S
B : Unambiguous
AT
C : Regular
P H
D : None of these
O M
Q.no 57. Forward reference table(FRT) is arranged like -
A : Stack
B : Queue
C : Linked list
D : Double linked list
Q.no 58. If linked origin is not equal to translated address then relocation is
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler


D : resources
A
AH
Q.no 1. A macro is
S W
A : a small program inside a program
T
B : set of special instructions
H A
C : a unit of specification for program generation through expansion
M P
D : same as function
O
Q.no 3. Which scheduling algorithm allocates the CPU first to the process that
requests the CPU first?
A : first-come, first-served scheduling
B : shortest job scheduling
C : priority scheduling
D : Round Robin
A : PS
B : TOP
C : fork
D : kill
Q.no 5. The method of synchronizing the processor with the I/O device in which
the device sends a signal when it is ready is?
A : Exceptions
B : Signal handling
C : Interrupts
AHA
D : DMA
W
Q.no 6. LR stands for
S
A : Left to right
AT
B : Left to right reduction
P H
C : Right to left
O M
D : Left to right and right most derivation in reverse
Q.no 7. which algo. Is nonpreemptive
A : SJF-P
B : FCFS
C : RR
D : Priority
Q.no 8. Examples of system program includes
A : Ticket booking system
B : Banking software
C : Online shopping program
D : Operating System
Q.no 9. It is used as an index into the page table.
A : frame bit
B : page number
C : page offset
D : frame offset
Q.no 10. The pager concerns with the
A : entire thread
B : first page of a process
C : individual page of a process
A
D : entire process
AH
Q.no 11. process is trash
S W
A : it spends more time paging than executing
T
B : it spends less time paging than executing
H A
C : page fault occurs
M P
D : swapping can not take place
O
Q.no 12. When a user process issues an I/O request, the operating system assigns a
buffer in the system portion of main memory to the operation is called
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Machine code
D : A parse tree
Q.no 14. A model statement contains call for another macro is called as
A : referential macro call

B : nested macro call
C : inbuilt macro call
D : inherited macro call
B : blocking I/O
A
D : synchronous I/O
AH
Q.no 16. The interval from the time of submission of a process to the time of
W
completion is termed as
S
A : waiting time
AT
B : turnaround time
P H
C : response time
O M
D : throughput
Q.no 17. Literal table stores
A : Numbers from code
B : variables from code
C : instruction
D : Opcodes
Q.no 18. In priority scheduling algorithm
A : CPU is allocated to the process with highest priority
B : CPU is allocated to the process with lowest priority
C : Equal priority processes can not be scheduled
D : Equal priority processes can not be scheduled parallely
A : Stop
B : Return
C : OP
D : End
Q.no 20. The system is notified of a read or write operation by
A : Appending an extra bit of the address
B : Enabling the read or write bits of the devices
C : Raising an appropriate interrupt signal
A
D : Sending a special signal along the BUS
AH
Q.no 21. When the valid – invalid bit is set to valid, it means that the associated
W
page
S
A : is in the TLB
AT
B : has data in it
P H
C : is in the process’s logical address space
O M
D : is the system’s physical address space
Q.no 22. Lexemes can be referred to as
A : elements of lexicography
B : sequence of alphanumeric characters in a token
C : lexical errors
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
Q.no 24. Disadvantage of compile and go loading scheme is that

A : a position of memory is wasted because the case occupied by the assembler is
unavailable the object program
B : it is necessary to retranslate the users program check every time it is run
C : Easily handles multiple segments of code
D : Both 1 & 2
Q.no 25. In which algorithm, the disk arm starts at one end of the disk and moves
toward the other end, servicing requests till the other end of the disk. At the
other end, the direction is reversed and servicing continues.
A : LOOK
AHA
B : SCAN
W
C : C-SCAN
S
D : C-LOOK
AT
P H
A : YACC
O M
B : BISON
C : FLEX
D : Iburg
Q.no 28. The real difficulty with SJF in short term scheduling is
A : it is too good an algorithm
B : knowing the length of the next CPU request
C : it is too complex to understand

D : it is too complex to implement
Q.no 29. The strategy of making processes that are logically runnable to be
temporarily suspended is called
A : Non preemptive scheduling
B : Preemptive scheduling
C : Shortest job first
D : First come First served
Q.no 30. The time taken for the desired sector to rotate to the disk head is called
AHA
W
S
C : seek time
AT
P H
Q.no 31. When access is granted to append or update a file to more than one user,
M
the OS or file management system must enforce discipline. This is
O
A : Simultaneous access
B : Compaction
C : External Fragmentation
D : Division
Q.no 32. Bit used for Illegal addresses are trapping are called as
A : error
B : protection
C : valid – invalid
D : access

Q.no 34. In segmentation, each address is specified by
A : a segment number & offset
B : an offset & value
C : a value & segment number
D : a key & value
A
Q.no 35. Way of specifying arguments in instruction is
AH
A : instruction format
S W
B : addressing modes
T
C : both 1 & 2
H A
D : function
M P
Q.no 36. Memory protection in a paged environment is accomplished by
O
A : protection algorithm with each page
B : restricted access rights to users
C : restriction on page visibility
D : protection bit with each page
Q.no 37. in which Swap space exists
A : cpu
B : primary memory
C : secondary memory
Q.no 38. Loader is a program that
A : places programs into memory and prepares them for execution
B : automates the translation of assembly language into machine language

C : accepts a program written in a high level language and produces an object program
D : appers to execute a source program as if it were machine language
Q.no 39. In which method, the file allocation table contains a separate one level
index for each file, the index has one entry for each portion allocated to the file.
A : Chained allocation
B : Indexed allocation
C : Contiguous allocation
D : Variable allocation
AHA
Q.no 40. Round robin scheduling falls under the category of
W
A : Non-preemptive scheduling
S
AT
C : All of the mentioned
P H
D : processes are classified into groups
O M

D : data dependant
A
AH
W
S
T
A : Bit tables
H A
M P
C : Indexing
O
D : Free Block List
D : no error occurs

A : compiler
B : assembler
C : loader
D : interpreter
Belady’s Anomaly?
AHA
B : LRU
W
C : FIFO
S
AT
P H
O M
D : PL domain only
B : page size
A : compilation
B : execution
C : loading
D : linking
A
AH
S W
T
H A
M P
O
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
A : minimum
B : average
C : maximum
D : approximate
A
AH
S W
T
H A
M P
O
A : Second pass
B : First pass
C : Zeroth pass
Q.no 1. In which of the following page replacement policies Balady’s anomaly

occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
Q.no 2. Which statement declare the name of macro.
A : macro prototype
B : macro definition
C : macro identification
D : macro call
A : END
B : ENDS
C : MEND
D : ENDD
A
Q.no 4. LRU stands for?
AH
A : Less Recently used
S W
B : Least Recurrently used
T
C : Least Randomly used
H A
D : Least Recently used
M P
O
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language

A
Q.no 9. The method which offers higher speeds of I/O transfers is
AH
A : Interrupts
S W
B : Memory mapping
T
C : Program-controlled I/O
H A
D : DMA
M P
Q.no 10. SJF can be
O
A : preemptive only
B : nonpreemptive only
C : either preemptive or nonpreemptive
D : sequential
A : System call
B : API
C : library
D : shell
A
Q.no 14. Expansion time variables are used
AH
A : Before expansion of macro calls
S W
B : only during expansion of macro calls
T
C : After expansion of macro calls
H A
D : Any one of the above
M P
Q.no 15. Which of the following system software resides in main memory always ?
O
A : Text editor
B : Assembler
C : Linker
D : Loader
Q.no 16. The processes that are residing in main memory and are ready and
waiting to execute are kept on a list called
A : job queue
B : ready queue
C : execution queue
D : process queue
B : code generation
C : syntax analysis
A
AH
S W
B : control program
T
H A
D : All
M P
O
Q.no 21. which of these is not a pseudocode/assembler directive
A : USING
B : BALR
C : DROP
D : ORG
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A
Q.no 24. In multilevel feedback scheduling algorithm
AH
A : a process can move to a different classified ready queue
S W
B : classification of ready queue is permanent
T
C : processes are not classified into groups
H A
M P
Q.no 25. Pass-1 of two pass assmbler is used for
O
A : synthesizing code
B : gathering information
C : processing macro
D : expanding macro
Q.no 26. To obtain better memory utilization, dynamic loading is use With
dynamic loading, a routine is not loaded until it is calle For implementing
dynamic loading
A : special support from hardware is required
B : special support from operating system is essential
C : special support from both hardware and operating system is essential
D : user programs can implement dynamic loading without any special support from
hardware or operating system
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
Q.no 28. The beginning of the macro definition can be represented as
A : START
B : BEGIN
C : MACRO
A
AH
W
S
A : procedure
AT
B : subroutine
P H
C : macro
O M
Q.no 30. A self relocating program in one which
A : can not be made to exercise in any area of storage other than the one designated for
it at the time of its coding or translation
B : consists of a program and relevent information for its reloaction
C : one itself perform the relocation of its address sensitive positions
D : Both 1 & 2
D : something else
performed by
B : Syntax analysis
A : key
AHA
B : value
W
C : bit value
S
D : constant
AT
Q.no 34. The process of assigning a label or macroname to the string is called
P H
A : initialising macro
O M
B : initialising string macro
C : defining a string macro
D : defining a macro
A : file extension
C : file name
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : magnetic disks
C : assemblies
D : cylinders
A
AH
S W
T
H A
P
time?
O M
A : any language
C : c language
specification.
A : START
B : END
C : ORIGIN
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A
AH
S W
T
H A
M P
O
D : resources
A : Counters
B : RAM & Registers
D : Registers

D : translator
A
AH
W
S
A : Bit tables
AT
P H
C : Indexing
O M
D : Free Block List
time.
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List
A
A : write ahead
AH
B : read ahead
S W
C : free-behind
T
D : add-front
H A
M P
O
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : works well

B : Syntax analysis
AHA
S W
AT
H
M P
O
program
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Myfile.e
A
B : Myfile.yy.c
AH
C : Myfile.lex
S W
D : Myfile.obj
T
H A
A : Machine code
M P
O
D : A parse tree
Q.no 4. Which module gives control of the CPU to the process selected by the
short-term scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : all process
C : parent process
D : init process
A
AH
S W
T
D : Round Robin
H A
Q.no 7. Time sharing system is implemented using
M P
A : FCFS
O
B : SJF
C : RR
D : priority

A : word proccessor
B : spreadsheet
D : Unix
A
AH
A : Assembler
S W
B : Linking loader
T
C : Cross compiler
H A
D : Load and Go
M P
O
A : wait queue
B : ready queue
C : cpu
B : page-fault rate
C : hit ratio
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
AHA
W
S
AT
P H
O M
B : blocking I/O
D : synchronous I/O
A : PS
B : TOP
C : fork
D : kill
A : Parser
C : Code generator
D : Both 1 & 3
A
Q.no 21. Process are classified into different groups in
AH
S W
T
H A
M P
O
A : Bit table
C : Indexing
D : Free Block List
algorithm
algorithm
AHA
W
S
AT
P H
O M
D : a key & value
B : statement
C : Numeric data
D : ASCII data
A : Source code
C : Target code
D : tokens
A : system software
C : both 1 & 2
D : not a software
Q.no 30. A process is thrashing if
A : it is spending more time paging than executing
B : it is spending less time paging than executing
A
AH
S W
T
H A
M P
O
C : SCAN
D : Circular SCAN
Q.no 33. Directories, pricing tables, schedules and name lists are the examples of
A : Indexed files
B : Direct files
A : error
B : protection
D : access
A
AH
S W
T
H A
M P
D : priority
O
A : Identifiers
B : Constants
C : Keywords
page
A : is in the TLB
B : has data in it
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A
C : seek time
AH
S W
T
H A
M P
O
D : data dependant
D : PL domain only
D : no error occurs
A : compilation
AHA
B : execution
W
C : loading
S
D : linking
AT
H
M P
O
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

B : page size
AHA
A : Second pass
W
B : First pass
S
C : Zeroth pass
AT
P H
M
Belady’s Anomaly?
O
B : LRU
C : FIFO

A : Bit tables
C : Indexing
A
D : Free Block List
AH
S W
T
H A
M P
O
A : minimum
B : average
C : maximum
D : approximate
A : compiler
B : assembler
C : loader
D : interpreter

AHA
W
D : resources
S
AT
P H
O M
D : Both 1 & 2
A : macro prototype
D : macro call
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
Q.no 3. Which module deals with the device as a logical resource and is not
concerned with the details of actually controlling the device.
A : Directory Management
B : Logical I/O
C : Device I/O
AHA
W
C : instruction
S
D : Opcodes
AT
P H
O M
A : SJF-P
B : FCFS
C : RR
D : Priority
A : object code
D : machine code
AHA
B : File system
W
S
AT
P H
A : Text editor
O M
B : Assembler
C : Linker
D : Loader
A : waiting time
B : turnaround time
C : response time
D : throughput
track is known as
A : seek time
C : access time
D : Transfer time
AHA
A : assembler
W
B : compiler
S
C : loader
AT
D : interpreter
P H
Q.no 15. SJF can be
O M
A : preemptive only
D : sequential
3
A : Identifier
C : Integer Literal
A : Left to right
C : Right to left
A
AH
in memory is called
W
A : demand paging
S
B : virtual memory
AT
P H
O M
A : segmentation
B : swapping

C : process
C : both 1 & 2
D : function
A
AH
A : Attributes
S W
B : Protocol
T
C : Location
H A
D : Ownership
M P
O
C : <macro name>
D : <call macro>
A : START
B : BEGIN
C : MACRO
A : Parser
B : Optimizer
C : Scanner
D : Loader
AHA
S W
T
H A
M P
O
A : any language
C : c language
C : seek time
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
A
D : Both A and B
AH
W
S
AT
P H
O M
Q.no 36. What is Scheduling?
A : allowing a job to use the processor
B : making proper use of processor
C : all of the mentioned
Q.no 37. Machine independent phase of the compiler is
A : syntax analysis and Lexical analysis

B : only lexical analysis
C : Code optimization
D : code generation
A : file extension
C : file name
A
AH
W
S
AT
P H
O M
specification.
A : START
B : END
C : ORIGIN
B : Syntax analysis
A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
AT
P H
O M
D : translator
time.
A : Indexed files
B : Direct files

A
AH
S W
T
H A
M P
O
D : data dependant
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list

A : Bit tables
C : Indexing
D : Free Block List
A : Lex
AHA
B : Yacc
W
C : Iburg
S
D : both 1 & 3
AT
P H
M
O


program
A : works well

A : Counters
B : RAM & Registers
AHA
D : Registers
W
S
called
T
A : Ambiguous
H A
B : Unambiguous
M P
C : Regular
O
D : None of these
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler

B : code generation
C : syntax analysis
A
AH
S W
T
H A
M P
O
Q.no 4. Nested Macro calls are expanded using the
A : FIFO rule (First in first out)
B : LIFO (Last in First out)
C : FILO rule (First in last out)
A : END
B : ENDS
C : MEND
D : ENDD
A : FCFS
B : SJF
C : RR
D : priority
A : entire thread
A
AH
S W
D : entire process
T
H A
A : Hex code
M P
B : Mnenonics
O
C : ASCII code
D : C Language
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
A : PS
B : TOP
C : fork
D : kill
A : wait queue
AHA
B : ready queue
W
C : cpu
S
AT
P H
O M
B : page-fault rate
C : hit ratio
A : System call
B : API
C : library
D : shell
A : job queue
B : ready queue
C : execution queue
D : process queue
A : word proccessor
B : spreadsheet
D : Unix
A
AH
A : Assembler
S W
B : Linking loader
T
C : Cross compiler
H A
D : Load and Go
M P
O
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : magnetic disks
C : assemblies
D : cylinders
A
AH
A : key
S W
B : value
T
C : bit value
H A
D : constant
M P
O
A : Indexed files
B : Direct files
Q.no 24. The file name is generally split into two parts :
A : name & identifier
B : identifier & type
C : extension & name
D : type & extension

A
AH
S W
T
H A
M P
O
A : procedure
B : subroutine
C : macro
D : expanding macro

D : something else
A
D : priority
AH
W
S
AT
H
space of a process
M P
O
D : a key & value
C : seek time
A
AH
S W
T
H A
M P
O
performed by
B : Syntax analysis
dynamic loading
AHA
W
S
AT
D : Both 1 & 2
P H
O M
D : no error occurs
Belady’s Anomaly?
B : LRU
C : FIFO
A
AH
category of 'var1 '
W
A : Identifier
S
B : Number
AT
C : Keyword
P H
D : operator
O M
B : Syntax analysis
D : PL domain only
specification.
A : START
B : END
C : ORIGIN
A : Second pass
B : First pass
C : Zeroth pass
A
AH
W
S
AT
B : page size
P H
O M

D : resources
A : minimum
B : average
C : maximum
D : approximate
A : compiler
A
B : assembler
AH
C : loader
S W
D : interpreter
T
A
P H
O M
A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
A
AH
S W
T
H A
M P
A : macro prototype
O
D : macro call

A
AH
S W
C : instruction
T
D : Opcodes
H A
P
O M
B : File system
3
A : Identifier
C : Integer Literal

D : Both 1 & 3
A
AH
W
A : all process
S
AT
C : parent process
P H
D : init process
O M
A : Stop
B : Return
C : OP
D : End
Q.no 12. A macro is

B : control program
D : All
A
AH
S W
T
H A
M P
O
A : Machine code
D : A parse tree
B : Syntax trees
A
AH
A : SJF-P
S W
B : FCFS
T
C : RR
H A
D : Priority
M P
O
A : file extension
C : file name
C : both 1 & 2
D : function
A : Bit table

C : Indexing
D : Free Block List
algorithm
algorithm
A
AH
W
S
A : Paging
AT
B : Demand paging
P H
C : Segmentation
O M
D : Swapping

C : lexical errors
A : system software
A
C : both 1 & 2
AH
D : not a software
S W
page
AT
A : is in the TLB
P H
B : has data in it
O M

AHA
A : LOOK
W
B : SCAN
S
C : C-SCAN
AT
D : C-LOOK
P H
O M
A : Source code
C : Target code
D : tokens
A : Dos
B : Unix
C : System software
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Parser
B : Optimizer
C : Scanner
D : Loader
AHA
W
S
C : process
AT
P H
O M
D : data dependant
A : Bit tables

C : Indexing
D : Free Block List
time.
A : Indexed files
B : Direct files
A
AH
W
performed by
S
A : Absolute Loader
AT
B : Loader
P H
C : Linker
O M
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List
A : write ahead
B : read ahead
AHA
C : free-behind
W
D : add-front
S
AT
P H
O M
D : translator
A : works well




program
A
AH
A : Counters
S W
B : RAM & Registers
T
H A
D : Registers
M P
called
O
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

A
AH
S W
A : minimum
T
B : average
H A
C : maximum
M P
D : approximate
O
A : Second pass
B : First pass
C : Zeroth pass

D : resources
A : waiting time
B : turnaround time
C : response time
D : throughput
A
AH
S W
AT
P H
O M
D : Round Robin
A : Left to right
C : Right to left
A : System call
B : API
C : library
D : shell
B : Logical I/O
C : Device I/O
AHA
W
S
AT
P H
O M

A : Parser
C : Code generator
A
B : code generation
AH
C : syntax analysis
S W
T
H A
M P
O
B : blocking I/O
D : synchronous I/O
A
B : page-fault rate
AH
C : hit ratio
S W
T
H A
A : Myfile.e
M P
B : Myfile.yy.c
O
C : Myfile.lex
D : Myfile.obj
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : word proccessor
B : spreadsheet
D : Unix
D : code generation
A
AH
S W
T
D : expanding macro
H A
M P
O
A : Indexed files
B : Direct files
C : SCAN
D : Circular SCAN
D : priority
A
A : Compiler
AH
B : Interpreter
S W
C : Assembler
T
D : Loader
H A
M P
O
time?
A : USING
B : BALR
C : DROP
D : ORG
space of a process
A
AH
dynamic loading
S W
T
H A
M P
O

B : statement
C : Numeric data
D : ASCII data
A : procedure
B : subroutine
C : macro
AHA
W
S
the jobs.
T
H A
M P
O
D : critical ratio
A : any language
C : c language
A : YACC
B : BISON
C : FLEX
D : Iburg

AHA
W
S
T
H A
M P
B : page size
O
A : compiler
B : assembler
C : loader
D : interpreter
D : no error occurs
A : Bit tables
C : Indexing
D : Free Block List
AHA
W
S
AT
H
Belady’s Anomaly?
M P
O
B : LRU
C : FIFO

A : Stack
B : Queue
C : Linked list
A
AH
S W
T
D : Both 1 & 2
H A
M P
O
specification.
A : START
B : END
C : ORIGIN
A : Bit tables

C : Indexing
D : Free Block List
D : PL domain only
A
AH
A : compilation
S W
B : execution
T
C : loading
H A
D : linking
M P
O
D : data dependant
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

B : Syntax analysis
AHA
W
A : FCFS
S
B : SJF
AT
C : RR
P H
D : priority
O M
A : segmentation
B : swapping
B : control program
D : All
A : Machine code
D : A parse tree
A
AH
A : PS
S W
B : TOP
T
C : fork
H A
D : kill
M P
O
B : File system
in memory is called
A : demand paging
B : virtual memory

A : assembler
B : compiler
C : loader
A
D : interpreter
AH
W
S
A : Exceptions
AT
B : Signal handling
P H
C : Interrupts
O M
D : DMA
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : wait queue
B : ready queue
C : cpu

A : SJF-P
B : FCFS
A
C : RR
AH
D : Priority
S W
T
A : frame bit
H A
B : page number
M P
C : page offset
O
D : frame offset
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
Q.no 18. A macro is
A : Text editor
B : Assembler
C : Linker
D : Loader
A : END
B : ENDS
A
C : MEND
AH
D : ENDD
S W
T
A : cpu
H A
B : primary memory
M P
O

A
C : both 1 & 2
AH
D : function
S W
T
A : Source code
H A
M P
C : Target code
O
D : tokens
D : a key & value
A : error
B : protection
D : access
A
AH
S W
T
A
P H
O M
D : Both 1 & 2
C : lexical errors

AHA
W
D : something else
S
AT
H
algorithm
M P
O
algorithm
A : START
B : BEGIN
C : MACRO

A : system software
C : both 1 & 2
D : not a software
A
AH
W
S
AT
D : Both 1 & 2
P H
O M
A : minimum
B : average
C : maximum
D : approximate
A : Bit tables
C : Indexing
D : Free Block List
A
D : translator
AH
W
S
time.
T
A : Indexed files
H A
B : Direct files
M P
O

D : resources
A : Counters
B : RAM & Registers
D : Registers
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A
AH
S W
T
A
P H
O M




program
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
AHA
D : add-front
W
S
performed by
T
A : Absolute Loader
H A
B : Loader
M P
C : Linker
O
D : Assembler
A : Second pass
B : First pass
C : Zeroth pass

A : works well
A
AH
S W
T
H A
A : Bit tables
M P
O
C : Indexing
D : Free Block List
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
Answer for Question No 1. is d
Answer for Question No 2. is c
Answer for Question No 3. is b
A
W AH
AT S
P H
O M

Answer for Question No 20. is a
A
AH
T S W
P H A
O M

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O
Seat No -

Time : 1hr
Max Marks : 50
N.B
AHA
S W
AT
H
P
O M
B : Syntax trees

A : all process
C : parent process
D : init process
A
AH
S W
T
H A
M P
O
A : FCFS
B : SJF
C : RR
D : priority

occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
3
A : Identifier
C : Integer Literal
AHA
W
S
AT
P H
A : frame bit
O M
B : page number
C : page offset
D : frame offset
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : Parser
A
AH
C : Code generator
S W
T
A
P H
A : word proccessor
O M
B : spreadsheet
D : Unix
A : Left to right
C : Right to left
A : SJF-P
B : FCFS
C : RR
D : Priority
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
track is known as
A
A : seek time
AH
S W
C : access time
T
D : Transfer time
H A
M P
O
B : page-fault rate
C : hit ratio
D : Both 1 & 2

A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A
AH
S W
T
H A
P
O M
A : START
B : BEGIN
C : MACRO

C : both 1 & 2
D : function
A
AH
S W
C : <macro name>
T
D : <call macro>
H A
M P
O
A : Dos
B : Unix
C : System software
A : error
B : protection
D : access
A : Identifiers
B : Constants
C : Keywords
AHA
W
S
AT
P H
O M
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK

A
AH
dynamic loading
S W
T
H A
M P
O
A : Bit table
C : Indexing
D : Free Block List

A
AH
S W
AT
P H
O M
D : resources
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Bit tables
C : Indexing
D : Free Block List

A : compiler
B : assembler
C : loader
D : interpreter
AHA
B : page size
W
S
AT
H
M P
A : write ahead
O
B : read ahead
C : free-behind
D : add-front
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Stack
B : Queue
C : Linked list
AHA
W
S
AT
P H
O M



program
D : PL domain only

A : works well
A
AH
S W
AT
P H
B : Syntax analysis
O M
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
AHA
B : blocking I/O
W
S
D : synchronous I/O
AT
P H
A : Interrupts
O M
B : Memory mapping
D : DMA
B : code generation
C : syntax analysis
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Machine code
D : A parse tree
A
AH
S W
T
H A
M P
O
in memory is called
A : demand paging
B : virtual memory
C : instruction
D : Opcodes
B : control program
D : All
A
A : assembler
AH
B : compiler
S W
C : loader
T
D : interpreter
H A
M P
O

D : Both 1 & 3
Q.no 16. A macro is
A
A : END
AH
B : ENDS
S W
C : MEND
T
D : ENDD
H A
M P
O
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
Q.no 20. SJF can be
A : preemptive only

D : sequential
algorithm
algorithm
A
AH
S W
T
C : lexical errors
H A
M P
O
D : expanding macro
B : Compaction
D : Division
AHA
S W
A : procedure
T
B : subroutine
H A
C : macro
M P
O
C : seek time
page
A : is in the TLB
B : has data in it
A : file extension
C : file name
AHA
W
S
AT
P H
O M
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : SCAN
D : Circular SCAN
performed by
B : Syntax analysis
A : YACC
B : BISON
A
C : FLEX
AH
D : Iburg
S W
T
H A
M P
O
D : code generation

A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
T
category of 'var1 '
H A
A : Identifier
M P
B : Number
O
C : Keyword
D : operator
A : minimum
B : average
C : maximum
D : approximate
A : compilation
B : execution
C : loading
D : linking
D : no error occurs
AHA
A : Second pass
W
B : First pass
S
C : Zeroth pass
AT
P H
O M
D : translator
Belady’s Anomaly?
B : LRU
C : FIFO
D : Both 1 & 2
A
AH
specification.
W
A : START
S
B : END
AT
C : ORIGIN
P H
O M
D : data dependant

A : Bit tables
C : Indexing
A
D : Free Block List
AH
W
S
A : Counters
AT
B : RAM & Registers
P H
O M
D : Registers
time.
A : Indexed files
B : Direct files

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A
AH
D : PL domain only
S W
occurs?
AT
A : FIFO
P H
B : LRU
O M
C : LFU
D : NRU
A : object code
D : machine code
3
A : Identifier
C : Integer Literal
B : Syntax trees
A
AH
S W
T
H A
A : Myfile.e
M P
B : Myfile.yy.c
O
C : Myfile.lex
D : Myfile.obj
A : segmentation
B : swapping

A : all process
C : parent process
D : init process
AHA
W
S
AT
P H
A : macro prototype
O M
D : macro call
A : Text editor
B : Assembler
C : Linker
D : Loader
A
AH
S W
T
H A
M P
O
A : System call
B : API
C : library
D : shell

B : File system
A
A : wait queue
AH
B : ready queue
S W
C : cpu
T
H A
M P
O
D : Both 1 & 2
A : system software
C : both 1 & 2
D : not a software

A : Paging
B : Demand paging
C : Segmentation
D : Swapping
AHA
A : Source code
W
S
C : Target code
AT
D : tokens
P H
O M
D : a key & value
A : cpu
B : primary memory

space of a process
A
AH
W
S
AT
P H
D : something else
O M
C : both 1 & 2
D : function
A : Parser
B : Optimizer
C : Scanner
D : Loader
the jobs.
AHA
D : critical ratio
W
S
AT
P H
O M
A : Bit table
C : Indexing
D : Free Block List

A : USING
B : BALR
A
C : DROP
AH
D : ORG
S W
T
A : Attributes
H A
B : Protocol
M P
C : Location
O
D : Ownership
A : works well
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
AHA
W
S
AT
P H
O M
A : Stack
B : Queue
C : Linked list
B : Syntax analysis
AHA
W
S
AT
P H
O M



program

D : resources
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
AHA
B : assembler
W
C : loader
S
D : interpreter
AT
P H
O M
B : page size

AHA
A : write ahead
W
B : read ahead
S
C : free-behind
AT
D : add-front
P H
M
O
A : Bit tables
C : Indexing
D : Free Block List
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

track is known as
A : seek time
C : access time
AHA
D : Transfer time
W
S
A : Left to right
AT
P H
C : Right to left
O M
A : entire thread
D : entire process
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : PS
B : TOP
A
C : fork
AH
D : kill
S W
T
H A
M P
O
A : assembler
B : compiler
C : loader
D : interpreter
A : job queue
B : ready queue
C : execution queue
D : process queue
A
AH
S W
AT
P H
B : Logical I/O
O M
C : Device I/O
A : waiting time
B : turnaround time
C : response time
D : throughput
D : Round Robin
A
AH
S W
T
H A
A : Stop
M P
B : Return
O
C : OP
D : End
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : Interrupts
B : Memory mapping
D : DMA
A
AH
S W
T
A
P H
O M
D : Both 1 & 2
D : expanding macro
A
AH
S W
C : process
T
H A
M P
O
C : seek time
time?

AHA
A : file extension
W
S
C : file name
AT
P H
M
page
O
A : is in the TLB
B : has data in it
performed by
B : Syntax analysis
A : magnetic disks
C : assemblies
D : cylinders
A
AH
W
S
AT
C : SCAN
P H
D : Circular SCAN
O M
C : seek time
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A
D : data dependant
AH
S W
T
H A
M P
O
A : Bit tables
C : Indexing
D : Free Block List
Belady’s Anomaly?
B : LRU
C : FIFO
A
AH
S W
T
A : Second pass
H A
B : First pass
M P
C : Zeroth pass
O
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
time.
A : Indexed files
B : Direct files

D : PL domain only
A : works well
A
AH
S W
T
A
H
M P
A : minimum
O
B : average
C : maximum
D : approximate
A : compilation
B : execution
C : loading
D : linking

D : translator
D : no error occurs
A
AH
A : Counters
S W
B : RAM & Registers
T
H A
D : Registers
M P
O
D : Both 1 & 2
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
AHA
S W
A : Double buffer
T
B : Single buffer
H A
C : Linear buffer
M P
D : Circular buffer
O
B : Syntax trees
A
AH
W
S
A : Assembler
AT
B : Linking loader
P H
C : Cross compiler
O M
D : Load and Go
A : Text editor
B : Assembler
C : Linker
D : Loader
B : File system
in memory is called
A : demand paging
B : virtual memory
AHA
W
S
AT
P H
O M
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
A : segmentation
B : swapping

Q.no 14. SJF can be
A : preemptive only
D : sequential
A : Machine code
A
AH
S W
D : A parse tree
T
H A
M P
O
A : macro prototype
D : macro call
C : instruction
D : Opcodes
A : Swapping
AHA
B : Spooling
W
C : Semaphore
S
D : Scheduler
AT
H
M P
O
A
AH
S W
C : <macro name>
T
D : <call macro>
H A
M P
O
D : code generation
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Dos
B : Unix
C : System software
A
AH
S W
T
H A
M P
A : any language
O
C : c language
A : key
B : value
C : bit value
D : constant
A
A : YACC
AH
B : BISON
S W
C : FLEX
T
D : Iburg
H A
P
O M
D : something else
the jobs.

D : critical ratio
C : lexical errors
A
AH
A : Indexed files
S W
B : Direct files
T
H A
M P
O
A : Bit tables
C : Indexing
D : Free Block List

A : write ahead
B : read ahead
C : free-behind
AHA
D : add-front
W
S
category of 'var1 '
T
A : Identifier
H A
B : Number
M P
C : Keyword
O
D : operator
A : Bit tables
C : Indexing
D : Free Block List

A : Stack
B : Queue
C : Linked list
specification.
A : START
B : END
AHA
C : ORIGIN
W
S
AT
P H
O M
A : compiler
B : assembler
C : loader
D : interpreter

B : Syntax analysis
AHA
W
S
AT
H
M P
O


program

D : resources

B : page size
A
D : PL domain only
AH
S W
A : Lex
T
B : Yacc
H A
C : Iburg
M P
D : both 1 & 3
O
D : no error occurs
12/25/2020 https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5843&code=1052000&showTest=319&actForm=edit&set=30
Seat No -

Time : 1hr
Max Marks : 50
N.B
A
AH
S W
T
H A
P
M
O
Q.no 1. what consists of all processes whose memory images are in the backing store or in
memory and are ready to run.
A : wait queue
B : ready queue
C : cpu
Q.no 2. A macro can be defined at
Q.no 3. The system is notified of a read or write operation by
https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=5843&code=1052000&showTest=319&actForm=edit&set=30 1/362
A : END
B : ENDS
A
C : MEND
AH
D : ENDD
W
T S
H A
P
O M
A : Text editor
B : Assembler
C : Linker
D : Loader
B : FIFO policy (First in first out)
Q.no 8. Which of the following type of software should be used if you need to create,edit and
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : System call
B : API
A
C : library
AH
D : shell
W
Q.no 10. Output file of Lex is , if the input file is Myfile.
T S
A : Myfile.e
H A
B : Myfile.yy.c
P
C : Myfile.lex
O M
D : Myfile.obj
Q.no 11. Which module deals with the device as a logical resource and is not concerned with the
details of actually controlling the device.
B : Logical I/O
C : Device I/O
Q.no 12. A set of techniques that allow to execute a program which is not entirely in memory is
called
A : demand paging
B : virtual memory
A : macro prototype
B : macro definition
C : macro identification
D : macro call
A
AH
W
Q.no 15. A system program that combines the separately compiled modules of a program into a
S
form suitable for execution ?
AT
A : Assembler
P H
B : Linking loader
M
C : Cross compiler
O
D : Load and Go
A : PS
B : TOP
C : fork
D : kill
Q.no 17. The interval from the time of submission of a process to the time of completion is
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : object code
D : machine code
A
AH
D : A part of the memory is specifically set aside for the I/O operation
W
T S
H A
P
O M
A : Identifiers
B : Constants
C : Keywords
A : key
B : value
C : bit value
D : constant
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
A
AH
W
T S
H A
C : process
P
O M
Q.no 27. When the valid – invalid bit is set to valid, it means that the associated page
A : is in the TLB
B : has data in it
Q.no 28. In segmentation, each address is specified by
D : a key & value
A : setting initial value of LC and specifies start of program
C : specifies start of literal table
D : specifies start of symbol table
A
Q.no 30. Which of the following derivation a top-down parser use while parsing an input string?
AH
The input is assumed to be scanned in left to right order ?
S W
AT
P H
M
O
A : file extension
B : file identifier
C : file name
Q.no 32. In which algorithm, the disk arm starts at one end of the disk and moves toward the
other end, servicing requests till the other end of the disk. At the other end, the direction is
reversed and servicing continues.
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Indexed files
B : Direct files
C : Sequential files
D : Indexed Sequential files
A
AH
W
A : Compiler
T S
B : Interpreter
H A
C : Assembler
P
D : Loader
O M
Q.no 36. The strategy of making processes that are logically runnable to be temporarily
suspended is called
C : Shortest job first
Q.no 38. If a number of instructions are repeating through the main program, then what is to be
used to reduce the length of the program
A : procedure
B : subroutine
C : macro
A : any language
C : c language
A
AH
W
A : a position of memory is wasted because the case occupied by the assembler is unavailable the
S
object program
AT
P H
M
D : Both 1 & 2
O
D : translator
D : PL domain only
Q.no 43. The minimum number of page frames that must be allocated to a running process in a
virtual memory environment is determined by
B : page size
Q.no 44. Given a priori information about the number of resources of each type that maybe
requested for each process, it is possible to construct an algorithm that ensures that the system
will never enter a deadlock state.
A : minimum
B : average
A
C : maximum
AH
D : approximate
W
Q.no 45. These file are often used where very rapid access is required, where fixed length records
S
are used, and where records are always accessed one at a time.
AT
A : Indexed files
P H
B : Direct files
M
O
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
Q.no 48. If linked origin is not equal to translated address then relocation is performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A
AH
W
T S
H A
P
O M
Q.no 53. When expression "int var1,var2;' is tokenized then what is the token category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
Q.no 54. Which method on free space management, each block is assigned in a reserved portion
of the disk.
A : Bit tables
C : Indexing
AHA
D : Free Block List
Q.no 55. Segment replacement algorithms are more complex than page replacement algorithms
W
because
T S
H A
P
O M
D : Segments have fixed sizes
Q.no 57. When a program tries to access a page that is mapped in address space but not loaded in
physical memory, then what occurs
D : no error occurs
Q.no 58. In the optimized technique for sequential access removes a page from the buffer as soon
as the next page is requested.
A : write ahead
B : read ahead
C : free-behind
D : add-front
A
AH
W
T S
A : Stack
H A
B : Queue
P
C : Linked list
O M
12/25/2020 https://sppu.wheebox.com/WAC-3/openanswers.obj
A
W AH
AT S
P H
O M
https://sppu.wheebox.com/WAC-3/openanswers.obj 1/110
AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M
AHA
S W
H AT
M P
O
AHA
W
T S
A
P H
O M
D : Both 1 & 3
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
A : assembler
B : compiler
C : loader
D : interpreter
A : segmentation
A
B : swapping
AH
S W
D : multiple fixed contiguous partitions
AT
P H
M
O
Q.no 9. When expression sum=3+2 is tokenized then what is the token category of 3
A : Identifier
C : Integer Literal
Q.no 10. The process wherein the processor constantly checks the status flags is called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A
AH
S W
Q.no 13. Which scheduling algorithm allocates the CPU first to the process that requests the CPU
T
first?
A
A : first-come, first-served scheduling
P H
O M
D : Round Robin
Q.no 14. Grammar of the programming is checked at phase of compiler
B : code generation
C : syntax analysis
Q.no 15. On a movable head system, the time it takes to position the head at the track is known
as
A : seek time
C : access time
D : Transfer time

A : FIFO rule (First in first out)
A
AH
S W
AT
P H
M
O
A : Left to right
C : Right to left
Q.no 20. In which of the following page replacement policies Balady’s anomaly occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
Q.no 21. The policy used to select the disk I/O request that requires the least movement of the
disk arm from its current position is
A : Last in first out
B : Shortest service time first
Q.no 22. Yacc resolves conflicts by of type ?
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
AHA
D : Both A and B
W
T S
H A
P
C : seek time
M
O
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : processes are classified into groups
Q.no 26. The portion of the process scheduler in an operating system that dispatches processes is
concerned with
Q.no 27. A multilevel page table is preferred in comparison to a single level page table for
translating virtual address to physical address because
B : it helps to reduce the size of page table needed to implement the virtual address space of a process
A
AH
Q.no 28. Which of the following isn’t a part of the file directory?
S W
A : Attributes
AT
B : Protocol
P H
C : Location
M
D : Ownership
O
A : using very large time slices converts it into First come First served scheduling algorithm
B : using very small time slices converts it into First come First served scheduling algorithm
Q.no 30. If the lexical analyser finds a lexeme with the same name as that of a reserved word,it
D : something else
C : lexical errors
Q.no 32. Recognition of basic syntactic constructs through reductions, this task is performed by
B : Syntax analysis
AHA
W
T S
H A
P
O M
A : Source code
C : Target code
D : tokens
Q.no 36. on free space management has the advantages that it relatively easy to find one or a
contiguous group of free blocks.
A : Bit table

C : Indexing
D : Free Block List
Q.no 37. The concept in which a process is copied into the main memory from the secondary
memory according to the requirement.
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A
Q.no 38. In which method, the file allocation table contains a separate one level index for each
AH
file, the index has one entry for each portion allocated to the file.
W
S
AT
P H
M
O
C : both 1 & 2
D : function
Q.no 40. When access is granted to append or update a file to more than one user, the OS or file
management system must enforce discipline. This is
B : Compaction
D : Division




program
A : Second pass
B : First pass
A
C : Zeroth pass
AH
W
T S
A : compilation
H A
B : execution
P
C : loading
O M
D : linking
Q.no 44. s free space management has the advantages that it relatively easy to find one or a
A : Bit tables
C : Indexing
D : Free Block List
Q.no 45. Which of the following page replacement algorithms suffers from Belady’s Anomaly?
B : LRU
C : FIFO

AHA
S W
AT
P H
D : Both 1 & 2
M
Q.no 49. A deadlock avoidance algorithm dynamically examines the state to ensure that a
O
circular wait condition can never exist.
D : resources
Q.no 50. Each request requires that the system consider to decide whether the current request
can be satisfied or must wait to avoid a future possible deadlock.
A : works well

A
Q.no 53. which directive sets the LC with address specified with address specification.
AH
A : START
W
B : END
T S
C : ORIGIN
H A
P
Q.no 54. In free space management, which method has negligible space overhead because there is
M
no need for a disk allocation table, merely for a pointer to the beginning of the chain and the
O
length of the first portion.
A : Bit tables
C : Indexing
D : Free Block List
Q.no 55. What are the two methods of the LRU page replacement policy that can be implemented
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
Q.no 57. Analysis which determines the meaning of a statement once its grammatical structure
becomes known is termed as
B : Syntax analysis
A
Q.no 58. A grammar that produces more than one parse tree for some sentence is called
AH
A : Ambiguous
W
B : Unambiguous
T S
C : Regular
H A
D : None of these
P
O M
AHA
S W
H AT
M P
O

A
AH
S W
H AT
M P
O

A
AH
T S W
P H A
O M

AHA
T S W
P H A
O M
Q.no 2. The processes that are residing in main memory and are ready and waiting to execute are
A
kept on a list called
AH
A : job queue
S W
B : ready queue
AT
C : execution queue
H
D : process queue
P
O M
A : Interrupts
B : Memory mapping
D : DMA
Q.no 4. The method of synchronizing the processor with the I/O device in which the device sends
a signal when it is ready is?
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : entire thread
B : first page of a process
D : entire process
A : macro prototype
AHA
W
S
D : macro call
AT
P H
M
O
C : instruction
D : Opcodes

A : FCFS
B : SJF
C : RR
D : priority
Q.no 12. Which technique is used for temporarily removing inactive programs from the memory
of computer system
A : Swapping
B : Spooling
AHA
C : Semaphore
W
D : Scheduler
T S
H A
A : Stop
P
B : Return
O M
C : OP
D : End
Q.no 14. Which algorithm is defined in Time quantum?
B : page-fault rate
C : hit ratio
AHA
Q.no 18. syntax analyzer or parser takes the input from a
S W
AT
P H
M
O
Q.no 19. Which module gives control of the CPU to the process selected by the short-term
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : is in the TLB
B : has data in it
Q.no 22. Orders are processed in the sequence they arrive if , this rule sequences the jobs.
C : first come, first served
D : critical ratio
AHA
W
A : magnetic disks
T S
H A
C : assemblies
P
D : cylinders
O M
Q.no 24. In this policy, when the last track has been visited in one direction, the arm is returned
to the opposite end of the disk and the scan begins again.
C : SCAN
D : Circular SCAN
C : process

A : error
B : protection
D : access
A
Q.no 28. Which of the following algorithms tends to minimize the process flow time?
AH
W
T S
H A
P
Q.no 29. The file name is generally split into two parts :
O M
A : name & identifier
B : identifier & type
D : priority
A : USING
B : BALR
C : DROP
D : ORG
D : expanding macro

A : any language
AHA
C : c language
S W
AT
P H
M
O
C : defining a string macro
D : defining a macro

A : first executes the job that came in last in the queue
B : first executes the job that came in first in the queue
C : first executes the job that needs minimal processor
D : first executes the job that has maximum processor needs

A
AH
W
Q.no 39. The real difficulty with SJF in short term scheduling is
T S
H A
P
O M
A : procedure
B : subroutine
C : macro

D : PL domain only
A : Stack
B : Queue
C : Linked list
A
AH
S W
AT
P H
M
D : no error occurs
O
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
AHA
of the disk.
W
A : Bit tables
T S
H A
C : Indexing
P
D : Free Block List
O M
B : page size
D : data dependant
because
A
AH
W
A : minimum
T S
B : average
H A
C : maximum
P
D : approximate
O M




program
A : compilation
B : execution
C : loading
D : linking
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
AHA
S W
AT
A : compiler
P H
B : assembler
M
C : loader
O
D : interpreter
D : translator
AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M


A
W AH
AT S
P H
O M
AHA
S W
H AT
M P
O
Q.no 1. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
compared with the priority of
A : all process
C : parent process
A
D : init process
AH
Q.no 2. When a user process issues an I/O request, the operating system assigns a buffer in the
W
system portion of main memory to the operation is called
S
A : Double buffer
AT
B : Single buffer
P H
: Linear buffer D
O M
: Circular buffer
A : Parser
C : Code generator
Q.no 6. The interval from the time of submission of a process to the time of completion is termed
as
A : waiting time
B : turnaround time
C : response time
A
D : throughput
AH
S W
A : System call
AT
B : API
P H
C : library
M
D : shell
O
Q.no 8. SJF can be
A : preemptive only
D : sequential
Q.no 9. A macro is
C : a unit of specification for program generation through expansion
B : blocking I/O
D : synchronous I/O
A : Postfix notation
B : Syntax trees
D : Prefix notation
A
as
AH
A : seek time
S W
T
C : access time
H A
D : Transfer time
P
O M
A : cannot be used with fixed partitions
D : can be loaded only at one specific location
called
A : demand paging
B : virtual memory
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : code generation
C : syntax analysis
A : Left to right
AHA
C : Right to left
S W
AT
P H
A : PS
M
B : TOP
O
C : fork
D : kill
A : Machine code
D : A parse tree
A : a process can move to a different classified ready queue
B : classification of ready queue is permanent
AHA
C : processes are not classified into groups
W
T S
H A
P
O M
A : can not be made to exercise in any area of storage other than the one designated for it at the time of
its coding or translation
D : Both 1 & 2
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : cpu
B : primary memory
AHA
S W
AT
P H
M
O
B : Syntax analysis
A : file extension
B : file identifier
C : file name
AHA
S W
AT
P H
M
O
D : code generation
Q.no 36. To obtain better memory utilization, dynamic loading is use With dynamic loading, a
routine is not loaded until it is calle For implementing dynamic loading
D : user programs can implement dynamic loading without any special support from hardware or
operating system
Q.no 37. The beginning of the macro definition can be represented as
A : START
B : BEGIN
C : MACRO
A
AH
W
A : Dos
T S
B : Unix
H A
C : System software
P
O M
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
Q.no 40. Process are classified into different groups in
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A
AH
W
T S
H A
P
O M
A : START
B : END
C : ORIGIN
B : Syntax analysis
A
AH
W
T S
H A
P
M
O
D : resources
A : Second pass
B : First pass
C : Zeroth pass

D : Both 1 & 2
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A
AH
W
T S
H A
P
M
A : Bit tables
O
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter

A : Ambiguous
AHA
B : Unambiguous
C : Regular
S W
D : None of these
AT
P H
A : Stack
M
B : Queue
O
C : Linked list
D : data dependant

AHA
T S W
P H A
O M
A
W AH
AT S
P H
O M

A
W AH
AT S
P H
O M
AHA
S W
H AT
M P
O
A
AH
S W
AT
P H
M
A : END
O
B : ENDS
C : MEND
D : ENDD
Q.no 5. Which layer deals with the logical structure of files and with the operations that can be
specified by users such as open, close, read and write.
B : File system
A : segmentation
B : swapping
A
A : Exceptions
AH
B : Signal handling
W
C : Interrupts
T S
D : DMA
H A
P
A : Stop
O M
B : Return
C : OP
D : End
A : Text editor
B : Assembler
C : Linker
D : Loader
B : control program
D : All
AHA
W
T S
H A
P
O M
A : FIFO
B : LRU
C : LFU
D : NRU
B : page-fault rate
C : hit ratio
AHA
S W
A : Identifier
AT
P H
C : Integer Literal
M
O
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code

AHA
A : Attributes
B : Protocol
S W
C : Location
AT
D : Ownership
P H
O M
C : SCAN
D : Circular SCAN
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
Q.no 26. a part of a compiler that takes as input a stream of characters and produces
output as a meaningful token .
A : Parser
B : Optimizer
C : Scanner
D : Loader
B : statement
C : Numeric data
D : ASCII data
A
AH
A : YACC
W
B : BISON
T S
C : FLEX
H A
D : Iburg
P
O M
A : key
B : value
C : bit value
D : constant
A : Bit table
C : Indexing
D : Free Block List

A
object program
AH
S W
AT
D : Both 1 & 2
P H
M
A : Identifiers
O
B : Constants
C : Keywords
C : both 1 & 2
D : function
C : seek time
A
AH
W
D : priority
T S
H A
A : Source code
P
O M
C : Target code
D : tokens
A : write ahead
B : read ahead
C : free-behind
D : add-front


A : compilation
B : execution
A
C : loading
AH
D : linking
W
S
because
AT
P H
M
O
A : Identifier
B : Number
C : Keyword
D : operator
B : Syntax analysis
A : Indexed files
B : Direct files
AHA
S W
AT
A : works well
P H
M
O
A : minimum
B : average
C : maximum
D : approximate



program
AHA
W
T S
H A
P
O M
A : START
B : END
C : ORIGIN

D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
AHA
B : LRU
C : FIFO
S W
AT
P H
M
O
D : translator
AHA
T S W
A
P H
O M
AHA
S W
AT
P H
O M
AHA
W
AT S
P H
O M
AHA
S W
H AT
M P
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A
AH
W
T S
H A
P
M
O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Syntax trees
D : Prefix notation
A : Machine code
D : A parse tree
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A
A : assembler
AH
B : compiler
W
C : loader
T S
D : interpreter
H A
P
first?
M
O
D : Round Robin
A : wait queue
B : ready queue
C : cpu
A : macro prototype
D : macro call
Q.no 12. The processes that are residing in main memory and are ready and waiting to execute
are kept on a list called
A
A : job queue
AH
B : ready queue
W
C : execution queue
T S
D : process queue
H A
P
O M
D : Both 1 & 3
Q.no 14. A macro is
A : System call
B : API
C : library
D : shell
Q.no 16. SJF can be
A : preemptive only
D : sequential

AHA
C : instruction
D : Opcodes
S W
T
called
H A
A : demand paging
P
B : virtual memory
O M
B : Logical I/O
C : Device I/O
B : blocking I/O
D : synchronous I/O
D : critical ratio
B : Syntax analysis
A
AH
W
T S
H A
P
O M
A : cpu
B : primary memory
A : procedure
B : subroutine
C : macro
A : system software
C : both 1 & 2
D : not a software

AHA
W
T S
H A
P
O M
C : <macro name>
D : <call macro>
A : file extension
B : file identifier
C : file name
B : Compaction
D : Division
A
AH
S W
AT
P H
M
O
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
suspended is called
A
AH
W
T S
H A
P
M
O
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : START
B : BEGIN
C : MACRO

of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A
AH
W
T S
H A
D : Both 1 & 2
P
O M
A : Stack
B : Queue
C : Linked list
D : data dependant
D : resources
AHA
T S W
P H A
O M
D : PL domain only
A
AH
W
T S
H A
A : compiler
P
B : assembler
O M
C : loader
D : interpreter
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : page size
A
A : Bit tables
AH
W
C : Indexing
T S
D : Free Block List
H A
P
A : Absolute Loader
O M
B : Loader
C : Linker
D : Assembler
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Second pass
B : First pass
C : Zeroth pass
A
A : works well
AH
W
T S
H A
P
O M




program
AHA
T S W
P H A
O M

AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M


A
W AH
AT S
P H
O M
Q.no 2. On a movable head system, the time it takes to position the head at the track is known as
A : seek time
AHA
C : access time
D : Transfer time
S W
AT
A : Polling
P H
B : Inspection
M
C : Reviewing
O
D : Echoing
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : PS
B : TOP
C : fork
D : kill
B : control program
AHA
D : All
S W
AT
P H
M
O
A : Interrupts
B : Memory mapping
D : DMA
A : Stop
B : Return
C : OP
D : End
A
AH
A : END
W
B : ENDS
T S
C : MEND
H A
D : ENDD
P
O M
A : SJF-P
B : FCFS
C : RR
D : Priority
Q.no 16. In priority scheduling algorithm, when a process arrives at the ready queue, its priority
is compared with the priority of
A : all process
C : parent process
D : init process
A
AH
S W
B : File system
AT
P H
M
O
A : frame bit
B : page number
C : page offset
D : frame offset
A
AH
A : Compiler
W
B : Interpreter
T S
C : Assembler
H A
D : Loader
P
O M
C : process
A : magnetic disks
C : assemblies
D : cylinders
A
A : key
AH
B : value
W
C : bit value
T S
D : constant
H A
P
O M
C : seek time
A : any language
C : c language
D : expanding macro
A
AH
C : lexical errors
W
T S
H A
A : Indexed files
P
B : Direct files
O M
A : USING
B : BALR
C : DROP
D : ORG
operating system
A : Source code
C : Target code
D : tokens
A
AH
W
T S
H A
A : is in the TLB
P
B : has data in it
O M
object program
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
A
AH
W
T S
D : translator
H A
P
O M
B : LRU
C : FIFO
A : Identifier
B : Number
C : Keyword
D : operator
A
AH
W
T S
H A
A : compilation
P
B : execution
O M
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
AHA
A : Indexed files
B : Direct files
S W
AT
P H
O M
B : Syntax analysis
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front
AHA
A : START
S W
B : END
AT
C : ORIGIN
P H
M
O
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
AHA
S W
H AT
M P
O


AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M

AHA
T S W
P H A
O M
A : object code
D : machine code
A : Double buffer
A
B : Single buffer
AH
C : Linear buffer
W
D : Circular buffer
T S
H A
P
B : page-fault rate
O M
C : hit ratio
A : macro prototype
D : macro call
AHA
S W
AT
B : Syntax trees
P H
M
D : Prefix notation
O
A : System call
B : API
C : library
D : shell
A : FCFS
B : SJF
C : RR
D : priority
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
Q.no 12. A macro is
A
AH
W
T S
H A
P
O M
C : instruction
D : Opcodes
B : blocking I/O
D : synchronous I/O
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A
termed as
AH
A : waiting time
W
B : turnaround time
T S
C : response time
H A
D : throughput
P
Q.no 19. SJF can be
O M
A : preemptive only
D : sequential
A : Identifier
C : Integer Literal
A : Bit table
C : Indexing
D : Free Block List
A : Attributes
B : Protocol
C : Location
D : Ownership
A
AH
concerned with
S W
AT
P H
M
O
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A
AH
S W
AT
P H
D : Both 1 & 2
M
O
B : Syntax analysis
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A
D : something else
AH
S W
A : Reduce - Reduce
AT
B : Shift - Reduce
P H
C : Shift - Shift
M
D : Both A and B
O
A : file extension
B : file identifier
C : file name
A
AH
W
T S
H A
P
O M
D : code generation
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A
D : data dependant
AH
W
A : compiler
T S
B : assembler
H A
C : loader
P
D : interpreter
O M
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A
AH
A : Bit tables
S W
AT
C : Indexing
P H
D : Free Block List
M
O
A : works well
A : minimum
B : average
C : maximum
D : approximate
D : resources
A : Second pass
B : First pass
C : Zeroth pass
A
AH
W
A : Stack
T S
B : Queue
H A
C : Linked list
P
O M
D : Both 1 & 2
B : page size


A
AH
W
S
program
AT
P H
M
O
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
B : Syntax analysis
A
W AH
AT S
P H
O M
AHA
S W
H AT
M P
O
AHA
S W
H AT
M P
O
AHA
T S W
P H A
O M
A : Left to right
C : Right to left
A : entire thread
A
AH
W
D : entire process
T S
H A
P
O M
A : wait queue
B : ready queue
C : cpu
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
print document ?
A
A : word proccessor
AH
B : spreadsheet
W
T S
D : Unix
H A
P
O M
first?
D : Round Robin
A : assembler
B : compiler
C : loader
D : interpreter
A
AH
B : code generation
W
C : syntax analysis
T S
H A
P
O M
A : SJF-P
B : FCFS
C : RR
D : Priority
A : all process
C : parent process
D : init process
A : Myfile.e
AHA
B : Myfile.yy.c
C : Myfile.lex
S W
D : Myfile.obj
AT
P H
A : Machine code
M
O
D : A parse tree
A : Source code
C : Target code
D : tokens
A
AH
W
D : priority
T S
H A
P
O M
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
suspended is called
AHA
S W
AT
P H
M
O
C : process
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A
AH
W
T S
A
P H
M
O
operating system
A : system software
C : both 1 & 2
D : not a software
A : USING
B : BALR
C : DROP
D : ORG
A
AH
W
D : critical ratio
T S
H A
P
O M
C : seek time
B : Compaction
D : Division
A : Bit tables
C : Indexing
D : Free Block List
A
AH
W
T S
H A
P
O M
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : Lex
AHA
B : Yacc
C : Iburg
S W
D : both 1 & 3
AT
P H
M
O
D : translator
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A
A : write ahead
AH
B : read ahead
W
C : free-behind
T S
D : add-front
H A
P
M
O
D : no error occurs
B : LRU
C : FIFO
A : START
B : END
C : ORIGIN
because
A
AH
W
T S
H A
P
O M
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
AHA
T S W
P H A
O M
A
W AH
AT S
P H
O M
AHA
S W
H AT
M P
O
AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M
C : instruction
D : Opcodes
A : Double buffer
A
B : Single buffer
AH
C : Linear buffer
S W
D : Circular buffer
AT
H
M P
O
D : Both 1 & 3
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Identifier
C : Integer Literal
A : FIFO
B : LRU
AHA
C : LFU
W
D : NRU
T S
H A
A : object code
P
O M
D : machine code
A : END
B : ENDS
C : MEND
D : ENDD
B : control program

D : All
B : blocking I/O
D : synchronous I/O
AHA
S W
AT
B : File system
H
M P
O
A : System call
B : API
C : library
D : shell
A : PS
B : TOP
C : fork
D : kill
A
of computer system
AH
A : Swapping
S W
B : Spooling
AT
C : Semaphore
H
D : Scheduler
M P
O
A : Stop
B : Return
C : OP
D : End
D : something else
A : Bit table
C : Indexing
D : Free Block List
A
AH
S W
AT
H
M P
O
B : statement
C : Numeric data
D : ASCII data
A : file extension
B : file identifier
C : file name
A : is in the TLB
B : has data in it
AHA
W
T S
A
P H
O M
C : lexical errors

D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
AHA
C : System software
W
T S
H A
P
O M
A : key
B : value
C : bit value
D : constant
AHA
W
S
AT
H
M P
O
A : START
B : BEGIN
C : MACRO

A : Bit tables
C : Indexing
D : Free Block List

A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
AHA
W
T S
A : Bit tables
A
P H
C : Indexing
O M
D : Free Block List
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
A : Identifier
B : Number
C : Keyword
D : operator
A : compiler
B : assembler
C : loader
AHA
D : interpreter
W
T S
H A
P
O M
A : Second pass
B : First pass
C : Zeroth pass
A : works well
A : Stack
B : Queue
C : Linked list
A
AH
S W
AT
P H
M
D : Both 1 & 2
O
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size



A
AH
W
S
program
T
H A
M P
O
D : PL domain only


AHA
T S W
P H A
O M
AHA
S W
H AT
M P
O


AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M
A : SJF-P
A
B : FCFS
AH
C : RR
S W
D : Priority
AT
H
A : Parser
M P
O
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
Q.no 7. SJF can be
A : preemptive only
AHA
W
D : sequential
T S
H A
P
O M
A : Machine code
D : A parse tree
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : all process
C : parent process
D : init process
B : code generation
A
C : syntax analysis
AH
S W
AT
P H
M
O
A : entire thread
D : entire process
as
A : seek time
C : access time
D : Transfer time
A : wait queue
B : ready queue
C : cpu
AHA
W
T S
A : Text editor
A
B : Assembler
P H
C : Linker
O M
D : Loader


B : Compaction
D : Division
AHA
W
A : YACC
T S
B : BISON
A
C : FLEX
P H
D : Iburg
O M
C : seek time
A : Identifiers
B : Constants
C : Keywords
C : SCAN
D : Circular SCAN
A
AH
S W
AT
H
M P
O
B : Syntax analysis
A : system software
C : both 1 & 2
D : not a software
A : Source code
C : Target code
D : tokens
suspended is called
A
AH
S W
AT
H
M P
O
C : seek time

A : Swapping
B : Paging
C : Segmentation
D : Demand paging

A
AH
D : code generation
S W
AT
A : Indexed files
P H
B : Direct files
M
O
A : procedure
B : subroutine
C : macro
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
A
D : resources
AH
W
because
T S
A
P H
O M

A : Absolute Loader
B : Loader
C : Linker
D : Assembler

B : Syntax analysis
A
AH
S W
AT
H
M P
O
D : translator
A : write ahead
B : read ahead
C : free-behind
D : add-front
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A
AH
W
A : Indexed files
T S
B : Direct files
A
P H
M
O
A : compilation
B : execution
C : loading
D : linking

D : PL domain only
A : Bit tables
C : Indexing
D : Free Block List
A
A : compiler
AH
B : assembler
S W
C : loader
AT
D : interpreter
H
P
O M
D : data dependant
AHA
S W
AT
P H
M
O

AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M


A
W AH
AT S
P H
O M
A
B : Syntax trees
AH
S W
D : Prefix notation
AT
H
A : PS
M P
B : TOP
O
C : fork
D : kill
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
A
C : scheduler
AH
D : interpreter
S W
AT
A : Myfile.e
H
B : Myfile.yy.c
M P
C : Myfile.lex
O
D : Myfile.obj
called
A : demand paging
B : virtual memory
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : Left to right
C : Right to left
AHA
W
T S
A : segmentation
H A
B : swapping
P
O M
D : Both 1 & 3
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
Q.no 16. The method of synchronizing the processor with the I/O device in which the device
sends a signal when it is ready is?
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : blocking I/O
A
D : synchronous I/O
AH
S W
AT
P H
M
O

A : frame bit
B : page number
C : page offset
D : frame offset
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : is in the TLB
B : has data in it
AHA
W
T S
H A
P
O M
D : Both 1 & 2

object program
D : Both 1 & 2
A : USING
B : BALR
C : DROP
D : ORG
A : cpu
AHA
B : primary memory
W
T S
H A
P
A : file extension
O M
B : file identifier
C : file name


D : a key & value
A
AH
S W
AT
P H
M
O

A : Dos
B : Unix
C : System software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : any language
C : c language
AHA
W
T S
H A
P
O M
operating system
A : minimum
B : average
C : maximum
D : approximate

A
AH
W
T S
A
program
P H
M
O
B : page size
AHA
A : Bit tables
W
T S
C : Indexing
A
D : Free Block List
P H
O M
A : Stack
B : Queue
C : Linked list
D : no error occurs

D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A
A : Ambiguous
AH
B : Unambiguous
S W
C : Regular
AT
D : None of these
H
M P
A : works well
O
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
AHA
C : Zeroth pass
W
T S
H A
P
O M
D : translator
A
AH
T S W
P H A
O M
AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M
AHA
S W
H AT
M P
O
AHA
W
T S
A
H
A : Assembler
M P
B : Linking loader
O
C : Cross compiler
D : Load and Go

A : entire thread
D : entire process
A : Text editor
B : Assembler
C : Linker
D : Loader
A : assembler
B : compiler
C : loader
AHA
D : interpreter
W
T S
A : object code
H A
P
O M
D : machine code


B : page-fault rate
C : hit ratio
AHA
W
B : control program
T S
H A
D : All
P
M
termed as
O
A : waiting time
B : turnaround time
C : response time
D : throughput
B : File system
Q.no 17. SJF can be
A : preemptive only
D : sequential
A
AH
A : job queue
S W
B : ready queue
AT
C : execution queue
H
D : process queue
M P
O
A : END
B : ENDS
C : MEND
D : ENDD
A : magnetic disks
C : assemblies
D : cylinders
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A
AH
S W
AT
H
M P
O
C : seek time
D : code generation
AHA
W
T S
A
H
M P
O
A : Attributes
B : Protocol
C : Location
D : Ownership
D : critical ratio
A : procedure
B : subroutine
C : macro
AHA
W
T S
H A
A : error
P
B : protection
M
O
D : access
D : priority
A : START
B : BEGIN
C : MACRO
AHA
W
T S
H A
P
O M
A : Parser
B : Optimizer
C : Scanner
D : Loader
D : resources
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : minimum
B : average
AHA
C : maximum
W
D : approximate
T S
A
P H
O M
D : PL domain only

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : compiler
B : assembler
A
C : loader
AH
D : interpreter
S W
T
A
A : write ahead
P H
B : read ahead
O M
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO

A : Absolute Loader
B : Loader
A
C : Linker
AH
D : Assembler
S W
T
A
A : Indexed files
P H
B : Direct files
O M
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
A
AH
D : data dependant
S W
T
because
A
P H
O M
A
W AH
T S
P H A
O M
AHA
T S W
P H A
O M
AHA
S W
H AT
M P
O

A
AH
S W
H AT
M P
O
A : segmentation
B : swapping
AHA
W
T S
H A
P
O M
B : blocking I/O
D : synchronous I/O
B : Logical I/O
C : Device I/O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
A
C : RR
AH
D : priority
S W
AT
P H
M
O
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Left to right
C : Right to left
A
AH
S W
A : FIFO
AT
B : LRU
P H
C : LFU
M
D : NRU
O
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Identifier
C : Integer Literal
B : code generation
C : syntax analysis
A : frame bit
B : page number
C : page offset
D : frame offset
AHA
A : macro prototype
W
T S
H A
D : macro call
P
O M
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Stop
B : Return
C : OP
D : End
A : Source code
C : Target code
D : tokens
D : Both 1 & 2
A
AH
S W
AT
D : expanding macro
H
M P
O
B : Syntax analysis
A : USING
B : BALR
C : DROP
D : ORG
C : seek time
D : something else
AHA
W
T S
A
H
suspended is called
M P
O

A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Bit table
AHA
W
C : Indexing
T S
D : Free Block List
A
P H
A : any language
O M
C : c language
C : SCAN
D : Circular SCAN
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
AHA
W
T S
H A
P
O M
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A
AH
S W
AT
P H
M
O
D : Both 1 & 2
A : START
B : END
C : ORIGIN
A : Stack
B : Queue
C : Linked list
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Identifier
B : Number
C : Keyword
D : operator
AHA
W
T S
H A
P
O M




program
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : works well
AHA
W
T S
H A
P
O M
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
A
B : Loader
AH
C : Linker
S W
D : Assembler
AT
H
A : Lex
P
B : Yacc
O M
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front
AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M


A
W AH
AT S
P H
O M
AHA
S W
H AT
M P
O
AHA
W
T S
H A
A : object code
P
O M
D : machine code
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
Q.no 6. A macro is

A : entire thread
D : entire process
AHA
W
T S
B : page-fault rate
H A
C : hit ratio
P
O M
A : Machine code
D : A parse tree
D : Both 1 & 3
as
A : waiting time
B : turnaround time
C : response time
D : throughput
AHA
A : System call
W
B : API
T S
C : library
H A
D : shell
P
O M
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin
Q.no 18. SJF can be
A
A : preemptive only
AH
S W
AT
D : sequential
H
P
called
O M
A : demand paging
B : virtual memory
A : END
B : ENDS
C : MEND
D : ENDD
A : is in the TLB
AHA
B : has data in it
W
S
H AT
P
O M

operating system
D : a key & value

A : Compiler
B : Interpreter
AHA
C : Assembler
W
D : Loader
T S
H A
P
O M
C : both 1 & 2
D : function
A : YACC
B : BISON
C : FLEX
D : Iburg
C : process
concerned with
A : cpu
B : primary memory
A
AH
S W
T
A
H
A : LOOK
M P
B : SCAN
O
C : C-SCAN
D : C-LOOK
A : Attributes
B : Protocol
C : Location
D : Ownership
object program
D : Both 1 & 2
A : Indexed files
A
B : Direct files
AH
S W
AT
H
A : system software
M P
O
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
D : Both 1 & 2
because
A
AH
S W
T
A
P H
B : Syntax analysis
O M
A : compiler
B : assembler
C : loader
D : interpreter
A : compilation
B : execution
C : loading
D : linking
AHA
W
S
T
A
A : minimum
P H
B : average
O M
C : maximum
D : approximate
of the disk.
A : Bit tables
C : Indexing
D : Free Block List

D : data dependant
A
AH
D : translator
S W
AT
P H
O M
D : PL domain only
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : resources
A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
AT
P H
B : LRU
M
C : FIFO
O
AHA
T S W
P H A
O M
AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M
A : PS
B : TOP
C : fork
D : kill
B : Syntax trees
AHA
W
D : Prefix notation
T S
A
H
M P
B : Logical I/O
O
C : Device I/O
A : Identifier
C : Integer Literal
B : File system

A : Exceptions
B : Signal handling
AHA
C : Interrupts
W
D : DMA
T S
A
A : Stop
P H
B : Return
O M
C : OP
D : End

of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
as
A : seek time
A
C : access time
AH
D : Transfer time
S W
AT
H
B : control program
M P
O
D : All

A : segmentation
B : swapping
A : FCFS
B : SJF
C : RR
D : priority
AHA
S W
A : Assembler
AT
B : Linking loader
H
C : Cross compiler
M P
D : Load and Go
O
A : Left to right
C : Right to left
A : wait queue
B : ready queue
C : cpu
B : Syntax analysis
D : something else
A
AH
S W
AT
H
M P
O
C : seek time
A : Source code
C : Target code
D : tokens
AHA
W
C : <macro name>
T S
D : <call macro>
H A
M P
O
A : file extension
B : file identifier
C : file name

A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Bit table
AHA
W
C : Indexing
T S
D : Free Block List
A
P H
M
O
D : expanding macro
suspended is called
C : lexical errors
A : error
B : protection
AHA
W
D : access
T S
A
H
P
B : Compaction
O M
D : Division
D : code generation
A : write ahead
B : read ahead
C : free-behind
D : add-front

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
AHA
W
D : no error occurs
T S
A
A : Absolute Loader
P H
B : Loader
M
C : Linker
O
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A
AH
S W
AT
A : Stack
H
B : Queue
P
C : Linked list
O M
B : page size
A : Indexed files
B : Direct files


AHA
S W
T
program
A
P H
O M
A : Bit tables
C : Indexing
D : Free Block List

A
B : LRU
AH
C : FIFO
S W
T
H A
A : Second pass
P
B : First pass
O M
C : Zeroth pass
AHA
T S W
A
P H
O M
AHA
T S W
H A
M P
O

A
W AH
S
H AT
M P
O

A
W AH
T S
P H A
O M
first?
A
AH
S W
D : Round Robin
AT
H
M P
O
A : job queue
B : ready queue
C : execution queue
D : process queue
Q.no 5. SJF can be
A : preemptive only
D : sequential
as
A : waiting time
B : turnaround time
C : response time
D : throughput
AHA
W
T S
H A
P
O M
A : System call
B : API
C : library
D : shell
A : entire thread
D : entire process
called
A : demand paging
B : virtual memory
A
AH
S W
AT
P H
B : code generation
M
C : syntax analysis
O
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
AHA
W
A : object code
T S
H A
P
D : machine code
O M

D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A
A : Dos
AH
B : Unix
S W
C : System software
AT
H
P
A : key
O M
B : value
C : bit value
D : constant
A : system software
C : both 1 & 2
D : not a software
A : cpu
B : primary memory
A : START
B : BEGIN
AHA
C : MACRO
W
T S
H A
P
M
O
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
D : critical ratio
A : any language
C : c language
AHA
W
T S
H A
P
O M
A : is in the TLB
B : has data in it
A : Identifiers
B : Constants
C : Keywords
AHA
W
T S
A
P H
M
O
B : statement
C : Numeric data
D : ASCII data
A : works well
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Absolute Loader
AHA
B : Loader
W
C : Linker
S
D : Assembler
AT
P H
M
O
A : compilation
B : execution
C : loading
D : linking
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
A : START
A
B : END
AH
C : ORIGIN
W
T S
H A
P
O M
D : translator
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
A
B : Unambiguous
AH
C : Regular
S W
D : None of these
AT
H
P
O M
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : PL domain only
A
AH
S W
D : resources
AT
P H
A : compiler
M
B : assembler
O
C : loader
D : interpreter
AHA
S W
AT
P H
M
O

AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M


A
W AH
AT S
P H
O M
C : instruction
D : Opcodes
A : segmentation
A
B : swapping
AH
S W
AT
H
M P
O
A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
AHA
C : Myfile.lex
W
D : Myfile.obj
T S
H A
P
O M
A : Parser
C : Code generator
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : blocking I/O
D : synchronous I/O
A
AH
S W
AT
A : FIFO
P H
B : LRU
M
C : LFU
O
D : NRU
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : assembler
B : compiler
C : loader
D : interpreter
AHA
W
T S
A : SJF-P
H A
B : FCFS
P
C : RR
O M
D : Priority

A : FCFS
B : SJF
C : RR
D : priority

D : code generation
C : SCAN
D : Circular SCAN
A
AH
concerned with
W
T S
A
P H
O M
A : file extension
B : file identifier
C : file name

D : priority
C : seek time
D : Both 1 & 2
A
AH
S W
AT
H
P
O M
A : Source code
C : Target code
D : tokens
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A
AH
S W
AT
H
M P
O

operating system
A
AH
S W
AT
H
M P
O
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : procedure
B : subroutine
C : macro




program
A : Indexed files
B : Direct files
AHA
W
S
T
H A
A : Bit tables
M P
O
C : Indexing
D : Free Block List

A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
AHA
C : Zeroth pass
W
T S
H A
P
O M

B : page size
B : Syntax analysis
A
AH
S W
AT
H
M P
O
D : data dependant

A : Lex
B : Yacc
C : Iburg
A
D : both 1 & 3
AH
S W
AT
P H
M
D : translator
O
because
AHA
T S W
P H A
O M

AHA
T S W
P H A
O M
AHA
S W
H AT
M P
O


AHA
S W
H AT
M P
O
A : wait queue
B : ready queue
C : cpu
A
AH
S W
AT
called
P H
A : demand paging
O M
B : virtual memory
B : page-fault rate
C : hit ratio
B : File system
A : seek time
AHA
C : access time
W
D : Transfer time
T S
H A
P
O M
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
AHA
W
T S
A : Text editor
H A
B : Assembler
P
C : Linker
O M
D : Loader
Q.no 14. A macro is
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing
AHA
W
T S
H A
P
O M
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Interrupts
B : Memory mapping
D : DMA

A : is in the TLB
B : has data in it
AHA
W
T S
H A
P
M
A : Indexed files
O
B : Direct files
A : magnetic disks
C : assemblies
D : cylinders
object program
D : Both 1 & 2
A : system software
C : both 1 & 2
D : not a software
AHA
W
T S
H A
P
O M
C : lexical errors
B : Syntax analysis
A : YACC
B : BISON
AHA
C : FLEX
W
D : Iburg
T S
A
P H
M
O
C : process
D : something else
A : any language
C : c language
AHA
W
S
A : Compiler
AT
B : Interpreter
P H
C : Assembler
M
D : Loader
O
C : both 1 & 2
D : function
A : minimum
B : average
C : maximum
D : approximate
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
A
C : Indexing
AH
D : Free Block List
W
T S
H A
P
O M
D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list
AHA
W
T S
H A
P
D : resources
O M
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Indexed files
B : Direct files
D : Both 1 & 2
A
AH
A : Absolute Loader
W
B : Loader
T S
C : Linker
H A
D : Assembler
P
O M
A : START
B : END
C : ORIGIN
B : LRU
C : FIFO



program
A
AH
W
T S
H A
P
O M
D : no error occurs
AHA
T S W
P H A
O M

A
W AH
AT S
P H
M
O

A
W AH
AT S
P H
O M
AHA
S W
H AT
P
O M
AHA
W
T S
H A
P
B : Syntax trees
O M
D : Prefix notation
first?
D : Round Robin
A : macro prototype
D : macro call
as
A : waiting time
B : turnaround time
C : response time
D : throughput
AHA
W
T S
H A
P
O M
B : Logical I/O
C : Device I/O
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language

A : segmentation
B : swapping
A : job queue
B : ready queue
AHA
C : execution queue
W
D : process queue
T S
A
P H
M
O
A : Machine code
D : A parse tree
A : SJF-P
B : FCFS
C : RR
D : Priority
A : entire thread
D : entire process
A
D : Both 1 & 3
AH
S W
AT
B : code generation
P H
C : syntax analysis
M
O
A : FCFS
B : SJF
C : RR
D : priority
A : Left to right
C : Right to left
C : SCAN
D : Circular SCAN
A : Parser
B : Optimizer
C : Scanner
A
D : Loader
AH
W
T S
A : Paging
A
B : Demand paging
P H
C : Segmentation
M
D : Swapping
O
D : critical ratio
B : Compaction
D : Division
suspended is called
A
AH
S W
A : Source code
AT
H
C : Target code
P
D : tokens
O M
A : file extension
B : file identifier
C : file name
A : Dos
B : Unix
C : System software
A : Attributes
B : Protocol
C : Location
D : Ownership
A
AH
S W
T
H A
P
operating system
M
O
C : seek time
A : USING
B : BALR
C : DROP
D : ORG
concerned with
A
AH
W
T S
H A
P
O M
because
A : Second pass
B : First pass
C : Zeroth pass
AHA
W
T S
H A
P
M
A : Bit tables
O
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
AHA
C : Iburg
W
D : both 1 & 3
T S
H A
P
O M
B : Syntax analysis
A : Identifier
B : Number
C : Keyword
D : operator
B : page size
AHA
W
T S
H A
P
O M
D : translator
A : Bit tables
C : Indexing
D : Free Block List

A : compiler
A
B : assembler
AH
C : loader
W
D : interpreter
T S
A
of the disk.
P H
A : Bit tables
M
O
C : Indexing
D : Free Block List
D : Both 1 & 2
AHA
S W
AT
P H
M
O
A
AH
T S W
P H A
O M
AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Assembler
A
B : Linking loader
AH
C : Cross compiler
S W
D : Load and Go
AT
H
A : END
P
B : ENDS
O M
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler

Q.no 7. SJF can be
A : preemptive only
A
AH
D : sequential
S W
AT
H
P
O M
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing
AHA
W
T S
H A
P
O M
A : Stop
B : Return
C : OP
D : End
A : System call
B : API
C : library
D : shell
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
AHA
W
S
AT
P H
M
O
B : blocking I/O
D : synchronous I/O
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Bit table
C : Indexing
D : Free Block List
A
AH
C : seek time
W
T S
H A
P
O M
C : both 1 & 2
D : function
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : cpu
B : primary memory
AHA
W
T S
H A
P
O M


D : a key & value
AHA
S W
AT
P H
M
O
D : code generation
B : statement
C : Numeric data
D : ASCII data

A
A : system software
AH
W
C : both 1 & 2
T S
D : not a software
H A
P
O M
B : LRU
C : FIFO
A : Indexed files
B : Direct files

A : Absolute Loader
AHA
B : Loader
C : Linker
S W
D : Assembler
AT
P H
A : works well
M
O
A : Second pass
B : First pass
C : Zeroth pass
A : START
B : END
C : ORIGIN

A : Stack
B : Queue
A
C : Linked list
AH
W
T S
H A
P
O M
D : no error occurs
D : resources
because

A
AH
W
T S
A
H
program
P
O M
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A
AH
A : minimum
W
B : average
T S
C : maximum
H A
D : approximate
P
O M
D : PL domain only

A
W AH
AT S
P H
O M
AHA
S W
H AT
M P
O


AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A
A : frame bit
AH
B : page number
S W
C : page offset
AT
D : frame offset
H
M P
A : SJF-P
O
B : FCFS
C : RR
D : Priority
B : File system
C : instruction
D : Opcodes
A : FCFS
B : SJF
C : RR
D : priority
print document ?
A : word proccessor
AHA
B : spreadsheet
W
T S
D : Unix
A
P H
M
B : page-fault rate
O
C : hit ratio
Q.no 11. A macro is

A : job queue
B : ready queue
AHA
C : execution queue
W
D : process queue
T S
A
A : PS
P H
B : TOP
M
C : fork
O
D : kill
A : all process
C : parent process
D : init process
called
A : demand paging
B : virtual memory

A : Left to right
C : Right to left
A
AH
S W
AT
H
P
O M
A : Identifier
C : Integer Literal
A
AH
operating system
W
S
A : Reduce - Reduce
AT
B : Shift - Reduce
P H
C : Shift - Shift
M
D : Both A and B
O
B : Syntax analysis
D : something else
suspended is called
A
AH
W
T S
H A
P
O M
A : USING
B : BALR
C : DROP
D : ORG
A
AH
A : Dos
W
B : Unix
T S
C : System software
H A
P
O M
A : is in the TLB
B : has data in it
C : process
C : seek time
D : critical ratio
AHA
S W
AT
P H
A : error
M
B : protection
O
D : access
D : priority
A : Bit tables
C : Indexing
D : Free Block List

AHA
B : page size
S W
AT
P H
M
O
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator

AHA
D : translator
S W
T
H A
P
O M
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
AHA
S W
AT
P H
M
O
A : Bit tables
C : Indexing
D : Free Block List
B : Syntax analysis
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

AHA
W
T S
H A
P
D : no error occurs
O M
A : START
B : END
C : ORIGIN
AHA
S W
AT
P H
M
O

AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M


A
W AH
AT S
P H
O M
A : FIFO
B : LRU
C : LFU
D : NRU
A
AH
S W
AT
H
P
A : segmentation
O M
B : swapping
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
A
AH
S W
D : Round Robin
AT
H
P
O M
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : object code
D : machine code
A
AH
S W
T
H A
P
O M
as
A : seek time
C : access time
D : Transfer time
B : blocking I/O
D : synchronous I/O
A : END
B : ENDS
C : MEND
D : ENDD
B : Syntax trees
D : Prefix notation
AHA
A : Myfile.e
S W
B : Myfile.yy.c
AT
C : Myfile.lex
P H
D : Myfile.obj
M
O
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : YACC
B : BISON
C : FLEX
D : Iburg
AHA
A : any language
S W
C : c language
AT
P H
M
O
object program
D : Both 1 & 2
A : START
B : BEGIN
C : MACRO
A
AH
B : Compaction
W
T S
D : Division
H A
P
A : system software
O M
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Indexed files
B : Direct files
AHA
S W
AT
P H
M
C : seek time
O
A : key
B : value
C : bit value
D : constant
A : file extension
B : file identifier
C : file name


A
D : Both 1 & 2
AH
W
T S
H A
P
O M
A : Identifiers
B : Constants
C : Keywords
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Bit tables
A
C : Indexing
AH
D : Free Block List
W
T S
H A
P
O M
D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list
D : resources
A : Ambiguous
B : Unambiguous
C : Regular
AHA
D : None of these
S W
AT
P H
M
O
A : works well
A : Second pass
B : First pass
C : Zeroth pass

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
AHA
A : compilation
B : execution
S W
C : loading
AT
D : linking
P H
O M
A : Indexed files
B : Direct files
A : minimum
B : average
C : maximum
D : approximate



A
AH
program
W
T S
H A
B : LRU
P
C : FIFO
O M
D : translator
A
AH
T S W
P H A
O M
AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M
AHA
S W
H AT
M P
O
A : all process
C : parent process
D : init process
of computer system
AHA
A : Swapping
B : Spooling
S W
C : Semaphore
AT
D : Scheduler
P H
M
O
A : System call
B : API
C : library
D : shell
A : frame bit
B : page number
C : page offset
D : frame offset
A : Double buffer
A
B : Single buffer
AH
C : Linear buffer
W
D : Circular buffer
T S
H A
P
O M
B : Logical I/O
C : Device I/O
A : Stop
B : Return
C : OP
D : End
A : Parser
C : Code generator
A : macro prototype
A
AH
D : macro call
W
T S
H A
B : code generation
P
C : syntax analysis
O M
A : wait queue
B : ready queue
C : cpu
A : Polling
B : Inspection
C : Reviewing
D : Echoing
AHA
S W
AT
P H
D : Both 1 & 3
M
O
A : entire thread
D : entire process
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
AHA
S W
AT
P H
M
O
C : lexical errors
B : statement
C : Numeric data
D : ASCII data


A
AH
W
T S
H A
A : is in the TLB
P
B : has data in it
O M
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
D : priority
A
AH
W
T S
H A
B : Syntax analysis
P
O M
C : <macro name>
D : <call macro>
A : Attributes
B : Protocol
C : Location
D : Ownership
D : expanding macro
A
AH
W
A : Compiler
T S
B : Interpreter
H A
C : Assembler
P
D : Loader
O M
C : both 1 & 2
D : function
A : START
B : END
C : ORIGIN

AHA
A : Identifier
B : Number
S W
C : Keyword
AT
D : operator
P H
M
A : Lex
O
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
AHA
S W
AT
D : no error occurs
P H
O M
D : data dependant
B : Syntax analysis
A
A : compiler
AH
B : assembler
W
C : loader
T S
D : interpreter
H A
P
O M
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A
A : Stack
AH
B : Queue
W
C : Linked list
T S
H A
P
O M
A : Bit tables
C : Indexing
D : Free Block List
AHA
S W
H AT
M P
O

A
AH
S W
H AT
M P
O

A
AH
T S W
P H A
O M

AHA
T S W
P H A
O M
A
A : assembler
AH
B : compiler
S W
C : loader
AT
D : interpreter
P H
O M
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Interrupts
B : Memory mapping
D : DMA
Q.no 7. A macro is
AHA
W
S
AT
P H
A : Hex code
M
B : Mnenonics
O
C : ASCII code
D : C Language
B : Syntax trees
D : Prefix notation

A : FCFS
B : SJF
C : RR
AHA
D : priority
S W
A : SJF-P
AT
B : FCFS
P H
C : RR
M
D : Priority
O
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj

Q.no 17. SJF can be
A : preemptive only
D : sequential
AHA
S W
AT
P H
M
O
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Indexed files
B : Direct files
A : key
B : value
C : bit value
D : constant

A : Dos
AHA
B : Unix
C : System software
S W
AT
P H
M
O
A : USING
B : BALR
C : DROP
D : ORG
operating system

A
AH
W
T S
H A
A : Identifiers
P
B : Constants
O M
C : Keywords
C : seek time
B : Compaction
D : Division
C : process

A
AH
W
S
AT
P H
M
O
A : Parser
B : Optimizer
C : Scanner
D : Loader
D : critical ratio

A : cpu
B : primary memory
AHA
S W
A : any language
AT
P H
C : c language
M
O
D : something else




program
in hardware?
A : Counters
B : RAM & Registers

D : Registers
AHA
S W
D : PL domain only
AT
P H
A : Ambiguous
M
B : Unambiguous
O
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Indexed files
B : Direct files

A : works well

A
AH
W
T S
A
P H
M
O
D : resources
A : minimum
B : average
C : maximum
D : approximate
A : compilation
B : execution
C : loading
D : linking
B : LRU
C : FIFO
A : Second pass
A
B : First pass
AH
C : Zeroth pass
W
T S
A
because
P H
M
O

AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M


A
W AH
AT S
P H
O M
AHA
S W
H AT
M P
O

D : translator
A : Absolute Loader
B : Loader
A
C : Linker
AH
D : Assembler
W
T S
H A
P
O M
A : Bit tables
C : Indexing
D : Free Block List
AHA
S W
AT
P H
A : seek time
M
O
C : access time
D : Transfer time
A : Left to right
C : Right to left
B : File system
AHA
W
T S
H A
P
B : page-fault rate
O M
C : hit ratio
A : Machine code
D : A parse tree
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer

AHA
S W
AT
A : Parser
P H
M
C : Code generator
O
B : blocking I/O
D : synchronous I/O
called
A : demand paging
B : virtual memory
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
B : control program
AHA
D : All
S W
AT
P H
M
C : instruction
O
D : Opcodes

D : code generation
AHA
W
T S
H A
C : SCAN
P
D : Circular SCAN
O M
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging

D : a key & value
AHA
W
T S
H A
D : Both 1 & 2
P
M
O
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : Attributes
B : Protocol
C : Location
D : Ownership
AHA
S W
AT
P H
M
A : Source code
O
C : Target code
D : tokens
D : priority
A : system software
C : both 1 & 2
D : not a software
AHA
A : Paging
B : Demand paging
S W
C : Segmentation
AT
D : Swapping
P H
O M
A : procedure
B : subroutine
C : macro
A : YACC
B : BISON
C : FLEX
D : Iburg
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A
AH
S W
AT
D : data dependant
P H
M
A : Stack
O
B : Queue
C : Linked list
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3




program
A
AH
W
A : compiler
T S
B : assembler
H A
C : loader
P
D : interpreter
O M
B : page size
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs
AHA
S W
AT
P H
M
O
B : Syntax analysis
D : Both 1 & 2
A
AH
W
T S
H A
P
O M
A : works well
AHA
T S W
P H A
O M
AHA
S W
H AT
M P
O

AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M
D : Both 1 & 3
A
A : System call
AH
B : API
W
C : library
T S
D : shell
H A
P
A : FIFO
O M
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : END
B : ENDS
C : MEND
D : ENDD

A : macro prototype
AHA
D : macro call
S W
AT
P H
M
O
Q.no 9. SJF can be
A : preemptive only
D : sequential
A : Stop
B : Return
C : OP
D : End

A : Exceptions
B : Signal handling
C : Interrupts
A
D : DMA
AH
W
T S
H A
P
O M
first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue

AHA
Q.no 18. A macro is
S W
AT
P H
M
O
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : Syntax trees
D : Prefix notation
B : Syntax analysis
C : seek time
AHA
A : is in the TLB
B : has data in it
S W
AT
P H
O M
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : key
B : value
C : bit value
D : constant
A : Compiler
B : Interpreter
C : Assembler
D : Loader

AHA
S W
AT
P H
M
O
D : expanding macro
AHA
S W
AT
P H
M
O
A : file extension
B : file identifier
C : file name
A : error
B : protection
D : access

A
AH
W
A : START
T S
B : BEGIN
H A
C : MACRO
P
O M
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
A
AH
in hardware?
S W
A : Counters
AT
B : RAM & Registers
P H
M
D : Registers
O
D : PL domain only
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : translator
A : Bit tables
C : Indexing
AHA
D : Free Block List
S W
A : Second pass
AT
B : First pass
P H
C : Zeroth pass
M
O
A : compilation
B : execution
C : loading
D : linking
D : resources
A : Indexed files
B : Direct files
AHA
W
S
AT
A : Bit tables
P H
M
C : Indexing
O
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : minimum
B : average
C : maximum
D : approximate
because
AHA
S W
AT
P H
A : Absolute Loader
M
B : Loader
O
C : Linker
D : Assembler
AHA
T S W
A
P H
O M
AHA
T S W
H A
M P
O

A
W AH
S
H AT
M P
O

A
W AH
T S
P H A
O M
A : wait queue
B : ready queue
C : cpu
A
AH
S W
AT
P H
M
O
B : page-fault rate
C : hit ratio

as
A : waiting time
B : turnaround time
C : response time
D : throughput
called
AHA
A : demand paging
B : virtual memory
S W
AT
P H
O M
A : all process
C : parent process
D : init process

AHA
S W
AT
P H
A : segmentation
M
B : swapping
O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : SJF-P
B : FCFS
AHA
C : RR
D : Priority
S W
AT
P H
M
O
A : FCFS
B : SJF
C : RR
D : priority

A : Dos
B : Unix
C : System software
AHA
W
T S
A : Paging
H A
B : Demand paging
P
C : Segmentation
O M
D : Swapping
C : both 1 & 2
D : function
A : magnetic disks
C : assemblies
D : cylinders
AHA
W
T S
H A
P
O M
A : any language
C : c language
C : lexical errors
concerned with

B : Compaction
A
D : Division
AH
W
T S
H A
C : <macro name>
P
D : <call macro>
O M
object program
D : Both 1 & 2
D : Both 1 & 2

D : something else
C : process
AHA
S W
AT
P H
M
O
suspended is called
B : Syntax analysis
D : Both 1 & 2
AHA
S W
AT
P H
M
O
A : Stack
B : Queue
C : Linked list
A : works well

A
A : Identifier
AH
B : Number
W
C : Keyword
T S
D : operator
H A
P
M
O
D : no error occurs



A
program
AH
S W
AT
P H
M
D : data dependant
O
A : compiler
B : assembler
C : loader
D : interpreter
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
AHA
S W
A : Bit tables
AT
P H
C : Indexing
M
D : Free Block List
O
D : translator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
AHA
T S W
P H A
O M

AHA
T S W
P H A
O M

A
W AH
AT S
P H
O M


A
W AH
AT S
P H
O M
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
scheduler?
A
A : Dispatcher
AH
B : interrupt
S W
C : scheduler
AT
D : interpreter
P H
M
A : assembler
O
B : compiler
C : loader
D : interpreter
A : frame bit
B : page number
C : page offset
D : frame offset
A : object code
D : machine code
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A
AH
W
T S
A
P H
A : job queue
M
B : ready queue
O
C : execution queue
D : process queue
first?
D : Round Robin
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
as
A : seek time
A
AH
C : access time
W
D : Transfer time
T S
A
of computer system
P H
A : Swapping
M
B : Spooling
O
C : Semaphore
D : Scheduler

A
AH
W
T S
H A
P
O M
D : Both 1 & 3
A : Machine code
D : A parse tree
A : Parser
C : Code generator
D : critical ratio
A
AH
W
A : file extension
T S
B : file identifier
H A
C : file name
P
O M
A : START
B : BEGIN
C : MACRO
A : procedure
B : subroutine
C : macro
A
AH
W
T S
H A
C : seek time
P
O M
A
AH
W
T S
H A
P
O M
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : error
B : protection
D : access
A
AH
W
T S
H A
P
O M
C : seek time
A : Bit tables
C : Indexing
D : Free Block List
because
AHA
S W
AT
P H
M
O
A : Indexed files
B : Direct files
AHA
B : Syntax analysis
S W
AT
P H
M
A : Second pass
O
B : First pass
C : Zeroth pass
A : minimum
B : average
C : maximum
D : approximate
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : resources
AHA
A : START
S W
B : END
AT
C : ORIGIN
P H
M
O
D : PL domain only
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers
D : Registers
AHA
A : Ambiguous
S W
B : Unambiguous
AT
C : Regular
P H
D : None of these
M
O
B : LRU
C : FIFO
D : translator
AHA
S W
H AT
M P
O


AHA
S W
H AT
M P
O

A
AH
T S W
P H A
O M

AHA
T S W
P H A
O M
A
A : END
AH
B : ENDS
W
C : MEND
T S
D : ENDD
H A
P
O M
A : entire thread
D : entire process
A : segmentation
B : swapping

A : SJF-P
B : FCFS
AHA
C : RR
D : Priority
S W
AT
P H
M
O
B : Syntax trees
D : Prefix notation
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
A
D : Echoing
AH
S W
A : Exceptions
AT
B : Signal handling
P H
C : Interrupts
M
D : DMA
O
B : code generation
C : syntax analysis
A : Interrupts
B : Memory mapping
D : DMA
B : control program
D : All
B : Logical I/O
C : Device I/O
AHA
S W
AT
P H
M
O
C : instruction
D : Opcodes
A : Identifiers
B : Constants
C : Keywords
concerned with
A
AH
W
T S
H A
P
O M
B : statement
C : Numeric data
D : ASCII data
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : YACC
B : BISON
C : FLEX
D : Iburg
A
AH
B : Syntax analysis
W
T S
H A
P
O M
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Indexed files
B : Direct files
A
AH
W
T S
H A
P
A : is in the TLB
O M
B : has data in it
A : key
B : value
C : bit value
D : constant
D : priority
A : system software
A
AH
C : both 1 & 2
W
D : not a software
T S
A
P H
A : Bit table
M
O
C : Indexing
D : Free Block List
A : Dos
B : Unix
C : System software
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Identifier
A
B : Number
AH
C : Keyword
W
D : operator
T S
A
P H
M
O
A : Bit tables
C : Indexing
D : Free Block List
A
AH
W
T S
H A
P
O M
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
AHA
S W
D : data dependant
AT
P H
A : Lex
M
B : Yacc
O
C : Iburg
D : both 1 & 3
B : page size




program
A
AH
D : no error occurs
W
T S
H A
P
O M
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN
AHA
T S W
P H A
O M

A
W AH
AT S
P H
M
O

A
W AH
AT S
P H
O M
AHA
S W
H AT
M P
O
Seat No -

Time : 1hr
Max Marks : 50
N.B
AHA
S W
AT
H
P
O M
A : wait queue
B : ready queue
C : cpu

A : all process
C : parent process
D : init process
A : System call
B : API
C : library
D : shell
A
AH
S W
T
H A
A : assembler
M P
B : compiler
O
C : loader
D : interpreter
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
3
A : Identifier
C : Integer Literal
A
AH
S W
T
D : Both 1 & 3
H A
M P
O
B : code generation
C : syntax analysis
A : Stop
B : Return
C : OP
D : End
A : PS
B : TOP
C : fork
D : kill
A
A : FCFS
AH
B : SJF
S W
C : RR
T
D : priority
H A
M P
A : frame bit
O
B : page number
C : page offset
D : frame offset
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code
AHA
A : Exceptions
W
B : Signal handling
S
C : Interrupts
AT
D : DMA
P H
M
O
A : job queue
B : ready queue
C : execution queue
D : process queue
A : error
B : protection
D : access

D : Both 1 & 2
A : Indexed files
B : Direct files
A
AH
performed by
W
S
B : Syntax analysis
AT
P H
O M
page
A : is in the TLB
B : has data in it
A : file extension
C : file name
AHA
D : something else
W
S
AT
P H
O M
D : expanding macro
A : magnetic disks
C : assemblies
D : cylinders
A
AH
W
S
A : procedure
AT
B : subroutine
P H
C : macro
O M
the jobs.
D : critical ratio
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Attributes
B : Protocol
C : Location
D : Ownership
A
C : both 1 & 2
AH
D : function
S W
T
H A
M P
C : seek time
O
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A
AH
S W
T
A : compiler
H A
B : assembler
M P
C : loader
O
D : interpreter
D : translator
A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
AT
P H
O M
A : minimum
B : average
C : maximum
D : approximate
AHA
B : Syntax analysis
W
S
AT
H
category of 'var1 '
M P
A : Identifier
O
B : Number
C : Keyword
D : operator




program

D : data dependant
time.
A : Indexed files
B : Direct files
A
AH
S W
AT
A : Counters
P H
B : RAM & Registers
O M
D : Registers
specification.
A : START
B : END
C : ORIGIN
B : page size

A
AH
S W
T
A
called as
P H
A : Polling
O M
B : Inspection
C : Reviewing
D : Echoing
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : waiting time
B : turnaround time
C : response time
D : throughput
A : END
B : ENDS
C : MEND
D : ENDD
A
A : macro prototype
AH
S W
T
D : macro call
H A
M P
O
A : Left to right
C : Right to left
C : instruction
D : Opcodes
A
AH
S W
T
H A
P
O M
B : File system
in memory is called
A : demand paging
B : virtual memory

A
AH
S W
T
H A
M P
O
B : Syntax trees
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU

B : Compaction
D : Division
AHA
W
S
AT
P H
O M
C : process

C : lexical errors
A : key
B : value
C : bit value
D : constant
A
AH
S W
T
H A
M P
O
A : USING
B : BALR
C : DROP
D : ORG

A
AH
A : cpu
S W
B : primary memory
T
H A
M P
O
A : any language
C : c language

A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A
AH
S W
A : LOOK
T
B : SCAN
H A
C : C-SCAN
M P
D : C-LOOK
O
C : seek time
A : Bit table
C : Indexing
D : Free Block List
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A
AH
W
S
AT
P H
O M
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

AHA
D : no error occurs
W
S
AT
P H
O M
D : Both 1 & 2
D : PL domain only
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
T
A
P H
A : Bit tables
O M
C : Indexing
D : Free Block List
A : Stack
B : Queue
C : Linked list
A : works well

D : resources
A : Second pass
AHA
B : First pass
W
C : Zeroth pass
S
AT
P H
A : compilation
O M
B : execution
C : loading
D : linking
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
A
AH
S W
T
H A
M P
O
A : Machine code
D : A parse tree

Q.no 5. SJF can be
A : preemptive only
D : sequential
A
AH
S W
T
H A
M P
A : Interrupts
O
B : Memory mapping
D : DMA
A : frame bit
B : page number
C : page offset
D : frame offset
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : page-fault rate
C : hit ratio
A
A : SJF-P
AH
B : FCFS
S W
C : RR
T
D : Priority
H A
M P
A : System call
O
B : API
C : library
D : shell
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
AHA
W
S
AT
P H
O M
B : control program
D : All

A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A
AH
S W
T
H A
P
O M
dynamic loading

C : SCAN
AHA
D : Circular SCAN
W
S
AT
P H
O M
performed by
B : Syntax analysis

C : <macro name>
D : <call macro>
A : Source code
A
C : Target code
AH
D : tokens
S W
T
A
algorithm
P H
M
algorithm
O
D : code generation

A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A
AH
S W
T
H A
M P
O
D : priority
time?

A : Attributes
B : Protocol
C : Location
D : Ownership
A
A : Identifiers
AH
B : Constants
S W
C : Keywords
T
H A
M P
O
D : translator

specification.
AHA
A : START
W
B : END
S
C : ORIGIN
AT
P H
O M



program
time.
A : Indexed files
B : Direct files
AHA
S W
T
H A
A : Counters
M P
B : RAM & Registers
O
D : Registers
A : compiler
B : assembler
C : loader
D : interpreter
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
AHA
W
B : page size
S
AT
P H
O M
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

B : Syntax analysis
AHA
called
S W
A : Ambiguous
T
B : Unambiguous
H A
C : Regular
M P
D : None of these
O
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : all process
C : parent process
D : init process
A : segmentation
B : swapping
A
AH
S W
T
H A
B : Syntax trees
M P
O
track is known as
A : seek time
C : access time
D : Transfer time
D : Round Robin
A : Parser
C : Code generator
in memory is called
A : demand paging
AHA
B : virtual memory
W
S
AT
H
M P
A : Swapping
O
B : Spooling
C : Semaphore
D : Scheduler
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : entire thread

D : entire process
A : wait queue
B : ready queue
C : cpu
AHA
W
S
AT
P H
O M
A : Left to right
C : Right to left
C : instruction
D : Opcodes
A
AH
S W
T
D : Both 1 & 3
H A
M P
A : FCFS
O
B : SJF
C : RR
D : priority
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : START
B : BEGIN
C : MACRO
A
A : file extension
AH
S W
C : file name
T
H A
M P
A : magnetic disks
O
C : assemblies
D : cylinders

D : Both 1 & 2

A
AH
A : error
S W
B : protection
T
H A
D : access
M P
O
the jobs.

D : critical ratio
A : Indexed files
B : Direct files
A
AH
A : key
S W
B : value
T
C : bit value
H A
D : constant
M P
O
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Dos
B : Unix
C : System software
A
AH
S W
T
H A
D : a key & value
M P
O
A : system software
C : both 1 & 2
D : not a software
A : Stack
B : Queue
C : Linked list
D : translator
A
AH
W
S
AT
P H
D : resources
O M
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
A
D : PL domain only
AH
W
S
T
A : Bit tables
H A
M P
C : Indexing
O
D : Free Block List
A : Second pass
B : First pass
C : Zeroth pass
A : works well
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
T
H A
M P
O
D : no error occurs
D : Both 1 & 2
A
AH
S W
T
H A
A : Lex
M P
B : Yacc
O
C : Iburg
D : both 1 & 3
A : compilation
B : execution
C : loading
D : linking
B : page size

A : Text editor
B : Assembler
C : Linker
D : Loader
A
AH
S W
T
H A
M P
O
A : Interrupts
B : Memory mapping
D : DMA

AHA
B : Logical I/O
W
C : Device I/O
S
AT
H
M P
O
B : File system
B : blocking I/O
D : synchronous I/O
A : job queue
B : ready queue
C : execution queue
D : process queue
A
A : frame bit
AH
B : page number
S W
C : page offset
T
D : frame offset
H A
P
O M
A : word proccessor
B : spreadsheet
D : Unix
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : control program
D : All
A : waiting time
B : turnaround time
C : response time
D : throughput
AHA
W
S
AT
P H
O M
Q.no 19. A macro is
A : object code
D : machine code
C : seek time
A
AH
S W
T
H A
M P
O
A : any language
C : c language
B : statement
C : Numeric data
D : ASCII data
D : priority
A
AH
S W
T
H A
M P
O

C : lexical errors
A
AH
W
A : Bit table
S
AT
C : Indexing
P H
D : Free Block List
O M
C : seek time
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : USING
B : BALR
C : DROP
D : ORG
A
AH
dynamic loading
S W
T
H A
M P
O
time?
A : Source code
C : Target code
D : tokens

A : Identifiers
B : Constants
C : Keywords
A
AH
S W
T
A : Stack
H A
B : Queue
M P
C : Linked list
O
B : Syntax analysis
specification.
A : START
B : END
C : ORIGIN

time.
A : Indexed files
B : Direct files
AHA
A : Counters
W
B : RAM & Registers
S
AT
D : Registers
P H
O M
A : compiler
B : assembler
C : loader
D : interpreter
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
AHA
W
S
AT
P H
O M
D : data dependant
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these



program
A
AH
S W
T
A
H
M P
A : minimum
O
B : average
C : maximum
D : approximate

AHA
W
B : page size
S
AT
P H
M
O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
C : RR
D : priority
A : System call
B : API
C : library
D : shell
C : instruction
D : Opcodes
A
AH
track is known as
W
A : seek time
S
AT
C : access time
P H
D : Transfer time
O M
in memory is called
A : demand paging
B : virtual memory
A : macro prototype
D : macro call

occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
A : Stop
B : Return
C : OP
A
D : End
AH
W
called as
S
A : Polling
AT
B : Inspection
P H
C : Reviewing
O M
D : Echoing
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
Q.no 12. SJF can be
A : preemptive only
D : sequential

B : page-fault rate
C : hit ratio
A
AH
S W
T
H A
M P
O

A
AH
S W
T
H A
M P
O
A : Dos
B : Unix
C : System software
page
A : is in the TLB
B : has data in it
A : LOOK
A
B : SCAN
AH
C : C-SCAN
S W
D : C-LOOK
T
A
P H
A : procedure
O M
B : subroutine
C : macro
performed by
B : Syntax analysis
algorithm
algorithm
A
AH
S W
T
H A
M P
O
D : something else
B : Compaction
D : Division

space of a process
A : file extension
C : file name
AHA
W
S
T
A : Parser
H A
B : Optimizer
M P
C : Scanner
O
D : Loader
C : process
A : Attributes
B : Protocol
C : Location
D : Ownership
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : cpu
B : primary memory
A
AH
S W
T
H A
M P
C : <macro name>
O
D : <call macro>
A : Stack
B : Queue
C : Linked list
A : Second pass
B : First pass
C : Zeroth pass
B : Syntax analysis
AHA
W
S
AT
A : Lex
P H
B : Yacc
O M
C : Iburg
D : both 1 & 3

A : compilation
B : execution
C : loading
D : linking
Belady’s Anomaly?
B : LRU
AHA
C : FIFO
W
S
T
H A
A : Bit tables
M P
O
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Bit tables
C : Indexing
D : Free Block List
specification.
A : START
B : END
C : ORIGIN
AHA
W
S
AT
P H
M
O
D : no error occurs
A : works well

A : write ahead
B : read ahead
C : free-behind
D : add-front
AHA
S W
A : Bit tables
T
H A
C : Indexing
M P
D : Free Block List
O
D : PL domain only

A : word proccessor
B : spreadsheet
AHA
D : Unix
W
S
T
A : all process
H A
M P
C : parent process
O
D : init process
A : Machine code
D : A parse tree
D : Round Robin
B : Logical I/O
C : Device I/O
AHA
W
S
AT
P H
A : Left to right
O M
C : Right to left
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language

D : Both 1 & 3
A : SJF-P
A
B : FCFS
AH
C : RR
S W
D : Priority
T
H A
M P
O
A : segmentation
B : swapping

A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : END
AHA
B : ENDS
W
C : MEND
S
D : ENDD
AT
P H
A : assembler
O M
B : compiler
C : loader
D : interpreter
B : control program
D : All
A
AH
S W
T
H A
M P
O
D : expanding macro
B : statement
C : Numeric data
D : ASCII data
C : seek time
time?
AHA
W
S
D : code generation
AT
P H
O M
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : Identifiers
AHA
B : Constants
W
C : Keywords
S
AT
P H
A : START
O M
B : BEGIN
C : MACRO

D : a key & value

D : Both 1 & 2
A
AH
S W
T
H A
M P
O
A : Bit table
C : Indexing
D : Free Block List
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
performed by
A : Absolute Loader
B : Loader
C : Linker
AHA
D : Assembler
W
S
AT
A : minimum
P H
B : average
O M
C : maximum
D : approximate
A : compiler
B : assembler
C : loader
D : interpreter
time.
A : Indexed files
B : Direct files
A
AH
S W
T
H A
M P
O
D : data dependant

D : resources
A
AH
A : Counters
S W
B : RAM & Registers
T
H A
D : Registers
M P
O
D : translator
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
AHA
specification.
S W
A : START
T
B : END
H A
C : ORIGIN
M P
O
A : Bit tables
C : Indexing
D : Free Block List
AHA
W
S
AT
B : code generation
P H
C : syntax analysis
O M
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : frame bit
B : page number
C : page offset
D : frame offset
A
AH
S W
T
A : PS
H A
B : TOP
M P
C : fork
O
D : kill
A : job queue
B : ready queue
C : execution queue
D : process queue
B : File system
AHA
W
S
T
H A
A : wait queue
M P
B : ready queue
O
C : cpu
Q.no 12. SJF can be
A : preemptive only
D : sequential
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A
B : page-fault rate
AH
C : hit ratio
S W
T
Q.no 16. A macro is
H A
M P
O
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
called as
A
A : Polling
AH
B : Inspection
S W
C : Reviewing
T
D : Echoing
H A
M P
O
A : file extension
C : file name
A : Source code
C : Target code
D : tokens
A : Indexed files
B : Direct files
A
A : error
AH
B : protection
S W
T
D : access
H A
M P
O
A : magnetic disks
C : assemblies
D : cylinders
A : system software
C : both 1 & 2
D : not a software
the jobs.
AHA
W
S
AT
D : critical ratio
P H
O M
C : both 1 & 2
D : function
A : any language
C : c language
A
AH
S W
T
D : priority
H A
M P
O
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : cpu
B : primary memory
AHA
W
S
AT
P H
O M
Belady’s Anomaly?
B : LRU
C : FIFO

A : Stack
B : Queue
C : Linked list
A
AH
W
A : Bit tables
S
AT
C : Indexing
P H
D : Free Block List
O M
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : works well
A : Second pass
B : First pass
C : Zeroth pass
B : page size
AHA
W
S
AT
P H
O M
D : no error occurs



program
A : compilation
B : execution
C : loading
D : linking
A
AH
W
S
B : Syntax analysis
AT
P H
O M
D : Both 1 & 2
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler

D : PL domain only
A : Lex
B : Yacc
C : Iburg
A
D : both 1 & 3
AH
W
S
T
A : Bit tables
H A
M P
C : Indexing
O
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : object code
D : machine code

C : instruction
D : Opcodes
A : segmentation
B : swapping
A
AH
S W
T
A : Interrupts
H A
B : Memory mapping
M P
O
D : DMA
D : Round Robin
A : FCFS
B : SJF
C : RR
D : priority

A
AH
S W
T
A : System call
H A
B : API
M P
C : library
O
D : shell
B : Syntax trees

A
AH
S W
T
A : Parser
H A
M P
C : Code generator
O
A : Left to right
C : Right to left
A : SJF-P
B : FCFS
C : RR
D : Priority

in memory is called
A : demand paging
B : virtual memory
AHA
W
S
AT
P H
O M
A : waiting time
B : turnaround time
C : response time
D : throughput

A
AH
C : process
S W
T
A
P H
O M
D : something else

C : <macro name>
D : <call macro>
A
AH
S W
T
H A
M P
A : Compiler
O
B : Interpreter
C : Assembler
D : Loader
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : seek time
time?
AHA
W
S
AT
P H
O M
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Dos
B : Unix
C : System software
D : code generation
AHA
W
S
C : SCAN
AT
D : Circular SCAN
P H
M
O
B : Compaction
D : Division
D : expanding macro

A : minimum
B : average
C : maximum
A
D : approximate
AH
S W
T
H A
M P
D : translator
O
A : compiler
B : assembler
C : loader
D : interpreter
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these

specification.
A : START
B : END
C : ORIGIN
AHA
W
S
AT
P H
O M

A : Counters
B : RAM & Registers
AHA
D : Registers
W
S
AT
P H
O M
time.
A : Indexed files
B : Direct files
D : data dependant
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
A
AH
S W
T
H A
P
O M
D : resources
D : PL domain only
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Text editor
B : Assembler
C : Linker
D : Loader
A
AH
W
S
B : Logical I/O
AT
C : Device I/O
P H
O M
Q.no 3. A macro is
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
A
D : Myfile.obj
AH
W
S
A : all process
AT
P H
C : parent process
O M
D : init process
A : macro prototype
D : macro call

A : Stop
B : Return
C : OP
A
D : End
AH
S W
T
B : control program
H A
M P
D : All
O
track is known as
A : seek time
C : access time
D : Transfer time
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A
AH
S W
called as
AT
A : Polling
P H
B : Inspection
O M
C : Reviewing
D : Echoing
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : Machine code
D : A parse tree
A
B : statement
AH
C : Numeric data
S W
D : ASCII data
T
A
P H
A : procedure
O M
B : subroutine
C : macro
algorithm
algorithm
space of a process
A : magnetic disks
C : assemblies
D : cylinders
A
AH
S W
T
H A
M P
O
C : lexical errors
page
A : is in the TLB
B : has data in it

A
AH
A : Identifiers
S W
B : Constants
T
C : Keywords
H A
M P
O
A : key
B : value
C : bit value
D : constant

D : priority
A : START
B : BEGIN
C : MACRO
A
AH
A : USING
S W
B : BALR
T
C : DROP
H A
D : ORG
M P
O
A : system software
C : both 1 & 2
D : not a software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Parser
B : Optimizer
C : Scanner
D : Loader
A
AH
W
S
A : write ahead
AT
B : read ahead
P H
C : free-behind
O M
D : add-front
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : Stack
B : Queue
A
C : Linked list
AH
S W
AT
P H
O M
D : Both 1 & 2

A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
T
Belady’s Anomaly?
H A
M P
B : LRU
O
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
A
AH
B : page size
S W
T
H A
P
M
O
A : Bit tables
C : Indexing
D : Free Block List




program
A : works well
A
AH
S W
category of 'var1 '
AT
A : Identifier
P H
B : Number
O M
C : Keyword
D : operator
Firefox https://sppu.wheebox.com/WAC-3/allqusdownloadhtml.ils?testNo=585...
Seat No -
PWD10892_SYSTEMS PROGRAMMING
Time : 1hr
Max Marks : 50
N.B
AHA
S W
AT
H
M P
O
Q.no 1. In a two pass assembler the object code generation is done during the
A : Second pass
B : First pass
C : Zeroeth pass
D : In all passes
Q.no 2. Each execution of procedure is called as
A : activation
B : execution
C : symbol
D : environment
Q.no 3. Which order of expansion nested macro calls follows?
1 of 26 25-12-2020, 03:51:33 pm
A : First In first Out
B : First In Last Out
C : Last In First Out
D : Last In Last Out
Q.no 4. To derive a string using the production rules of a given grammar, we use:
A : Position where next reduce or shift operation will occur
B : The next step has use of Non-terminal for reduction
A
C : Used for reduction in a coming-up step along with a position in the sentential form where the
AH
next shift or reduce operation will occur
W
D : Used in the next step for reduction along with a position in the sentential form where the right
S
hand side of the production may be found
AT
Q.no 5. The assembler which performs macro expansion as well as assembly is called as
P H
A : Macro processor
M
B : Macro preprocessor
O
C : Macro
D : Macro assembler
Q.no 6. What is the output of a lexical analyzer?
A : Machine Code
B : Intermediate Code
C : Stream of Token
D : Parse Tree
Q.no 7. A compiler is
A : A program that place program into memory and prepares them for execution
B : A program that automates the translation of assembly language into machine language
C : program that accepts program written in high level language and produces an object program
D : A program that appears to execute a source program as if it were machine language
2 of 26 25-12-2020, 03:51:33 pm
Q.no 8. Three address code generated , Arrays are
A : One Dimensional
B : Not Supported
C : Multi Dimensional
D : Supported using pointer
Q.no 9. Which one of the following is a top-down parser?
A : Ambiguous
A
B : Unambiguous
AH
C : Regular
S W
D : Irregular
AT
Q.no 10. Type checking is normally done during ?
P H
M
B : Syntax analysis
O
C : Syntax directed translation
D : Code generation
Q.no 11. Which of these is not a part of Synthesis phase
A : Obtain machine code corresponding to the mnemonic from the Mnemonics table
B : Obtain address of a memory operand from the symbol table
C : Perform LC processing
D : Synthesize a machine instruction or the machine form of a constant
Q.no 12. Which of the following class of statement usually produces no executable code when
compiled?
A : Declarative statement
B : Input output statement
C : Loops
3 of 26 25-12-2020, 03:51:33 pm
D : Structural statement
Q.no 13. Which table is designed to hold names of all macros defined in a program?
A : Macro Name Table
B : Macro Definition Table
C : Macro Parameter Name Table
D : Actual Parameter table
A
A : Stop
AH
B : Return
S W
C : OP
AT
D : End
P H
Q.no 15. the main task of the lexical analyzer is
M
A : to read the input characters of the source program
O
B : group them into lexemes
C : produce as output a sequence of tokens for each lexeme in the source program
D : All of above
Q.no 16. TII stands for
A : Table of incomplete instructions
B : Table of information instructions
C : Translation of instructions information
D : Translation of information instruction
Q.no 17. Which amongst LR Parsers is the most powerful.
A : Top down Parser
B : Bottom Up parser
C : May be top down or bottom up
4 of 26 25-12-2020, 03:51:33 pm
D : Both top down and bottom up
Q.no 18. What a macro call leads to?
A : Macro Expansion
B : Macro Execution
C : Macro Linking
D : Macro Change
Q.no 19. Which of the following is advanced macro a facility?
A
A : LTORG
AH
B : ORIGIN
S W
C : EQU
AT
D : Expansion Time sequensing symbol
P H
Q.no 20. A graph that shows basic blocks and their successor relationship is called as
M
A : Flow graph
O
B : control graph
C : Hamiltonion graph
D : DAG
Q.no 21. Attribute which indicates value of the expression for a non terminal in sematic action
is known as
A : code
B : place
C : mode
D : record
Q.no 22. YACC is a computer program for ______ operation system.
A : Windows
B : DOS
5 of 26 25-12-2020, 03:51:33 pm
C : Unix
D : openSUSE
Q.no 23. The action of parsing the source program into proper syntactic classes is called
__________
A : LALR parser
B : LL parser
C : Recursive Accent parser
D : LR Parser
AHA
Q.no 24. The assembler directive EQU, when used in the instruction: Sum EQU 200 does
________
S W
A : Finds the first occurrence of Sum and assigns value 200 to it
AT
B : Replaces every occurrence of Sum with 200
P H
C : Re-assigns the address of Sum by adding 200 to its original address
M
D : Assigns 200 bytes of memory starting the location of Sum
O
Q.no 25. The lexical analyzer reads the stream of characters making up the source program
and groups the characters into meaningful sequences called -------------
A : lexemes
B : Pattern
C : Tokens
D : Error
Q.no 26. Attribute which indicates type of the result for a non terminal in sematic action is
known as
A : code
B : place
C : mode
D : record
Q.no 27. Attribute which indicates three address code generated for a non terminal in sematic
6 of 26 25-12-2020, 03:51:33 pm
action is known as
A : code
B : place
C : mode
D : record
Q.no 28. Induction variables and Reduction in strengths is part of which phase
A : Intermediate code generation
A
B : Storage allocation
AH
S W
D : Parser
AT
Q.no 29. Which of the following derivations does a top-down parser use while parsing an
H
input string?
P
A : Syntax Analysis
O M
B : Lexical Analysis
C : Interpretation analysis
D : General Syntax Analysis
Q.no 30. Which of the following is Macro Preprocessor Statement?
A : ORIGIN
B : AIF
C : AGO
D : SET
Q.no 31. Which is NOT a implementation For TAC
A : Quadruple
B : Postfix Notation
C : Triple
7 of 26 25-12-2020, 03:51:33 pm
D : Indirect Triple
Q.no 32. Computer program can be optimized by
A : Type Checking
B : Common Subprograms
C : Dead Code elimination
D : Copy intermediate loop
A
AH
S W
AT
D : data dependant
P H
Q.no 34. Which of the following is used for grouping of characters into tokens
M
A : Yes Another Compile Compiler
O
B : Yet Another Compile Compiler
C : Yet Another Compiler Compiler
D : Yes Another Compiler Compiler
_________
D : something else
Q.no 36. A --------- is a sequence of characters in the source program that matches
the pattern for a token and is identied by the lexical analyzer as an
instance of that token
A : lexemes
8 of 26 25-12-2020, 03:51:33 pm
B : Pattern
C : Tokens
D : Error
Q.no 37. which of the following is a example of relocating loaders?
A : Absolute loader
B : Compile and Go loader
C : Binary Symbolic Subroutine
A
D : Assemble and Go loader
AH
Q.no 38. What a subroutine name in a call leads to?
S W
A : Execution
AT
B : Expansion
P H
C : Error
M
D : Loop
O
Q.no 39. Allocation strategy which allocates and deallocates storage as needed at runtime
from data area is known as
A : Static Allocation
B : Stack Allocation
C : Dynamic Allocation
D : Heap Allocation
Q.no 40. The input string is in I/p buffer followed by the right end marker -------
A:$
B:*
C:%
D:#
Q.no 41. printf("Total = %d\n", score); In this statement "Total = %d\n" is lexem matching
with token ---------
9 of 26 25-12-2020, 03:51:33 pm
A : ID
B : Keyword
C : Literal
D : Pattern
Q.no 42. The _______ table is created by YACC.
B : Syntax analysis
A
AH
D : Code generation
S W
Q.no 43. Which of the following is true for a predictive parser?
AT
A : Analyzing
P H
B : Recognizing
M
C : Tokenizing
O
D : Parsing
Q.no 44. if attributes of child node depends on its parent node then it is called as ……………
A : TAC
B : synthesised
C : inherited
D : directed
Q.no 45. In direct conversion of RE to DFA, If Node is . (Cat node) c1.c2 then Firstpos(node) is
A : if nullable(c1) then firstpos(c1) Union firstpos(c2)

else firstpos(c1)
B : fistpos(c1)
C : if nullable(c2) then firstpos(c1) Union firstpos(c2)

else firstpos(c1)
D : Not Calculated
10 of 26 25-12-2020, 03:51:33 pm
Q.no 46. Which of the following statements is false?
A : LALR parsing
B : LL parsing
C : GLR parsing
D : LR Parsing
Q.no 47. Consider the basic block given below

a=b+c
c=a+d
d=b+c
A
e=d-b
AH
a=e+b
The minimum number of nodes and edges present in the DAG representation of the above
W
basic block respectively are
S
A : 6 and 6
AT
B : 8 and 10
P H
C : 4 and 4
O M
D : 8 and 8
Q.no 48. Which of the following system program forgoes the production of object code to
generate absolute machine code and load it into the physical main storage location from which
it will be executed immediately upon completion of the assembly?
A : compiler
B : macroprocessor
C : two pass assembler
D : load-and-go assembler
Q.no 49. Postfix notation for the given expression is

x= c ? a: b
A : xcab?:=
B : xcab: ? =
C : xcab=?:
D : xc=ab:?
11 of 26 25-12-2020, 03:51:33 pm
Q.no 50. In which loading scheme programmer must specify to the assembler the address in
core where the program is be be loaded?
A : Dynamic Linking
B : Dynamic loading
D : Absolute Loader
Q.no 51. Which card contain the actual object code translated version of source program in
direct linking loading scheme?
A
A : TXD(Text card)
AH
B : External Symbol Dictionary card
S W
C : Relocation and Linkage Directory card
AT
D : END card
P H
Q.no 52. To recognize the tokens in the input stream--------------------- and ------------ are
convenient ways of designing recognizers.
O M
A : Transition Diagrams, Finite Automata
B : Transition Diagram, NFA
C : Transaction Diagram, Finite Automata
D : Transaction diagram, NFA
Q.no 53. The assembler stores the object code in ______
A : Main memory
B : Cache
C : Mangnetic Disk
D : RAM
Q.no 54. Which of the following describes a handle (as applicable to LR-parsing)
appropriately?
A : Parser
B : code generator
12 of 26 25-12-2020, 03:51:33 pm
C : Lexical Analyzer
D : Code optimizer
Q.no 55. In direct conversion of RE to DFA, If Node is * (star node) having one child c1 then
lastpos(node) is
A : lastpos(c1)
B : lastpos(previousnode)
C : firtspos(node)
D : lastpose(node)
AHA
Q.no 56. The least number of temporary variables required to create a three-address code in
static single assignment form for the expression
W
q + r/3 + s – t * 5 + u * v/w is
T S
A:4
H A
B:8
P
C:7
O M
D:9
Q.no 57. Which is not charectristic of Peephole optimization
A : Redundant- instruction elimination
B : Flow of control optimization
C : Algebraic simplification
D : Not producing new code
Q.no 58. In which mechanism loading and linking of external references are postponed until
execution time?
A : Direct Linking Loader
B : Dynamic loading
C : Absolute Loader
D : Dynamic Linking
Q.no 59. In BSS what is used to solve the problem of relocation?
13 of 26 25-12-2020, 03:51:33 pm
A : Relocation bit
B : Allocation bit
C : Transfer vector
D : Program Length
Q.no 60. What does the assembler psudo opcode EXTRN followed by list of symbol indicate?
A : these symbols are defined in other programs but referenced in present program
B : these symbols are defined in present program but referenced in other programs
A
C : Global variable
AH
D : Expansion time variables
S W
Q.no 1. ________ is a process of finding parse tree for a string of tokens
AT
A : SLR
P H
B : CLR
M
C : LALR
O
D : LLR
Q.no 2. Use of macro name in mnemonic field of an assembly statement leads to what?
A : Macro Expansion
B : Macro Execution
C : Macro control transfer
D : Macro replacement
Q.no 3. In a two-pass assembler, the task of the Pass II is to
A : separate the symbol, mnemonic opcode and operand fields
B : build the symbol table.
C : construct intermediate code.
D : synthesize the target program
Q.no 4. Functions of Lexical analyzer are ?
14 of 26 25-12-2020, 03:51:33 pm
A : Removing white space
B : Removing constants, identifiers and keywords
C : Removing comments
D : All of above
Q.no 5. Peep-hole optimization is a form of
A : data flow analysis
B : Constant folding
A
C : Local optimization
AH
D : Loop Optimization
S W
Q.no 6. The graph that is used in code optimization is
AT
A : Flow graph
P H
B : DAG
M
C : Control Graph
O
D : Multi graph
Q.no 7. Translation of parse tree to intermediate form is called as
A : Syntax Directed Translation
B : lecical analysis
C : syntax analysis
D : code geeration
Q.no 8. Which of the following is not a type of assembler
A : One pass
B : Two pass
C : Three pass
D : Load and go
Q.no 9. A processor-
15 of 26 25-12-2020, 03:51:33 pm
A : is a sequence of instructions
B : is the device where information is stored
C : is a device that performs a sequence of operations specified by instructions in memory
D : is the device where programs are stored stored
Q.no 10. Which of the following provides program generation facility through expansion?
A : Assembler
B : Macros
A
C : Compiler
AH
D : Loader
S W
Q.no 11. One of the purposes of using intermediate code in compilers is to
AT
A : make parsing and symantic analysis simpler
P H
B : improve error recovery
M
C : improve the chances of resusing machine independent code optimizer in other compiler
O
D : improve register allocation
Q.no 12. Machine independent optimization is related with
A : recognization of basic syntactic construction through reductions
B : recognition of basic elements and creation of uniform symbols
C : creation of more optimal code
D : use of macro-processor to produce more optimal assembly code
Q.no 13. Shift reduce parsers are __________
A : Right most derivation
B : Rightmost derivation in reverse
C : Leftmost derivation
D : Leftmost derivation in reverse
Q.no 14. In three address code , Arrays are
16 of 26 25-12-2020, 03:51:33 pm
A : not supported
B : one dimentional
C : Two dimentional
D : supported via pointers
Q.no 15. What macro prototype statements declares?
A : The name of macro
B : The parameters of macro
A
C : the name of macro and the names and kinds of its parameter
AH
D : macro definition
S W
Q.no 16. Allocation strategy which lays out data objects at compile time is known as
AT
A : Static Allocation
P H
B : Stack Allocation
M
C : Dynamic Allocation
O
D : Heap Allocation
Q.no 17. The concept of grammar is much used in this part of the compiler
A : lexical analysis
B : parser
C : code generation
Q.no 18. Given the following expression grammar:

E -> E * F | F+E | F
F -> F-F | id
B : Leftmost derivation in reverse
D : Rightmost derivation in reverse
17 of 26 25-12-2020, 03:51:33 pm
Q.no 19. all information required for a single activation procedure is contained in
A : stack
B : activation record
C : tree
D : environment
Q.no 20. The nodes of Abstract Syntax Tree deals with which of the following entities
A : Syntactic
A
B : Semantic
AH
C : Operators
S W
D : Operands
AT
Q.no 21. ------------- phase designed to improve the intermediate code.
P H
A : Code optimization
M
B : Code Generation
O
C : Intermediate code generator
D : Syntax Analyzer
Q.no 22. What is used to describe tokens and identifiers.
A : Parser
B : Lexical Analyzer
C : Regular Expression
D : Regular Grammar
Q.no 23. Intermediate code generation for a compiler is
A : Must
B : Optional
C : Depends on language
D : Never
18 of 26 25-12-2020, 03:51:33 pm
Q.no 24. In which loading scheme assembler simply places the code into core and the loader
consists of one instruction that transfers to the starting instruction of the newly assembled
program?
A : Absolute loader
B : Assemble and Go loader
D : Direct Linking Loader
Q.no 25. Forward reference is
A
A : A reference to a label that is defined in the program before its use
AH
B : A reference to a label that is defined later in the program
S W
C : A reference to a label that is defined anywhere in the program
AT
D : A reference to a label that is defined in the another program
P H
Q.no 26. LALR in LALR parser stands for:
M
A : Recursive Descent parser
O
B : no backtracking
C : Recursive Descent parser and no backtracking
D : Recursive Descent parser and backtracking
Q.no 27. In compiler " Reduction in strength means "
A : Removing common subexpressions
B : Removing Loop invariant computation
C : Replacing run time computation by compile time computation
D : replacing a costly set of Instruction by a relatively cheaper one
Q.no 28. The purpose of the ORIGIN directive is __________
A : To indicate the starting of the computation code
B : To indicate the starting position in memory, where the program block is to be stored
C : To indicate the purpose of the code
19 of 26 25-12-2020, 03:51:33 pm
Q.no 29. Which of the following might be used to convert high-level language instructions into
machine language?
A : system software
B : applications software
C : an operating environment
D : an interpreter
Q.no 30. Syntax Directed defination that uses synthesized attribute only is called as
AHA
A : L attributed defination
W
B : S-attributed defination
T S
C : SL attributed defination
H A
D : R-attributed defination
P
Q.no 31. When code is generated for " a < b and c > d" , location left for backpatching are
O M
A : falselist of a< b
B : falselist of a<b and falselist of c>d
C : falselist of a<b ,falselist of c>d, truelist of c >d
D : Truelist of a< b,falselist of a<b and falselist of c>d, truelist of c >d
Q.no 32. Which is NOT a component of activation record
A : return Value
B : local data
C : Saved machine status
D : global data
Q.no 33. When expression sum=3+2 is tokenized then what is the token category of 3?
A : Identifier
20 of 26 25-12-2020, 03:51:33 pm
C : Integer Literal
Q.no 34. The grammar A → AA | (A) | e is not suitable for predictive-parsing because the
grammar is?
A : Scanning
B : Parsing
C : Derivation
D : Reduction
AHA
Q.no 35. Which statement is used to perform auxiliary functions during macro expansion?
W
A : Preprocessor statement
T S
B : Model atatement
H A
C : Prototype statement
P
D : Macro call
O M
Q.no 36. The ------------- phase receives optimized intermediate codes and generates the code
for
execution
A : Code optimization
B : Lexical Analyzer
C : Code Generator
D : Syntax Analyzer
Q.no 37. Which of the following is used to keep track of currently -active activation
A : control stack
B : activation
C : execution
D : symbol
Q.no 38. Which of the following identifies mutually exclusive subroutines?
21 of 26 25-12-2020, 03:51:33 pm
A : Linker
B : Assembler
C : Macro
D : Overlay Structure
Q.no 39. In which loading scheme core is occupied by assembler and unavailable to other
object deck?
A : Compile and Go loader
B : Direct Linking Loader
AHA
C : Binders
W
D : Dynamic Linking
T S
Q.no 40. A graphical representation for derivations that filter out the choice regarding
A
replacement order is called the -----------------
P H
A : Graph tree
M
B : Parse tree
O
C : Symol Tree
D : Graph
Q.no 41. Decressing number of instruction in loop is done infollowing optimization technique
A : Elimination of Subexpression
B : Code propogation
C : Dead code elimination
D : Code Motion
Q.no 42. Which of the following is true for a predictive parser?
A : Analyzing
B : Recognizing
C : Tokenizing
D : Parsing
22 of 26 25-12-2020, 03:51:33 pm
Q.no 43. In BSS what is used to solve the problem of relocation?
A : Relocation bit
B : Allocation bit
C : Transfer vector
D : Program Length
Q.no 44. What does the assembler psudo opcode EXTRN followed by list of symbol indicate?
A : these symbols are defined in other programs but referenced in present program
A
B : these symbols are defined in present program but referenced in other programs
AH
C : Global variable
S W
D : Expansion time variables
AT
Q.no 45. In which loading scheme programmer must specify to the assembler the address in
H
core where the program is be be loaded?
P
A : Dynamic Linking
O M
B : Dynamic loading
D : Absolute Loader
Q.no 46. Postfix notation for the given expression is

x= c ? a: b
A : xcab?:=
B : xcab: ? =
C : xcab=?:
D : xc=ab:?
Q.no 47. The assembler stores the object code in ______
A : Main memory
B : Cache
C : Mangnetic Disk
23 of 26 25-12-2020, 03:51:33 pm
D : RAM
Q.no 48. To recognize the tokens in the input stream--------------------- and ------------ are
convenient ways of designing recognizers.
A : Transition Diagrams, Finite Automata
B : Transition Diagram, NFA
C : Transaction Diagram, Finite Automata
D : Transaction diagram, NFA
Q.no 49. if attributes of child node depends on its parent node then it is called as ……………
AHA
A : TAC
W
B : synthesised
T S
C : inherited
H A
D : directed
P
Q.no 50. Which of the following statements is false?
O M
A : LALR parsing
B : LL parsing
C : GLR parsing
D : LR Parsing
Q.no 51. Which of the following describes a handle (as applicable to LR-parsing)
appropriately?
A : Parser
B : code generator
C : Lexical Analyzer
D : Code optimizer
Q.no 52. The _______ table is created by YACC.
B : Syntax analysis
24 of 26 25-12-2020, 03:51:33 pm
D : Code generation
Q.no 53. In direct conversion of RE to DFA, If Node is * (star node) having one child c1 then
lastpos(node) is
A : lastpos(c1)
B : lastpos(previousnode)
C : firtspos(node)
D : lastpose(node)
AHA
Q.no 54. In which mechanism loading and linking of external references are postponed until
execution time?
S W
A : Direct Linking Loader
AT
B : Dynamic loading
P H
C : Absolute Loader
M
D : Dynamic Linking
O
Q.no 55. In direct conversion of RE to DFA, If Node is . (Cat node) c1.c2 then Firstpos(node) is
A : if nullable(c1) then firstpos(c1) Union firstpos(c2)

else firstpos(c1)
B : fistpos(c1)
C : if nullable(c2) then firstpos(c1) Union firstpos(c2)

else firstpos(c1)
D : Not Calculated
Q.no 56. Which card contain the actual object code translated version of source program in
direct linking loading scheme?
A : TXD(Text card)
B : External Symbol Dictionary card
C : Relocation and Linkage Directory card
D : END card
25 of 26 25-12-2020, 03:51:33 pm
Q.no 57. Which of the following system program forgoes the production of object code to
generate absolute machine code and load it into the physical main storage location from which
it will be executed immediately upon completion of the assembly?
A : compiler
B : macroprocessor
C : two pass assembler
D : load-and-go assembler
Q.no 58. Which is not charectristic of Peephole optimization
A
A : Redundant- instruction elimination
AH
B : Flow of control optimization
S W
C : Algebraic simplification
AT
D : Not producing new code
P H
Q.no 59. Consider the basic block given below
a=b+c
M
c=a+d
O
d=b+c
e=d-b
a=e+b
The minimum number of nodes and edges present in the DAG representation of the above
basic block respectively are
A : 6 and 6
B : 8 and 10
C : 4 and 4
D : 8 and 8
Q.no 60. The least number of temporary variables required to create a three-address code in
static single assignment form for the expression
q + r/3 + s – t * 5 + u * v/w is
A:4
B:8
C:7
D:9
26 of 26 25-12-2020, 03:51:33 pm
Seat No -

Time : 1hr
Max Marks : 50
N.B
AHA
S W
AT
H
P
O M
A : wait queue
B : ready queue
C : cpu

A : all process
C : parent process
D : init process
A : System call
B : API
C : library
D : shell
A
AH
S W
T
H A
A : assembler
M P
B : compiler
O
C : loader
D : interpreter
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
3
A : Identifier
C : Integer Literal
A
AH
S W
T
D : Both 1 & 3
H A
M P
O
B : code generation
C : syntax analysis
A : Stop
B : Return
C : OP
D : End
A : PS
B : TOP
C : fork
D : kill
A
A : FCFS
AH
B : SJF
S W
C : RR
T
D : priority
H A
M P
A : frame bit
O
B : page number
C : page offset
D : frame offset
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code
AHA
A : Exceptions
W
B : Signal handling
S
C : Interrupts
AT
D : DMA
P H
M
O
A : job queue
B : ready queue
C : execution queue
D : process queue
A : error
B : protection
D : access

D : Both 1 & 2
A : Indexed files
B : Direct files
A
AH
performed by
W
S
B : Syntax analysis
AT
P H
O M
page
A : is in the TLB
B : has data in it
A : file extension
C : file name
AHA
D : something else
W
S
AT
P H
O M
D : expanding macro
A : magnetic disks
C : assemblies
D : cylinders
A
AH
W
S
A : procedure
AT
B : subroutine
P H
C : macro
O M
the jobs.
D : critical ratio
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Attributes
B : Protocol
C : Location
D : Ownership
A
C : both 1 & 2
AH
D : function
S W
T
H A
M P
C : seek time
O
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A
AH
S W
T
A : compiler
H A
B : assembler
M P
C : loader
O
D : interpreter
D : translator
A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
AT
P H
O M
A : minimum
B : average
C : maximum
D : approximate
AHA
B : Syntax analysis
W
S
AT
H
category of 'var1 '
M P
A : Identifier
O
B : Number
C : Keyword
D : operator




program

D : data dependant
time.
A : Indexed files
B : Direct files
A
AH
S W
AT
A : Counters
P H
B : RAM & Registers
O M
D : Registers
specification.
A : START
B : END
C : ORIGIN
B : page size

A
AH
S W
T
A
called as
P H
A : Polling
O M
B : Inspection
C : Reviewing
D : Echoing
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : waiting time
B : turnaround time
C : response time
D : throughput
A : END
B : ENDS
C : MEND
D : ENDD
A
A : macro prototype
AH
S W
T
D : macro call
H A
M P
O
A : Left to right
C : Right to left
C : instruction
D : Opcodes
A
AH
S W
T
H A
P
O M
B : File system
in memory is called
A : demand paging
B : virtual memory

A
AH
S W
T
H A
M P
O
B : Syntax trees
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU

B : Compaction
D : Division
AHA
W
S
AT
P H
O M
C : process

C : lexical errors
A : key
B : value
C : bit value
D : constant
A
AH
S W
T
H A
M P
O
A : USING
B : BALR
C : DROP
D : ORG

A
AH
A : cpu
S W
B : primary memory
T
H A
M P
O
A : any language
C : c language

A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A
AH
S W
A : LOOK
T
B : SCAN
H A
C : C-SCAN
M P
D : C-LOOK
O
C : seek time
A : Bit table
C : Indexing
D : Free Block List
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A
AH
W
S
AT
P H
O M
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

AHA
D : no error occurs
W
S
AT
P H
O M
D : Both 1 & 2
D : PL domain only
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
T
A
P H
A : Bit tables
O M
C : Indexing
D : Free Block List
A : Stack
B : Queue
C : Linked list
A : works well

D : resources
A : Second pass
AHA
B : First pass
W
C : Zeroth pass
S
AT
P H
A : compilation
O M
B : execution
C : loading
D : linking
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
A
AH
S W
T
H A
M P
O
A : Machine code
D : A parse tree

Q.no 5. SJF can be
A : preemptive only
D : sequential
A
AH
S W
T
H A
M P
A : Interrupts
O
B : Memory mapping
D : DMA
A : frame bit
B : page number
C : page offset
D : frame offset
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : page-fault rate
C : hit ratio
A
A : SJF-P
AH
B : FCFS
S W
C : RR
T
D : Priority
H A
M P
A : System call
O
B : API
C : library
D : shell
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
AHA
W
S
AT
P H
O M
B : control program
D : All

A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A
AH
S W
T
H A
P
O M
dynamic loading

C : SCAN
AHA
D : Circular SCAN
W
S
AT
P H
O M
performed by
B : Syntax analysis

C : <macro name>
D : <call macro>
A : Source code
A
C : Target code
AH
D : tokens
S W
T
A
algorithm
P H
M
algorithm
O
D : code generation

A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A
AH
S W
T
H A
M P
O
D : priority
time?

A : Attributes
B : Protocol
C : Location
D : Ownership
A
A : Identifiers
AH
B : Constants
S W
C : Keywords
T
H A
M P
O
D : translator

specification.
AHA
A : START
W
B : END
S
C : ORIGIN
AT
P H
O M



program
time.
A : Indexed files
B : Direct files
AHA
S W
T
H A
A : Counters
M P
B : RAM & Registers
O
D : Registers
A : compiler
B : assembler
C : loader
D : interpreter
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
AHA
W
B : page size
S
AT
P H
O M
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

B : Syntax analysis
AHA
called
S W
A : Ambiguous
T
B : Unambiguous
H A
C : Regular
M P
D : None of these
O
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : all process
C : parent process
D : init process
A : segmentation
B : swapping
A
AH
S W
T
H A
B : Syntax trees
M P
O
track is known as
A : seek time
C : access time
D : Transfer time
D : Round Robin
A : Parser
C : Code generator
in memory is called
A : demand paging
AHA
B : virtual memory
W
S
AT
H
M P
A : Swapping
O
B : Spooling
C : Semaphore
D : Scheduler
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : entire thread

D : entire process
A : wait queue
B : ready queue
C : cpu
AHA
W
S
AT
P H
O M
A : Left to right
C : Right to left
C : instruction
D : Opcodes
A
AH
S W
T
D : Both 1 & 3
H A
M P
A : FCFS
O
B : SJF
C : RR
D : priority
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : START
B : BEGIN
C : MACRO
A
A : file extension
AH
S W
C : file name
T
H A
M P
A : magnetic disks
O
C : assemblies
D : cylinders

D : Both 1 & 2

A
AH
A : error
S W
B : protection
T
H A
D : access
M P
O
the jobs.

D : critical ratio
A : Indexed files
B : Direct files
A
AH
A : key
S W
B : value
T
C : bit value
H A
D : constant
M P
O
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Dos
B : Unix
C : System software
A
AH
S W
T
H A
D : a key & value
M P
O
A : system software
C : both 1 & 2
D : not a software
A : Stack
B : Queue
C : Linked list
D : translator
A
AH
W
S
AT
P H
D : resources
O M
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
A
D : PL domain only
AH
W
S
T
A : Bit tables
H A
M P
C : Indexing
O
D : Free Block List
A : Second pass
B : First pass
C : Zeroth pass
A : works well
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
T
H A
M P
O
D : no error occurs
D : Both 1 & 2
A
AH
S W
T
H A
A : Lex
M P
B : Yacc
O
C : Iburg
D : both 1 & 3
A : compilation
B : execution
C : loading
D : linking
B : page size

A : Text editor
B : Assembler
C : Linker
D : Loader
A
AH
S W
T
H A
M P
O
A : Interrupts
B : Memory mapping
D : DMA

AHA
B : Logical I/O
W
C : Device I/O
S
AT
H
M P
O
B : File system
B : blocking I/O
D : synchronous I/O
A : job queue
B : ready queue
C : execution queue
D : process queue
A
A : frame bit
AH
B : page number
S W
C : page offset
T
D : frame offset
H A
P
O M
A : word proccessor
B : spreadsheet
D : Unix
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : control program
D : All
A : waiting time
B : turnaround time
C : response time
D : throughput
AHA
W
S
AT
P H
O M
Q.no 19. A macro is
A : object code
D : machine code
C : seek time
A
AH
S W
T
H A
M P
O
A : any language
C : c language
B : statement
C : Numeric data
D : ASCII data
D : priority
A
AH
S W
T
H A
M P
O

C : lexical errors
A
AH
W
A : Bit table
S
AT
C : Indexing
P H
D : Free Block List
O M
C : seek time
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : USING
B : BALR
C : DROP
D : ORG
A
AH
dynamic loading
S W
T
H A
M P
O
time?
A : Source code
C : Target code
D : tokens

A : Identifiers
B : Constants
C : Keywords
A
AH
S W
T
A : Stack
H A
B : Queue
M P
C : Linked list
O
B : Syntax analysis
specification.
A : START
B : END
C : ORIGIN

time.
A : Indexed files
B : Direct files
AHA
A : Counters
W
B : RAM & Registers
S
AT
D : Registers
P H
O M
A : compiler
B : assembler
C : loader
D : interpreter
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
AHA
W
S
AT
P H
O M
D : data dependant
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these



program
A
AH
S W
T
A
H
M P
A : minimum
O
B : average
C : maximum
D : approximate

AHA
W
B : page size
S
AT
P H
M
O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
C : RR
D : priority
A : System call
B : API
C : library
D : shell
C : instruction
D : Opcodes
A
AH
track is known as
W
A : seek time
S
AT
C : access time
P H
D : Transfer time
O M
in memory is called
A : demand paging
B : virtual memory
A : macro prototype
D : macro call

occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
A : Stop
B : Return
C : OP
A
D : End
AH
W
called as
S
A : Polling
AT
B : Inspection
P H
C : Reviewing
O M
D : Echoing
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
Q.no 12. SJF can be
A : preemptive only
D : sequential

B : page-fault rate
C : hit ratio
A
AH
S W
T
H A
M P
O

A
AH
S W
T
H A
M P
O
A : Dos
B : Unix
C : System software
page
A : is in the TLB
B : has data in it
A : LOOK
A
B : SCAN
AH
C : C-SCAN
S W
D : C-LOOK
T
A
P H
A : procedure
O M
B : subroutine
C : macro
performed by
B : Syntax analysis
algorithm
algorithm
A
AH
S W
T
H A
M P
O
D : something else
B : Compaction
D : Division

space of a process
A : file extension
C : file name
AHA
W
S
T
A : Parser
H A
B : Optimizer
M P
C : Scanner
O
D : Loader
C : process
A : Attributes
B : Protocol
C : Location
D : Ownership
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : cpu
B : primary memory
A
AH
S W
T
H A
M P
C : <macro name>
O
D : <call macro>
A : Stack
B : Queue
C : Linked list
A : Second pass
B : First pass
C : Zeroth pass
B : Syntax analysis
AHA
W
S
AT
A : Lex
P H
B : Yacc
O M
C : Iburg
D : both 1 & 3

A : compilation
B : execution
C : loading
D : linking
Belady’s Anomaly?
B : LRU
AHA
C : FIFO
W
S
T
H A
A : Bit tables
M P
O
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Bit tables
C : Indexing
D : Free Block List
specification.
A : START
B : END
C : ORIGIN
AHA
W
S
AT
P H
M
O
D : no error occurs
A : works well

A : write ahead
B : read ahead
C : free-behind
D : add-front
AHA
S W
A : Bit tables
T
H A
C : Indexing
M P
D : Free Block List
O
D : PL domain only

A : word proccessor
B : spreadsheet
AHA
D : Unix
W
S
T
A : all process
H A
M P
C : parent process
O
D : init process
A : Machine code
D : A parse tree
D : Round Robin
B : Logical I/O
C : Device I/O
AHA
W
S
AT
P H
A : Left to right
O M
C : Right to left
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language

D : Both 1 & 3
A : SJF-P
A
B : FCFS
AH
C : RR
S W
D : Priority
T
H A
M P
O
A : segmentation
B : swapping

A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : END
AHA
B : ENDS
W
C : MEND
S
D : ENDD
AT
P H
A : assembler
O M
B : compiler
C : loader
D : interpreter
B : control program
D : All
A
AH
S W
T
H A
M P
O
D : expanding macro
B : statement
C : Numeric data
D : ASCII data
C : seek time
time?
AHA
W
S
D : code generation
AT
P H
O M
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : Identifiers
AHA
B : Constants
W
C : Keywords
S
AT
P H
A : START
O M
B : BEGIN
C : MACRO

D : a key & value

D : Both 1 & 2
A
AH
S W
T
H A
M P
O
A : Bit table
C : Indexing
D : Free Block List
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
performed by
A : Absolute Loader
B : Loader
C : Linker
AHA
D : Assembler
W
S
AT
A : minimum
P H
B : average
O M
C : maximum
D : approximate
A : compiler
B : assembler
C : loader
D : interpreter
time.
A : Indexed files
B : Direct files
A
AH
S W
T
H A
M P
O
D : data dependant

D : resources
A
AH
A : Counters
S W
B : RAM & Registers
T
H A
D : Registers
M P
O
D : translator
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
AHA
specification.
S W
A : START
T
B : END
H A
C : ORIGIN
M P
O
A : Bit tables
C : Indexing
D : Free Block List
AHA
W
S
AT
B : code generation
P H
C : syntax analysis
O M
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : frame bit
B : page number
C : page offset
D : frame offset
A
AH
S W
T
A : PS
H A
B : TOP
M P
C : fork
O
D : kill
A : job queue
B : ready queue
C : execution queue
D : process queue
B : File system
AHA
W
S
T
H A
A : wait queue
M P
B : ready queue
O
C : cpu
Q.no 12. SJF can be
A : preemptive only
D : sequential
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A
B : page-fault rate
AH
C : hit ratio
S W
T
Q.no 16. A macro is
H A
M P
O
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
called as
A
A : Polling
AH
B : Inspection
S W
C : Reviewing
T
D : Echoing
H A
M P
O
A : file extension
C : file name
A : Source code
C : Target code
D : tokens
A : Indexed files
B : Direct files
A
A : error
AH
B : protection
S W
T
D : access
H A
M P
O
A : magnetic disks
C : assemblies
D : cylinders
A : system software
C : both 1 & 2
D : not a software
the jobs.
AHA
W
S
AT
D : critical ratio
P H
O M
C : both 1 & 2
D : function
A : any language
C : c language
A
AH
S W
T
D : priority
H A
M P
O
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : cpu
B : primary memory
AHA
W
S
AT
P H
O M
Belady’s Anomaly?
B : LRU
C : FIFO

A : Stack
B : Queue
C : Linked list
A
AH
W
A : Bit tables
S
AT
C : Indexing
P H
D : Free Block List
O M
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : works well
A : Second pass
B : First pass
C : Zeroth pass
B : page size
AHA
W
S
AT
P H
O M
D : no error occurs



program
A : compilation
B : execution
C : loading
D : linking
A
AH
W
S
B : Syntax analysis
AT
P H
O M
D : Both 1 & 2
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler

D : PL domain only
A : Lex
B : Yacc
C : Iburg
A
D : both 1 & 3
AH
W
S
T
A : Bit tables
H A
M P
C : Indexing
O
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : object code
D : machine code

C : instruction
D : Opcodes
A : segmentation
B : swapping
A
AH
S W
T
A : Interrupts
H A
B : Memory mapping
M P
O
D : DMA
D : Round Robin
A : FCFS
B : SJF
C : RR
D : priority

A
AH
S W
T
A : System call
H A
B : API
M P
C : library
O
D : shell
B : Syntax trees

A
AH
S W
T
A : Parser
H A
M P
C : Code generator
O
A : Left to right
C : Right to left
A : SJF-P
B : FCFS
C : RR
D : Priority

in memory is called
A : demand paging
B : virtual memory
AHA
W
S
AT
P H
O M
A : waiting time
B : turnaround time
C : response time
D : throughput

A
AH
C : process
S W
T
A
P H
O M
D : something else

C : <macro name>
D : <call macro>
A
AH
S W
T
H A
M P
A : Compiler
O
B : Interpreter
C : Assembler
D : Loader
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : seek time
time?
AHA
W
S
AT
P H
O M
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Dos
B : Unix
C : System software
D : code generation
AHA
W
S
C : SCAN
AT
D : Circular SCAN
P H
M
O
B : Compaction
D : Division
D : expanding macro

A : minimum
B : average
C : maximum
A
D : approximate
AH
S W
T
H A
M P
D : translator
O
A : compiler
B : assembler
C : loader
D : interpreter
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these

specification.
A : START
B : END
C : ORIGIN
AHA
W
S
AT
P H
O M

A : Counters
B : RAM & Registers
AHA
D : Registers
W
S
AT
P H
O M
time.
A : Indexed files
B : Direct files
D : data dependant
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
A
AH
S W
T
H A
P
O M
D : resources
D : PL domain only
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Text editor
B : Assembler
C : Linker
D : Loader
A
AH
W
S
B : Logical I/O
AT
C : Device I/O
P H
O M
Q.no 3. A macro is
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
A
D : Myfile.obj
AH
W
S
A : all process
AT
P H
C : parent process
O M
D : init process
A : macro prototype
D : macro call

A : Stop
B : Return
C : OP
A
D : End
AH
S W
T
B : control program
H A
M P
D : All
O
track is known as
A : seek time
C : access time
D : Transfer time
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A
AH
S W
called as
AT
A : Polling
P H
B : Inspection
O M
C : Reviewing
D : Echoing
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : Machine code
D : A parse tree
A
B : statement
AH
C : Numeric data
S W
D : ASCII data
T
A
P H
A : procedure
O M
B : subroutine
C : macro
algorithm
algorithm
space of a process
A : magnetic disks
C : assemblies
D : cylinders
A
AH
S W
T
H A
M P
O
C : lexical errors
page
A : is in the TLB
B : has data in it

A
AH
A : Identifiers
S W
B : Constants
T
C : Keywords
H A
M P
O
A : key
B : value
C : bit value
D : constant

D : priority
A : START
B : BEGIN
C : MACRO
A
AH
A : USING
S W
B : BALR
T
C : DROP
H A
D : ORG
M P
O
A : system software
C : both 1 & 2
D : not a software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Parser
B : Optimizer
C : Scanner
D : Loader
A
AH
W
S
A : write ahead
AT
B : read ahead
P H
C : free-behind
O M
D : add-front
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : Stack
B : Queue
A
C : Linked list
AH
S W
AT
P H
O M
D : Both 1 & 2

A : Bit tables
AHA
C : Indexing
W
D : Free Block List
S
T
Belady’s Anomaly?
H A
M P
B : LRU
O
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
A
AH
B : page size
S W
T
H A
P
M
O
A : Bit tables
C : Indexing
D : Free Block List




program
A : works well
A
AH
S W
category of 'var1 '
AT
A : Identifier
P H
B : Number
O M
C : Keyword
D : operator
Operating System Questions & Answers – Processes
This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Processes”.
1. The systems which allow only one process execution at a time, are called __________
a) uniprogramming systems
b) uniprocessing systems
c) unitasking systems
d) none of the mentioned
Answer:b
A
Explanation: Those systems which allows more than one process execution at a time, are called
multiprogramming systems. Uniprocessing means only one processor.
A H
2. In operating system, each process has its own __________
a) address space and global variables
W
b) open files
S
c) pending alarms, signals and signal handlers
AT
d) all of the mentioned
Answer:d
H
Explanation: None.
P
3. In Unix, Which system call creates the new process?
a) fork
M
b) create
O
c) new
Answer:a
Explanation: None.
4. A process can be terminated due to __________
a) normal exit
b) fatal error
c) killed by another process
Answer: d
Explanation: None.
5. What is the ready state of a process?
a) when process is scheduled to run after some execution
b) when process is unable to run until some task has been completed
c) when process is using the CPU
Answer: a
Explanation: When process is unable to run until some task has been completed, the process
is in blocked state and if process is using the CPU, it is in running state.
6. What is interprocess communication?
a) communication within the process
b) communication between two process
c) communication between two threads of same process
Answer: b
Explanation: None.
7. A set of processes is deadlock if __________
a) each process is blocked and will remain so forever
b) each process is terminated
c) all processes are trying to kill each other
Answer: a
Explanation: None.
8. A process stack does not contain __________
a) Function parameters
A
b) Local variables
H
c) Return addresses
A
d) PID of child process
Answer: d
W
Explanation: None.
AT S
9. Which system call returns the process identifier of a terminated child?
a) wait
b) exit
H
c) fork
P
d) get
Answer: a
M
Explanation: None.
O
10. The address of the next instruction to be executed by the current process is provided by
the __________
a) CPU registers
b) Program counter
c) Process stack
d) Pipe
Answer: b
Explanation: None.
This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on “CPU
Scheduling”.
1. Which module gives control of the CPU to the process selected by the short-term
scheduler?
a) dispatcher
b) interrupt
c) scheduler
Answer: a
Explanation: None.
2. The processes that are residing in main memory and are ready and waiting to execute are
kept on a list called _____________
a) job queue
b) ready queue
c) execution queue
d) process queue
Answer: b
Explanation: None.
3. The interval from the time of submission of a process to the time of completion is termed as
____________
a) waiting time
b) turnaround time
c) response time
A
d) throughput
H
Answer: b
A
Explanation: None.
W
4. Which scheduling algorithm allocates the CPU first to the process that requests the CPU
S
first?
AT
a) first-come, first-served scheduling
b) shortest job scheduling
H
c) priority scheduling
P
M
Answer: a
O
Explanation: None.
5. In priority scheduling algorithm ____________
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) Equal priority processes can not be scheduled
d) None of the mentioned
Answer: a
Explanation: None.
6. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is
compared with the priority of ____________
a) all process
b) currently running process
c) parent process
d) init process
Answer: b
Explanation: None.
7. Which algorithm is defined in Time quantum?
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm
Answer: b
Explanation: None.
8. Process are classified into different groups in ____________
Answer: d
Explanation: None.
9. In multilevel feedback scheduling algorithm ____________
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
A
Answer: a
Explanation: None.
A H
10. Which one of the following can not be scheduled by the kernel?
a) kernel level thread
W
b) user level thread
S
c) process
AT
H
Answer: b
P
Explanation: User level threads are managed by thread library and the kernel is unaware of
them.
O M
This set of Operating System Multiple Choice Questions & Answers (MCQs) focuses on
“Deadlock”.
1. What is a reusable resource?

a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
Answer: a
Explanation: None.
2. Which of the following condition is required for a deadlock to be possible?
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
Answer: d
Explanation: None.
3. A system is in the safe state if ____________
a) the system can allocate resources to each process in some order and still avoid a deadlock
b) there exist a safe sequence
c) all of the mentioned
Answer: a
Explanation: None.
4. The circular wait condition can be prevented by ____________
a) defining a linear ordering of resource types
b) using thread
c) using pipes
Answer: a
Explanation: None.
5. Which one of the following is the deadlock avoidance algorithm?
a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
A
d) karn’s algorithm
A H
Answer: a
Explanation: None.
S W
6. What is the drawback of banker’s algorithm?
AT
a) in advance processes rarely know how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
H
P
Answer: d
M
Explanation: None.
O
7. For an effective operating system, when to check for deadlock?
a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mention
Answer: c
Explanation: None.
8. A problem encountered in multitasking when a process is perpetually denied necessary
resources is called ____________
a) deadlock
b) starvation
c) inversion
d) aging
Answer: b
Explanation: None.
9. Which one of the following is a visual ( mathematical ) way to determine the deadlock
occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
Answer: a
Explanation: None.
10. To avoid deadlock ____________
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used
Answer: a
Explanation: None.
Total- (10+10+10)
********************************************************************************
***** SPOS Question Bank on unit-IV
A H A
1. Dual mode of operating system has
S W
A. 1 mode
AT
B. 2 modes
C. 3 modes
H
D. 4 modes
P
ANSWER: B
M
2. Multi-processor system gives a
O
A. small system
B. tightly coupled system
C. loosely coupled system
D. both a and b
Answer B
3. Logical extension of multiprogramming operating system is
A. time sharing
B. multi-tasking
C. single programing
D. both a and b
Answer D
4. Multiprocessor system have advantage of
A. Increased Throughput
B. Expensive hardware
C. operating system
D. both a and b
ANSWER:A
5. Scheduling of threads are done by

A. input
B. output
C. operating system
D. memory
ANSWER:C
6. Multiprogramming of computer system increases
A. memory
B. storage
C. CPU utilization
A H A
S W
P H AT
O M
D. cost
ANSWER:
C
7. Another type of multiple-CPU system is the
A. mini Computer
B. Super Computer
C. Clustered System
D. both a and b
ANSWER:
A
C
AH
8. Interrupt table of pointers having addresses for each interrupt is located at
S W
A. high memory
B. low memory
T
C. mid memory
A
D. both a and b
H
ANSWER:
P
B
M
9. Example of open source operating system is
O
A. UNIX
B. Linux
C. windows
D. both a and b
ANSWER:
D
10. Main memory of computer system is also called
A. non volatile
B. volatile
C. reserved
D. large
ANSWER: B
11. Controller of computer system transfers data from device to
A. buffers
B. cache
C. registers
D. in
dexes
ANSWER:
A
12. When many users accesses mainframes, this approach is called as
A. resource allocation
B. word processors
C. dedicated resources
D. interface
ANSWER: A
AHA
T S W
P H A
O M
13. Accessing same data from storage of computer system is provided by
A. serial clusters
B. parallel clusters
C. Beowulf clusters
D. both a and b
ANSWER:
B
14. To start an I/O operation device driver loads appropriate register into?
A
A. memory
AH
B. Secondary storage
C. Device Controller
W
D. Ar
S
rays
T
ANSWER:
A
C
H
15. Symmetric multiprocessing architecture of computer system uses shared
M P
A. bus
O
B. memory
C. processors
D. both a and
b ANSWER: D
16. In asymmetric clustering other machines perform operations while one machine is in
A. hot standby mode

B. standby mode
C. reset mode
D. undefined mode
ANSWER: AAnswer
A
17. Ability to continuously providing service proportional to level of surviving hardware
A. graceful upgradation
B. degradation
C. upgradation
D. graceful
degradation
ANSWER: D
18. Secondary memory of computer system is also called
A. non volatile
B. volatile
C. reserved
D. small
AHA
T S W
P H A
O M
ANSWER: A
19. Environment in which programs of computer system are executed is:
A. operating system
B. nodes
C. clustered system
D. both a and b
ANSWER:
A
AHA
20. One word memory storage is collection of
W
A. 2 bytes
S
B. 4 bytes
C. 7 bytes
T
8
A
D.
byt
H
es
P
ANSWER:
M
B
O
21. Each user of computer system that uses computer services has at least
A. 1program
B. 2programs
C. 3programs
D. 4programs
ANSWER:
A
22. Clusters of computer system can be used more efficiently using
A. serialization
B. parallelization
C. LAN
D. WAN
ANSWER: B
23. A properly designed operating system must ensure that an incorrect (or malicious)
program cannot cause other programs to execute
A. incorrectly
B. Correctly
C. both a and b
D. None
ANSWER: A
24. Table of pointers for interrupt to be executed contains the

A. interrupts
B. programs
A
C. addresses
AH
D. compilers
ANSWER: C
S W
25. User view of system depends upon the
H AT
A. CPU
P
B. software
C. hardware
M
D. interface
O
ANSWER: D
26. Memories are normally classified according to their
A. speed
B. cost
C. indexes
D. both a and b
ANSWER:
D
27. SCSI system is abbreviation of the
A. small common-system interface

B. small common-system interaction
C. small computer-system interface
D. small computer-system
interaction ANSWER: C
28. One megabyte memory storage in form of bytes is equal to
A. 1024 bytes
B. 1024² bytes
C. 1024³ bytes
D. 1024&sup4; bytes
ANSWER: B
29. Multi-processing systems of computer system are of
A. 2 types
B. 3 types
C. 4 types
D. 5 types
AHA
ANSWER: A
S W
30. Clustered computer systems are normally linked via
AT
A. LAN
H
B. WAN
M P
O
C. PAN
D. TAN
ANSWER: A
31. Kernel mode of operating system runs when mode bit is
A. 1
B. 0
A
C. x
AH
D. undefined
ANSWER:
W
B
S
32. Kernel mode of operating system is also called
AT
user mode
H
A.
system mode
P
B.
C. supervisor mode
M
D. both a and b
ANSWER:
O
C
33. Multi-processor systems of computer system has advantage of
A. cost
B. reliability
C. uncertainty
D. scalability
ANSWER: B
34. Time sharing systems of computer system have
A. clusters
B. nodes
C. file system
D. both a and b
ANSWER:C
A. 1024 bytes
B. 1024 kilo bytes
C. 1056 bytes
D. 1058 kilo
bytes
ANSWER: B
36. Privileged mode of operating system mode is a
A. user code
AHA
T S W
P H A
O M
B. kernel mode
C. system mode
D. both b and c
ANSWER:
B
37. Example of bug in one program of operating system effects others in
A. zero error
B. infinite loop
C. invalid memory access
A
D. both a and b
AH
ANSWER:
B
W
38. Master slave relationship in computer system is used by
AT S
A. symmetric multiprocessor
asymmetric multiprocessor
H
B.
C. symmetric multiprocessing
P
D. asymm etric
M
multiprocessing
ANSWER: D
O
39. Beowulf clusters of computer system uses
A. close source softwares

B. open source softwares
C. dedicated softwares
 both a
and b
D. ANSWER:
B
40. In non-multiprogrammed system Central Processing Unit will
A. sit idle
B. perform well
C. cost high
D. cost low
ANSWER: B
41. When a thread needs to wait for an event it will

A. Block
B. Execute
C. Terminate
D. Update
ANSWER:A
42. In a pure Kernel Level Thread facility all of work of thread management is done by the
A. Application
B. Program
C. Kernel
D. Threads
ANSWER:C
AHA
43. Microkernel design imposes a uniform
W
A. Process
S
B. Processor
C. Interface
T
D. System
A
ANSWER:C
P H
M
44. Microkernel architecture facilitates
O
A. Functionality
B. Extensibility
C. Reliability
D. Portability
ANSWER:B
45. Asynchronous elements in program can be implemented through

A. Bugs
B. Threads
C. Programs
D. Security Policy
ANSWER:B
46. Unit of dispatching is usually referred as

A. Multiprogramming
B. Security Policy
C. Problem
D. Thread
ANSWER:D
47. A single machine instruction can controls simultaneous execution of a number processing
elements on
A. Lockstep Basis
B. Open Step Basis
C. Early Basis
D. None
ANSWER:A
48. Owner of an address space can grant a number of its
A
A. Modules
AH
B. Pages
C. Devices
W
D. Computers
S
ANSWER:B
AT
49. Microkernel lends itself to
P H
A. Computers
B. Systems
M
C. Distributed Systems
O
D. Applications
ANSWER:C
50. Microkernel supports

A. Flexibility
B. Reliability
C. Accessible
D. Rigid
ANSWER:A
51. In Many-to-One multithreading model many user level threads are attached to
A. One register
B. operating system
C. One kernel thread
D. other threads
ANSWER:C
52. Programs involve a variety of activities is easier to design and implement using
A. Programs
B. Information
C. Data
D. Threads
ANSWER:D
53. Multiple threads within same process may be allocated to separate

A. Applications
B. Programs
C. Processors
D. Processes
ANSWER:C
AHA
54. A lightweight process (LWP) can be viewed as a mapping between ULTs and
W
A. Kernel Threads
S
B. UNIX Thread
T
C. Linux Threads
A
D. WindowVista Threads
H
ANSWER:A
P
55. Modular design helps to enhance
M
A. Functionality
O
B. Reliability
C. Portability
D. Flexibility
ANSWER:B
56. Microkernel is responsible for mapping each virtual

A. Module
B. I/O Devices
C. Memory
D. Page
ANSWER:D
57. Thread processor affinity is set of

A. Processes
B. Processors
C. Programs
D. Applications
ANSWER:B
58. In UNIX, thread is

A. Runnable
B. Executing
C. Updated
D. Access
ANSWER:A
AHA
T S W
P H A
O M
59. When a process is spawned, a thread for that process is also
A. Complete
B. Spawned
C. Closed
D. Update
ANSWER:B
60. A sequence of data is transmitted to a set of

A. Devices
B. Resources
A
C. Computers
AH
D. Processors
ANSWER:D
T S W
61. A set of processors simultaneously execute different instructions on different
A
A. Buffers
H
B. Data Set
P
C. Buses
M
D. Registers
ANSWER:B
O
62. A new process is created in Linux by copying the
A. Address
B. ID
C. Object
D. Attributes
ANSWER:D
63. Multithreading refers to ability of an operating system to support multiple

A. Execution
B. Updating
C. Completion
D. None
ANSWER:A
64. A microkernel architecture works well in context of an

A. Object Oriented Operating System
B. Internal device
C. Interface
D. Attractive Feature
E. ANSWER:A
65. When a new process is created in Win32 new process inherits many of its
A. Classes
B. Objects
C. Parent Attributes
D. Functions
ANSWER:C
66. A single processor executes a single instruction stream to operate on data stored in a single
A. Computer
A
B. System
AH
C. Memory
D. Device
ANSWER:C
T S W
67. Each windows process is represented by an
H A
A. I/O Devices
P
B. Interface
C. Object
M
D. Information
O
ANSWER:C
68. With Microkernel architecture it is possible to handle hardware interrupts as

A. Application
B. Information
C. Data
D. Message
ANSWER:D
69. Process or task in Linux is represented by a

A. task done
B. task construct
C. task build
D. task struct
ANSWER:D
70. Windows processes are implemented as

A. Objectives
B. Programs
C. Modems
D. Models
ANSWER:A
71. Kernel threads are directly supported by
A. Register
B. Application
C. Operating system
D. Memory
ANSWER:C
72. Motivation for converting interrupts to threads is to reduce
A
A. Overcome
AH
B. Overhead
C. Overload
W
D. Over access
S
ANSWER:B
H AT
73. Process image is collection of
P
A. Images
M
B. Graphics
O
C. Programs
D. None
ANSWER:C
74. Kernel dispatcher keep track of all ready

A. Threads
B. Systems
C. Registers
D. Buffers
ANSWER:A
75. A process can map any of its pages into address space of another
A. Process
B. Program
C. System
D. Application
ANSWE:A
76. In a pure User Level Thread facility all of work of thread management is
done by the
A. Application
B. Process
C. Program
D. System
A
ANSWER:A
W AH
77. Process execution is execution of
AT S
A. Blocks
H
B. Paths
P
C. Statements
D. Programs
O M
ANSWER:B
78. Traditionally computer has been viewed as a sequential
A. Data
B. Machine
C. Program
D. Process
ANSWER:B
79. Port identities and capabilities are maintained by

B. Kernel Service
C. Kernel
D. Microkernel
ANSWER:C
80. Which java feature is used to invoke a method on a remote object?
A. Process Control Block (PCB)

B. Remote Method Invocation (RMI)
C. Remote access control Block
A
D. Both a and b
AH
ANSWER:B
S W
Total=30+80=110
H AT
M P
O
1. Whenever a process needs I/O to or from a disk it issues a ______________
a) system call to the CPU
b) system call to the operating system
c) a special procedure
Answer: b
Explanation: None.
2. If a process needs I/O to or from a disk, and if the drive or controller is busy then
____________
A
a) the request will be placed in the queue of pending requests for that drive
AH
b) the request will not be processed and will be ignored completely
c) the request will be not be placed
W
Answer: a
S
Explanation: None.
AT
3. Consider a disk queue with requests for I/O to blocks on cylinders.
H
98 183 37 122 14 124 65 67
P
Considering FCFS (first cum first served) scheduling, the total number of head movements is, if
the disk head is initially at 53 is?
M
a) 600
O
b) 620
c) 630
d) 640
Answer: d
Explanation: None.

98 183 37 122 14 124 65 67
Considering SSTF (shortest seek time first) scheduling, the total number of head movements is,
if the disk head is initially at 53 is?
a) 224
b) 236
c) 245
d) 240
Answer: b
Explanation: None.
5. Random access in magnetic tapes is _________ compared to magnetic disks.

a) fast
b) very fast
c) slow
d) very slow
Answer: d
Explanation: None.
6. Magnetic tape drives can write data at a speed ________ disk drives.
a) much lesser than
b) comparable to
c) much faster than
Answer: b
Explanation: None.
A
7. On media that use constant linear velocity (CLV), the _____________ is uniform.
AH
a) density of bits on the disk
b) density of bits per sector
c) the density of bits per track
W
S
Answer: c
T
Explanation: The farther a track is from the center of the disk.
H A
8. SSTF algorithm, like SJF __________ of some requests.
P
a) may cause starvation
b) will cause starvation
M
c) does not cause starvation
O
d) causes aging
Answer: a
Explanation: None.
9. In the ______ algorithm, the disk arm starts at one end of the disk and moves toward the other
end, servicing requests till the other end of the disk. At the other end, the direction is reversed
and servicing continues.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
Answer: b
Explanation: None.
10. In the _______ algorithm, the disk head moves from one end to the other, servicing requests
along the way. When the head reaches the other end, it immediately returns to the beginning of
the disk without servicing any requests on the return trip.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
Answer: c
Explanation: None.
advertisement
11. In the ______ algorithm, the disk arm goes as far as the final request in each direction, then
reverses direction immediately without going to the end of the disk.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
A
View Answer
AH
Answer: a
Explanation: None.
S W
12. Which of the following is an example of Spooled Device?
AT
a) A graphic display device
b) A line printer used to print the output of a number of jobs
H
c) A terminal used to enter input data to a running program
P
d) A secondary storage device in a virtual memory system
M
Answer: b
O
Explanation: A line printer used to print the output of a number of jobs
13. Thrashing occurs when___________
a) CPU tends to execute a particular process and seeks for it's respective page
b) IO demands a service
c) Cache memory stores a page
d) Any command runs
Answer: a
14. The following is not a layer of IO management module
a) PIOCS (Physical Input Output Control System)

b) LIOCS (Logical Input Output Control System)
c) FS (File System)
d) MCS (Management Control System)
Answer: (d).MCS (Management Control System)

15. If one or more devices use a common set of wires to communicate with the computer system,
the connection is called ______
a) CPU
b) Monitor
c) Wirefull
d) Bus
Answer: (d).
A
16. A ____ a set of wires and a rigidly defined protocol that specifies a set of messages that can
AH
be sent on the wires.
a) Port
W
b) Node
S
c) Bus
T
d) None of above
H A
Answer: (c).
P
17. When device A has a cable that plugs into device B, and device B has a cable that plugs into
M
device C and device C plugs into a port on the computer, this arrangement is called a _________
O
a) Port
b) Daisy chain
c) Bus
d) Cable
Answer: (b).
18. The _________ present a uniform device-access interface to the I/O subsystem, much as
system calls provide a standard interface between the application and the operating system.
a) Devices
b) Buses
c) Device drivers
d) I/O systems
Answer: c
19. How does the Hardware trigger an interrupt ?
a) Sending signals to CPU through system bus

b) Executing a special program called interrupt program
c) Executing a special program called system program
d) Executing a special operation called system call
Answer: (a).
20. Which operation is performed by an interrupt handler ?
a) Saving the current state of the system

b) Loading the interrupt handling code and executing it
c) Once done handling, bringing back the system to the original state it was before the
interrupt occurred
d) All of these
Answer: (d).
A
21. Whenever a process needs I/O to or from a disk it issues a ______________
AH
a) system call to the CPU
b) system call to the operating system
W
c) a special procedure
S
Answer: b
T
Explanation: As per Definition.
H A
22. If a process needs I/O to or from a disk, and if the drive or controller is busy then
P
____________
M
a) the request will be placed in the queue of pending requests for that drive
b) the request will not be processed and will be ignored completely
O
c) the request will be not be placed
Answer: a
Explanation: As per Definition
98 183 37 122 14 124 65 67
Considering FCFS (first cum first served) scheduling, the total number of head movements is, if
the disk head is initially at 53 is?
a) 600
b) 620
c) 630
d) 640
Answer: d
98 183 37 122 14 124 65 67
Considering SSTF (shortest seek time first) scheduling, the total number of head movements is,
if the disk head is initially at 53 is?
a) 224
b) 236
c) 245
d) 240
Answer: b
25. Random access in magnetic tapes is _________ compared to magnetic disks.

a) fast
b) very fast
c) slow
d) very slow
Answer: d
A
AH
26. Magnetic tape drives can write data at a speed ________ disk drives.
a) much lesser than
W
b) comparable to
S
c) much faster than
T
A
Answer: b
H
P
27. On media that use constant linear velocity (CLV), the _____________ is uniform.
M
a) density of bits on the disk
O
b) density of bits per sector
c) the density of bits per track
Answer: c
Explanation: The farther a track is from the center of the disk.
28. SSTF algorithm, like SJF __________ of some requests.

a) may cause starvation
b) will cause starvation
c) does not cause starvation
d) causes aging
Answer: a
29. In the ______ algorithm, the disk arm starts at one end of the disk and moves toward the
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
Answer: b
30. In the _______ algorithm, the disk head moves from one end to the other, servicing requests
along the way. When the head reaches the other end, it immediately returns to the beginning of
the disk without servicing any requests on the return trip.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
Answer: c
A
AH
31. In the ______ algorithm, the disk arm goes as far as the final request in each direction, then
reverses direction immediately without going to the end of the disk.
W
a) LOOK
S
b) SCAN
T
c) C-SCAN
A
d) C-LOOK
P H
Answer: a
Explanation: None.
O M
32. ______ is a unique tag, usually a number identifies the file within the file system.
a) File identifier
b) File name
c) File type
Answer: a
Explanation: By Definition
33. To create a file ____________

a) allocate the space in file system
b) make an entry for new file in directory
c) allocate the space in file system & make an entry for new file in directory
Answer: c
34. By using the specific system call, we can ____________

a) open the file
b) read the file
c) write into the file
Answer: d
35. File type can be represented by ____________

a) file name
b) file extension
c) file identifier
Answer: b
A
36. Which file is a sequence of bytes organized into blocks understandable by the system’s
AH
linker?
a) object file
b) source file
W
c) executable file
S
d) text file
T
Answer: a
A
P H
37. What is the mounting of file system?
a) crating of a filesystem
M
b) deleting a filesystem
O
c) attaching portion of the file system into a directory structure
d) removing the portion of the file system into a directory structure
Answer: c
38. Mapping of file is managed by ____________

a) file metadata
b) page table
c) virtual memory
d) file system
Answer: a
39. Mapping of network file system protocol to local file system is done by ____________
a) network file system
b) local file system
c) volume manager
d) remote mirror
Answer: a
40. Which one of the following explains the sequential file access method?
a) random access according to the given byte number
b) read bytes one at a time, in order
c) read/write sequentially by record
d) read/write randomly by record
Answer: b
41. When will file system fragmentation occur?

a) unused space or single file are not contiguous
b) used space is not contiguous
A
c) unused space is non-contiguous
AH
d) multiple files are non-contiguous
Answer: a
T S W
P H A
O M
SPOS MCQ Question Bank on UNIT-V
1. CPU fetches the instruction from memory according to the value of:
A. program counter
B. status register
C. instruction register
D. program status word
Answer: Option A
Explanation:
None
2. A memory buffer used to accommodate a speed differential is called:

A. stack pointer
B. cache
A
C. accumulator
H
D. disk buffer
A
ANSWER: B
W
3. Which one of the following is the address generated by CPU?
S
A. physical address
AT
B. absolute address
C. logical address
H
D. none of the mentioned
ANSWER:C
M P
4. Run time mapping from virtual to physical address is done by:
O
A. memory management unit
B. CPU
C. PCI
ANSWER:A
5. Memory management technique in which system stores and retrieves data from secondary
storage for use in main memory is called:
A. fragmentation
B. paging
C. mapping
ANSWER:B
6. Effective access time is directly proportional to:

A. page-fault rate
B. hit ratio
C. memory access time
ANSWER:B
7. In FIFO page replacement algorithm, when a page must be replaced:

A. oldest page is chosen
B. newest page is chosen
C. random page is chosen
ANSWER:A
8. Which algorithm chooses the page that has not been used for the longest period of time whenever
the page required to be replaced?
A. first in first out algorithm

B. additional reference bit algorithm
C. least recently used algorithm
D. counting based page replacement algorithm
ANSWER:A
9. A process is thrashing if:

A. it is spending more time paging than executing
B. it is spending less time paging than executing
C. page fault occurs
D. swapping can not take place
A
ANSWER:C
A H
10. Working set model for page replacement is based on the assumption of:
W
A. modularity
S
B. locality
C. globalization
AT
D. random access
ANSWER:A
P H
11. The operating system is :
M
A. in the low memory
B. in the high memory
O
C. either a or b (depending on the location of interrupt vector)
D. None of these
ANSWER:C
12. In contiguous memory allocation :

A. each process is contained in a single contiguous section of memory
B. all processes are contained in a single contiguous section of memory
C. the memory space is contiguous
D. None of these
ANSWER:A
13. The relocation register helps in :

A. providing more address space to processes
B. a different address space to processes
C. to protect the address spaces of processes
D. None of these
ANSWER:C
14. With relocation and limit registers, each logical address must be
A. less than
B. equal to
C. greater than
D. None of these
the limit register.
ANSWER:A
15. The operating system and the other processes are protected from being modified by an already
running process because :
A. they are in different memory spaces
B. they are in different logical addresses
C. they have a protection algorithm
D. every address generated by the CPU is being checked against the relocation and limit registers
ANSWER:D
16. Transient operating system code is code that :

A. is not easily accessible
B. comes and goes as needed
C. stays in the memory always
D. never enters the memory space
ANSWER:B
A
17. Using transient code,
H
A. increases
A
B. decreases
W
he size of the operating system during program execution. C. changes
S
D. maintains
ANSWER:C
AT
18. When memory is divided into several fixed sized partitions, each partition may contain
H
A. exactly one process
P
B. atleast one process
M
C. multiple processes at once
D. None of these
O
ANSWER:A
19. In fixed sized partition, the degree of multiprogramming is bounded by

A. the number of partitions
B. the CPU utilization
C. the memory size
D. All of these
ANSWER:A
20. The first fit, best fit and worst fit are strategies to select a
A. process from a queue to put in memory
B. processor to run the next process
C. free hole from a set of available holes
D. All of these
ANSWER:C
21. In internal fragmentation, memory is internal to a partition and :

A. is being used
B. is not being used
C. is always used
D. None of these
ANSWER:B
22. A solution to the problem of external fragmentation is :

A. compaction
B. larger memory space
C. smaller memory space
D. None of these
ANSWER:A
23. Another solution to the problem of external fragmentation problem is to :

 A. permit the logical address space of a process to be noncontiguous
 B. permit smaller processes to be allocated memory at last
 C. permit larger processes to be allocated memory at last
 D. All of these
ANSWER:A
24. If relocation is static and is done at assembly or load time, compaction
 A. cannot be done
 B. must be done
 C. must not be done
A
 D. can be done
H
.
A
ANSWER:A
W
25. The disadvantage of moving all process to one end of memory and all holes to the other
S
direction,
producing one large hole of available memory is :
AT
 A. the cost incurred
 B. the memory used
H
 C. the CPU used
P
 D. All of these
M
ANSWER:A
Answer D
O
26.
is generally faster than
 A. first fit, best fit, worst fit
 B. best fit, first fit, worst fit
and
. C. worst fit, best fit, first fit
 D. None of these
ANSWER:A
27. External fragmentation exists when :
 A. enough total memory exists to satisfy a request but it is not contiguous
 B. the total memory is insufficient to satisfy a request
 C. a request cannot be satisfied even when the total memory is free
ANSWER:A
28. External fragmentation will not occur when :
 A. first fit is used
 B. best fit is used
 C. worst fit is used
 D. no matter which algorithm is used, it will always occur
ANSWER:D
29. Sometimes the overhead of keeping track of a hole might be :
 A. larger than the memory
 B. larger than the hole itself
 C. very small
 D. All of these
ANSWER:B
30. When the memory allocated to a process is slightly larger than the process, then :
 A. internal fragmentation occurs
 B. external fragmentation occurs
 C. both a and b
 D. neither a nor b

ANSWER:A
31. Because of virtual memory, the memory can be shared among:

A. processes
 B. threads
 C. instructions
 D. none of the mentioned
ANSWER:A
A
32.
H
is the concept in which a process is copied into main memory from the secondary memory
A
according to the requirement.
W
 A. Paging
S
 B. Demand paging
 C. Segmentation
AT
 D. Swapping
ANSWER:B
H
33. The pager concerns with the:
P
 A. individual page of a process
M
 B. entire process
 C. entire thread
O
 D. first page of a process

ANSWER:A
34. Swap space exists in:
 A. primary memory
 B. secondary memory
 C. CPU
ANSWER:B
35. When a program tries to access a page that is mapped in address space but not loaded in
physical
memory, then?
 A. segmentation fault occurs
 B. fatal error occurs
 C. page fault occurs
 D. no error occursANSWER:C
36. Effective access time is directly proportional to:
 A. page-fault rate
 B. hit ratio
 C. memory access time
ANSWER:A
37. In FIFO page replacement algorithm, when a page must be replaced:
 A. oldest page is chosen
 B. newest page is chosen
 C. random page is chosen
ANSWER:A
38. Which algorithm chooses the page that has not been used for the longest period of time
whenever the page required to be replaced?
 A. first in first out algorithm
 B. additional reference bit algorithm
 C. least recently used algorithm
 D. counting based page replacement algorithm
ANSWER:C
39. A process is thrashing if:

 A. it is spending more time paging than executing
 B. it is spending less time paging than executing
A
 C. page fault occurs
H
 D. swapping can not take place
A
ANSWER:A
S W
40. Working set model for page replacement is based on the assumption of:
 A. modularity
AT
 B. locality
 C. globalization
H
 D. random access
P
ANSWER:B
M
41. Destruction of files for malicious reasons such as access by fraudulent people is classified as
O
being
A. modified
B. accessed
C. destroyed
D. unauthorized access
ANSWER:A
42.. In files, if order of operation on two or more files are similar, then operation will be
A.complex
B.simple
C. sequential
D. combinational
ANSWER:B
43. Search in which record is checked and read for desired items in file linearly is classified as
A. combinational search
B. linear research
C. linear search
D. quadratic search
ANSWER:C
4. Field which is used to identify specific record and can't be duplicated is classified as
A. key field
B. duplicate field
C. copied field
D. original field
Answer A
45. Access in which records are accessed from and inserted into file, is classified as
A. direct access
B. sequential access
C. random access
D. duplicate access
ANSWER:B
46.Smallest piece of data that could be deal separately is classified as
A
A. file record
H
B. item
A
C. data column
W
D. bug
S
Answer B
AT
47. File code which engineers add to file name and limit access to few users is called
A. limited code
H
B. access code
P
C. code protection
M
D. physical code
Answer B
O
48. Large collection of structured data that can be used in different applications is called
A. database management
B. management system
C. database
D. data storage system
Answer C
49. Preparation of disc for subsequent file storage is classified as

A. disc format
B. disc address
C. disc footer
D. disc header
Answer A
50. In microcomputers files, inquiry programs used for simple purposes are classified as
A. storage package
B. database package
C. organized package
D. hardware package
Answer B
51. In computer programming, particular way by which data records are arranged into a specific
manner is considered as
A. organization
B. reorganizedC. managing
D. record storage
ANSWER:A
52. Arrangement of data into a specific order is classified as

A. sorting
B. ordering
C. learning
D. inquiring
Answer A
53. File which is automatically updated when needed is classified as

A. particular file
B. reference file
C. master file
A
D. application file
H
Answer C
W A
54. All keys which are used to identify particular item must be
S
A. same
B. different
AT
C. lengthy
D. short
H
ANSWER:B
M P
55. Program packages that allows user to search items in a file or some combination of selected
items are classified as
O
A. file search
B. file inquiry
C. linear file search
D. quadratic linear search
Answer B
56. Programs written easily by programmers in a

A. direct file
B. order file
C. sequence file
D. timed file
Answer C
57. Kind of exchange in which number is compared to next item for possible exchange is called
A. exchange sort
B. selection sort
C. bubble sort
D. possible sort
Answer C
58. Operations performed on serial file are in order would be much

A. easier
B. complex
C. differential
D. sequential
Answer A
59. In user facilities, copying of all records onto a main store from permanent store is considered as
A. delete file
B. rename file
C. save file
D. load file
Answer D
60. In sequential files update, record orders of transaction file and master file must be
A. safe
B. same
C. different
D. descending order
ANSWER:B
HA
61.When data files are updated, new file is called
A
A. father file
W
B. son file
S
C. grandfather file
D. grandson file
AT
ANSWER:B
H
62. Ability to obtain data from a storage device by going directly to where it is physically located on
P
device rather than by having to sequentially look for data at one physical location after another is
M
called
A. sequential access
O
B. timed access
C. direct access
D. variable access
ANSWER:C
63. Level of generations that are generally kept are

A. two
B. three
C. four
D. five
ANSWER:B
64. Straightforward allocation of storage space is consist of fixed length

A. item
B. advantage
C. previous records
D. disadvantage
ANSWER:B
25. Use of passwords and access codes to safeguard files is classified as

A. software safeguards
B. physical safeguards
C. generation files
D. locked files
Answer A
26. Selection of files are easy in
A.direct access
B. sequential access
C. timed access
D. random access
Answer A
27. Items in key field of record is classified as

A. duplicate
B. key
C. copied column
D. copied row
Answer B
A
28.. Method of scanning of files for a desired record is classified as
H
A. linear research
A
B. quadratic search
W
C. search
S
D. non linear research
ANSWER:C
AT
29. If master and transaction file have keys in same order then it takes
H
A. less time
P
B. more time
M
C. many hours
D. many days
O
ANSWER:A
30. Organized collection of records is considered as

A. record
B. file
C. rows
D. column
ANSWER:B
31. Label which contains file name is classified as

A.header label
B. trailer label
C.end of file marker
D. start of file marker
ANSWER:A
32. File used to update information in computer's master file is classified as

A. transaction file
B. direct file
C. order file
D. sequence file
ANSWER:AAnswer A
33. Files to be accessed from punched cards and paper tape is classified as
A.timed access file
B. random access file
C. direct access file
D. sequential access file
Answer D
34. Method by which program read from files and writes data into file is considered as
A.access
B. organization
C. recording
D. selection
Answer A
35. Type of field in which reserved set of characters are not determined is classified as
A.stable length
B. file length
A
C. variable length
H
D. fixed length
A
ANSWER:C
S W
36.Type of access in which records are chosen in an order is classified as
A.timed access file
AT
B. random access file
C. direct access file
H
D. sequential access file
P
ANSWER:C
M
37. Process of creating copy of stored data onto another disc is termed as creating
O
A.locked files
B. backup files
C. modified file
D. destroyed file
ANSWER:B
38. Directory which consists of list of files is classified as

A. list directory
B. directory part
C. catalogue
D. disc directory
ANSWER:C
39. Records would not be arranged in particular order before creating it is classified as
A. direct access file
B. sequence access file
C. timed access file
D. random access file
ANSWER:A
40. File which contains list of other file names is known as

A. path file
B. batched file
C. directory
D. path name
ANSWER:C
1. With deadlock detection, requested resources are granted to

A. Resources
B. Programs
C. Processes
D. Users
ANSWER:C
2. All deadlocks involve conflicting needs for

A. Resources
B. Users
C. Computers
D. Programs
A
ANSWER:A
A H
3. Fastest form of inter process communication provided in UNIX is
W
A.Virtual Memory
S
B. Memory
C. Shared Memory
AT
D. Main Memory
Answer C
P H
4. Deadlock prevention strategies are very
M
A.Conservative
B. Straight
O
C. Complex
D. Simple
ANSWER:A
5. A consumable resource is one that can be

A. Access
B. Count
C. Created
D. Control
ANSWER:C
6. A signal is a software mechanism that informs a

A. Processor
B. User
C. Program
D. Process
ANSWER:D
7. No preemption means that a resource is released as

A. Terminated
B. Non Voluntarily
C. Voluntarily
D. None
ANSWER:C
8. Deadlock avoidance requires knowledge of future
A. Process
B. Resource
C. Program
D. Application
ANSWER:A
9. Circular wait condition can be prevented by defining a linear ordering of

A. Program Type
B. User Type
C. Resource Type
D. Process Type
ANSWER:C
10. An unsafe state is of course a state that is not
A
A. Require
H
B. SafeC. Run
A
D. Control
W
ANSWER:B
S
11. Linux includes all of concurrency mechanism found in other
AT
A. UNIX System
b. Linux System
H
C. Windows System
P
D. None
M
Answer A
O
12. Dining philosophers problem can be seen as representative of
A. Users
B. Problems
C. Process
D. Application
Answer B
13. A direct method of deadlock prevention is to prevent occurrence of a circular

A. Data
B. Process
C. Movement
D. Wait
Answer D
14. To solve dining philosophers, monitor consist of two

A. Users
B. Programs
C. Applications
D. Procedures
Answer D
15. Conditions for deadlock, only one process may use a resource at a
A. Program
B. Time
C. Process
D. None
Answer B
16. A useful tool in characterizing and allocating of resources to process is the

A. User Allocation Graph
B. Time Allocation Graph
C. Resource Allocation Graph
D. Location Allocation Graph
Answer C
17. UNIX provides a variety of mechanisms for inter processor

A. Information
B. Communication
C. Process
D. Resource
A
Answer B
A H
18. Deadlock involves reusable
W
A. Resources
S
B. Users
C. Time
AT
D. Cost
Answer A
P H
19. Once deadlock has been detected, some strategy is needed for
M
A. Control
B. Access
O
C. Recovery
D. None
Answer C
20. Common technique used for protecting a critical section in Linux is the
A. Lock Step
B. Program lock
C. Spinlock
D. None
ANSWER:C
Answer 21. For effective operating system, when to check for deadlock?
 A. every time a resource request is made
 B. at fixed time intervals
 C. both (a) and (b)
ANSWER:C
24. Which To The avoid number one of of mentioned the resources following a visual by ( a
mathematical process : ) way to determine the deadlock occurrence?
25. aging inversion technique can requested be is used none of deadlock:

 A. must always be less than the total number of resources available in the system
 B. must always be equal to the total number of resources available in the system
 C. must not exceed the total number of resources available in the system
 D. must exceed the total number of resources available in the system
 ANSWER:C
26. The request and release of resources are
 A. command line statements
 B. interrupts
 C. system calls
 D. special programs
ANSWER:C
27. Multithreaded programs are :

 A. lesser prone to deadlocks
 B. more prone to deadlocks
 C. not at all prone to deadlocks
ANSWER:B
28. For Mutual exclusion to prevail in the system :
A
 A. at least one resource must be held in a non sharable mode
H
 B. the processor must be a uniprocessor rather than a multiprocessor
A
 C. there must be at least one resource in a sharable mode
W
 D. All of these
S
ANSWER:A
29. For a Hold and wait condition to prevail :
AT
 A. A process must be not be holding a resource, but waiting for one to be freed, and then request
to
H
acquire it
P
 B. A process must be holding at least one resource and waiting to acquire additional resources that
M
are
being held by other processes
O
 C. A process must hold at least one resource and not be waiting to acquire additional resources
 D. None of theseANSWER:B
30. Deadlock prevention is a set of methods :
 A. to ensure that at least one of the necessary conditions cannot hold
 B. to ensure that all of the necessary conditions do not hold
 C. to decide if the requested resources for a process have to be given or not
 D. to recover from a deadlock

ANSWER:A
31. For non sharable resources like a printer, mutual exclusion :
 A. must exist
 B. must not exist
 C. may exist
ANSWER:A
32. For sharable resources, mutual exclusion :
 A. is required
 B. is not required
 C. None of these
ANSWER:B
33. To ensure that the hold and wait condition never occurs in the system, it must be ensured that :
 A. whenever a resource is requested by a process, it is not holding any other resources
 B. each process must request and be allocated all its resources before it begins its execution
 C. a process can request resources only when it has none
 D. All of these
ANSWER:D
34. The disadvantage of a process being allocated all its resources before beginning its execution
is :
 A. Low CPU utilization
 B. Low resource utilization
 C. Very high resource utilization
 D. None of theseANSWER:B
35. To ensure no preemption, if a process is holding some resources and requests another resource
that
cannot be immediately allocated to it :
 A. then the process waits for the resources be allocated to it
 B. the process keeps sending requests until the resource is allocated to it
 C. the process resumes execution without the resource being allocated to it
 D. then all resources currently being held are preempted

A
ANSWER:D
H
36. What is the reusable resource?
A
 A. that can be used by one process at a time and is not depleted by that use
W
 B. that can be used by more than one process at a time
S
 C. that can be shared between various threads
AT
ANSWER:A
37. Which of the following condition is required for deadlock to be possible?
H
 A. mutual exclusion
P
 B. a process may hold allocated resources while awaiting assignment of other resources
M
 C. no resource can be forcibly removed from a process holding it
 D. all of the mentioned
O

ANSWER:D
38. A system is in the safe state if:
 A. the system can allocate resources to each process in some order and still avoid a deadlock
 B. there exist a safe sequence
 C. both (a) and (b)
ANSWER:C
39. The circular wait condition can be prevented by:
 A. defining a linear ordering of resource types
 B. using thread C. using pipes
 D. all of the mentioned
ANSWER:A
 A. banker’s algorithm
 B. round-robin algorithm
 C. elevator algorithm
 D. karn’s algorithm
ANSWER:A
SPOS Question Bank on unit-IV
1. Dual mode of operating system has
A. 1 mode
B. 2 modes
C. 3 modes
D. 4 modes
ANSWER: B
2. Multi-processor system gives a
A. small system
B. tightly coupled system
A
C. loosely coupled system
H
D. both a and b
A
Answer B
S W
3. Logical extension of multiprogramming operating system is
AT
A. time sharing
H
B. multi-tasking
P
C. single programing
D. both a and b
M
Answer D
O
4. Multiprocessor system have advantage of
A. Increased Throughput
B. Expensive hardware
C. operating system
D. both a and b
ANSWER:A
5. Scheduling of threads are done by
A. input
B. output
C. operating system
D. memory
ANSWER:C
6. Multiprogramming of computer system increases
A. memory
B. storage
C. CPU utilization
A HA
S W
P H AT
O M
D. cost
ANSWER:
C
7. Another type of multiple-CPU system is the
A. mini Computer
B. Super Computer
C. Clustered System
D. both a and b
ANSWER:
A
C
AH
8. Interrupt table of pointers having addresses for each interrupt is located at
S W
A. high memory
B. low memory
T
C. mid memory
A
D. both a and b
H
ANSWER:
P
B
M
9. Example of open source operating system is
O
A. UNIX
B. Linux
C. windows
D. both a and b
ANSWER:
D
10. Main memory of computer system is also called
A. non volatile
B. volatile
C. reserved
D. large
ANSWER: B
11. Controller of computer system transfers data from device to
A. buffers
B. cache
C. registers
D. in
dexes
ANSWER:
A
12. When many users accesses mainframes, this approach is called as
A. resource allocation
B. word processors
C. dedicated resources
D. interface
ANSWER: A
AHA
T S W
P H A
O M
13. Accessing same data from storage of computer system is provided by
A. serial clusters
B. parallel clusters
C. Beowulf clusters
D. both a and b
ANSWER:
B
14. To start an I/O operation device driver loads appropriate register into?
A
A. memory
AH
B. Secondary storage
C. Device Controller
W
D. Ar
S
rays
T
ANSWER:
A
C
H
15. Symmetric multiprocessing architecture of computer system uses shared
M P
A. bus
O
B. memory
C. processors
D. both a and
b ANSWER: D
16. In asymmetric clustering other machines perform operations while one machine is in
A. hot standby mode

B. standby mode
C. reset mode
D. undefined mode
ANSWER: AAnswer
A
17. Ability to continuously providing service proportional to level of surviving hardware
A. graceful upgradation
B. degradation
C. upgradation
D. graceful
degradation
ANSWER: D
18. Secondary memory of computer system is also called
A. non volatile
B. volatile
C. reserved
D. small
AHA
T S W
P H A
O M
ANSWER: A
19. Environment in which programs of computer system are executed is:
A. operating system
B. nodes
C. clustered system
D. both a and b
ANSWER:
A
AHA
20. One word memory storage is collection of
W
A. 2 bytes
S
B. 4 bytes
C. 7 bytes
T
D. 8
H A
bytes
P
ANSWER:
M
B
O
21. Each user of computer system that uses computer services has at least
A. 1program
B. 2programs
C. 3programs
D. 4programs
ANSWER:
A
22. Clusters of computer system can be used more efficiently using
A. serialization
B. parallelization
C. LAN
D. WAN
ANSWER: B
23. A properly designed operating system must ensure that an incorrect (or malicious)
program cannot cause other programs to execute
A. incorrectly
B. Correctly
C. both a and b
D. None
ANSWER: A
24. Table of pointers for interrupt to be executed contains the

A. interrupts
B. programs
A
C. addresses
AH
D. compilers
ANSWER: C
S W
25. User view of system depends upon the
H AT
A. CPU
P
B. software
C. hardware
M
D. interface
O
ANSWER: D
26. Memories are normally classified according to their
A. speed
B. cost
C. indexes
D. both a and b
ANSWER:
D
27. SCSI system is abbreviation of the
A. small common-system interface

B. small common-system interaction
C. small computer-system interface
D. small computer-system
interaction ANSWER: C
A. 1024 bytes
B. 1024² bytes
C. 1024³ bytes
D. 1024&sup4; bytes
ANSWER: B
29. Multi-processing systems of computer system are of
A. 2 types
B. 3 types
C. 4 types
D. 5 types
AHA
ANSWER: A
S W
30. Clustered computer systems are normally linked via
AT
A. LAN
H
B. WAN
M P
O
C. PAN
D. TAN
ANSWER: A
31. Kernel mode of operating system runs when mode bit is
A. 1
B. 0
A
C. x
AH
D. undefined
ANSWER:
W
B
S
32. Kernel mode of operating system is also called
AT
A. user mode
H
B. system mode
P
C. supervisor mode
M
D. both a and b
O
ANSWER:
C
33. Multi-processor systems of computer system has advantage of
A. cost
B. reliability
C. uncertainty
D. scalability
ANSWER: B
34. Time sharing systems of computer system have
A. clusters
B. nodes
C. file system
D. both a and b
ANSWER:C
A. 1024 bytes
B. 1024 kilo bytes
C. 1056 bytes
D. 1058 kilo
bytes
ANSWER: B
36. Privileged mode of operating system mode is a
A. user code
AHA
T S W
P H A
O M
B. kernel mode
C. system mode
D. both b and c
ANSWER:
B
37. Example of bug in one program of operating system effects others in
A. zero error
B. infinite loop
C. invalid memory access
A
D. both a and b
AH
ANSWER:
B
W
38. Master slave relationship in computer system is used by
AT S
A. symmetric multiprocessor
B. asymmetric multiprocessor
H
C. symmetric multiprocessing
P
D. asymmetric
M
multiprocessing
ANSWER: D
O
39. Beowulf clusters of computer system uses
A. close source softwares

B. open source softwares
C. dedicated softwares
D. both a and b
ANSWER:
B
40. In non-multiprogrammed system Central Processing Unit will
A. sit idle
B. perform well
C. cost high
D. cost low
ANSWER: B
MCQ. When a thread needs to wait for an event it will

A. Block
B. Execute
C. Terminate
D. Update
ANSWER:A
MCQ. In a pure Kernel Level Thread facility all of work of thread management is done by the
A. Application
B. Program
C. Kernel
D. Threads
ANSWER:C
AHA
MCQ. Microkernel design imposes a uniform
A. Process
W
B. Processor
S
C. Interface
D. System
T
ANSWER:C
P H A
MCQ. Microkernel architecture facilitates
M
A. Functionality
O
B. Extensibility
C. Reliability
D. Portability
ANSWER:B
MCQ. Asynchronous elements in program can be implemented through

A. Bugs
B. Threads
C. Programs
D. SecurityPolicy
ANSWER:B
MCQ. Unit of dispatching is usually referred as

A. Multiprogramming
B. Security Policy
C. Problem
D. Thread
ANSWER:D
MCQ. A single machine instruction can controls simultaneous execution of a number

processing elements on
A. Lockstep Basis
B. Open Step Basis
C. Early Basis
D. None
ANSWER:A
MCQ. Owner of an address space can grant a number of its

A. Modules
B. Pages
C. Devices
A
D. Computers
AH
ANSWER:B
S W
MCQ. Microkernel lends itself to
T
A. Computers
A
B. Systems
H
C. Distributed Systems
P
D. Applications
ANSWER:C
O M
MCQ. Microkernel supports
A. Flexibility
B. Reliability
C. Accessible
D. Rigid
ANSWER:A
MCQ. In Many-to-One multithreading model many user level threads are attached to
A. One register
B. operating system
C. One kernel thread
D. other threads
ANSWER:C
MCQ. Programs involve a variety of activities is easier to design and implement using
A. Programs
B. Information
C. Data
D. Threads
ANSWER:D
MCQ. Multiple threads within same process may be allocated to separate
A. Applications
B. Programs
C. Processors
D. Processes
ANSWER:C
MCQ. A lightweight process (LWP) can be viewed as a mapping between ULTs and
A
A. Kernel Threads
AH
B. UNIX Thread
C. Linux Threads
D. WindowVista Threads
W
ANSWER:A
T S
MCQ. Modular design helps to enhance
H A
A. Functionality
P
B. Reliability
C. Portability
M
D. Flexibility
O
ANSWER:B
MCQ. Microkernel is responsible for mapping each virtual

A. Module
B. I/O Devices
C. Memory
D. Page
ANSWER:D
MCQ. Thread processor affinity is set of

A. Processes
B. Processors
C. Programs
D. Applications
ANSWER:B
MCQ. In UNIX, thread is

A. Runnable
B. Executing
C. Updated
D. Access
ANSWER:A
AHA
T S W
P H A
O M
MCQ. When a process is spawned, a thread for that process is also
A. Complete
B. Spawned
C. Closed
D. Update
ANSWER:B
MCQ. A sequence of data is transmitted to a set of

A. Devices
A
B. Resources
AH
C. Computers
D. Processors
ANSWER:D
T S W
MCQ. A set of processors simultaneously execute different instructions on different
H A
A. Buffers
P
B. Data Set
C. Buses
M
D. Registers
O
ANSWER:B
MCQ. A new process is created in Linux by copying the

A. Address
B. ID
C. Object
D. Attributes
ANSWER:D
MCQ. Multithreading refers to ability of an operating system to support multiple

A. Execution
B. Updating
C. Completion
D. None
ANSWER:A
MCQ. A microkernel architecture works well in context of an

B. Internal device
C. Interface
D. Attractive FeatureANSWER:A
MCQ. When a new process is created in Win32 new process inherits many of its
A. Classes
B. Objects
C. Parent Attributes
D. Functions
ANSWER:C
MCQ. A single processor executes a single instruction stream to operate on data stored in a single
A. Computer
B. System
C. Memory
A
D. Device
AH
ANSWER:C
S W
MCQ. Each windows process is represented by an
T
A. I/O Devices
A
B. Interface
H
C. Object
P
D. Information
ANSWER:C
O M
MCQ. With Microkernel architecture it is possible to handle hardware interrupts as
A. Application
B. Information
C. Data
D. Message
ANSWER:D
MCQ. Process or task in Linux is represented by a

A. task done
B. task construct
C. task build
D. task struct
ANSWER:D
MCQ. Windows processes are implemented as

A. Objectives
B. Programs
C. Modems
D. Models
ANSWER:A
MCQ. Kernel threads are directly supported by
A. Register
B. Application
C. Operating system
D. Memory
ANSWER:C
MCQ. Motivation for converting interrupts to threads is to reduce

A. Overcome
A
B. Overhead
AH
C. Overload
D. Over access
ANSWER:B
T S W
MCQ. Process image is collection of
H A
A. Images
P
B. Graphics
C. Programs
M
D. None
O
ANSWER:C
MCQ. Kernel dispatcher keep track of all ready

A. Threads
B. Systems
C. Registers
D. Buffers
ANSWER:A
MCQ. A process can map any of its pages into address space of another
A. Process
B. Program
C. System
D. Application
ANSWE:A
MCQ. In a pure User Level Thread facility all of work of thread management is done by the
A. Application
B. Process
C. Program
D. System
ANSWER:A
AHA
MCQ. Process execution is execution of
S W
A. Blocks
T
B. Paths
A
C. Statements
H
D. Programs
M P
ANSWER:B
O
MCQ. Traditionally computer has been viewed as a sequential
A. Data
B. Machine
C. Program
D. Process
ANSWER:B
MCQ. Port identities and capabilities are maintained by

B. Kernel Service
C. Kernel
D. Microkernel
ANSWER:C
MCQ. Which java feature is used to invoke a method on a remote object?
A. Process Control Block (PCB)

B. Remote Method Invocation (RMI)
C. Remote access control Block
D. both a and
ANSWER:B
AHA
T S W
P H A
O M
MCQ Question Bank for SPOS Unit-1
In a two pass assembler the object code generation is done during the ?
1.
Second pass
a.
First pass
b.
Zeroeth pass
c.
Not done by assembler
d.
Answer:(a).Second pass
A HA
Which of the following is not a type of assembler ?
2.
S W
one pass
a.
AT
two pass
b.
H
three pass
c.
P
load and go
M
d.
O
Answer:(c).three pass
In a two pass assembler, adding literals to literal table and address resolution of local symbols
3. are done using ?
First pass and second respectively

a.
Both second pass
b.
Second pass and first respectively
c.
Both first pass
d.
Answer:(d).Both first pass
In a two pass assembler the pseudo code EQU is to be evaluated during ?

4.
Pass 1
a.
Pass 2
b.
not evaluated by the assembler
c.
None of above
d.
Answer:(a).Pass 1
Which of the following system program foregoes the production of object code to generate
absolute machine code and load it into the physical main storage location from which it will be
5.
executed immediately upon completion of the assembly ?
Macro processor
a.
Load and go assembler
b.
Two pass assembler
A
c.
H
Compiler
d.
A
Answer:(b).Load and go assembler
S W
AT
Translator for low level programming language were termed as
6.
H
Assembler
a.
P
Compiler
M
b.
O
Linker
c.
Loader
d.
Answer:(a).Assembler
An assembler is
7.
programming language dependent
a.
syntax dependant
b.
machine dependant
c.
data dependant
d.
Answer:(c).machine dependant
An imperative statement
8.
Reserves areas of memory and associates names with them
a.
Indicates an action to be performed during execution of assembled program
b.
Indicates an action to be performed during optimization
c.
None of the above
d.
Answer:(b).Indicates an action to be performed during execution of assembled program
In a two-pass assembler, the task of the Pass II is to

9.
separate the symbol, mnemonic opcode and operand fields.
a.
build the symbol table.
b.
construct intermediate code.
c.
A
synthesize the target program.
H
d.
A
Answer:(d).synthesize the target program.
S W
TII stands for
AT
10.
Table of incomplete instructions
a.
P H
Table of information instructions
b.
M
Translation of instructions information
c.
O
Translation of information instruction
d.
Answer:(a).Table of incomplete instructions
Assembler is a machine dependent, because of?

11.
Macro definition table(MDT)
a.
Pseudo operation table(POT)
b.
Argument list array(ALA)
c.
Mnemonics operation table(MOT)
d.
Answer: (d).Mnemonics operation table(MOT)
Assembler is ?
12.
A program that places programs into memory an prepares them for execution
a.
A program that automate the translation of assembly language into machine language
b.
A program that accepts a program written in high level language and produces an object
c. program
Is a program that appears to execute a source program as if it were machine language

d.
Answer:(b).A program that automate the translation of assembly language into machine language
Forward reference table(FRT) is arranged like ?

13.
Stack
a.
Queue
b.
A
Linked list
c.
A H
Double linked list
d.
W
Answer:(c).Linked list
AT S
Assembler is a program that
14.
H
places programs into memory and prepares then for execution
P
a.
M
automates the translation of assemble language into machine language
b.
O
accepts a program written in a high level language and produces an object program
c.
appears to execute a resource as if it were machine language
d.
Answer:(b).automates the translation of assemble language into machine language
A single two pass assembler does which of the following in the first pass
15.
It allicates space for the literals
a.
It computes the total length of the program
b.
It builds the symbol table for the symbols and their values
c.
all of the above
d.
Answer:(d).all of the above
Which of the following is not a function of pass1 of an assembler

16.
generate data
a.
keep track of LC
b.
remember literals
c.
remember values of symbols until pass 2
d.
Answer:(a).generate data
An Assembler converts
17.
machine code to mnemonics
a.
high level language to assembly level
b.
A
assembly language to machine language
H
c.
A
all of the above
d.
S W
Answer:(c).assembly language to machine language
AT
____ converts the programs written in assembly language into machine instructions .
18.
P H
Machine compiler
a.
M
Interpreter
b.
O
Assembler
c.
Converter
d.
Answer:(c).Assembler
The instructions like MOV or ADD are called as ______ .

19.
OP-Code
a.
Operators
b.
Commands
c.
None of the above
d.
Answer:(a).OP-Code
Instructions which wont appear in the object program are called as _____ .
20.
Redundant instructions
a.
Exceptions
b.
Comments
c.
Assembler Directives
d.
Answer:(d).Assembler Directives
The assembler stores all the names and their corresponding values in ______ .
21.
Special purpose Register
a.
Symbol Table
A
b.
H
Value map Set
A
c.
W
None of the above
d.
S
Answer:(b).Symbol Table
P H AT
When dealing with the branching code, the assembler
22.
M
Replaces the target with its address
a.
O
Does not replace until the test condition is satisfied
b.
Finds the Branch offset and replaces the Branch target with it
c.
Replaces the target with the value specified by the DATAWORD directive
d.
Answer:(c).Finds the Branch offset and replaces the Branch target with it
The last statement of the source program should be _______ .

23.
Stop
a.
Return
b.
OP
c.
End
d.
Answer:(d).End
_____ directive specifies the end of execution of a program .

24.
End
a.
Return
b.
Stop
c.
Terminate
d.
Answer:(b).Return
In a two-pass assembler, the task of the Pass II is to

25.
separate the symbol, mnemonic opcode and operand fields.
a.
A
build the symbol table.
H
b.
A
construct intermediate code.
c.
S W
synthesize the target program.
d.
AT
Answer:(d).synthesize the target program.
P H
O M
Address symbol table is generated by the
26.
memory management software
a.
assembler
b.
match logic of associative memory
c.
generated by operating system
d.
Answer:(b).assembler
Which of these features of assembler are Machine-Dependent ?

27.
Instruction formats
a.
Addressing modes
b.
Program relocation
c.
All of the mentioned
d.
Answer:(d).All of the mentioned
In a two pass assembler pseudo code,equ is to be evaluated during
28.
pass 1
a.
pass 2
b.
not evaluated by the assembler
c.
none of these
d.
Answer:(a).pass 1
The translator used by second generation languages is?

29.
A
assembler
H
a.
A
interpreter
b.
S W
compiler
c.
AT
linker
d.
H
Answer:(a).assembler
M P
A simple two-pass assembler does which of the following in the first pass ?
30.
O
It allocates space for the literals
a.
It computes the total length of the program
b.
It builds the symbol table for the symbols and their values
c.
All of these
d.
Answer:(d).All of these
In a single pass assembler, most of the forward references can be avoided by putting the
31. restriction
that the data segment must be defined after the code segment
a.
on the number of strings/lifereacts
b.
on unconditional rump
c.
None of these
d.
Answer:(a).that the data segment must be defined after the code segment
Which of the following translation program converts assembly language programs to object
32. program
Loader
a.
Compiler
b.
Assembler
c.
Macroprocessor
d.
A
Answer:(c).Assembler
A H
Loop is a collection of nodes that is
W
33.
S
strongly connected and has a unique entry
a.
AT
loosely connected and has a unique entry
b.
H
strongly connected
P
c.
M
none of these
d.
O
Answer:(a).strongly connected and has a unique entry
Pass 2 -
34.
perform processing of assembler directives not done during pass 1
a.
write the object program and assembly listing
b.
assemble instruction and generate data
c.
all of these
d.
Answer:(d).all of these
Pass I -
35.
save the values assigned to all labels for use in pass 2
a.
perform some processing of assembler directives
b.
assign address to all statements in the program
c.
all of these
d.
Answer:(d).all of these
Which of the following system program forgoes the production of object code to generate
36.
executed immediately upon completion of the assembly?
compiler
a.
macroprocessor
b.
two pass assembler
c.
A
load-and-go assembler
d.
A H
Answer:(d).load-and-go assembler
S W
In a two-pass assembler, symbol table is
AT
37.
Generated in first pass
a.
P H
Generated in second pass
b.
M
Not generated at all
c.
O
Generated and used only in second pass
d.
Answer:(c).Not generated at all
Match the following:
(a) Forward Reference Table (i) Assembler directive
(b) Mnemonic Table (ii) Uses array data structure
38. (c) Segment Register Table (iii) Contains machine OP code
(d) EQU (iv) Uses linked list data structure
code:
(a) (b) (c) (d)
(ii)(iii)(iv)(i)
a.
(iii)(iv)(ii)(i)
b.
(iv)(i)(iii)(ii)
c.
(iv)(iii)(ii)(i)
d.
Answer:(d).(iv)(iii)(ii)(i)
The translator which performs macro calls expansion is called :

39.
Macro processor
a.
Micro pre-processor
A
b.
H
Macro pre-processor
A
c.
W
Dynamic linker
d.
S
Answer:(c).Macro pre-processor
P H AT
‘Macro’ in an assembly level program is …………..
40.
M
sub program
a.
O
a complete program
b.
a hardware portion
c.
relative coding
d.
Answer:(a).sub program
Grammar of the programming is checked at …………… phase of compiler.

41.
semantic analysis
a.
code generation
b.
syntax analysis
c.
code optimization
d.
Answer:(c).syntax analysis
Macro-processors are ………….

42.
Hardware
a.
Compiler
b.
Registers
c.
None of the above
d.
Answer:(b).Compiler
An assembly program contains:

43.
imperative and declarative statements
a.
A
imperative and assembler directives
H
b.
A
imperative and declarative statements as well as assembler directives
c.
S W
declarative statements and assembler directives
d.
AT
Answer:(c).imperative and declarative statements as well as assembler directives
P H
Which of the following are Assembler Directives?
O M
(i) EQU
44. (ii) ORIGIN
(iii) START
(iv) END
(ii), (iii) and (iv)

a.
(i), (iii) and (iv)
b.
(iii) and (iv)
c.
(i), (ii), (iii) and (iv)
d.
Answer:(d).(i), (ii), (iii) and (iv)
Assembler program is:

45.
dependent on the operating system
a.
dependent on the compiler
b.
dependent on the hardware
c.
independent of the hardware
d.
Answer:(c).dependent on the hardware
In a two pass compiler, during the first pass:

46.
user defined address symbols are correlated with their binary equivalent
a.
the syntax of the statement is checked and mistakes, if any, are listed
b.
object program is generated
c.
semantic of the source program is elucidated
d.
A
Answer:(a).user defined address symbols are correlated with their binary equivalent
A H
W
A single instruction in an assembly language program contains:
47.
S
one micro operation
AT
a.
one macro operation
b.
P H
one instruction to be completed in a single pulse
c.
M
one machine code instruction
d.
O
Answer:(b).one macro operation
An operating system is:

48.
Collection of hardware components
a.
Collection of input-output devices
b.
Collection of software routines
c.
All the above
d.
Answer: (c).Collection of software routines
Which activity is not included in the first pass of two pass assembler?
49.
build the symbol table
a.
construct the intermediate code
b.
separate mnemonic opcode and operand field
c.
none of these
d.
Answer: (d).none of these
Which activity is not included in the first pass of two pass assemblers ?
50.
Build the symbol table
a.
Construct the machine code
b.
Separate mnemonic opcode and operand fields
c.
None of these
d.
A
Answer: (d).None of these
A H
W
Which activity is not included in the first pass of two pass assemblers?
51.
S
AT
a.
Construct the intermediate code
b.
P H
c.
M
None of the above
d.
O
Answer: (d).None of the above
Which activity is included in the first pass of two pass assemblers?

52.
a.
Construct the intermediate code
b.
c.
All of the above
d.
Answer: (d).All of the above
In two pass assembler the symbol table is used to store:
53.
Label and value
a.
Only value
b.
Mnemonic
c.
Memory Location
d.
Answer: (d).Memory Location
Not an assembler directive
A
54.
H
XCHG
A
a.
W
ASSUME
b.
S
SHORT
AT
c.
DB
d.
P H
Answer: (a).XCHG
M
55. The purpose of the ORIGIN directive is __________
O
A. To indicate the starting position in memory, where the program block is to be stored
B. To indicate the starting of the computation code
C. To indicate the purpose of the code
D. To list the locations of all the registers used
Answer: Option A
56. The last statement of the source program should be _______

A. Stop
B. Return
C. OP
D. End
Answer: Option D
57. In a two pass assembler, adding literals to literal table and address resolution of local symbols
are done using?
A. First pass and second respectively

B. Both second pass
C. Second pass and first respectively
D. Both first pass
Answer: Option D
58. A machine language instruction format consists of
A. Operand field
B. Operation code field
C. Operation code field & operand field
D. None of the mentioned
59. In a two pass assembler the object code generation is done during the?
A. Second pass
B. First pass
A
C. Zeroeth pass
H
D. Not done by assembler
A
Answer: Option A
S W
AT
60. In a two-pass assembler, the task of the Pass II is to
A. separate the symbol, mnemonic opcode and operand fields
H
B. build the symbol table
P
C. construct intermediate code
M
D. synthesize the target program
O
Answer: Option D
61. Which of the following are language processors

A. assembler
B. compilers
C. interpreter
D. All of these
Answer: Option A
62. Which of the following might be used to convert high-level language instructions into machine
language?
A. system software
B. applications software
C. an operating environment
D. an interpreter
Answer: Option D
63. Which of the following is designed to control the operations of a computer?

a) Application Software
b) System Software
c) Utility Software
d) User
Answer: b
Explanation: Software is basically classified into two: System and application. System Software is
A
designed to control the operations and extend the processing capability of a computer system.
A H
64. Which of the following is not an example of system software?
S W
a) Language Translator
AT
b) Utility Software
c) Communication Software
H
d) Word Processors
M P
Answer: d
O
Explanation: A system software is responsible for controlling the operations of a computer system.
Word Processor is an application software since it is specific to its purpose.
65. A person who designs the programs in a software package is called :

a) User
b) Software Manager
c) System Developer
d) System Programmer
Answer: d
Explanation: The programs included in a system software package are called system programs. The
programmers who design them and prepare them are called system programmers.
66. ___________________ is designed to solve a specific problem or to do a specific task.

a) Application Software
b) System Software
c) Utility Software
d) User
Answer: a
Explanation: An application software is specific to solving a specific problem. System software is
designed for controlling the operations of a computer system.
67.Assembler is used as a translator for?

a) Low level language
b) High Level Language
A
c) COBOL
A H
d) C
S W
Answer: a
AT
Explanation: Assembler is used in case of low level languages. It is generally used to make the
binary code into an understandable format. Interpreter is used with the high level languages
H
similarly.
M P
O
68. What do you call a program in execution?
a) Command
b) Process
c) Task
d) Instruction
Answer: b
Explanation: Option Process is correct. A program is a set of instructions. A program in execution is
called a process.
69.
Which of the following functions is/ are performed by the loader?

Allocate space in memory for the programs and resolve symbolic references between object
A.
decks
B. Physically place the machine instructions and data into memory
Adjust all address dependent locations, such as address constants, to correspond to the allocated
C.
space
D.All of the above
Answer: Option D
70.
5.A self-relocating program is one which

A cannot be made to execute in any area of storage other than the one designated for it at the time
. of its coding or translation
B. consists of a program and relevant information for its relocation
C
can itself perform the relocation of its address-sensitive portions
.
D
All of the above
.
HA
Answer: Option C
W A
S
71.
AT
Which of the following systems software does the job of merging the records from two flies into
H
one?
P
A
Documentation system
M
.
O
B.Utility program
C
Networking software
.
D
Security software
.
Answer: Option B
72.
A compiler for a high-level language that runs on one machine and produces code for a different
machine is called
A
optimizing compiler
.
B. one pass compiler
C
cross compiler
.
D
multipass compiler
.
Answer: Option C
73.
Assembly code data base is associated with
A.a permanent table which lists all key words and special symbols of the language in symbolic form
a permanent table of decision rules in the form of patterns for matching with the uniform symbol
B.
table to discover syntactic structure
consists of a full or partial list or the tokens as they appear in the program. Created by Lexical
C.
analysis and used for syntax analysis and interpretation
assembly language version of the program which is created by the code generation phase and is
D.
input to the assembly phase
Answer: Option D
A HA
74.
W
A development stategy whereby the executive control modules of a system are coded and tested
AT S
first, is known as
A
H
Bottom-up development
.
P
B. Top-down development
C
M
Left-Right development
.
O
D
All of the above
.
Answer: Option B
75.
A non-relocatable program is one which
A cannot be made to execute in any area of storage other than the one designated for it at the time
. of its coding or translation
B.consists of a program and relevant information for its relocation
C
can itself perform the relocation of its address-sensitive portions
.
D
All Of the above
.
Answer: Option A
76.
Multiprogramming was made possible by
A.input/output units that operate independently of the CPU
B. operating systems
C.both (a) and (b)
D.neither (a) nor (b)
Answer: Option C
77.
An Interpreter is
A
A.is a program that appears to execute a source program as if it were machine language
H
B. a program that automate the translation of assembly language into machine language
A
C.program that accepts a program written in a high level language and produces an object program
D.a program that places programs into memory and prepares them for execution
W
Answer: Option A
AT S
H
78.
P
Systems software is a program that directs the overall operation of the computer, facilitates its use
O M
and interacts with the users. What are the different types of this software?
A.Operating system
B. Languages
C.Utilities
D.All of the above
Answer: Option D
79.
Assembler is
A.a program that automate the translation of assembly language into machine language
a program that accepts a program written in a high level language and produces an object
B.
program
C.a program that places programs into memory and prepares them for execution
D.is a program that appears to execute a source program as if it were machine language
Answer: Option A
80.
A translator which reads an entire programme written in a high level language and converts it into
machine language code is:
A.assembler
B. translator
C.compiler
D.system software
Answer: Option C
81.
Which of the following might be used to convert high-level language instructions into machine
language?
HA
A
system software
A
.
B.applications software
W
C
S
an operating environment
.
AT
D
an interpreter
.
H
Answer: Option D
M P
O
82.
Which of the following program is not a utility?
A
Debugger
.
B.Editor
C
Spooler
.
D
All of the above
.
Answer: Option C
83. A translator which reads an entire programme written in a high level language and converts it
into machine language code is:
A. compiler B. translator
C. assembler D. system software
Answer: A
Explanation:
compiler
84. Which of the following might be used to convert high-level language instructions into machine
language?
A
an interpreter
.
B
system software
.
C
applications software
.
D
an operating environment
A
.
H
Answer & Explanation
A
Answer: A
S W
Explanation:
AT
an interpreter
P H
85. The advantage(s) inherent to using high level languages is/are:
O M
A
A greater degree of machine independence
.
B
Improved debugging capability, and superior documentation
.
C
Fewer people, less management and shorter transition in learning time
.
D
All of the above
.
Answer: D
Explanation:
All of the above
86. . A development stategy whereby the executive control modules of a system are coded and
tested first, is known as
A. Top-down development
B. Bottom-up development
C. Left-Right development
D. All of the above
Answer:A
Explanation:
Top-down development
87. Multiprogramming was made possible by
A. operating systems
B. input/output units that operate independently of the CPU
A
C. both (a) and (b)
D. neither (a) nor (b)
A H
W
Answer:C
S
Explanation:
AT
both (a) and (b)
P H
M
88. An Interpreter is
O
A. a program that places programs into memory and prepares them for execution
C. is a program that appears to execute a source program as if it were machine language
program that accepts a program written in a high level language and produces an object
D.
program
Answer:C
Explanation:
is a program that appears to execute a source program as if it were machine language
89. Systems software is a program that directs the overall operation of the computer, facilitates its
use and interacts with the users. What are the different types of this software?
A. Utilities B. Languages
C. Operating system D. All of the above
Answer:D
Explanation:
All of the above
90. Loaders that allow for program relocation are called
A. relative loaders B. relocating loaders

C. both (a) and (b) D. None of the above
Answer:C
Explanation:
A
both (a) and (b)
A H
91. The task(s) of the Lexial analysis phase is/are:
S W
AT
A. to build a uniform symbol table
B. to build a literal table and an identifier table
C. to parse the source program into the basic elements or tokens of the language
H
D. All of the above
P
O M
Answer:D
Explanation:
All of the above
92. The action of parsing the source program into the proper syntactic classes is known as
A. lexical analysis
B. syntax analysis
C. general syntax analysis
D. interpretation analysis
Answer:A
Explanation:
lexical analysis
93. Advantage(s) of using assembly language rather than machine language is/are:
A. Introduction of data to program is easier
B. Addresses any symbolic, not absolute
C. It is mnemonic and easy to read
D. All of the above
Answer:D
Explanation:
All of the above
A
94. The table created by lexical analysis to describe all literals used in the source program, is:
A H
A. Reductions B. Literal table
W
C. Identifier table D. Terminal table
S
AT
Answer:B
H
Explanation:
P
Literal table
O M
95. Indicate which of the following is not true about an interpreter?
A. Interpreter is a kind of translator

B. Interpreter generates an object program from the source program
C. Interpreter analyses each source statement every time it is to be executed
D. All of the above
Answer:B
Explanation:
Interpreter generates an object program from the source program
96. When a computer is first turned on or restarted, a special type of absolute loader, called a
______ is executed
A. bootstrap loader
B. loader
C. linker
D. None of the above
Answer:A
Explanation:
bootstrap loader
97. A compiler is
A. a program that places programs into memory and prepares them for execution
A
C. is a program that appears to execute a source program as if it were machine language
H
program that accepts a program written in a high level language and produces an object
A
D.
program
W
AT S
Answer:D
Explanation:
P H
program that accepts a program written in a high level language and produces an object program
O M
98. An algorithm is best described as
A. A computer language
B. A branch of mathematics
C. A step by step procedure for solving a problem
D. All of the above
Answer:C
Explanation:
A step by step procedure for solving a problem
99. Which of the following system program forgoes the production of object code to generate
executed immedia
A. compiler
B. macroprocessor
C. two pass assembler
D. load-and-go assembler
Answer:D
Explanation:
load-and-go assembler
100.
Bug means
A. A logical error in a program
B. A difficult syntax error in a program
A
C. Documenting programs using an efficient documentation tool
D. All of the above
H
A
Answer:A
S W
Explanation:
AT
A logical error in a program
P H
O M
UNIT-I
INTRODUCTION
1. In a two pass assembler the object code generation is done during the?
A. Second pass
B. First pass
C. Zeroeth pass
D. Not done by assembler
Ans:A
A
2. Which of the following is not a type of assembler ?
AH
A. Second pass
B. First pass
W
C. Three pass
S
D. Load and Go
T
Ans:C
H A
3. In a two pass assembler, adding literals to literal table and address resolution of local
P
symbols are done using ?
M
A. First Pass and second pass respectively
O
B. Both Second pass
C . Second pass and first respectively
D. Both first pass
Ans:D
4. In a two pass assembler the pseudo code EQU is to be evaluated during?

A. Pass 1
B. Pass 2
C. not evaluated by the assembler
D. None of above
Ans: A
5. Which of the following system program foregoes the production of object code to
generate absolute machine code and load it into the physical main storage location from
which it will be executed immediately upon completion of the assembly ?
A. Macro processor
B. Load and go assembler
C. Two pass assembler
D. Compiler
Ans: B
6. Translator for low level programming language were termed as
A. Assembler
B. Compiler
C. Linker
D. Loader
Ans: A
7. An assembler is
A. programming language dependent
B. syntax dependant
A
C. machine dependant
AH
D. data dependant
Ans: C
S W
8. An imperative statement
T
A. Reserves areas of memory and associates names with them
A
B. Indicates an action to be performed during execution of assembled program
H
C. Indicates an action to be performed during optimization
P
Ans:B
O M
9. In a two-pass assembler, the task of the Pass II is to
A. separate the symbol, mnemonic opcode and operand fields.
B. build the symbol table.
C. construct intermediate code.
D. synthesize the target program.
Ans:D
10. TII stands for

A. Table of incomplete instructions
B. Table of information instructions
C. Translation of instructions information
D. Translation of information instruction
Ans: A
11. Assembler is a machine dependent, because of?

A. Macro definition table(MDT)
B. Pseudo operation table(POT)
C. Argument list array(ALA)
D. Mnemonics operation table(MOT)
Ans:D
12. Assembler is ?
A. A program that places programs into memory an prepares them for execution
B. A program that automate the translation of assembly language into machine language
C. A program that accepts a program written in high level language and produces an
object program
D. Is a program that appears to execute a source program as if it were machine language
Ans:B
13. Forward reference table (FRT) is arranged like ?

A. Stack
A
B. Queue
AH
C. Linked list
D. Double linked list
W
Ans: C
T S
14. A single two pass assembler does which of the following in the first pass
A
A. It allocates space for the literals
H
B. It computes the total length of the program
P
C. It builds the symbol table for the symbols and their values
D. all of the above
M
Ans:D
O
15. Which of the following is not a function of pass1 of an assembler
A. generate data
B. keep track of LC
C. remember literals
D. remember values of symbols until pass 2
Ans: A
16. The instructions like MOV or ADD are called as ______ .

A. OP-Code
B. Operators
C. Commands
Ans:A
17. Instructions which will not appear in the object program are called as _____ .
A. Redundant instructions
B. Exceptions
C. Comments
D. Assembler Directives
Ans: D
18. The assembler stores all the names and their corresponding values in ______
A. Special purpose Register
B. Symbol Table
C. Value map Set
Ans: B
A
19. When dealing with the branching code, the assembler
AH
A. Replaces the target with its address
B. Does not replace until the test condition is satisfied
W
C. Finds the Branch offset and replaces the Branch target with it
S
D. Replaces the target with the value specified by the DATAWORD directive
T
Ans:C
H A
20. The last statement of the source program should be _______ .
P
A. Stop
B. Return
M
C. OP
O
D. End
Ans:D
21. Address symbol table is generated by the

A. Memory management software
B. Assembler
C. Match logic of associative memory
D. Generated by operating system
Ans: B
22. Which of these features of assembler are Machine-Dependent ?

A. Instruction formats
B. Addressing modes
C. Program relocation
D. All of the mentioned
Ans:D
23. In a two pass assembler pseudo code EQU is to be evaluated during

A. pass 1
B. pass 2
C. not evaluated by the assembler
D. none of these
Ans:A
24. The translator used by second generation languages is?

A. assembler
B. interpreter
C. compiler
D. linker
A
Ans:A
AH
25. A simple two-pass assembler does which of the following in the first pass?
W
A. It allocates space for the literals
S
B. It computes the total length of the program
T
C. It builds the symbol table for the symbols and their values
A
D. All of these
H
Ans:D
P
26. In analyzing the compilation of PL/I program the description " resolving symbolic
M
address ( labels ) and generating machine language " is associated with
O
A. syntax analysis
B. code generation
C. storage assignment
D. assembly and output
Ans:D
27. In a single pass assembler, most of the forward references can be avoided by putting the
restriction
A. that the data segment must be defined after the code segment
B. on the number of strings/life reacts
C. on unconditional Jump
D. None of these
Ans: A
28. Pass 2 -
A. perform processing of assembler directives not done during pass 1
B. writes the object program and assembly listing
C. assemble instruction and generate data
D. all of these
Ans:D
29. Pass I -
A. save the values assigned to all labels for use in pass 2
B. perform some processing of assembler directives
C. assign address to all statements in the program
D. all of these
Ans:D
30. Which table is permanent databases that has an entry for each terminal symbol ?
A
A. Literal table
AH
B. Identifier table
C. Terminal table
W
D. None of these
S
Ans:C
AT
31. Which of the following system program forgoes the production of object code to generate
H
absolute machine code and load it into the physical main storage location from which it
P
will be executed immediately upon completion of the assembly?
A. compiler
M
B. macroprocessor
O
C. two pass assembler
D. load-and-go assembler
Ans:D
32. In a two-pass assembler, symbol table is

A. Generated in first pass
B. Generated in second pass
C. Not generated at all
D. Generated and used only in second pass
Ans:C
33. Match the following:
(a) Forward Reference Table (i) Assembler directive

(b) Mnemonic Table (ii) Uses array data structure
(c) Segment Register Table (iii) Contains machine OP code
(d) code: EQU (iv) Uses linked list data structure
(a) (b) (c) (d)
A. (ii) (iii) (iv) (i)

B. (iii) (iv) (ii) (i)
C. (iv) (i) (iii) (ii)
D. (iv) (iii) (ii) (i)
Ans:D
34. Which of the following program is not a utility?

A. Debugger
B. Editor
C. Spooler
D. All of the above
A
Ans:C
AH
35. Software that allows your computer to interact with the user, applications, and hardware
W
is called
S
A. application software
T
B. word processor
A
C. system software
H
D. database software
P
Ans:C
M
36. Programs that coordinate computer resources, provide an interface between users and the
O
computer and run applications are called
A. utilities
B. operating systems
C. device drivers
D. language translators
Ans:B
37. This type of program performs specific tasks related to managing computer resources.
Also known as a service program,
A. utility
B. operating system
C. language translator
D. device driver
Ans:A
38. The purpose of the ORIGIN directive is _________

A. To indicate the starting position in memory, where the program block is to be stored
B. To indicate the starting of the computation code
C. To indicate the purpose of the code
D. To list the locations of all the registers used
Ans:A
39. A machine language instruction format consists of

A. Operand field
B. Operation code field
C. Operation code field & operand field
Ans:C
A
40. The extension file that is must for a file to be accepted by the LINK as a valid object file
AH
is
A. .OBJ file
W
B. .EXE file
S
C. .MASM file
T
D. DEBUG file
A
Ans:A
P H
41. Which of the following are language processors
A. assembler
M
B. compilers
O
C. interpreter
D. All of these
Ans:D
42. Programming language in which there is a very strong correspondence between the
language and the architecture's machine code instructions is termed as
A. machine language
B. assembly language
C. high level language
D. medium language
Ans:B
43. Binder performs the functions of

A. allocation
B. relocation
C. linking
D. All of these
Ans:D
44. Which development tool / program has the potential to allocate the specific
Addresses so as to load the object code into memory?
A. Loader
B. Locator
C. Library
D. Linker
Ans:B
45. The assembler list file generated by an assembler mainly includes ________
a. binary codes
A
b. assembly language statements
AH
c. offset for each instruction
d. all of the above
W
Ans:d
T S
46. Which kind of assembler does not generate the programs in similar language as that
A
used by micro-controllers by developing the program in high-level languages
H
making them as machine independent?
P
a. Macro Assembler
b. Cross Assembler
M
c. Meta Assembler
O
d. All of the above
Ans:b
47. What kind of address/es is /are usually assigned to program by the linker adopted in
an execution of assembler?
a. Absolute Address
b. Relative Address starting from unity
c. Relative Addresses starting from zero
d. None of the above
Ans:C
48. What are the major form of functionalities associated to high-level language
compilers?
a. Generation of an application program
b. Conversion of generated code from higher level language to machine-level language
c. Both a & b
Ans:c
49. Which development tool can facilitate the creation and modification of source
programs in addition to assembly and higher -level languages?
a. Editor
b. Assembler
c. Debugger
d. High-level language Compiler
Ans:a
50. It is a characteristic provision of some debuggers to stop the execution after each
instruction because__________
A
a. it facilitates to analyze or vary the contents of memory and register
AH
b. it facilitates to move the break point to a later point
c. it facilitates to rerun the program
W
d. it facilitates to load the object code program to system memory
S
Ans:a
AT
51. An interpreter is a program that
H
A. places programs into memory and prepares then for execution
P
B. automates the translation of assemble language into machine language
C. accepts a program written in a high level language and produces an object program
M
D. appears to execute a resource as if it were machine language
O
Ans:D
52. A simple two pass assembler does which of the following in the first class
a. It allocates space for the literals
b. It computes the total length of the program
c. It builds the symbol table for the symbols and their values
d .It generates code for all the load and stores regular instruction
A. only a
B. a and b
C. a,b and c
D. only d
Ans:C
53. Mnemonic refers to:

A. Instructions
B. Code
C. Symbolic codes
D. Assembler
Ans:C
54. Mnemonic represent:
A. Operation codes
B. Strings
C. Address
D. None of these
Ans:A
55. To represent addresses in assembly language we use

A. String characters
B. Arrays
A
C. Structure
AH
D. Enum
Ans:A
S W
56. ________generation computers use assembly language:
T
A. First generation
A
B. Third generation
H
C. second generation
P
D. fourth generation
Ans:C
O M
57. The assembler translates isomorphically______ mapping from mnemonic in these
statements to machine instructions:
A. 1:1
B. 2:1
C. 3:3
D. 4:1
Ans:A
58. In second pass, assembler creates _______in binary format for every instruction in
program and then refers to the symbol table to giving every symbol an______ relating the
segment.
A. Code and program
B. Program and instruction
C. Code and offset
D. All of these
Ans:C
59. In which code is object file is coded:

A. Link code
B. Decimal code
C. Assembly code
D. Binary code
Ans:D
60. which type of errors are detected by the assembler:

a. syntax error
b. logical error
c. run time error
d. none of these
AHA
T S W
P H A
O M
Ans:a
61. MOVE AX BX in this LINES OF CODE what type of error is declared:

a. Undeclared identifier MOVE
b. undeclared identifier AX
c. Accept as a command
d. Not look in symbol table
Ans:A
62. What type of errors are not detected by assemblers:
a. Syntax error
b. Run time error
A
c. Logical error
H
d. All of these
A
Ans:C
S W
63. An assembler is a utility program that performs:
AT
a. Isometric translation
b. Isomorphic translation
H
c. Isochoric translation
P
d. None of these
Ans:b
O M
64. Assemblers are of 2 types:
a. 1 pass
b. 2 pass
c. both a & b
d. none of these
Ans:c
65. Which of the following is not an example of system software?

A. Word Processors
B. Language Translator
C. Utility Software
D. Communication Software
Ans:A
66. ___________________ is designed to solve a specific problem or to do a specific task

A. System Software
B. Utility Software
C. User
D. Application Software
Ans:D
67. Which statements are used for reserving memory for variables
A. Imperative statement
B. Assembler Directives
C. Declaration statements
Ans:C
68. Which are advanced Assembler directives

A. ORIGIN
B. EQU
C. LTORG
D. All of the above
Ans:D
H A
69. Which directive is used to reset Location Counter?
A
A. ORIGIN
W
B. EQU
S
C. LTORG
AT
Ans:A
P H
70. Correct Syntax of ORIGIN
M
A. A ORIGIN 408
O
B. 408 ORIGIN A
C. ORIGIN A 408
D. ORIGIN A
Ans: D
71. Correct Syntax of using LTORG is

A. LTORG L
B. LTORG 200
C. 200 LTORG
D. LTORG
Ans:D
72. Match the following

a. LTORG i) Used to set new address for LC
b. ORIGIN ii) Depending on condition code transfer control
c. EQU iii) Allocates addresses to literals
d. BC iv) Associates new address to symbol
A. (a)-iii (b)-i (c)-ii (d)-iv
B. (a)-iii (b)-i (c)-iv (d)-ii
C. (a)-iii (b)-iv (c)-i (d)-ii
D. (a)-iii (b)-iI (c)-iv (d)-i
Ans: B
73. Which statement is used to specify size of variable?
A. LTORG
B. DC
C. DS
D. END
Ans: C
74. A simple two-pass assembler does the following in the first pass:
(a) It allocates space for the literals.
(b) It computes the total length of the program
(c) It builds the symbol table for the symbols and their values.
(d) It generates code for all the load and store register instructions.
A
(e) None of the above.
H
Ans: C
W A
75. What will be LC value after end of code?
S
START 200
AT
MOVER AREG ‘=5’
MOVEM AREG X
H
L1 MOVER BREG ‘=2’
P
ORIGIN L1+3
O M
A. 203
B. 204
C. 206
D. 205
Ans:D
76. What will be addresses of literals?

START 200
MOVER AREG ‘=5’
MOVEM AREG X
ORIGIN L1+3
A. Literal ‘=2’ address 205 and Literal ‘=5’ address is 206

B. Literal ‘=2’ address 204 and Literal ‘=5’ address is 205
C. Literal ‘=5’ address 204 and Literal ‘=2’ address is 205
D. Literal ‘=5’ address 205 and Literal ‘=6’ address is 206
Ans: D

START 200
MOVER AREG ‘=5’
MOVEM AREG X
ORIGIN L1+6

Ans: C

START 200
A
L1 MOVER AREG ‘=5’
H
MOVEM AREG X
A
MOVER BREG ‘=2’
W
ORIGIN L1+6
AT S
H
P
M
Ans: B
O
79. Find literals and label in following code
START 200
L1 MOVER AREG ‘=5’
MOVEM AREG X
MOVER BREG ‘=2’
ORIGIN L1+6
A. Literals:X and 2 label: L1

B. Literals:L1 label: 5 and 2
C. Literals:5 and 2 label: X+6
D. Literals:5 and 2 label: L1
Ans: D
80. What will be address of D and A
START 100
MOVER AREG ‘=5’
ADD CREG ‘=1’
A DS 3
L1 MOVER AREG B
ADD AREG C
MOVEM AREG D
LTORG
D EQU A+1
A. Address of A=103 Address of D=104

B. Address of A=102 Address of D=110
C. Address of A=102 Address of D=103
D. Address of A=102 Address of D=107
Ans:C
81. What will be address of literals
START 100
A
MOVER AREG ‘=5’
H
ADD CREG ‘=1’
A
A DS 3
W
L1 MOVER AREG B
S
ADD AREG C
MOVEM AREG D
AT
LTORG
D EQU A+1
P H
A. Address of first literal= 101 Address of first literal=102
M
B. Address of first literal= 108 Address of first literal=109
O
C. Address of first literal= 106 Address of first literal=107
D. Address of first literal= 100 Address of first literal=101
Ans:B
82. From following assembly code which are literals and symbols
START 100
MOVER AREG ‘=5’
ADD CREG ‘=1’
A DS 3
L1 MOVER AREG B
ADD AREG C
MOVEM AREG D
LTORG
D EQU A+1
A. Symbols are L1, A, B and Literals are 5, 1
B. Symbols are A, B and Literals are 3, 5, 1
C. Symbols is L1 and Literals are 5, 1
D. Symbols are A, B and Literals are 5, 1
Ans: D
83. Which pseudo code indicates to the assembler which general purpose register to use
as a base and what its contents will be.
A. USING
B. BALR
C. BR
D. NONE
Ans:A
84. The advantages of assembly level programming are
a) flexibility of programming is more
b) chances of error are less
c) debugging is easy
Ans:D
A
85. The extension that is essential for every assembly level program is
H
a) .ASP
A
b) .ALP
W
c) .ASM
S
d) .PGM
AT
Ans:c
P H
O M
UNIT-II
MACROPROCESSOR, LINKER AND LOADER
1. The object code is then passed through a program called a ___________ which turns it
into an executable program.
A. Integer
B. Source code
C. Linker
Ans:C
AHA
2. When a computer is first turned on or restarted, a special type of absolute loader is
executed, called a
W
A. Compile and Go loader
S
B. Boot loader
T
C. Bootstrap loader
A
D. Relating loader
H
Ans:C
M P
3. Which of the following system software resides in main memory always?
O
A. Text editor
B. Assembler
C. Linker
D. LOADER
Ans:D
4. Which is not a function of a loader?

A. Allocation
B. Translation
C. Relocation
D. Loading
Ans:B
5. Disadvantage of compiler and go loading scheme is that

A. a position of memory is wasted because the case occupied by the assembler is
B. it is necessary to retranslate the users program check every time it is run
C. it is very difficult to handle multiple segments especially if the source programs are in
different language and to produce overlay modular programs
D. all of the above
Ans:D
6. The non relocatable program is one which
A. Can not made to execute in any area to storage other than the one designated for it at
the time of its coding or translation
B. consists of a program and relevant information for its relocation
C. can itself perform the relocation of its address sensitive positions
D. all of the above
Ans:A
A
7. By whom address of external function in the assembly source file supplied by ______
AH
when activated:
a. Assembler
W
b. Linker
S
c. Machine
d. Code
T
Ans:b
P H A
8. A_______ processor controls repetitious writing of sequence:
a. Macro
M
b. Micro
O
c. Nano
d. All of these
Ans:A
9. IBM-360 type language is example which supporting______ language:

a. Micro
b. Macro
c. Both a & b
d. None of these
Ans:b
10. _________ is attached to using macro instruction definition:

a. Name
b. Definition
c. Identifier
d. All of these.
Ans: a
11. END of macro definition by

a. NAME
b. MEND
c. DATA
d. MEMORY
Ans:b
12. Process of replacing the sequence of lines of codes is known as:

a. Tetra macro
b. Expanding tri macro
c. Expanding macro
d. None of these
Ans:c
13. A program that links several programs is called:
A
a. Loader
AH
b. Linker
c. Translator
W
d. None of these
S
Ans:b
AT
14. _______address is not assigned by linker:
H
a. Relative
P
b. Absolute
c. Both a & b
M
d. None of these
O
Ans:b
15. . ________address is provided by linker to modules linked together that starting

from______:
a. Absolute and 0
b. Relative and 0
c. Relative and 1
d. Relative and 3
Ans:b
16. . A linker is also known as:

a. Binder
b. Linkage editor
c. Both a & b
d. None of these
Ans:C
17. Loading is _______ with the task of storage management of operating system and mostly
preformed after assembly:
a. Expanded
b. Bound
c. Overlaps
d. All of these
Ans:b
18. It is the task of the ________to locate externally defined symbols in programs, load them
in to memory by placing their _______of symbols in calling program:
a. Loader and name
b. Linker and values
c. Linker and name
d. Loader and values
Ans:d
AHA
19. Linker creates a link file containing binary codes and also produces_______ containing
address information on linked files:
W
a. Symbol map
S
b. Map table
c. Link map
T
d. None of these
A
Ans:c
P H
20. A module contains machine code with specification on______:
M
a. Relative addresses
b. Absolute addresses
O
c. Object program
d. None of these
Ans:a
21. After actual locations for main storage are known, a ______adjusts relative addresses to
these actual locations
a. Default loader
b. Locating loader
c. Relocating loader
d. None of these
Ans:c
22. If there is a module from single source-language only that does not contain any external
references, it doesn’t need a linker to load it and is loaded______:
a. Indirectly
b. Directly
c. Extending
d. None of these
Ans:b
23. In an absolute loading scheme, which loader function is accomplished by assembler?

A. Relocation
B. Allocation
C. Linking
D. Loading
Ans:A
24. The linker?

A. is same as the loader
B. is required to create a load module
C. is always used before programs are executed
A
D. None of above
AH
Ans:B
W
25. A system program that combines the separately compiled modules of a program into a
S
T
A. Assembler
A
B. Linking loader
H
C. Cross compiler
P
D. Load and Go
Ans:B
O M
26. Loading process can be divided into two separate programs, to solve some problems. The
first is binder the other is?
A. Linkage editor
B. Module Loader
C. Relocator
D. None of these
Ans:B
27. Load address for the first word of the program is called
A. Load address origin
B. Linker address origin
C. Phase library
D. Absolute library
Ans: A
28. Resolution of externally defined symbols is performed by

A. Linker
B. Loader
C. Compiler
D. Editor
Ans:A
29. Relocatable programs

A. cannot be used with fixed partitions
B. can be loaded almost anywhere in memory
C. do not need a linker
D. can be loaded only at one specific location
Ans:B
A
30. Memory allocation involves which of the following task(s)
AH
A. determine amount of memory required
B. use an appropriate memory allocation model
W
C. determine appropriate memory mapping
S
D. All of the above
T
Ans: D
H A
31. ________________is used for reducing relocation requirements.
P
A. Relocation register
B. Track register
M
C. Binding register
O
D. Segment Register
Ans: D
32. If load origin is not equal to linked origin then relocation is performed by
A. Linker
B. By program itself
C. Loader
D. Relocation not performed
Ans: C
33. If linked origin is not equal to translated address then relocation is performed
by____________.
A. Absolute Loader
B. Loader
C. Linker
Ans:C
34. In an absolute loading scheme which loader function is accomplished by loader

A. Linker
B. Loader
C. Compiler
D. Editor
Ans: B
35. Relocating bits used by relocating loader are specified by

A. Relocating loader itself
B. Linker
C. Assembler
A
D. Macro processor
AH
Ans:B
W
36. Which of the following can be accessed by transfer vector approach of linking?
S
A. External data segments
T
B. Data located in other procedure
A
C. External subroutines
H
D. All of these
P
Ans: C
M
37. A system program that combines separately compiled modules of a program into a form
O
suitable for execution is
A. Linking loader
B. Assembler
C. Cross compiler
Ans:A
38. Which of the following module does not incorporate initialization of values changed by
the module?
A. re-enterable module
B. all of these
C. serially reusable module
D. non reusable module
Ans: D
39. A linker is given object module for a set of programs that were compiled separately.
What information need not be included in an object module
A. Object code
B. Relocation bits
C. Absolute addresses of internal symbols.
D. Names and locations of all external symbols denied in the object module
Ans:C
40. Which of the following functions is performed by loader?

A. Adjust all address dependent locations, such as address constants, to correspond to the
allocated space
B. Allocate space in memory for the programs and resolve symbolic references between
objects decks
C. Physically place the machine instructions and data into memory
A
D. All of the above
AH
Ans:D
W
41. In what module, multiple instances of execution will yield the same result even if one
S
instance has not terminated before the next one has begun?
T
A. serially reusable
A
B. recursive module
H
C. reenterable module
P
D. non-reusable module
Ans:C
O M
42. Direct linking loader is an example of
B. Absolute loader
C. Dynamic loader
D. Relocating loader
Ans:C
43. In direct linking loader which card is not related to object program
A. ESD
B. TXT
C. RLD
D. BSS
Ans:D
44. Binary Symbolic Subroutine loader is an example of

B. Absolute loader
C. Dynamic loader
D. Relocating loader
Ans:D
45. In direct linking loader, Location and length of each address constant is maintained by
A. ESD
B. TXT
C. RLD
D. END
Ans: C
46. ESD cards contain information about
A
A. All symbols that are defined in this program that may be reference elsewhere and all
AH
symbols reference in the program but defined elsewhere.
B. Actual object code translated version of source program.
W
C. Those location in the program whose content depend on the address at which program
S
is placed.
T
D. END of object deck.
A
Ans: A
P H
47. TXT cards contain information about
M
O
is placed.
Ans: B
48. RLD cards contain information about

is placed.
Ans:C
49. END cards contain information about

is placed.
Ans:D
50. Transfer vector is used by Direct linking loader

A. TRUE
B. FALSE
Ans: A
A
51. In compile and go loader linking is performed loader.
AH
A. TRUE
B. FALSE
W
Ans: B
T S
52. Global External Symbol Table(GEST) is used by direct linking loader.
A
A. TRUE
H
B. FALSE
P
Ans:A
M
53. Global External Symbol Table(GEST) is not used by direct linking loader.
O
A. TRUE
B. FALSE
Ans:B
54. Local External Symbol Array is used by direct linking loader.

A. TRUE
B. FALSE
Ans:A
55. Local External Symbol Array) is not used by direct linking loader.
A. TRUE
B. FALSE
Ans: B
56. Overlay Structures used when

A. Virtual memory is available.
B. secondary memory is available
C. Virtual Memory is not available.
Ans:C
57. In which card length of segment is present?
A. ESD
B. TXT
C. RLD
D. END
Ans: A
58. In direct linking loader, relocation and linking information of object program is present in
A. ESD
B. TXT
A
C. RLD
AH
D. END
Ans:C
S W
59. Match the following cards with it’s functions
AT
(a) ESD (i) Actual object code translated version
H
(b) RLD (ii) Specifies the address to start execution
P
(c) TXT (iii) Contains relocation information
(d) END (iv) Information about entries and symbols
M
(a) (b) (c) (d)
O
A. (ii) (iii) (iv) (i)
B. (iii) (iv) (ii) (i)
C. (iv) (i) (iii) (ii)
D. (iv) (iii) (i) (ii)
Ans:D
60. Which of the following features is not offered by Macros?

A. Code reusability
B. Less memory space
C. Fast execution
Ans: B
61. Which of the following is the correct syntax for calling a Macro?
A. MACRO macro_name
B. MACRO macro_name [ parameter's list]
C. macro_name [parameter's list ]
Ans:C
62. Which of the following characteristics of Procedures makes it unfit for being used for
short instruction sets with less number of instructions?
A. Extra code requirement for integrating procedures
B. Linking of procedures with the mainline program takes too much time
C. Extra work load on processor for shifting controls
D. All of the Above
Ans: D
63. In a program, a Macro is being called 'n' times. Then how many times is the machine
code generated for the same?
A
A. 1 time
AH
B. 'n' times
C. 'n-1' times
W
S
Ans: B
AT
64. Macro definition is enclosed
H
A. between Macro header statement and macro end
P
B. In main program
C. In other function
M
O
Ans:A
65. MACRO definition consist of

A. Macro prototype statement
B. One or more model statements
C. Macro pre-processor statements
D. All of the above
Ans:D
66. A macro is
A. a small program inside a program
B. set of special instructions
C. a unit of specification for program generation through expansion
Ans:C
67. A ________________ statement declare the name of macro.

A. macro prototype
B. macro definition
C. macro identification
Ans:A
68. During macro expansion each statement is replaced by

A. the original program
B. the sequence of assembly statement
C. by specific symbols
Ans:B
AHA
69. Each macro statement is marked with the __________ sign preceded it.
A. +
W
B. @
S
C. -
T
D. $
A
Ans:A
P H
70. The flow control during macro expansion is
A. combination
M
B. chronological
O
C. indexable
D. sequential
Ans:D
71. A model statement contains call for another macro is called as

A. referential macro call
B. nested macro call
C. inbuilt macro call
D. inherited macro call
Ans:B
72. Expansion time variables are used

A. Before expansion of micro calls
B. only during expansion of macro calls
C. After expansion of micro calls
D. Any one of the above
Ans:B
73. The translator which perform macro expansion is called a

A. Macro processor
B. Macro pre-processor
C. Micro pre-processor
D. assembler
Ans:B
74. Macro processor is an inbuilt function of ?

A. Loader
B. Editor
C. Linker
A
D. Assembler
AH
Ans:D
75. If a number of instructions are repeating through the main program, then to reduce the
W
length of the program, ……. is used.
S
A. procedure
T
B. subroutine
A
C. macro
H
P
Ans:C
M
76. The process of assigning a label or macroname to the string is called
O
A. initialising macro
B. initialising string macro
C. defining a string macro
D. defining a macro
Ans: D
77. A macro can be used

A. in data segment
B. to represent directives
C. to represent statements
D. all of the mentioned
Ans: D
78. Inserting the statements and instructions represented by macro, directly at the place of the
macroname, in the program, is known as
A. calling a macro
B. inserting a macro
C. initializing a macro
Ans: A
79. The time required for execution of a macro is ……… that of procedure.
A. greater than
B. less than
C. equal to
Ans:B
80. Which of the following statements is incorrect?
A
A. complete code of instruction string is inserted at each place, wherever the macroname
AH
appears
B. macro requires less time of execution than that of procedure
W
C. macro uses stack memory
S
D. macro name can be anything except registers and mnemonics
T
Ans:C
H A
81. The beginning of the macro can be represented as
P
A. START
B. BEGIN
M
C. MACRO
O
Ans: C
82. Nested Macro calls are expanded using the

A. FIFO rule (First in first out)
B. LIFO (Last in First out)
C. FILO rule (First in last out)
Ans:B
83. Macro-processors are ______

A. Hardware
B. Compilers
C. Registers
Ans:B
84. Macro processor is an inbuilt function of -

A. Loader
B. Linker
C. Editor
D. Assembler
Ans:D
85. Advantage of incorporating the macro-processor into pass 1 is that

A. many functions have to be implemented twice
B. more flexibility is available to the programmer in that he may use all the features of
the assembler in conjunction with macros.
C. functions are combined and it is not necessary to create intermediate files as output
A
from the macro-processor and input to the assembler.
AH
D. all of these
Ans: D
S W
86. In which way a macro processor for assembly language can be implemented
T
A. Processor incorporated into pass 1 of a standard two pass assembler
A
B. Independent one-pass processor
H
C. Independent two-pass processor
P
D. All of these
Ans:D
O M
87. What are x and y in the following macro definition?
MACRO Add x, y
Load y
Mul x
Store y
MEND
A. variables
B. identifiers
C. formal parameters
D. actual parameters
Ans: C
88. The conditional expansion facility of macro procesors is provided to

A. to expand certain model statements depending upon the value of a condition during
the execution of the expanded program
B. test a condition during the execution of the expanded program
C. Both (a) and (b)
D. to expand certain model statements depending upon the value of a condition during
the process of macro expansion
Ans: C
89. The advantage(s) of incorporating the macro processor into pass 1 is/ are
A. many functions do not have to be implemented twice
B. more flexibility is available to the programmer in which he/she may use all the
features of the assembler in conjunction with macros
C. Functions are combined and it is not necessary to create intermediate files as output
from the macro processor and input to the assembler
D. All of the above
Ans: D
AHA
90. In which way(s) can a macro processor for assembly language be implemented?
A. independent one-pass processor
W
B. independent two-pass processor
S
C. processor incorporated into pass of a standard two-pass assembler
T
D. all of the above
A
Ans:D
P H
91. Which symbol used with formal parameter?
A. $
M
B. %
O
C. @
D. &
Ans:D
92. Which of the following is true in MACRO?

A. Keyword Parameters are written before positional parameters
B. Can be written in any order.
C. positional Parameters are written before Keyword parameters
D. Keyword parameters not allowed
Ans:C
93. MACRO uses both positional and keyword parameters?

A. TRUE
B. FALSE
Ans:A
94. Consider following Macro

MACRO
INCR &MEM_VAL &INCR_VAL &REG
MOVER &REG &MEM_VAL
ADD &REG &MEM_VAL
MOVEM &REG &MEM_VAL
MEND
Macro call for above definition will be?
A. INCR A B AREG
B. INCR MEM_VAL=A INCR_VAL=B REG=AREG
C. INCR MEM_VAL=A REG=AREG INCR_VAL=B
D. All of the above
Ans:A
AHA
MACRO
W
INCR &MEM_VAL= &INCR_VAL= &REG=
S
MOVER &REG &MEM_VAL
T
ADD &REG &MEM_VAL
A
MOVEM &REG &MEM_VAL
H
MEND
P
A. INCR A B AREG
M
B. INCR MEM_VAL=A INCR_VAL=B REG=AREG
O
D. Both B and C
Ans:D

MACRO
INCR &MEM_VAL=10 &INCR_VAL= &REG=
MOVER &REG &MEM_VAL
ADD &REG &MEM_VAL
MOVEM &REG &MEM_VAL
MEND
A. INCR A B AREG
B. INCR INCR_VAL=B REG=AREG
D. Both B and C
Ans:D
97. While calling Macro, ______ Parameters are always placed before ______ parameters.
A. Keyword, positional
B. Positional, Keyword
C. Default, Positional
D. Positional, Default
Ans: B
98. Mixing of parameters is allowed in macro.

A.TRUE
B. FALSE
Ans: A
AHA
99. Mixing of parameters is not allowed in macro.
A.TRUE
W
B. FALSE
S
Ans: B
AT
100.From following which is true?
H
A. Macro uses positional, keyword and default parameters
P
B. Positional Parameters are placed before Keyword parameters
C. Macro uses mixing of all parameters
M
D. All the above
O
Ans:D
UNIT-III
LANGUAGE TRANSLATOR
1. A compiler is a program that
A places programs into memory and prepares them for execution.

B automates the translation of assembly language into machine language.
C accepts a program written in a high level language and produces an object program.
D None of the above
Ans:C
2. The output of a lexical analyzer is
A
A. Machine Code
H
B. Intermediate Code
A
C. Stream of Token
W
D. Parse Tree
S
Ans: C
AT
3. Which concept of grammar is used in the compiler?
H
A Parser
P
B Code optimization
M
C Lexical analysis
D Code generation
O
Ans: A
4. What goes over the characters of the lexeme to produce a value?
A Scanner
B Lexical generator
C Parser
D Evaluator
Ans:A
5. Two Important lexical categories are
A White Space & Comments

B White Space
C Comments
D None of the mentioned
Ans: A
6. Which grammar defines Lexical Syntax
A Lexical Grammar
B Context free Grammar
C Regular Grammar
D None of the above
Ans: A
7. When expression sum=3+2 is tokenized then what is the token category of 3
A Integer Literal
B Addition Operator
C Identifier
D None of the above
Ans: A
8. It has encoded within it information on the possible sequences of characters that can
be contained within any of the tokens it handles..Above motioned function is
performed by?
A Syntactic Analyser
A
B Parser
C Scanner
H
D All of the mentioned
A
Ans: C
S W
9. A programmer, by mistake, writes an instruction to divide, instead of a multiply, such
AT
error can be detected by a/an
A compiler
H
B interpreter
P
C compiler or interpreter test
M
D None of these
Ans: D
O
10. The process of forming tokens from an input stream of characters is called_____
A Tokenization
B Liberalisation
C Characterisation
D None of the mentioned
Ans: A
11. Which of the following is a phase of a compilation process ?
A Lexical analysis
B Code generation
C Both (a) and (b)
D None of these
Ans:C
12. Compiler can diagnose
A Grammatical errors only

B logical errors only
C grammatical as well as logical errors
D None of these
Ans:A
13. System program such a s compiler are designed so that they are
A re-enterable
B non-reusable
C serially usable
D None of the above
Ans:A
14. A compiler program written in a high level language is called
A source program
B object program
C machine language program
D None of these
A
Ans: A
A H
15. The output of lexical analyzer is
W
A Set of Tokens
S
B A set of RE
AT
C Syntax Tree
D None of the above
H
Ans: A
P
16. Which of the following are Lexemes?
O M
A Keywords
B Identifiers
C Constants
D All of the mentioned
Ans: D
17. Which of the following is not a phase of compiler?
a. syntax
b. lexical
c. testing
d. code generation
Ans: c
18. In compiler, Source program is read by
a. parser
b. lexical analyzer
c.developer
d.analyst
Ans:b
19. In interpreter, Source program is read
a. character by character
b. line by line
c. page by page
d. module wise
Ans:b
20. Compiler
a. reads source program

b. converts it into target language
c. both a and b
d. none of the above
Ans:c
A
21. Token for if is
H
a. id
A
b. keyword
W
c. If
S
d. string
AT
Ans: c
22. Output of parser is
P H
a. set of tokens
b. parse tree
M
c. object code
O
d. intermediate code
Ans: b
23. Grammar is ambiguous if
a. it has 2 parse trees

b. it has two left most derivations
c. it has two right most derivations
d. all of the above
Ans: d
24. Parsing is also known as
a. syntax analysis
b. lexical analysis
c. semantic analysis
d. code generation
Ans: a
25. The concept of FSA is much used in this part of the compiler
a. lexical analysis
b. parser
c. code generation
d. code optimization
Ans: a
26. Input buffer is used
a. syntax analysis
b. lexical analysis
c. semantic analysis
d. code generation
Ans: b
27. Input buffer is
a. symbol table
A
b. divided into two halves
c. divided into Three halves
H
d. not divided
A
Ans: b
S W
28. How many Pointers are maintained in Input buffering Scheme?
AT
a. One
H
b. Two
P
c. Three
d. None of these
M
Ans: b
O
29. In input buffering scheme use two pointer are
a. low and High

b. First and second
c. Begin Pointer and Forward pointer
Ans: c
30. A grammar that produces more than one parse tree for some sentence is called
a) Ambiguous
b) Unambiguous
c) Regular
Ans: a
31. The optimization which avoids test at every iteration is

a) Loop unrolling
b) Loop jamming
c) Constant folding
Ans: a
32. Shift reduce parsers are
a) Top down Parser
b) Bottom Up parser
c) May be top down or bottom up
Ans: b
33. An intermediate code form is

a) Postfix notation
b) Syntax Trees
c) Three Address code
d) All of the mentioned
A
Ans: d
A H
34. A bottom up parser generates
W
a) Right most derivation
S
b) Right most derivation in reverse
AT
c) Left most derivation
d) Left most derivation in reverse
H
Ans: b
M P
35. A optimizing compiler
O
a) Is optimized to occupy less space
b) Is optimized to take less time for execution
c) Optimized the code
Ans: c
36. Input to code generator

a) Source code
b) Intermediate code
c) Target code
Ans: b
37. _____________ is a graph representation of a derivation

a) The parse tree
b) Oct tree
c) Binary tree
Ans: a
38. An intermediate code form is

a) Postfix Notation
b) Syntax Trees
c) Three address code
Ans: c
39. How many parts of compiler are there?

A. 1
B. 2
C. 4
D. 8
Ans: B
A
40. Grammar of the programming is checked at _______ phase of compiler.
H
A. Semantic analysis
A
B. Syntax analysis
W
C. Code optimization
S
D. Code generation
AT
Ans: B
H
41. Compiler can check ________ error.
P
A. Logical
M
B. Syntax
O
C. Content
D. Both A and B
Ans: B
42. What is the name of the process that determining whether a string of tokens can be
generated by a grammar?
A. Analysing
B. Recognizing
C. Translating
D. Parsing
Ans: D
43. Dead code elimination is done in

A. Lexical Phase
B. Syntax analysis
C. Code generation
D. Code optimization
Ans: D
44. Which of the following operations done in code optimization

A. Memory management
B. Eliminate redundancies
C. Generating code
D. Register allocation
Ans: B
45. Which of the following operations done in code generation

A. Generating code
B. Register allocation
C. Memory management
D. All of the above
Ans: D
46. Match the following
A
a)Lexical analysis i)Dead code elimination
H
b) Syntax analysis ii)Type checking
A
c) Semantic analysis iii)Generates Syntax tree
W
d) code optimization iv) Divide source program into tokens
AT S
A. a-iv b-iii c-i d-ii
B. a-iv b-ii c-i d-iii
H
C. a-iv b-iii c-ii d-i
P
D. a-iv b-ii c-iii d-i
M
Ans: B
O
47. Type checking is done usually done by
A. Lexical Phase
B. Syntax analysis
C. Semantic analysis
D. Code optimization
Ans: C
48. Which is permanent data base in the general model of compiler

A. Literal table
B. Identifier table
C. Source code
D. Terminal Table
Ans: C
49. Which of the following not used in intermediate code form?

A. Postfix notation
B. Three address code
C. Syntax trees
D. Quadruples
Ans: C
50. The lexical analysis for a modern computer language such as Java needs the power of
which one of the following machine models in a necessary and sufficient sense?
A. Finite state automata
B. Deterministic pushdown automata
C. Non-Deterministic pushdown automata
D. Turing Machine
Ans: A
51. Match all items in Group 1 with correct options from those given in Group 2.
Group 1 Group 2
P. Regular expression 1. Syntax analysis
Q. Pushdown automata 2. Code generation
A
R. Dataflow analysis 3. Lexical analysis
H
S. Register allocation 4. Code optimization
A
A. P-4. Q-1, R-2, S-3
B. P-3, Q-1, R-4, S-2
S W
C. P-3, Q-4, R-1, S-2
D. P-2, Q-1, R-4, S-3
AT
Ans: B
P H
52. Some code optimizations are carried out on the intermediate code because
A. they enhance the portability of the compiler to other target processors
M
B. program analysis is more accurate on intermediate code than on machine code
O
C. the information from dataflow analysis cannot otherwise be used for optimization
D. the information from the front end cannot otherwise be used for optimization
Ans: A
53. Which one of the following is FALSE?

A. A basic block is a sequence of instructions where control enters the sequence at the
beginning and exits at the end
B. Available expression analysis can be used for common subexpression elimination
C. Live variable analysis can be used for dead code elimination
D. x = 4 ∗ 5 => x = 20 is an example of common subexpression elimination
Ans: D
54. One of the purposes of using intermediate code in compilers is to

A. make parsing and semantic analysis simpler
B. improve error recovery and error reporting
C. increase the chances of reusing the machine-independent code optimizer in other
compilers
D. improve the register allocation
Ans: C
55. Consider the following statements:
(I) The output of a lexical analyzer is groups of characters.

(II) Total number of tokens in printf("i=%d, &i=%x", i, &i); are 11.
(III) Symbol table can be implementation by using array and hash table but not tree.
Which of the following statement(s) is/are correct?
A. Only (I)
B. Only (II) and (III)
C. All (I), (II), and (III)
D. None of these
Ans: D
A
56. Match all items in Group 1 with correct options from those given in Group 2.
H
Group 1 Group 2
A
A. Responsible for recognizing syntax 1. Optimizer
W
B. Output stream of words 2. Semantic analysis
S
C. Understands meanings of variables 3. Parser
AT
D. Used to improve IR representation 4. Scanner
H
Code: A B C D
P
A. iii iv ii i
M
B. iv iii ii i
O
C. ii iv i iii
D. ii iv iii i
Ans: A
57. The number of tokens in the following C statement is printf("i=%d, &i=%x", i&i);
A. 13
B. 6
C. 10
D. 9
Ans: D
58. Indicate which of the following is not true about interpreter ?

A. Interpreter generate an object program from the source program
B. Interpreter analyses each source statement every time it is to be executed
C. Interpreter is a kind of translator
D. All of above
Ans: A
59. An interpreter is
A. A program that places programs into memory an prepares them for execution
B. A program that automate the translation of assembly language into machine
language
C. A program that accepts a program written in high level language and produces an
object program
D. Is a program that appears to execute a source program as if it were machine
language
Ans: D
60. An interpreter is a program that

A. places programs into memory and prepares then for execution
B. automates the translation of assemble language into machine language
C. accepts a program written in a high level language and produces an object program
A
D. appears to execute a resource as if it were machine language
H
Ans: D
W A
61. A programmer, by mistakes writes a program to multiply two numbers instead of
S
dividing them, how can this error be detected
AT
A. Compiler
B. Interpreter
H
C. Compiler or interpreter
P
M
Ans: D
O
62. Compilers and interpreters are themselves:______________?
A. High-level language
B. Codes
C. Programs
D. Mnemonics
Ans: C
63. A finite automata recognizes

a) Any Language
b) Context Sensitive Language
c) Context Free Language
d) Regular Language
Ans: D
64. The regular languages are not closed under

A. Concatenation
B. Union
C. Kleene star
D. Complement
Ans: D
65. In regular expressions, the operator „*‟ stands for
a) Concatenation
b) Selection
c) Iteration
d) Addition
Ans: c
66. Regular expressions are used to represent which language

a) Recursive language
b) Context free language
c) Regular language
A
Ans: c
A H
67. Lexical Analyser‟s Output is given to Syntax Analysis.
W
a) True
S
b) False
AT
Ans: a
H
68. Which phase of the compiler is Lexical Analyser?
P
a) First
M
b) Second
O
c) Third
Ans: a
69. Which one is a type of Lexeme

a) Identifiers
b) Constants
c) Keywords
Ans: d
70. The process of forming tokens from an input stream of characters is called_____
a) Liberalisation
b) Characterisation
c) Tokenization
Ans: c
71. Which one is a lexer Generator

a) ANTLR
b) DRASTAR
c) FLEX
Ans: d
72. Select a Machine Independent phase of the compiler

a) Syntax Analysis
b) Intermediate Code generation
c) Lexical Analysis
Ans: d
73. Output file of Lex is _____ the input file is Myfile?
A
a) Myfile.e
H
b) Myfile.yy.c
A
c) Myfile.lex
W
d) Myfile.obj
S
Ans: b
AT
74. Suppose One of the Operand is String and other is Integer then it does not throw error
H
as it only checks whether there are two operands associated with „+‟ or not .
P
a) True
M
b) False
O
Ans: a
75. What does a Syntactic Analyser do?

a) Maintain Symbol Table
b) Collect type of information
c) Create parse tree
Ans: c
76. Which of the following statement is true?

a) Every language that is defined by regular expression can also be defined by finite
automata
b) Every language defined by finite automata can also be defined by regular
expression
c) We can convert regular expressions into finite automata
Ans: d
77. YACC is a computer program for ______ operation system.

a) Windows
b) DOS
c) Unix
d) openSUSE
Ans: c
78. The YACC takes C code as input and outputs_________

a) Top down parsers
b) Bottom up parsers
c) Machine code
Ans :b
79. Which of the following software tool is parser generator?
A
a) Lex
H
b) Yacc
A
c) Both of the mentioned
W
S
Ans: b
AT
80. A Lex compiler generates
H
a) Lex object code
P
b) Transition tables
M
c) Tokens
O
Ans: b
81. Input of Lex is ?

A. set to regular expression
B. statement
C. Numeric data
D. ASCII data
Ans: a
82. Yacc semantic action is a sequence of ?

A. Tokens
B. Expression
C. C statement
D. Rules
Ans: C
83. A compiler that runs on one machine and produces code for a different machine is
called
A. cross compilation
B. one pass compilation
C. two pass compilation
D. none of these
Ans: A
84. YACC stands for

A. yet accept compiler constructs
B. yet accept compiler compiler
C. yet another compiler constructs
D. yet another compiler compiler
Ans: D
85. Pee hole optimization

A. Loop optimization
A
B. Local optimization
H
C. Constant folding
A
D. Data flow analysis
W
Ans: C
AT S
86. Advantage of panic mode of error recovery is that
A. It is simple to implement
H
B. It never gets into an infinite loop
P
C. Both a and b
M
D. None of these
O
Ans: d
87. The output of lexical analyzer is

A. A set of RE
B. Syntax Tree
C. Set of Tokens
D. String Character
Ans: C
88. What is token for the lexeme “core dumped”

A. Keywords
B. Literals
C. Identifiers
D. Sentinels
Ans: B
89. Cross compiler is used in Bootstrapping.

a) True
b) False
Ans: a
90. Is GCC a cross Complier
a) Yes
b) No
Ans: a
91. What constitutes the stages of the compilation process?

a) Feasibility study, system, design, and testing
b) Implementation and. documentation
c) Lexical analysis, syntax. Analysis and code generation
Ans: c
A
92. Which of the following is not feature of compiler?
H
a) Scan the entire program first and translate into machine code
A
b) To remove syntax errors
W
c) Slow for debugging
S
d) Execution time is more
AT
Ans: d
H
93. All ___________ Are automatically treated as regular expressions.
P
a) Programmatic description
M
b) Window
O
c) Win Object
d) Collection
Ans: a
94. In a compiler, keywords of a language are recognized during

a) Parsing of the program
b) the code generation
c) the lexical analysis of the program
d) dataflow analysis
Ans: c
95. Consider the following statements related to compiler construction :

I. Lexical Analysis is specified by context-free grammars and implemented by pushdown
automata.
II. Syntax Analysis is specified by regular expressions and implemented by finite-state
machine.
Which of the above statement(s) is/are correct ?
a) only I
b) only II
c) first I and II
d) neither I nor II
Ans: d
96. Which one of the following statements is FALSE?
a) Context-free grammar can be used to specify both lexical and syntax rules.
b) Type checking is done before parsing.
c) High-level language programs can be translated to different Intermediate Representations
d) Arguments to a function can be passed using the program stack.
Ans: b
A H A
S W
P H AT
O M
UNIT-IV
OPERATING SYSTEMS
1. What is operating system?
a) collection of programs that manages hardware resources
b) system service provider to the application programs
c) link to interface the hardware and application programs
Ans: d
2. To access the services of operating system, the interface is provided by the
A
___________
H
a) System calls
A
b) API
W
c) Library
S
d) Assembly instructions
AT
Ans: a
H
3. Which one of the following is not true?
P
a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
M
c) kernel is made of various modules which can not be loaded in running operating
O
system
d) kernel remains in the memory during the entire computer session
Ans: c
4. Which one of the following error will be handling by the operating system?
a) power failure
b) lack of paper in printer
c) connection failure in the network
Ans: d
5. By operating system, the resource management can be done via __________

a) time division multiplexing
b) space division multiplexing
c) time and space division multiplexing
Ans: c
6. Which one of the following is not a real time operating system?

a) VxWorks
b) Windows CE
c) RTLinux
d) Palm OS.
Ans: d
Ans: b
A
H
b) open files
A
W
S
Ans: d
AT
H
a) fork
P
b) create
M
c) new
O
d) none of the mentioned.
Ans: a

a) normal exit
b) fatal error
Ans: d

Ans: a
12. What is inter process communication?

Ans: b

Ans: a

b) Local variables
A
c) Return addresses
H
A
Ans: d
S W
15. The address of the next instruction to be executed by the current process is provided
AT
by the __________
a) CPU registers
H
b) Program counter
P
c) Process stack
M
d) Pipe.
O
Ans: b
16. A Process Control Block(PCB) does not contain which of the following?
a) Code
b) Stack
c) Bootstrap program
d) Data
Ans: c
17. The number of processes completed per unit time is known as __________
a) Output
b) Throughput
c) Efficiency
d) Capacity
Ans: b
18. The state of a process is defined by __________

a) the final activity of the process
b) the activity just executed by the process
c) the activity to next be executed by the process
d) the current activity of the process
Ans: d
19. Which of the following is not the state of a process?
a) New
b) Old
c) Waiting
d) Running
Ans: b
20. What is a Process Control Block?

a) Process type variable
b) Data Structure
c) A secondary storage section
d) A Block in memory
A
Ans: b
A H
21. The entry of all the PCBs of the current processes is in __________
W
a) Process Register
S
b) Program Counter
AT
c) Process Table
d) Process Unit
H
Ans: c
M P
22. What is the degree of multiprogramming?
O
a) the number of processes executed per unit time
b) the number of processes in the ready queue
c) the number of processes in the I/O queue
d) the number of processes in memory
Ans: d
23. A single thread of control allows the process to perform __________

a) only one task at a time
b) multiple tasks at a time
c) only two tasks at a time
Ans: a
24. What is the objective of multiprogramming?

a) Have some process running at all times
b) Have multiple programs waiting in a queue ready to run
c) To minimize CPU utilization
Ans: a
25. What is a short-term scheduler?

a) It selects which process has to be brought into the ready queue
b) It selects which process has to be executed next and allocates CPU
c) It selects which process to remove from memory by swapping
Ans: b
26. Which of the following do not belong to queues for processes?

a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Ans: b
A
27. When the process issues an I/O request __________
H
a) It is placed in an I/O queue
A
b) It is placed in a waiting queue
W
c) It is placed in the ready queue
S
d) It is placed in the Job queue
AT
Ans: a
H
28. What will happen when a process terminates?
P
a) It is removed from all queues
M
b) It is removed from all, but the job queue
O
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
Ans: a
29. What is a long-term scheduler?

Ans: a
30. If all processes I/O bound, the ready queue will almost always be ______ and the
Short term Scheduler will have a ______ to do.
a) full, little
b) full, lot
c) empty, little
d) empty, lot
Ans: c
31. What is a medium-term scheduler?

Ans: c
32. The primary distinction between the short term scheduler and the long term scheduler
is __________
a) The length of their queues
b) The type of processes they schedule
c) The frequency of their execution
Ans: c
A
33. The only state transition that is initiated by the user process itself is __________
H
a) block
A
b) wakeup
W
c) dispatch
S
AT
Ans: a
H
34. In a time-sharing operating system, when the time slot given to a process is
P
completed, the process goes from the running state to the __________
M
a) Blocked state
O
b) Ready state
c) Suspended state
d) Terminated state
Ans: b
35. In a multiprogramming environment __________

a) the processor executes more than one process at a time
b) the programs are developed by more than one person
c) more than one process resides in the memory
d) a single user can execute many programs at the same time
Ans: c
36. Suppose that a process is in “Blocked” state waiting for some I/O service. When the
service is completed, it goes to the __________
a) Running state
b) Ready state
c) Suspended state
d) Terminated state
Ans: b
37. The context of a process in the PCB of a process does not contain __________
a) the value of the CPU registers
b) the process state
c) memory-management information
d) context switch time
Ans: d
38. Which of the following need not necessarily be saved on a context switch between
processes?
a) General purpose registers
b) Translation look aside buffer
c) Program counter
Ans: b
H A
39. Which of the following does not interrupt a running process?
A
a) A device
W
b) Timer
S
c) Scheduler process
AT
d) Power failure
Ans: c
P H
40. Which process can be affected by other processes executing in the system?
M
a) cooperating process
O
b) child process
c) parent process
d) init process
Ans: a
41. When several processes access the same data concurrently and the outcome of the
execution depends on the particular order in which the access takes place, is called?
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
Ans: b
42. If a process is executing in its critical section, then no other processes can be
executing in their critical section. This condition is called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
Ans: a
43. Mutual exclusion can be provided by the __________
a) mutex locks
b) binary semaphores
c) both mutex locks and binary semaphores
Ans: c
44. When high priority task is indirectly preempted by medium priority task effectively
inverting the relative priority of the two tasks, the scenario is called __________
a) priority inversion
b) priority removal
c) priority exchange
A
d) priority modification
H
Ans: a
W A
45. Process synchronization can be done on __________
S
a) hardware level
AT
b) software level
c) both hardware and software level
H
P
Ans: c
O M
46. With _____________ only one process can execute at a time; meanwhile all other
process are waiting for the processor. With ______________ more than one process
can be running simultaneously each on a different processor.
a) Multiprocessing, Multiprogramming
b) Multiprogramming, Uniprocessing
c) Multiprogramming, Multiprocessing
d) Uniprogramming, Multiprocessing
Ans: d
47. In UNIX, each process is identified by its __________

a) Process Control Block
b) Device Queue
c) Process Identifier
Ans: c
48. In UNIX, the return value for the fork system call is _____ for the child process and
_____ for the parent process.
a) A Negative integer, Zero
b) Zero, A Negative integer
c) Zero, A nonzero integer
d) A nonzero integer, Zero
Ans: c
49. The child process can __________

a) be a duplicate of the parent process
b) never be a duplicate of the parent process
c) cannot have another program loaded into it
d) never have another program loaded into it
Ans: a
50. What is Inter process communication?

a) allows processes to communicate and synchronize their actions when using the
same address space
A
b) allows processes to communicate and synchronize their actions without using the
H
same address space
A
c) allows the processes to only synchronize their actions without communication
W
S
Ans: b
AT
51. Message passing system allows processes to __________
H
a) communicate with one another without resorting to shared data
P
b) communicate with one another by resorting to shared data
M
c) share data
O
d) name the recipient or sender of the message
Ans: a
52. Which of the following two operations are provided by the IPC facility?
a) write & delete message
b) delete & receive message
c) send & delete message
d) receive & send message
Ans: d
53. Messages sent by a process __________

a) have to be of a fixed size
b) have to be a variable size
c) can be fixed or variable sized
Ans: c
54. The link between two processes P and Q to send and receive messages is called
__________
a) communication link
b) message-passing link
c) synchronization link
Ans: a
scheduler?
a) dispatcher
b) interrupt
c) scheduler
Ans: a
A
56. The processes that are residing in main memory and are ready and waiting to execute
H
are kept on a list called _____________
A
a) job queue
W
b) ready queue
S
c) execution queue
AT
d) process queue.
Ans: b
P H
57. The interval from the time of submission of a process to the time of completion is
M
termed as ____________
O
a) waiting time
b) turnaround time
c) response time
d) throughput
Ans: b
58. Which scheduling algorithm allocates the CPU first to the process that requests the
CPU first?
Ans: a

d) None of the mentioned.
Ans: a
60. In priority scheduling algorithm, when a process arrives at the ready queue, its
priority is compared with the priority of ____________
a) all process
c) parent process
d) init process
Ans: b

A
H
Ans: b
W A
S
AT
H
P
Ans: d
O M
Ans: a
64. CPU scheduling is the basis of ___________

a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
Ans: b
65. With multiprogramming ______ is used productively.

a) time
b) space
c) money
Ans: a
66. What are the two steps of a process execution?
a) I/O & OS Burst
b) CPU & I/O Burst
c) Memory & I/O Burst
d) OS & Memory Burst
Ans: b
67. An I/O bound program will typically have ____________

a) a few very short CPU bursts
b) many very short I/O bursts
c) many very short CPU bursts
d) a few very short I/O bursts
A
Ans: c
A H
68. A process is selected from the ______ queue by the ________ scheduler, to be
W
executed.
S
a) blocked, short term
AT
b) wait, long term
c) ready, short term
H
d) ready, long term
P
Ans: c
O M
69. In the following cases non – preemptive scheduling occurs?
a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state
c) When a process switches from the waiting state to the ready state
Ans: b
70. The switching of the CPU from one process or thread to another is called
____________
a) process switch
b) task switch
c) context switch
Ans: d
71. What is Dispatch latency?

a) the speed of dispatching a process from running to the ready state
b) the time of dispatching a process from running to ready state and keeping the CPU
idle
c) the time to stop one process and start running another one
Ans: c
72. Scheduling is done so as to ____________
a) increase CPU utilization
b) decrease CPU utilization
c) keep the CPU more idle
Ans: a

a) increase the throughput
b) decrease the throughput
c) increase the duration of a specific amount of work
A
Ans: a
A H
74. What is Turnaround time?
W
a) the total waiting time for a process to finish execution
S
b) the total time spent in the ready queue
AT
c) the total time spent in the running queue
d) the total time from the completion till the submission of a process
H
Ans: d
M P
O
a) increase the turnaround time
b) decrease the turnaround time
c) keep the turnaround time same
d) there is no relation between scheduling and turnaround time
Ans: b
76. What is Waiting time?

a) the total time in the blocked and waiting queues
Ans: b

a) increase the waiting time
b) keep the waiting time the same
c) decrease the waiting time
Ans: c
78. What is Response time?

a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is produced
c) the total time taken from submission time till the response is output
Ans: b
79. Round robin scheduling falls under the category of ____________

a) Non-preemptive scheduling
b) Preemptive scheduling
c) All of the mentioned
Ans: b
A
80. With round robin scheduling algorithm in a time shared system ____________
H
a) using very large time slices converts it into First come First served scheduling
A
algorithm
W
b) using very small time slices converts it into First come First served scheduling
S
algorithm
AT
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm
H
Ans: a
M P
81. The portion of the process scheduler in an operating system that dispatches processes
O
is concerned with ____________
a) assigning ready processes to CPU
b) assigning ready processes to waiting queue
c) assigning running processes to blocked queue
Ans: a
82. Complex scheduling algorithms ____________

a) are very appropriate for very large computers
b) use minimal resources
c) use many resources
Ans: a
83. What is FIFO algorithm?

a) first executes the job that came in last in the queue
b) first executes the job that came in first in the queue
c) first executes the job that needs minimal processor
d) first executes the job that has maximum processor needs
Ans:b
84. The strategy of making processes that are logically runnable to be temporarily
suspended is called ____________
a) Non preemptive scheduling
c) Shortest job first
d) First come First served
Ans: b
85. What is Scheduling?

a) allowing a job to use the processor
b) making proper use of processor
A
H
Ans: a
W A
86. There are 10 different processes running on a workstation. Idle processes are waiting
S
for an input event in the input queue. Busy processes are scheduled with the Round-
AT
Robin time sharing method. Which out of the following quantum times is the best
value for small response times, if the processes have a short runtime, e.g. less than
H
10ms?
P
a) tQ = 15ms
M
b) tQ = 40ms
O
c) tQ = 45ms
d) tQ = 50ms.
Ans: a
87. Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
a) earliest due date
b) slack time remaining
c) first come, first served
d) critical ratio
Ans: c
88. Which of the following algorithms tends to minimize the process flow time?
a) First come First served
b) Shortest Job First
c) Earliest Deadline First
d) Longest Job First
Ans: b
89. Under multiprogramming, turnaround time for short jobs is usually ________ and that
for long jobs is slightly ___________
a) Lengthened; Shortened
b) Shortened; Lengthened
c) Shortened; Shortened
d) Shortened; Unchanged
Ans: b
90. Which of the following statements are true?
I. Shortest remaining time first scheduling may cause starvation

II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
a) I only
b) I and III only
c) II and III only
A
d) I, II and III
A H
Ans: d
S W
91. Which is the most optimal scheduling algorithm?
AT
a) FCFS – First come First served
b) SJF – Shortest Job First
H
c) RR – Round Robin
P
Ans: b
O M
92. The real difficulty with SJF in short term scheduling is ____________
a) it is too good an algorithm
b) knowing the length of the next CPU request
c) it is too complex to understand
Ans: b
93. The FCFS algorithm is particularly troublesome for ____________

a) time sharing systems
b) multiprogramming systems
c) multiprocessor systems
d) operating systems
Ans: b
94. Consider the following set of processes, the length of the CPU burst time given in
milliseconds.
Process Burst time

P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm.
a) The waiting time for process P1 is 3ms
b) The waiting time for process P1 is 0ms
c) The waiting time for process P1 is 16ms
d) The waiting time for process P1 is 9ms
Ans: a
95. An SJF algorithm is simply a priority algorithm where the priority is ____________
a) the predicted next CPU burst
b) the inverse of the predicted next CPU burst
c) the current CPU burst
A
d) anything the user wants
H
Ans: a
A
96. Choose one of the disadvantages of the priority scheduling algorithm?
S W
a) it schedules in a very complex manner
b) its scheduling takes up a lot of time
AT
c) it can lead to some low priority process waiting indefinitely for the CPU
H
P
Ans: c
M
97. Which of the following scheduling algorithms gives minimum average waiting time?
O
a) FCFS
b) SJF
c) Round – robin
d) Priority
Ans: b
98. Mutual exclusion implies that ____________

a) if a process is executing in its critical section, then no other process must be
executing in their critical sections
b) if a process is executing in its critical section, then other processes must be
c) if a process is executing in its critical section, then all the resources of the system
must be blocked until it finishes execution
Ans: a

a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other
resources
Ans: d

a) the system can allocate resources to each process in some order and still avoid a
deadlock
Ans: a
A
H
A
b) using thread
W
c) using pipes
S
AT
Ans: a
H
P
a) banker‟s algorithm
M
O
d) karn‟s algorithm
Ans: a
103. What is the drawback of banker‟s algorithm?

Ans: d

Ans: c
105. A problem encountered in multitasking when a process is perpetually denied

necessary resources is called ____________
a) deadlock
b) starvation
c) inversion
d) aging
Ans: b
106. Which one of the following is a visual ( mathematical ) way to determine the
deadlock occurrence?
b) starvation graph
c) inversion graph
Ans: a
A
H
A
W
S
AT
Ans: a
H
108. The number of resources requested by a process ____________
P
a) must always be less than the total number of resources available in the system
M
b) must always be equal to the total number of resources available in the system
O
c) must not exceed the total number of resources available in the system
d) must exceed the total number of resources available in the system
Ans: c
109. The request and release of resources are ___________

a) command line statements
b) interrupts
c) system calls
d) special programs
Ans: c
110. For a deadlock to arise, which of the following conditions must hold simultaneously?
a) Mutual exclusion
b) No preemption
c) Hold and wait
Ans: d
111. For Mutual exclusion to prevail in the system ____________

a) at least one resource must be held in a non sharable mode
b) the processor must be a uniprocessor rather than a multiprocessor
c) there must be at least one resource in a sharable mode
Ans: a
112. For a Hold and wait condition to prevail ____________

a) A process must be not be holding a resource, but waiting for one to be freed, and
then request to acquire it
b) A process must be holding at least one resource and waiting to acquire additional
resources that are being held by other processes
c) A process must hold at least one resource and not be waiting to acquire additional
resources
A
Ans: b
A H
113. Deadlock prevention is a set of methods ____________
W
a) to ensure that at least one of the necessary conditions cannot hold
S
b) to ensure that all of the necessary conditions do not hold
AT
c) to decide if the requested resources for a process have to be given or not
d) to recover from a deadlock
H
Ans: a
M P
114. For non sharable resources like a printer, mutual exclusion ____________
O
a) must exist
b) must not exist
c) may exist
Ans: a
115. For sharable resources, mutual exclusion ____________

a) is required
b) is not required
c) may be or may not be required
Ans: b
116. To ensure that the hold and wait condition never occurs in the system, it must
be ensured that ____________
a) whenever a resource is requested by a process, it is not holding any other resources
b) each process must request and be allocated all its resources before it begins its
execution
c) a process can request resources only when it has none
Ans: d
117. The disadvantage of a process being allocated all its resources before beginning its
execution is ____________
a) Low CPU utilization
b) Low resource utilization
c) Very high resource utilization
Ans: b
118. To ensure no preemption, if a process is holding some resources and requests another
resource that cannot be immediately allocated to it ____________
a) then the process waits for the resources be allocated to it
b) the process keeps sending requests until the resource is allocated to it
A
c) the process resumes execution without the resource being allocated to it
H
d) then all resources currently being held are pre-empted
A
Ans: d
S W
119. One way to ensure that the circular wait condition never holds is to ____________
AT
a) impose a total ordering of all resource types and to determine whether one precedes
another in the ordering
H
b) to never let a process acquire resources that are held by other processes
P
c) to let a process wait for only one resource at a time
M
O
Ans: a
120. Each request requires that the system consider the _____________ to decide whether
the current request can be satisfied or must wait to avoid a future possible deadlock.
a) resources currently available
b) processes that have previously been in the system
c) resources currently allocated to each process
d) future requests and releases of each process
Ans: a
121. Given a priori information about the ________ number of resources of each type that
maybe requested for each process, it is possible to construct an algorithm that ensures
that the system will never enter a deadlock state.
a) minimum
b) average
c) maximum
d) approximate
Ans: c
122. A deadlock avoidance algorithm dynamically examines the __________ to ensure that
a circular wait condition can never exist.
a) resource allocation state
b) system storage state
c) operating system
d) resources
Ans: a
123. A state is safe, if ____________

a) the system does not crash due to deadlock occurrence
b) the system can allocate resources to each process in some order and still avoid a
deadlock
c) the state keeps the system protected and safe
Ans: b
H A
124. A system is in a safe state only if there exists a ____________
A
a) safe allocation
W
b) safe resource
S
c) safe sequence
AT
Ans: c
P H
125. All unsafe states are ____________
M
a) deadlocks
O
b) not deadlocks
c) fatal
Ans: b
126. A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2.
Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.
Process
P0
P1
P2
Maximum needs (process-wise: P0 through P2 top to bottom)

10
4
9
Currently allocated (process-wise)

5
2
2
Which of the following sequence is a safe sequence?
a) P0, P1, P2
b) P1, P2, P0
c) P2, P0, P1
d) P1, P0, P2
Ans: d
127. If no cycle exists in the resource allocation graph ____________

a) then the system will not be in a safe state
b) then the system will be in a safe state
Ans: b
128. The resource allocation graph is not applicable to a resource allocation system
A
____________
H
a) with multiple instances of each resource type
A
b) with a single instance of each resource type
W
c) single & multiple instances of each resource type
S
AT
Ans: a
H
129. The Banker‟s algorithm is _____________ than the resource allocation graph
P
algorithm.
M
a) less efficient
O
b) more efficient
c) equal
Ans: a
130. The data structures available in the Banker‟s algorithm are ____________
a) Available
b) Need
c) Allocation
Ans: d
131. The content of the matrix Need is ____________

a) Allocation – Available
b) Max – Available
c) Max – Allocation
d) Allocation – Max
Ans: c
132. A system with 5 processes P0 through P4 and three resource types A, B, C

have A with 10 instances, B with 5 instances, and C with 7 instances. At time t0, the
following snapshot has been taken:
Process
P0
P1
P2
P3
P4
Allocation (process-wise : P0 through P4 top TO bottom)

A B C
0 1 0
2 0 0
3 0 2
2 1 1
A
0 0 2
A H
MAX (process-wise: P0 through P4 top TO bottom)
A B C
W
7 5 3
S
3 2 2
AT
9 0 2
2 2 2
H
4 3 3
P
Available
M
A B C
O
3 3 2
The sequence <P1, P3, P4, P2, P0> leads the system to ____________
a) an unsafe state
b) a safe state
c) a protected state
d) a deadlock
Ans: b
133. The wait-for graph is a deadlock detection algorithm that is applicable when
____________
a) all resources have a single instance
b) all resources have multiple instances
c) all resources have a single 7 multiple instances
Ans: a
134. An edge from process Pi to Pj in a wait for graph indicates that ____________
a) Pi is waiting for Pj to release a resource that Pi needs
b) Pj is waiting for Pi to release a resource that Pj needs
c) Pi is waiting for Pj to leave the system
d) Pj is waiting for Pi to leave the system
Ans: a
135. If the wait for graph contains a cycle ____________

a) then a deadlock does not exist
b) then a deadlock exists
c) then the system is in a safe state
d) either deadlock exists or system is in a safe state
Ans: b
136. If deadlocks occur frequently, the detection algorithm must be invoked

________
a) rarely
A
b) frequently
H
c) rarely & frequently
A
W
Ans: b
AT S
137. What is the disadvantage of invoking the detection algorithm for every
request?
H
a) overhead of the detection algorithm due to consumption of memory
P
b) excessive time consumed in the request to be allocated memory
M
c) considerable overhead in computation time
O
Ans: c
138. A deadlock eventually cripples system throughput and will cause the CPU
utilization to ______
a) increase
b) drop
c) stay still
Ans: b
139. Every time a request for allocation cannot be granted immediately, the
detection algorithm is invoked. This will help identify ____________
a) the set of processes that have been deadlocked
b) the set of processes in the deadlock queue
c) the specific process that caused the deadlock
Ans: a
140. A computer system has 6 tape drives, with „n‟ processes competing for them.
Each process may need 3 tape drives. The maximum value of „n‟ for which the system
is guaranteed to be deadlock free is?
a) 2
b) 3
c) 4
d) 1
Ans: 2
141. A system has 3 processes sharing 4 resources. If each process needs a

maximum of 2 units then, deadlock ____________
a) can never occur
b) may occur
c) has to occur
A
Ans: a
A H
142. „m‟ processes share „n‟ resources of the same type. The maximum need of
W
each process doesn‟t exceed „n‟ and the sum of all their maximum needs is always
S
less than m+n. In this setup, deadlock ____________
AT
a) can never occur
b) may occur
H
c) has to occur
P
M
Ans: a
O
143. A deadlock can be broken by ____________
a) abort one or more processes to break the circular wait
b) abort all the process in the system
c) pre-empt all resources from all processes
Ans: a
144. The two ways of aborting processes and eliminating deadlocks are
____________
a) Abort all deadlocked processes
b) Abort all processes
c) Abort one process at a time until the deadlock cycle is eliminated
Ans: c
145. Those processes should be aborted on occurrence of a deadlock, the

termination of which?
a) is more time consuming
b) incurs minimum cost
c) safety is not hampered
Ans: b
146. The process to be aborted is chosen on the basis of the following factors?
a) priority of the process
b) process is interactive or batch
c) how long the process has computed
Ans: d
147. Cost factors for process termination include ____________

a) Number of resources the deadlock process is not holding
b) CPU utilization at the time of deadlock
A
c) Amount of time a deadlocked process has thus far consumed during its execution
H
A
Ans: c
S W
148. If we preempt a resource from a process, the process cannot continue with its
AT
normal execution and it must be ____________
a) aborted
H
b) rolled back
P
c) terminated
M
d) queued
O
Ans: b
149. To _______ to a safe state, the system needs to keep more information about
the states of processes.
a) abort the process
b) roll back the process
c) queue the process
Ans: b
150. If the resources are always preempted from the same process __________ can
occur.
a) deadlock
b) system crash
c) aging
d) starvation
Ans: d
151. Which of the following is NOT a valid deadlock prevention scheme?

(a) Release all resources before requesting a new resource
(b) Number the resources uniquely and never request a lower numbered resource than
the last one requested.
(c) Never request a resource after releasing any resource
(d) Request and all required resources be allocated before execution.
Ans: c
152. consider the 3 processes, P1, P2 and P3 shown in the table
Process Arrival time Time unit required

P1 0 5
P2 1 7
P3 3 4
The completion order of the 3 processes under the policies FCFS and RRS (round
robin scheduling with CPU quantum of 2 time units) are
A
(A) FCFS: P1, P2, P3 RR2: P1, P2, P3
H
(B) FCFS: P1, P3, P2 RR2: P1, P3, P2
A
(C) FCFS: P1, P2, P3 RR2: P1, P3, P2
W
(D) FCFS: P1, P3, P2 RR2: P1, P2, P3
S
Ans: c
AT
153. Consider a set of n tasks with known runtimes r1, r2, … rn to be run on a
H
uniprocessor machine. Which of the following processor scheduling algorithms
P
will result in the maximum throughput?
M
(a) Round-Robin
O
(b) Shortest-Job-First
(c) Highest-Response-Ratio-Next
(d) First-Come-First-Served
Ans: B
154. Consider the following table of arrival time and burst time for three
processes P0, P1 and P2.
Process Arrival time Burst Time

P0 0 ms 9 ms
P1 1 ms 4 ms
P2 2 ms 9 ms
The pre-emptive shortest job first scheduling algorithm is used. Scheduling is

carried out only at arrival or completion of processes. What is the average waiting
time for the three processes?
(A) 5.0 ms
(B) 4.33 ms
(C) 6.33 ms
(D) 7.33 ms
Ans: a
(Explanation: Process P0 is allocated processor at 0 ms as there is no other process in
ready queue. P0 is preempted after 1 ms as P1 arrives at 1 ms and burst time for P1 is
less than remaining time of P0. P1 runs for 4ms. P2 arrived at 2 ms but P1 continued
as burst time of P2 is longer than P1. After P1 completes, P0 is scheduled again as the
remaining time for P0 is less than the burst time of P2.
P0 waits for 4 ms, P1 waits for 0 ms and P2 waits for 11 ms. So average waiting time
is (0+4+11)/3 = 5.)
155. In which one of the following page replacement policies, Belady’s

anomaly may occur?
(A) FIFO
(B) Optimal
A
(C) LRU
H
(D) MRU
A
Ans: A
W
(Explanation: Belady‟s anomaly proves that it is possible to have more page faults
S
when increasing the number of page frames while using the First in First Out (FIFO)
AT
page replacement algorithm.)
H
156.
P
In the following process state transition diagram for a uniprocessor system,
M
assume that there are always some processes in the ready state: Now consider the
O
following statements:
I. If a process makes a transition D, it would result in another process making

transition A immediately.
II. A process P2 in blocked state can make transition E while another process P1
is in running state.
III. The OS uses preemptive scheduling.
IV. The OS uses non-preemptive scheduling.
Which of the above statements are TRUE?
(A) I and II
(B) I and III
(C) II and III
(D) II and IV
Ans: C
(Explanation: I is false. If a process makes a transition D, it would result in another
process making transition B, not A.
II is true. A process can move to ready state when I/O completes irrespective of other
process being in running state or not.
III is true because there is a transition from running to ready state.
IV is false as the OS uses preemptive scheduling.)
157. Which of the following is NOT true of deadlock prevention and deadlock
avoidance schemes?
(A) In deadlock prevention, the request for resources is always granted if the resulting
state is safe
(B) In deadlock avoidance, the request for resources is always granted if the result
A
state is safe
H
(C) Deadlock avoidance is less restrictive than deadlock prevention
A
(D) Deadlock avoidance requires knowledge of resource requirements a priori
W
Ans: A
S
(Explanation: Deadlock prevention scheme handles deadlock by making sure that one
AT
of the four necessary conditions don't occur. In deadlock prevention, the request for a
resource may not be granted even if the resulting state is safe.)
P H
158. Scheduling is done so as to :
M
A. increase the turnaround time
O
B. decrease the turnaround time
C. keep the turnaround time same
D. there is no relation between scheduling and turnaround time
Ans: B
159. Waiting time is :

A. the total time in the blocked and waiting queues
B. the total time spent in the ready queue
C. the total time spent in the running queue
D. the total time from the completion till the submission of a process
Ans: B
UNIT-IV
OPERATING SYSTEMS
1. What is operating system?
a) collection of programs that manages hardware resources
b) system service provider to the application programs
c) link to interface the hardware and application programs
Ans: d
2. To access the services of operating system, the interface is provided by the
A
___________
H
a) System calls
A
b) API
W
c) Library
S
d) Assembly instructions
AT
Ans: a
H
3. Which one of the following is not true?
P
a) kernel is the program that constitutes the central core of the operating system
b) kernel is the first part of operating system to load into memory during booting
M
c) kernel is made of various modules which can not be loaded in running operating
O
system
d) kernel remains in the memory during the entire computer session
Ans: c
4. Which one of the following error will be handling by the operating system?
a) power failure
b) lack of paper in printer
c) connection failure in the network
Ans: d
5. By operating system, the resource management can be done via __________

a) time division multiplexing
b) space division multiplexing
c) time and space division multiplexing
Ans: c
6. Which one of the following is not a real time operating system?

a) VxWorks
b) Windows CE
c) RTLinux
d) Palm OS.
Ans: d
Ans: b
A
H
b) open files
A
W
S
Ans: d
AT
H
a) fork
P
b) create
M
c) new
O
d) none of the mentioned.
Ans: a

a) normal exit
b) fatal error
Ans: d

Ans: a
12. What is inter process communication?

Ans: b

Ans: a

b) Local variables
A
c) Return addresses
H
A
Ans: d
S W
15. The address of the next instruction to be executed by the current process is provided
AT
by the __________
a) CPU registers
H
b) Program counter
P
c) Process stack
M
d) Pipe.
O
Ans: b
16. A Process Control Block(PCB) does not contain which of the following?
a) Code
b) Stack
c) Bootstrap program
d) Data
Ans: c
17. The number of processes completed per unit time is known as __________
a) Output
b) Throughput
c) Efficiency
d) Capacity
Ans: b
18. The state of a process is defined by __________

a) the final activity of the process
b) the activity just executed by the process
c) the activity to next be executed by the process
d) the current activity of the process
Ans: d
19. Which of the following is not the state of a process?
a) New
b) Old
c) Waiting
d) Running
Ans: b
20. What is a Process Control Block?

a) Process type variable
b) Data Structure
c) A secondary storage section
d) A Block in memory
A
Ans: b
A H
21. The entry of all the PCBs of the current processes is in __________
W
a) Process Register
S
b) Program Counter
AT
c) Process Table
d) Process Unit
H
Ans: c
M P
22. What is the degree of multiprogramming?
O
a) the number of processes executed per unit time
b) the number of processes in the ready queue
c) the number of processes in the I/O queue
d) the number of processes in memory
Ans: d
23. A single thread of control allows the process to perform __________

a) only one task at a time
b) multiple tasks at a time
c) only two tasks at a time
Ans: a
24. What is the objective of multiprogramming?

a) Have some process running at all times
b) Have multiple programs waiting in a queue ready to run
c) To minimize CPU utilization
Ans: a
25. What is a short-term scheduler?

Ans: b
26. Which of the following do not belong to queues for processes?

a) Job Queue
b) PCB queue
c) Device Queue
d) Ready Queue
Ans: b
A
27. When the process issues an I/O request __________
H
a) It is placed in an I/O queue
A
b) It is placed in a waiting queue
W
c) It is placed in the ready queue
S
d) It is placed in the Job queue
AT
Ans: a
H
28. What will happen when a process terminates?
P
a) It is removed from all queues
M
b) It is removed from all, but the job queue
O
c) Its process control block is de-allocated
d) Its process control block is never de-allocated
Ans: a
29. What is a long-term scheduler?

Ans: a
30. If all processes I/O bound, the ready queue will almost always be ______ and the
Short term Scheduler will have a ______ to do.
a) full, little
b) full, lot
c) empty, little
d) empty, lot
Ans: c
31. What is a medium-term scheduler?

Ans: c
32. The primary distinction between the short term scheduler and the long term scheduler
is __________
a) The length of their queues
b) The type of processes they schedule
c) The frequency of their execution
Ans: c
A
33. The only state transition that is initiated by the user process itself is __________
H
a) block
A
b) wakeup
W
c) dispatch
S
AT
Ans: a
H
34. In a time-sharing operating system, when the time slot given to a process is
P
completed, the process goes from the running state to the __________
M
a) Blocked state
O
b) Ready state
c) Suspended state
d) Terminated state
Ans: b
35. In a multiprogramming environment __________

a) the processor executes more than one process at a time
b) the programs are developed by more than one person
c) more than one process resides in the memory
d) a single user can execute many programs at the same time
Ans: c
36. Suppose that a process is in “Blocked” state waiting for some I/O service. When the
service is completed, it goes to the __________
a) Running state
b) Ready state
c) Suspended state
d) Terminated state
Ans: b
37. The context of a process in the PCB of a process does not contain __________
a) the value of the CPU registers
b) the process state
c) memory-management information
d) context switch time
Ans: d
38. Which of the following need not necessarily be saved on a context switch between
processes?
a) General purpose registers
b) Translation look aside buffer
c) Program counter
Ans: b
H A
39. Which of the following does not interrupt a running process?
A
a) A device
W
b) Timer
S
c) Scheduler process
AT
d) Power failure
Ans: c
P H
40. Which process can be affected by other processes executing in the system?
M
a) cooperating process
O
b) child process
c) parent process
d) init process
Ans: a
41. When several processes access the same data concurrently and the outcome of the
execution depends on the particular order in which the access takes place, is called?
a) dynamic condition
b) race condition
c) essential condition
d) critical condition
Ans: b
42. If a process is executing in its critical section, then no other processes can be
executing in their critical section. This condition is called?
a) mutual exclusion
b) critical exclusion
c) synchronous exclusion
d) asynchronous exclusion
Ans: a
43. Mutual exclusion can be provided by the __________
a) mutex locks
b) binary semaphores
c) both mutex locks and binary semaphores
Ans: c
44. When high priority task is indirectly preempted by medium priority task effectively
inverting the relative priority of the two tasks, the scenario is called __________
a) priority inversion
b) priority removal
c) priority exchange
A
d) priority modification
H
Ans: a
W A
45. Process synchronization can be done on __________
S
a) hardware level
AT
b) software level
c) both hardware and software level
H
P
Ans: c
O M
46. With _____________ only one process can execute at a time; meanwhile all other
process are waiting for the processor. With ______________ more than one process
can be running simultaneously each on a different processor.
a) Multiprocessing, Multiprogramming
b) Multiprogramming, Uniprocessing
c) Multiprogramming, Multiprocessing
d) Uniprogramming, Multiprocessing
Ans: d
47. In UNIX, each process is identified by its __________

a) Process Control Block
b) Device Queue
c) Process Identifier
Ans: c
48. In UNIX, the return value for the fork system call is _____ for the child process and
_____ for the parent process.
a) A Negative integer, Zero
b) Zero, A Negative integer
c) Zero, A nonzero integer
d) A nonzero integer, Zero
Ans: c
49. The child process can __________

a) be a duplicate of the parent process
b) never be a duplicate of the parent process
c) cannot have another program loaded into it
d) never have another program loaded into it
Ans: a
50. What is Inter process communication?

a) allows processes to communicate and synchronize their actions when using the
same address space
A
b) allows processes to communicate and synchronize their actions without using the
H
same address space
A
c) allows the processes to only synchronize their actions without communication
W
S
Ans: b
AT
51. Message passing system allows processes to __________
H
a) communicate with one another without resorting to shared data
P
b) communicate with one another by resorting to shared data
M
c) share data
O
d) name the recipient or sender of the message
Ans: a
52. Which of the following two operations are provided by the IPC facility?
a) write & delete message
b) delete & receive message
c) send & delete message
d) receive & send message
Ans: d
53. Messages sent by a process __________

a) have to be of a fixed size
b) have to be a variable size
c) can be fixed or variable sized
Ans: c
54. The link between two processes P and Q to send and receive messages is called
__________
a) communication link
b) message-passing link
c) synchronization link
Ans: a
scheduler?
a) dispatcher
b) interrupt
c) scheduler
Ans: a
A
56. The processes that are residing in main memory and are ready and waiting to execute
H
are kept on a list called _____________
A
a) job queue
W
b) ready queue
S
c) execution queue
AT
d) process queue.
Ans: b
P H
57. The interval from the time of submission of a process to the time of completion is
M
termed as ____________
O
a) waiting time
b) turnaround time
c) response time
d) throughput
Ans: b
58. Which scheduling algorithm allocates the CPU first to the process that requests the
CPU first?
Ans: a

d) None of the mentioned.
Ans: a
60. In priority scheduling algorithm, when a process arrives at the ready queue, its
priority is compared with the priority of ____________
a) all process
c) parent process
d) init process
Ans: b

A
H
Ans: b
W A
S
AT
H
P
Ans: d
O M
Ans: a
64. CPU scheduling is the basis of ___________

a) multiprocessor systems
b) multiprogramming operating systems
c) larger memory sized systems
Ans: b
65. With multiprogramming ______ is used productively.

a) time
b) space
c) money
Ans: a
66. What are the two steps of a process execution?
a) I/O & OS Burst
b) CPU & I/O Burst
c) Memory & I/O Burst
d) OS & Memory Burst
Ans: b
67. An I/O bound program will typically have ____________

a) a few very short CPU bursts
b) many very short I/O bursts
c) many very short CPU bursts
d) a few very short I/O bursts
A
Ans: c
A H
68. A process is selected from the ______ queue by the ________ scheduler, to be
W
executed.
S
a) blocked, short term
AT
b) wait, long term
c) ready, short term
H
d) ready, long term
P
Ans: c
O M
69. In the following cases non – preemptive scheduling occurs?
a) When a process switches from the running state to the ready state
b) When a process goes from the running state to the waiting state
c) When a process switches from the waiting state to the ready state
Ans: b
70. The switching of the CPU from one process or thread to another is called
____________
a) process switch
b) task switch
c) context switch
Ans: d
71. What is Dispatch latency?

a) the speed of dispatching a process from running to the ready state
b) the time of dispatching a process from running to ready state and keeping the CPU
idle
c) the time to stop one process and start running another one
Ans: c
a) increase CPU utilization
b) decrease CPU utilization
c) keep the CPU more idle
Ans: a

a) increase the throughput
b) decrease the throughput
c) increase the duration of a specific amount of work
A
Ans: a
A H
74. What is Turnaround time?
W
a) the total waiting time for a process to finish execution
S
AT
H
Ans: d
M P
O
a) increase the turnaround time
b) decrease the turnaround time
c) keep the turnaround time same
d) there is no relation between scheduling and turnaround time
Ans: b
76. What is Waiting time?

a) the total time in the blocked and waiting queues
Ans: b

a) increase the waiting time
b) keep the waiting time the same
c) decrease the waiting time
Ans: c
78. What is Response time?

a) the total time taken from the submission time till the completion time
b) the total time taken from the submission time till the first response is produced
c) the total time taken from submission time till the response is output
Ans: b
79. Round robin scheduling falls under the category of ____________

a) Non-preemptive scheduling
c) All of the mentioned
Ans: b
A
80. With round robin scheduling algorithm in a time shared system ____________
H
a) using very large time slices converts it into First come First served scheduling
A
algorithm
W
b) using very small time slices converts it into First come First served scheduling
S
algorithm
AT
c) using extremely small time slices increases performance
d) using very small time slices converts it into Shortest Job First algorithm
H
Ans: a
M P
81. The portion of the process scheduler in an operating system that dispatches processes
O
is concerned with ____________
a) assigning ready processes to CPU
b) assigning ready processes to waiting queue
c) assigning running processes to blocked queue
Ans: a
82. Complex scheduling algorithms ____________

a) are very appropriate for very large computers
b) use minimal resources
c) use many resources
Ans: a
83. What is FIFO algorithm?

a) first executes the job that came in last in the queue
b) first executes the job that came in first in the queue
c) first executes the job that needs minimal processor
d) first executes the job that has maximum processor needs
Ans:b
84. The strategy of making processes that are logically runnable to be temporarily
suspended is called ____________
a) Non preemptive scheduling
c) Shortest job first
d) First come First served
Ans: b
85. What is Scheduling?

a) allowing a job to use the processor
b) making proper use of processor
A
H
Ans: a
W A
86. There are 10 different processes running on a workstation. Idle processes are waiting
S
for an input event in the input queue. Busy processes are scheduled with the Round-
AT
Robin time sharing method. Which out of the following quantum times is the best
value for small response times, if the processes have a short runtime, e.g. less than
H
10ms?
P
a) tQ = 15ms
M
b) tQ = 40ms
O
c) tQ = 45ms
d) tQ = 50ms.
Ans: a
87. Orders are processed in the sequence they arrive if _______ rule sequences the jobs.
a) earliest due date
b) slack time remaining
c) first come, first served
d) critical ratio
Ans: c
88. Which of the following algorithms tends to minimize the process flow time?
a) First come First served
b) Shortest Job First
c) Earliest Deadline First
d) Longest Job First
Ans: b
89. Under multiprogramming, turnaround time for short jobs is usually ________ and that
for long jobs is slightly ___________
a) Lengthened; Shortened
b) Shortened; Lengthened
c) Shortened; Shortened
d) Shortened; Unchanged
Ans: b
90. Which of the following statements are true?
I. Shortest remaining time first scheduling may cause starvation

II. Preemptive scheduling may cause starvation
III. Round robin is better than FCFS in terms of response time
a) I only
b) I and III only
c) II and III only
A
d) I, II and III
A H
Ans: d
S W
91. Which is the most optimal scheduling algorithm?
AT
a) FCFS – First come First served
b) SJF – Shortest Job First
H
c) RR – Round Robin
P
Ans: b
O M
92. The real difficulty with SJF in short term scheduling is ____________
a) it is too good an algorithm
b) knowing the length of the next CPU request
c) it is too complex to understand
Ans: b
93. The FCFS algorithm is particularly troublesome for ____________

a) time sharing systems
b) multiprogramming systems
c) multiprocessor systems
d) operating systems
Ans: b
94. Consider the following set of processes, the length of the CPU burst time given in
milliseconds.
Process Burst time

P1 6
P2 8
P3 7
P4 3
Assuming the above process being scheduled with the SJF scheduling algorithm.
a) The waiting time for process P1 is 3ms
b) The waiting time for process P1 is 0ms
c) The waiting time for process P1 is 16ms
d) The waiting time for process P1 is 9ms
Ans: a
95. An SJF algorithm is simply a priority algorithm where the priority is ____________
a) the predicted next CPU burst
b) the inverse of the predicted next CPU burst
c) the current CPU burst
A
d) anything the user wants
H
Ans: a
A
96. Choose one of the disadvantages of the priority scheduling algorithm?
S W
a) it schedules in a very complex manner
b) its scheduling takes up a lot of time
AT
c) it can lead to some low priority process waiting indefinitely for the CPU
H
P
Ans: c
M
97. Which of the following scheduling algorithms gives minimum average waiting time?
O
a) FCFS
b) SJF
c) Round – robin
d) Priority
Ans: b
98. Mutual exclusion implies that ____________

a) if a process is executing in its critical section, then no other process must be
b) if a process is executing in its critical section, then other processes must be
c) if a process is executing in its critical section, then all the resources of the system
must be blocked until it finishes execution
Ans: a

a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other
resources
Ans: d

a) the system can allocate resources to each process in some order and still avoid a
deadlock
Ans: a
A
H
A
b) using thread
W
c) using pipes
S
AT
Ans: a
H
P
a) banker‟s algorithm
M
O
d) karn‟s algorithm
Ans: a
103. What is the drawback of banker‟s algorithm?

Ans: d

Ans: c
105. A problem encountered in multitasking when a process is perpetually denied

necessary resources is called ____________
a) deadlock
b) starvation
c) inversion
d) aging
Ans: b
106. Which one of the following is a visual ( mathematical ) way to determine the
deadlock occurrence?
b) starvation graph
c) inversion graph
Ans: a
A
H
A
W
S
AT
Ans: a
H
108. The number of resources requested by a process ____________
P
a) must always be less than the total number of resources available in the system
M
b) must always be equal to the total number of resources available in the system
O
c) must not exceed the total number of resources available in the system
d) must exceed the total number of resources available in the system
Ans: c
109. The request and release of resources are ___________

a) command line statements
b) interrupts
c) system calls
d) special programs
Ans: c
110. For a deadlock to arise, which of the following conditions must hold simultaneously?
a) Mutual exclusion
b) No preemption
c) Hold and wait
Ans: d
111. For Mutual exclusion to prevail in the system ____________

a) at least one resource must be held in a non sharable mode
b) the processor must be a uniprocessor rather than a multiprocessor
c) there must be at least one resource in a sharable mode
Ans: a
112. For a Hold and wait condition to prevail ____________

a) A process must be not be holding a resource, but waiting for one to be freed, and
then request to acquire it
b) A process must be holding at least one resource and waiting to acquire additional
resources that are being held by other processes
c) A process must hold at least one resource and not be waiting to acquire additional
resources
A
Ans: b
A H
113. Deadlock prevention is a set of methods ____________
W
a) to ensure that at least one of the necessary conditions cannot hold
S
b) to ensure that all of the necessary conditions do not hold
AT
c) to decide if the requested resources for a process have to be given or not
d) to recover from a deadlock
H
Ans: a
M P
114. For non sharable resources like a printer, mutual exclusion ____________
O
a) must exist
b) must not exist
c) may exist
Ans: a
115. For sharable resources, mutual exclusion ____________

a) is required
b) is not required
c) may be or may not be required
Ans: b
116. To ensure that the hold and wait condition never occurs in the system, it must
be ensured that ____________
a) whenever a resource is requested by a process, it is not holding any other resources
b) each process must request and be allocated all its resources before it begins its
execution
c) a process can request resources only when it has none
Ans: d
117. The disadvantage of a process being allocated all its resources before beginning its
execution is ____________
a) Low CPU utilization
b) Low resource utilization
c) Very high resource utilization
Ans: b
118. To ensure no preemption, if a process is holding some resources and requests another
resource that cannot be immediately allocated to it ____________
a) then the process waits for the resources be allocated to it
b) the process keeps sending requests until the resource is allocated to it
A
c) the process resumes execution without the resource being allocated to it
H
d) then all resources currently being held are pre-empted
A
Ans: d
S W
119. One way to ensure that the circular wait condition never holds is to ____________
AT
a) impose a total ordering of all resource types and to determine whether one precedes
another in the ordering
H
b) to never let a process acquire resources that are held by other processes
P
c) to let a process wait for only one resource at a time
M
O
Ans: a
120. Each request requires that the system consider the _____________ to decide whether
the current request can be satisfied or must wait to avoid a future possible deadlock.
a) resources currently available
b) processes that have previously been in the system
c) resources currently allocated to each process
d) future requests and releases of each process
Ans: a
121. Given a priori information about the ________ number of resources of each type that
maybe requested for each process, it is possible to construct an algorithm that ensures
that the system will never enter a deadlock state.
a) minimum
b) average
c) maximum
d) approximate
Ans: c
122. A deadlock avoidance algorithm dynamically examines the __________ to ensure that
a circular wait condition can never exist.
a) resource allocation state
b) system storage state
c) operating system
d) resources
Ans: a
123. A state is safe, if ____________

a) the system does not crash due to deadlock occurrence
b) the system can allocate resources to each process in some order and still avoid a
deadlock
c) the state keeps the system protected and safe
Ans: b
H A
124. A system is in a safe state only if there exists a ____________
A
a) safe allocation
W
b) safe resource
S
c) safe sequence
AT
Ans: c
P H
125. All unsafe states are ____________
M
a) deadlocks
O
b) not deadlocks
c) fatal
Ans: b
126. A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2.
Process P0 requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.
Process
P0
P1
P2
Maximum needs (process-wise: P0 through P2 top to bottom)

10
4
9
Currently allocated (process-wise)

5
2
2
Which of the following sequence is a safe sequence?
a) P0, P1, P2
b) P1, P2, P0
c) P2, P0, P1
d) P1, P0, P2
Ans: d
127. If no cycle exists in the resource allocation graph ____________

a) then the system will not be in a safe state
b) then the system will be in a safe state
Ans: b
128. The resource allocation graph is not applicable to a resource allocation system
A
____________
H
a) with multiple instances of each resource type
A
b) with a single instance of each resource type
W
c) single & multiple instances of each resource type
S
AT
Ans: a
H
129. The Banker‟s algorithm is _____________ than the resource allocation graph
P
algorithm.
M
a) less efficient
O
b) more efficient
c) equal
Ans: a
130. The data structures available in the Banker‟s algorithm are ____________
a) Available
b) Need
c) Allocation
Ans: d
131. The content of the matrix Need is ____________

a) Allocation – Available
b) Max – Available
c) Max – Allocation
d) Allocation – Max
Ans: c
132. A system with 5 processes P0 through P4 and three resource types A, B, C

have A with 10 instances, B with 5 instances, and C with 7 instances. At time t0, the
following snapshot has been taken:
Process
P0
P1
P2
P3
P4
Allocation (process-wise : P0 through P4 top TO bottom)

A B C
0 1 0
2 0 0
3 0 2
2 1 1
A
0 0 2
A H
MAX (process-wise: P0 through P4 top TO bottom)
A B C
W
7 5 3
S
3 2 2
AT
9 0 2
2 2 2
H
4 3 3
P
Available
M
A B C
O
3 3 2
The sequence <P1, P3, P4, P2, P0> leads the system to ____________
a) an unsafe state
b) a safe state
c) a protected state
d) a deadlock
Ans: b
133. The wait-for graph is a deadlock detection algorithm that is applicable when
____________
a) all resources have a single instance
b) all resources have multiple instances
c) all resources have a single 7 multiple instances
Ans: a
134. An edge from process Pi to Pj in a wait for graph indicates that ____________
a) Pi is waiting for Pj to release a resource that Pi needs
b) Pj is waiting for Pi to release a resource that Pj needs
c) Pi is waiting for Pj to leave the system
d) Pj is waiting for Pi to leave the system
Ans: a
135. If the wait for graph contains a cycle ____________

a) then a deadlock does not exist
b) then a deadlock exists
c) then the system is in a safe state
d) either deadlock exists or system is in a safe state
Ans: b
136. If deadlocks occur frequently, the detection algorithm must be invoked

________
a) rarely
A
b) frequently
H
c) rarely & frequently
A
W
Ans: b
AT S
137. What is the disadvantage of invoking the detection algorithm for every
request?
H
a) overhead of the detection algorithm due to consumption of memory
P
b) excessive time consumed in the request to be allocated memory
M
c) considerable overhead in computation time
O
Ans: c
138. A deadlock eventually cripples system throughput and will cause the CPU
utilization to ______
a) increase
b) drop
c) stay still
Ans: b
139. Every time a request for allocation cannot be granted immediately, the
detection algorithm is invoked. This will help identify ____________
a) the set of processes that have been deadlocked
b) the set of processes in the deadlock queue
c) the specific process that caused the deadlock
Ans: a
140. A computer system has 6 tape drives, with „n‟ processes competing for them.
Each process may need 3 tape drives. The maximum value of „n‟ for which the system
is guaranteed to be deadlock free is?
a) 2
b) 3
c) 4
d) 1
Ans: 2
141. A system has 3 processes sharing 4 resources. If each process needs a

maximum of 2 units then, deadlock ____________
a) can never occur
b) may occur
c) has to occur
A
Ans: a
A H
142. „m‟ processes share „n‟ resources of the same type. The maximum need of
W
each process doesn‟t exceed „n‟ and the sum of all their maximum needs is always
S
less than m+n. In this setup, deadlock ____________
AT
a) can never occur
b) may occur
H
c) has to occur
P
M
Ans: a
O
143. A deadlock can be broken by ____________
a) abort one or more processes to break the circular wait
b) abort all the process in the system
c) pre-empt all resources from all processes
Ans: a
144. The two ways of aborting processes and eliminating deadlocks are
____________
a) Abort all deadlocked processes
b) Abort all processes
c) Abort one process at a time until the deadlock cycle is eliminated
Ans: c
145. Those processes should be aborted on occurrence of a deadlock, the

termination of which?
a) is more time consuming
b) incurs minimum cost
c) safety is not hampered
Ans: b
146. The process to be aborted is chosen on the basis of the following factors?
a) priority of the process
b) process is interactive or batch
c) how long the process has computed
Ans: d
147. Cost factors for process termination include ____________

a) Number of resources the deadlock process is not holding
b) CPU utilization at the time of deadlock
A
c) Amount of time a deadlocked process has thus far consumed during its execution
H
A
Ans: c
S W
148. If we preempt a resource from a process, the process cannot continue with its
AT
normal execution and it must be ____________
a) aborted
H
b) rolled back
P
c) terminated
M
d) queued
O
Ans: b
149. To _______ to a safe state, the system needs to keep more information about
the states of processes.
a) abort the process
b) roll back the process
c) queue the process
Ans: b
150. If the resources are always preempted from the same process __________ can
occur.
a) deadlock
b) system crash
c) aging
d) starvation
Ans: d
151. Which of the following is NOT a valid deadlock prevention scheme?

(a) Release all resources before requesting a new resource
(b) Number the resources uniquely and never request a lower numbered resource than
the last one requested.
(c) Never request a resource after releasing any resource
(d) Request and all required resources be allocated before execution.
Ans: c
152. consider the 3 processes, P1, P2 and P3 shown in the table
Process Arrival time Time unit required

P1 0 5
P2 1 7
P3 3 4
The completion order of the 3 processes under the policies FCFS and RRS (round
robin scheduling with CPU quantum of 2 time units) are
A
(A) FCFS: P1, P2, P3 RR2: P1, P2, P3
H
(B) FCFS: P1, P3, P2 RR2: P1, P3, P2
A
(C) FCFS: P1, P2, P3 RR2: P1, P3, P2
W
(D) FCFS: P1, P3, P2 RR2: P1, P2, P3
S
Ans: c
AT
153. Consider a set of n tasks with known runtimes r1, r2, … rn to be run on a
H
uniprocessor machine. Which of the following processor scheduling algorithms
P
will result in the maximum throughput?
M
(a) Round-Robin
O
(b) Shortest-Job-First
(c) Highest-Response-Ratio-Next
(d) First-Come-First-Served
Ans: B
154. Consider the following table of arrival time and burst time for three
processes P0, P1 and P2.
Process Arrival time Burst Time

P0 0 ms 9 ms
P1 1 ms 4 ms
P2 2 ms 9 ms
The pre-emptive shortest job first scheduling algorithm is used. Scheduling is

carried out only at arrival or completion of processes. What is the average waiting
time for the three processes?
(A) 5.0 ms
(B) 4.33 ms
(C) 6.33 ms
(D) 7.33 ms
Ans: a
(Explanation: Process P0 is allocated processor at 0 ms as there is no other process in
ready queue. P0 is preempted after 1 ms as P1 arrives at 1 ms and burst time for P1 is
less than remaining time of P0. P1 runs for 4ms. P2 arrived at 2 ms but P1 continued
as burst time of P2 is longer than P1. After P1 completes, P0 is scheduled again as the
remaining time for P0 is less than the burst time of P2.
P0 waits for 4 ms, P1 waits for 0 ms and P2 waits for 11 ms. So average waiting time
is (0+4+11)/3 = 5.)
155. In which one of the following page replacement policies, Belady’s

anomaly may occur?
(A) FIFO
(B) Optimal
A
(C) LRU
H
(D) MRU
A
Ans: A
W
(Explanation: Belady‟s anomaly proves that it is possible to have more page faults
S
when increasing the number of page frames while using the First in First Out (FIFO)
AT
page replacement algorithm.)
H
156.
P
In the following process state transition diagram for a uniprocessor system,
M
assume that there are always some processes in the ready state: Now consider the
O
following statements:
I. If a process makes a transition D, it would result in another process making

transition A immediately.
II. A process P2 in blocked state can make transition E while another process P1
is in running state.
III. The OS uses preemptive scheduling.
IV. The OS uses non-preemptive scheduling.
Which of the above statements are TRUE?
(A) I and II
(B) I and III
(C) II and III
(D) II and IV
Ans: C
(Explanation: I is false. If a process makes a transition D, it would result in another
process making transition B, not A.
II is true. A process can move to ready state when I/O completes irrespective of other
process being in running state or not.
III is true because there is a transition from running to ready state.
IV is false as the OS uses preemptive scheduling.)
157. Which of the following is NOT true of deadlock prevention and deadlock
avoidance schemes?
(A) In deadlock prevention, the request for resources is always granted if the resulting
state is safe
(B) In deadlock avoidance, the request for resources is always granted if the result
A
state is safe
H
(C) Deadlock avoidance is less restrictive than deadlock prevention
A
(D) Deadlock avoidance requires knowledge of resource requirements a priori
W
Ans: A
S
(Explanation: Deadlock prevention scheme handles deadlock by making sure that one
AT
of the four necessary conditions don't occur. In deadlock prevention, the request for a
resource may not be granted even if the resulting state is safe.)
P H
158. Scheduling is done so as to :
M
A. increase the turnaround time
O
B. decrease the turnaround time
C. keep the turnaround time same
D. there is no relation between scheduling and turnaround time
Ans: B
159. Waiting time is :

A. the total time in the blocked and waiting queues
B. the total time spent in the ready queue
C. the total time spent in the running queue
D. the total time from the completion till the submission of a process
Ans: B
Seat No -

Time : 1hr
Max Marks : 50
N.B
A : wait queue
B : ready queue
C : cpu
A : END
B : ENDS
C : MEND
D : ENDD
A : Text editor
B : Assembler
C : Linker
D : Loader
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : System call
B : API
C : library
D : shell
Q.no 10. Output file of Lex is _____ , if the input file is Myfile.
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : Logical I/O
C : Device I/O
called
A : demand paging
B : virtual memory
A : macro prototype
D : macro call
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : PS
B : TOP
C : fork
D : kill
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : object code
D : machine code
A : Identifiers
B : Constants
C : Keywords
A : key
B : value
C : bit value
D : constant
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
C : process
A : is in the TLB
B : has data in it

D : a key & value
A : file extension
B : file identifier
C : file name
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Indexed files
B : Direct files
A : Compiler
B : Interpreter
C : Assembler
D : Loader
suspended is called
A : procedure
B : subroutine
C : macro
A : any language
C : c language
object program
D : Both 1 & 2
D : translator
D : PL domain only
B : page size
A : minimum
B : average
C : maximum
D : approximate
A : Indexed files
B : Direct files
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Identifier
B : Number
C : Keyword
D : operator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
because
D : no error occurs
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list
D : Both 1 & 3
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
A : assembler
B : compiler
C : loader
D : interpreter
A : segmentation
B : swapping

A : Identifier
C : Integer Literal
A : Polling
B : Inspection
C : Reviewing
D : Echoing
first?
D : Round Robin
B : code generation
C : syntax analysis
as
A : seek time
C : access time
D : Transfer time
A : Left to right
C : Right to left
A : FIFO
B : LRU
C : LFU
D : NRU
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
C : seek time
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
concerned with
A : Attributes
B : Protocol
C : Location
D : Ownership
_________
D : something else
C : lexical errors
B : Syntax analysis
A : Source code
C : Target code
D : tokens
A : Bit table
C : Indexing
D : Free Block List
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : both 1 & 2
D : function
B : Compaction
D : Division




program
A : Second pass
B : First pass
C : Zeroth pass
A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO
D : Both 1 & 2
D : resources
A : works well
A : START
B : END
C : ORIGIN
A : Bit tables
C : Indexing
D : Free Block List
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : Syntax analysis
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : job queue
B : ready queue
C : execution queue
D : process queue
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : entire thread
D : entire process
A : macro prototype
D : macro call
C : instruction
D : Opcodes
A : FCFS
B : SJF
C : RR
D : priority
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Stop
B : Return
C : OP
D : End
B : page-fault rate
C : hit ratio
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : is in the TLB
B : has data in it
D : critical ratio
A : magnetic disks
C : assemblies
D : cylinders
C : SCAN
D : Circular SCAN
C : process
A : error
B : protection
D : access
D : priority
A : USING
B : BALR
C : DROP
D : ORG
D : expanding macro

A : any language
C : c language

A : procedure
B : subroutine
C : macro
D : PL domain only
A : Stack
B : Queue
C : Linked list
D : no error occurs
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size
D : data dependant
because
A : minimum
B : average
C : maximum
D : approximate




program
A : compilation
B : execution
C : loading
D : linking
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : compiler
B : assembler
C : loader
D : interpreter
D : translator
A : all process
C : parent process
D : init process
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Parser
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
Q.no 8. SJF can be
A : preemptive only
D : sequential
Q.no 9. A macro is
B : blocking I/O
D : synchronous I/O
B : Syntax trees
D : Prefix notation
as
A : seek time
C : access time
D : Transfer time
called
A : demand paging
B : virtual memory
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : code generation
C : syntax analysis
A : Left to right
C : Right to left
A : PS
B : TOP
C : fork
D : kill
A : Machine code
D : A parse tree
D : Both 1 & 2
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : cpu
B : primary memory
B : Syntax analysis
A : file extension
B : file identifier
C : file name
D : code generation
operating system
A : START
B : BEGIN
C : MACRO
A : Dos
B : Unix
C : System software
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : START
B : END
C : ORIGIN
B : Syntax analysis
D : resources
A : Second pass
B : First pass
C : Zeroth pass
D : Both 1 & 2
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list
D : data dependant

A : END
B : ENDS
C : MEND
D : ENDD
B : File system
A : segmentation
B : swapping
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Stop
B : Return
C : OP
D : End
A : Text editor
B : Assembler
C : Linker
D : Loader
B : control program
D : All

A : FIFO
B : LRU
C : LFU
D : NRU
B : page-fault rate
C : hit ratio

A : Identifier
C : Integer Literal
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code
A : Attributes
B : Protocol
C : Location
D : Ownership
C : SCAN
D : Circular SCAN
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
Q.no 26. __________ a part of a compiler that takes as input a stream of characters and produces
A : Parser
B : Optimizer
C : Scanner
D : Loader
B : statement
C : Numeric data
D : ASCII data
A : YACC
B : BISON
C : FLEX
D : Iburg
A : key
B : value
C : bit value
D : constant
A : Bit table
C : Indexing
D : Free Block List
object program
D : Both 1 & 2
A : Identifiers
B : Constants
C : Keywords
C : both 1 & 2
D : function
C : seek time
D : priority
A : Source code
C : Target code
D : tokens
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
because
A : Identifier
B : Number
C : Keyword
D : operator
B : Syntax analysis
A : Indexed files
B : Direct files
A : works well
A : minimum
B : average
C : maximum
D : approximate




program
A : START
B : END
C : ORIGIN
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
D : translator
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Syntax trees
D : Prefix notation
A : Machine code
D : A parse tree
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : assembler
B : compiler
C : loader
D : interpreter
first?
D : Round Robin
A : wait queue
B : ready queue
C : cpu
A : macro prototype
D : macro call
A : job queue
B : ready queue
C : execution queue
D : process queue
D : Both 1 & 3
Q.no 14. A macro is
A : System call
B : API
C : library
D : shell
Q.no 16. SJF can be
A : preemptive only
D : sequential

C : instruction
D : Opcodes
called
A : demand paging
B : virtual memory
B : Logical I/O
C : Device I/O
B : blocking I/O
D : synchronous I/O
D : critical ratio
B : Syntax analysis
A : cpu
B : primary memory
A : procedure
B : subroutine
C : macro
A : system software
C : both 1 & 2
D : not a software
C : <macro name>
D : <call macro>
A : file extension
B : file identifier
C : file name
B : Compaction
D : Division
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
suspended is called
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : START
B : BEGIN
C : MACRO
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
D : data dependant
D : resources
D : PL domain only
A : compiler
B : assembler
C : loader
D : interpreter
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Second pass
B : First pass
C : Zeroth pass
A : works well




program
A : seek time
C : access time
D : Transfer time
A : Polling
B : Inspection
C : Reviewing
D : Echoing
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : PS
B : TOP
C : fork
D : kill
B : control program
D : All
A : Interrupts
B : Memory mapping
D : DMA
A : Stop
B : Return
C : OP
D : End
A : END
B : ENDS
C : MEND
D : ENDD
A : SJF-P
B : FCFS
C : RR
D : Priority
A : all process
C : parent process
D : init process
B : File system
A : frame bit
B : page number
C : page offset
D : frame offset
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : process
A : magnetic disks
C : assemblies
D : cylinders
A : key
B : value
C : bit value
D : constant
C : seek time
A : any language
C : c language

D : expanding macro
C : lexical errors
A : Indexed files
B : Direct files
A : USING
B : BALR
C : DROP
D : ORG
operating system
A : Source code
C : Target code
D : tokens
A : is in the TLB
B : has data in it
object program
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
D : translator
B : LRU
C : FIFO
A : Identifier
B : Number
C : Keyword
D : operator
A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
A : Indexed files
B : Direct files
B : Syntax analysis
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : START
B : END
C : ORIGIN
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : object code
D : machine code
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : page-fault rate
C : hit ratio
A : macro prototype
D : macro call
B : Syntax trees
D : Prefix notation
A : System call
B : API
C : library
D : shell
A : FCFS
B : SJF
C : RR
D : priority
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
Q.no 12. A macro is
C : instruction
D : Opcodes
B : blocking I/O
D : synchronous I/O
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
Q.no 19. SJF can be
A : preemptive only
D : sequential
A : Identifier
C : Integer Literal
A : Bit table
C : Indexing
D : Free Block List
A : Attributes
B : Protocol
C : Location
D : Ownership
concerned with
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : Both 1 & 2
B : Syntax analysis
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
_________
D : something else
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : file extension
B : file identifier
C : file name
D : code generation
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these

A : Bit tables
C : Indexing
D : Free Block List
A : works well
A : minimum
B : average
C : maximum
D : approximate
D : resources
A : Second pass
B : First pass
C : Zeroth pass
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2
B : page size




program
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
B : Syntax analysis
A : Left to right
C : Right to left
A : entire thread
D : entire process
A : wait queue
B : ready queue
C : cpu
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
print document ?
A : word proccessor
B : spreadsheet
D : Unix
first?
D : Round Robin
A : assembler
B : compiler
C : loader
D : interpreter
B : code generation
C : syntax analysis
A : SJF-P
B : FCFS
C : RR
D : Priority

A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Machine code
D : A parse tree
A : Source code
C : Target code
D : tokens
D : priority
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
suspended is called
C : process
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
operating system
A : system software
C : both 1 & 2
D : not a software
A : USING
B : BALR
C : DROP
D : ORG
D : critical ratio
C : seek time
B : Compaction
D : Division
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : translator
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : no error occurs
B : LRU
C : FIFO
A : START
B : END
C : ORIGIN
because
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
C : instruction
D : Opcodes
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Identifier
C : Integer Literal
A : FIFO
B : LRU
C : LFU
D : NRU
A : object code
D : machine code
A : END
B : ENDS
C : MEND
D : ENDD
B : control program

D : All
B : blocking I/O
D : synchronous I/O
B : File system
A : System call
B : API
C : library
D : shell
A : PS
B : TOP
C : fork
D : kill
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Stop
B : Return
C : OP
D : End
_________
D : something else
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : file extension
B : file identifier
C : file name
A : is in the TLB
B : has data in it
C : lexical errors

D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
C : System software
A : key
B : value
C : bit value
D : constant
A : START
B : BEGIN
C : MACRO
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Bit tables
C : Indexing
D : Free Block List
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
A : Identifier
B : Number
C : Keyword
D : operator
A : compiler
B : assembler
C : loader
D : interpreter

A : Second pass
B : First pass
C : Zeroth pass
A : works well
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size




program
D : PL domain only
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Parser
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
Q.no 7. SJF can be
A : preemptive only
D : sequential
A : Machine code
D : A parse tree
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : all process
C : parent process
D : init process
B : code generation
C : syntax analysis
A : entire thread
D : entire process
as
A : seek time
C : access time
D : Transfer time
A : wait queue
B : ready queue
C : cpu
A : Text editor
B : Assembler
C : Linker
D : Loader
B : Compaction
D : Division
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
A : Identifiers
B : Constants
C : Keywords
C : SCAN
D : Circular SCAN
B : Syntax analysis
A : system software
C : both 1 & 2
D : not a software
A : Source code
C : Target code
D : tokens
suspended is called
C : seek time
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : code generation
A : Indexed files
B : Direct files
A : procedure
B : subroutine
C : macro
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
D : resources
because
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
B : Syntax analysis
D : translator
A : write ahead
B : read ahead
C : free-behind
D : add-front
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Indexed files
B : Direct files
A : compilation
B : execution
C : loading
D : linking
D : PL domain only
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter
D : data dependant
B : Syntax trees
D : Prefix notation
A : PS
B : TOP
C : fork
D : kill
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
called
A : demand paging
B : virtual memory
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : Left to right
C : Right to left
A : segmentation
B : swapping
D : Both 1 & 3
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : blocking I/O
D : synchronous I/O
A : frame bit
B : page number
C : page offset
D : frame offset
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : is in the TLB
B : has data in it
D : Both 1 & 2
object program
D : Both 1 & 2
A : USING
B : BALR
C : DROP
D : ORG
A : cpu
B : primary memory
A : file extension
B : file identifier
C : file name
D : a key & value

A : Dos
B : Unix
C : System software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : any language
C : c language
operating system
A : minimum
B : average
C : maximum
D : approximate




program
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Stack
B : Queue
C : Linked list
D : no error occurs
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : works well
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
C : Zeroth pass

D : translator
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : entire thread
D : entire process
A : Text editor
B : Assembler
C : Linker
D : Loader
A : assembler
B : compiler
C : loader
D : interpreter
A : object code
D : machine code

B : page-fault rate
C : hit ratio
B : control program
D : All
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : File system
Q.no 17. SJF can be
A : preemptive only
D : sequential
A : job queue
B : ready queue
C : execution queue
D : process queue
A : END
B : ENDS
C : MEND
D : ENDD
A : magnetic disks
C : assemblies
D : cylinders
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : seek time
D : code generation
A : Attributes
B : Protocol
C : Location
D : Ownership
D : critical ratio
A : procedure
B : subroutine
C : macro
A : error
B : protection
D : access
D : priority
A : START
B : BEGIN
C : MACRO
A : Parser
B : Optimizer
C : Scanner
D : Loader
D : resources
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : minimum
B : average
C : maximum
D : approximate
D : PL domain only
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : compiler
B : assembler
C : loader
D : interpreter
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Indexed files
B : Direct files
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
D : data dependant
because
A : segmentation
B : swapping
B : blocking I/O
D : synchronous I/O
B : Logical I/O
C : Device I/O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
C : RR
D : priority
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Left to right
C : Right to left
A : FIFO
B : LRU
C : LFU
D : NRU
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Identifier
C : Integer Literal
B : code generation
C : syntax analysis
A : frame bit
B : page number
C : page offset
D : frame offset
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Stop
B : Return
C : OP
D : End
A : Source code
C : Target code
D : tokens
D : Both 1 & 2
D : expanding macro
B : Syntax analysis
A : USING
B : BALR
C : DROP
D : ORG
C : seek time
_________
D : something else
suspended is called
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Bit table
C : Indexing
D : Free Block List
A : any language
C : c language
C : SCAN
D : Circular SCAN
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : START
B : END
C : ORIGIN
A : Stack
B : Queue
C : Linked list
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Identifier
B : Number
C : Keyword
D : operator





program
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : works well
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : object code
D : machine code
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
Q.no 6. A macro is
A : entire thread
D : entire process
B : page-fault rate
C : hit ratio
A : Machine code
D : A parse tree
D : Both 1 & 3
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin
Q.no 18. SJF can be
A : preemptive only
D : sequential
called
A : demand paging
B : virtual memory
A : END
B : ENDS
C : MEND
D : ENDD
A : is in the TLB
B : has data in it

operating system
D : a key & value
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : YACC
B : BISON
C : FLEX
D : Iburg
C : process
concerned with
A : cpu
B : primary memory
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Attributes
B : Protocol
C : Location
D : Ownership
object program
D : Both 1 & 2
A : Indexed files
B : Direct files
A : system software
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
D : Both 1 & 2
because
B : Syntax analysis
A : compiler
B : assembler
C : loader
D : interpreter
A : compilation
B : execution
C : loading
D : linking
A : minimum
B : average
C : maximum
D : approximate
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
D : translator
D : PL domain only
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : resources
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO
A : PS
B : TOP
C : fork
D : kill
B : Syntax trees
D : Prefix notation
B : Logical I/O
C : Device I/O
A : Identifier
C : Integer Literal
B : File system
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Stop
B : Return
C : OP
D : End
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
as
A : seek time
C : access time
D : Transfer time
B : control program
D : All
A : segmentation
B : swapping
A : FCFS
B : SJF
C : RR
D : priority
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Left to right
C : Right to left
A : wait queue
B : ready queue
C : cpu
B : Syntax analysis
_________
D : something else
C : seek time
A : Source code
C : Target code
D : tokens
C : <macro name>
D : <call macro>
A : file extension
B : file identifier
C : file name
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Bit table
C : Indexing
D : Free Block List
D : expanding macro
suspended is called
C : lexical errors
A : error
B : protection
D : access
B : Compaction
D : Division
D : code generation
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : no error occurs
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Stack
B : Queue
C : Linked list
B : page size
A : Indexed files
B : Direct files




program
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO
A : Second pass
B : First pass
C : Zeroth pass
first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue
Q.no 5. SJF can be
A : preemptive only
D : sequential
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
A : entire thread
D : entire process
called
A : demand paging
B : virtual memory
B : code generation
C : syntax analysis
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
A : object code
D : machine code
D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
C : System software
A : key
B : value
C : bit value
D : constant
A : system software
C : both 1 & 2
D : not a software
A : cpu
B : primary memory
A : START
B : BEGIN
C : MACRO

A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
D : critical ratio
A : any language
C : c language

A : is in the TLB
B : has data in it
A : Identifiers
B : Constants
C : Keywords

B : statement
C : Numeric data
D : ASCII data
A : works well
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
A : START
B : END
C : ORIGIN
D : translator
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : PL domain only
D : resources
A : compiler
B : assembler
C : loader
D : interpreter
C : instruction
D : Opcodes
A : segmentation
B : swapping

A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Parser
C : Code generator
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : blocking I/O
D : synchronous I/O
A : FIFO
B : LRU
C : LFU
D : NRU
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : assembler
B : compiler
C : loader
D : interpreter
A : SJF-P
B : FCFS
C : RR
D : Priority

A : FCFS
B : SJF
C : RR
D : priority
D : code generation
C : SCAN
D : Circular SCAN
concerned with
A : file extension
B : file identifier
C : file name
D : priority
C : seek time
D : Both 1 & 2
A : Source code
C : Target code
D : tokens
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
operating system
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : procedure
B : subroutine
C : macro




program
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
C : Zeroth pass
B : page size
B : Syntax analysis
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : translator
because
A : wait queue
B : ready queue
C : cpu
called
A : demand paging
B : virtual memory
B : page-fault rate
C : hit ratio
B : File system
A : seek time
C : access time
D : Transfer time
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
A : Text editor
B : Assembler
C : Linker
D : Loader
Q.no 14. A macro is
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing

scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Interrupts
B : Memory mapping
D : DMA
A : is in the TLB
B : has data in it
A : Indexed files
B : Direct files
A : magnetic disks
C : assemblies
D : cylinders
object program
D : Both 1 & 2
A : system software
C : both 1 & 2
D : not a software
C : lexical errors
B : Syntax analysis
A : YACC
B : BISON
C : FLEX
D : Iburg

C : process
_________
D : something else
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : minimum
B : average
C : maximum
D : approximate
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list
D : resources
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Indexed files
B : Direct files
D : Both 1 & 2
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : START
B : END
C : ORIGIN
B : LRU
C : FIFO




program
D : no error occurs
B : Syntax trees
D : Prefix notation
first?
D : Round Robin
A : macro prototype
D : macro call
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : segmentation
B : swapping
A : job queue
B : ready queue
C : execution queue
D : process queue
A : Machine code
D : A parse tree
A : SJF-P
B : FCFS
C : RR
D : Priority
A : entire thread
D : entire process
D : Both 1 & 3
B : code generation
C : syntax analysis
A : FCFS
B : SJF
C : RR
D : priority
A : Left to right
C : Right to left
C : SCAN
D : Circular SCAN
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
D : critical ratio
B : Compaction
D : Division
suspended is called
A : Source code
C : Target code
D : tokens
A : file extension
B : file identifier
C : file name
A : Dos
B : Unix
C : System software
A : Attributes
B : Protocol
C : Location
D : Ownership
operating system
C : seek time
A : USING
B : BALR
C : DROP
D : ORG
concerned with
because
A : Second pass
B : First pass
C : Zeroth pass
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : Syntax analysis
A : Identifier
B : Number
C : Keyword
D : operator
B : page size
D : translator
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
Q.no 7. SJF can be
A : preemptive only
D : sequential
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : Stop
B : Return
C : OP
D : End
A : System call
B : API
C : library
D : shell
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : blocking I/O
D : synchronous I/O
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Bit table
C : Indexing
D : Free Block List
C : seek time
C : both 1 & 2
D : function
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : cpu
B : primary memory
D : a key & value
D : code generation
B : statement
C : Numeric data
D : ASCII data

A : system software
C : both 1 & 2
D : not a software
B : LRU
C : FIFO
A : Indexed files
B : Direct files
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : works well
A : Second pass
B : First pass
C : Zeroth pass
A : START
B : END
C : ORIGIN

A : Stack
B : Queue
C : Linked list
D : no error occurs
D : resources
because




program
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A : minimum
B : average
C : maximum
D : approximate
D : PL domain only
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
B : File system
C : instruction
D : Opcodes
A : FCFS
B : SJF
C : RR
D : priority
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : page-fault rate
C : hit ratio
Q.no 11. A macro is
A : job queue
B : ready queue
C : execution queue
D : process queue
A : PS
B : TOP
C : fork
D : kill
A : all process
C : parent process
D : init process
called
A : demand paging
B : virtual memory
A : Left to right
C : Right to left
A : Identifier
C : Integer Literal
operating system
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
B : Syntax analysis
_________
D : something else
suspended is called
A : USING
B : BALR
C : DROP
D : ORG
A : Dos
B : Unix
C : System software
A : is in the TLB
B : has data in it
C : process
C : seek time
D : critical ratio

A : error
B : protection
D : access
D : priority
A : Bit tables
C : Indexing
D : Free Block List
B : page size
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
D : translator
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Bit tables
C : Indexing
D : Free Block List
B : Syntax analysis
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : no error occurs
A : START
B : END
C : ORIGIN
A : FIFO
B : LRU
C : LFU
D : NRU
A : segmentation
B : swapping
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : object code
D : machine code
as
A : seek time
C : access time
D : Transfer time
B : blocking I/O
D : synchronous I/O
A : END
B : ENDS
C : MEND
D : ENDD
B : Syntax trees
D : Prefix notation
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : YACC
B : BISON
C : FLEX
D : Iburg
A : any language
C : c language
object program
D : Both 1 & 2
A : START
B : BEGIN
C : MACRO
B : Compaction
D : Division
A : system software
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Indexed files
B : Direct files
C : seek time
A : key
B : value
C : bit value
D : constant
A : file extension
B : file identifier
C : file name
D : Both 1 & 2
A : Identifiers
B : Constants
C : Keywords
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list
D : resources
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : works well
A : Second pass
B : First pass
C : Zeroth pass

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
A : Indexed files
B : Direct files
A : minimum
B : average
C : maximum
D : approximate




program
B : LRU
C : FIFO
D : translator
A : all process
C : parent process
D : init process
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : System call
B : API
C : library
D : shell
A : frame bit
B : page number
C : page offset
D : frame offset
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Logical I/O
C : Device I/O
A : Stop
B : Return
C : OP
D : End
A : Parser
C : Code generator
A : macro prototype
D : macro call
B : code generation
C : syntax analysis
A : wait queue
B : ready queue
C : cpu
A : Polling
B : Inspection
C : Reviewing
D : Echoing
D : Both 1 & 3
A : entire thread
D : entire process
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
C : lexical errors
B : statement
C : Numeric data
D : ASCII data
A : is in the TLB
B : has data in it
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B

D : priority
B : Syntax analysis
C : <macro name>
D : <call macro>
A : Attributes
B : Protocol
C : Location
D : Ownership
D : expanding macro
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : START
B : END
C : ORIGIN

A : Identifier
B : Number
C : Keyword
D : operator
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
D : no error occurs
D : data dependant
B : Syntax analysis
A : compiler
B : assembler
C : loader
D : interpreter
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : Bit tables
C : Indexing
D : Free Block List
A : assembler
B : compiler
C : loader
D : interpreter
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Interrupts
B : Memory mapping
D : DMA
Q.no 7. A macro is
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
B : Syntax trees
D : Prefix notation
A : FCFS
B : SJF
C : RR
D : priority
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
Q.no 17. SJF can be
A : preemptive only
D : sequential

print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Indexed files
B : Direct files
A : key
B : value
C : bit value
D : constant
A : Dos
B : Unix
C : System software
A : USING
B : BALR
C : DROP
D : ORG
operating system
A : Identifiers
B : Constants
C : Keywords
C : seek time
B : Compaction
D : Division
C : process
A : Parser
B : Optimizer
C : Scanner
D : Loader
D : critical ratio
A : cpu
B : primary memory
A : any language
C : c language
_________
D : something else




program
in hardware?
A : Counters
B : RAM & Registers

D : Registers
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Indexed files
B : Direct files
A : works well
D : resources
A : minimum
B : average
C : maximum
D : approximate
A : compilation
B : execution
C : loading
D : linking
B : LRU
C : FIFO
A : Second pass
B : First pass
C : Zeroth pass
because
D : translator
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List
A : seek time
C : access time
D : Transfer time
A : Left to right
C : Right to left
B : File system
B : page-fault rate
C : hit ratio
A : Machine code
D : A parse tree
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Parser
C : Code generator
B : blocking I/O
D : synchronous I/O
called
A : demand paging
B : virtual memory
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
B : control program
D : All
C : instruction
D : Opcodes
D : code generation
C : SCAN
D : Circular SCAN
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : a key & value
D : Both 1 & 2
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : Attributes
B : Protocol
C : Location
D : Ownership
A : Source code
C : Target code
D : tokens
D : priority
A : system software
C : both 1 & 2
D : not a software
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : procedure
B : subroutine
C : macro
A : YACC
B : BISON
C : FLEX
D : Iburg
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Stack
B : Queue
C : Linked list
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3




program
A : compiler
B : assembler
C : loader
D : interpreter
B : page size
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs
B : Syntax analysis
D : Both 1 & 2
A : works well
D : Both 1 & 3

A : System call
B : API
C : library
D : shell
A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : END
B : ENDS
C : MEND
D : ENDD
A : macro prototype
D : macro call
Q.no 9. SJF can be
A : preemptive only
D : sequential
A : Stop
B : Return
C : OP
D : End
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue
Q.no 18. A macro is
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : Syntax trees
D : Prefix notation
B : Syntax analysis
C : seek time
A : is in the TLB
B : has data in it
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : key
B : value
C : bit value
D : constant
A : Compiler
B : Interpreter
C : Assembler
D : Loader
D : expanding macro
A : file extension
B : file identifier
C : file name
A : error
B : protection
D : access

A : START
B : BEGIN
C : MACRO
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : PL domain only
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : translator
A : Bit tables
C : Indexing
D : Free Block List
A : Second pass
B : First pass
C : Zeroth pass
A : compilation
B : execution
C : loading
D : linking
D : resources
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : minimum
B : average
C : maximum
D : approximate
because
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : wait queue
B : ready queue
C : cpu
B : page-fault rate
C : hit ratio
as
A : waiting time
B : turnaround time
C : response time
D : throughput
called
A : demand paging
B : virtual memory
A : all process
C : parent process
D : init process
A : segmentation
B : swapping
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : SJF-P
B : FCFS
C : RR
D : Priority
A : FCFS
B : SJF
C : RR
D : priority
A : Dos
B : Unix
C : System software
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : both 1 & 2
D : function
A : magnetic disks
C : assemblies
D : cylinders
A : any language
C : c language
C : lexical errors
concerned with
B : Compaction
D : Division
C : <macro name>
D : <call macro>
object program
D : Both 1 & 2
D : Both 1 & 2
_________
D : something else
C : process
suspended is called
B : Syntax analysis
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : works well

A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs




program
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
A : Bit tables
C : Indexing
D : Free Block List
D : translator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : assembler
B : compiler
C : loader
D : interpreter
A : frame bit
B : page number
C : page offset
D : frame offset
A : object code
D : machine code
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : job queue
B : ready queue
C : execution queue
D : process queue
first?
D : Round Robin
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
as
A : seek time
C : access time
D : Transfer time
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
D : Both 1 & 3
A : Machine code
D : A parse tree
A : Parser
C : Code generator

D : critical ratio
A : file extension
B : file identifier
C : file name
A : START
B : BEGIN
C : MACRO
A : procedure
B : subroutine
C : macro
C : seek time
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : error
B : protection
D : access
C : seek time
A : Bit tables
C : Indexing
D : Free Block List
because
A : Indexed files
B : Direct files
B : Syntax analysis
A : Second pass
B : First pass
C : Zeroth pass
A : minimum
B : average
C : maximum
D : approximate
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : resources
A : START
B : END
C : ORIGIN
D : PL domain only
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : LRU
C : FIFO
D : translator
A : END
B : ENDS
C : MEND
D : ENDD
A : entire thread
D : entire process
A : segmentation
B : swapping

A : SJF-P
B : FCFS
C : RR
D : Priority
B : Syntax trees
D : Prefix notation
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : code generation
C : syntax analysis
A : Interrupts
B : Memory mapping
D : DMA
B : control program
D : All
B : Logical I/O
C : Device I/O
C : instruction
D : Opcodes
A : Identifiers
B : Constants
C : Keywords
concerned with
B : statement
C : Numeric data
D : ASCII data
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : YACC
B : BISON
C : FLEX
D : Iburg
B : Syntax analysis
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Indexed files
B : Direct files
A : is in the TLB
B : has data in it
A : key
B : value
C : bit value
D : constant
D : priority
A : system software
C : both 1 & 2
D : not a software
A : Bit table
C : Indexing
D : Free Block List
A : Dos
B : Unix
C : System software
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Identifier
B : Number
C : Keyword
D : operator
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list

of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size




program
D : no error occurs
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN
Seat No -

Time : 1hr
Max Marks : 50
N.B
A : wait queue
B : ready queue
C : cpu
A : END
B : ENDS
C : MEND
D : ENDD
A : Text editor
B : Assembler
C : Linker
D : Loader
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : System call
B : API
C : library
D : shell
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : Logical I/O
C : Device I/O
called
A : demand paging
B : virtual memory
A : macro prototype
D : macro call
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : PS
B : TOP
C : fork
D : kill
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : object code
D : machine code
A : Identifiers
B : Constants
C : Keywords
A : key
B : value
C : bit value
D : constant
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
C : process
A : is in the TLB
B : has data in it

D : a key & value
A : file extension
B : file identifier
C : file name
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Indexed files
B : Direct files
A : Compiler
B : Interpreter
C : Assembler
D : Loader
suspended is called
A : procedure
B : subroutine
C : macro
A : any language
C : c language
object program
D : Both 1 & 2
D : translator
D : PL domain only
B : page size
A : minimum
B : average
C : maximum
D : approximate
A : Indexed files
B : Direct files
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Identifier
B : Number
C : Keyword
D : operator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
because
D : no error occurs
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list
D : Both 1 & 3
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
A : assembler
B : compiler
C : loader
D : interpreter
A : segmentation
B : swapping

A : Identifier
C : Integer Literal
A : Polling
B : Inspection
C : Reviewing
D : Echoing
first?
D : Round Robin
B : code generation
C : syntax analysis
as
A : seek time
C : access time
D : Transfer time
A : Left to right
C : Right to left
A : FIFO
B : LRU
C : LFU
D : NRU
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
C : seek time
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
concerned with
A : Attributes
B : Protocol
C : Location
D : Ownership
_________
D : something else
C : lexical errors
B : Syntax analysis
A : Source code
C : Target code
D : tokens
A : Bit table
C : Indexing
D : Free Block List
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : both 1 & 2
D : function
B : Compaction
D : Division




program
A : Second pass
B : First pass
C : Zeroth pass
A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO
D : Both 1 & 2
D : resources
A : works well
A : START
B : END
C : ORIGIN
A : Bit tables
C : Indexing
D : Free Block List
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : Syntax analysis
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : job queue
B : ready queue
C : execution queue
D : process queue
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : entire thread
D : entire process
A : macro prototype
D : macro call
C : instruction
D : Opcodes
A : FCFS
B : SJF
C : RR
D : priority
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Stop
B : Return
C : OP
D : End
B : page-fault rate
C : hit ratio
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : is in the TLB
B : has data in it
D : critical ratio
A : magnetic disks
C : assemblies
D : cylinders
C : SCAN
D : Circular SCAN
C : process
A : error
B : protection
D : access
D : priority
A : USING
B : BALR
C : DROP
D : ORG
D : expanding macro

A : any language
C : c language

A : procedure
B : subroutine
C : macro
D : PL domain only
A : Stack
B : Queue
C : Linked list
D : no error occurs
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size
D : data dependant
because
A : minimum
B : average
C : maximum
D : approximate




program
A : compilation
B : execution
C : loading
D : linking
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : compiler
B : assembler
C : loader
D : interpreter
D : translator
A : all process
C : parent process
D : init process
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Parser
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
Q.no 8. SJF can be
A : preemptive only
D : sequential
Q.no 9. A macro is
B : blocking I/O
D : synchronous I/O
B : Syntax trees
D : Prefix notation
as
A : seek time
C : access time
D : Transfer time
called
A : demand paging
B : virtual memory
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : code generation
C : syntax analysis
A : Left to right
C : Right to left
A : PS
B : TOP
C : fork
D : kill
A : Machine code
D : A parse tree
D : Both 1 & 2
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : cpu
B : primary memory
B : Syntax analysis
A : file extension
B : file identifier
C : file name
D : code generation
operating system
A : START
B : BEGIN
C : MACRO
A : Dos
B : Unix
C : System software
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : START
B : END
C : ORIGIN
B : Syntax analysis
D : resources
A : Second pass
B : First pass
C : Zeroth pass
D : Both 1 & 2
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list
D : data dependant

A : END
B : ENDS
C : MEND
D : ENDD
B : File system
A : segmentation
B : swapping
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Stop
B : Return
C : OP
D : End
A : Text editor
B : Assembler
C : Linker
D : Loader
B : control program
D : All

A : FIFO
B : LRU
C : LFU
D : NRU
B : page-fault rate
C : hit ratio

A : Identifier
C : Integer Literal
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code
A : Attributes
B : Protocol
C : Location
D : Ownership
C : SCAN
D : Circular SCAN
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Parser
B : Optimizer
C : Scanner
D : Loader
B : statement
C : Numeric data
D : ASCII data
A : YACC
B : BISON
C : FLEX
D : Iburg
A : key
B : value
C : bit value
D : constant
A : Bit table
C : Indexing
D : Free Block List
object program
D : Both 1 & 2
A : Identifiers
B : Constants
C : Keywords
C : both 1 & 2
D : function
C : seek time
D : priority
A : Source code
C : Target code
D : tokens
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
because
A : Identifier
B : Number
C : Keyword
D : operator
B : Syntax analysis
A : Indexed files
B : Direct files
A : works well
A : minimum
B : average
C : maximum
D : approximate




program
A : START
B : END
C : ORIGIN
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
D : translator
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Syntax trees
D : Prefix notation
A : Machine code
D : A parse tree
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : assembler
B : compiler
C : loader
D : interpreter
first?
D : Round Robin
A : wait queue
B : ready queue
C : cpu
A : macro prototype
D : macro call
A : job queue
B : ready queue
C : execution queue
D : process queue
D : Both 1 & 3
Q.no 14. A macro is
A : System call
B : API
C : library
D : shell
Q.no 16. SJF can be
A : preemptive only
D : sequential

C : instruction
D : Opcodes
called
A : demand paging
B : virtual memory
B : Logical I/O
C : Device I/O
B : blocking I/O
D : synchronous I/O
D : critical ratio
B : Syntax analysis
A : cpu
B : primary memory
A : procedure
B : subroutine
C : macro
A : system software
C : both 1 & 2
D : not a software
C : <macro name>
D : <call macro>
A : file extension
B : file identifier
C : file name
B : Compaction
D : Division
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
suspended is called
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : START
B : BEGIN
C : MACRO
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
D : data dependant
D : resources
D : PL domain only
A : compiler
B : assembler
C : loader
D : interpreter
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Second pass
B : First pass
C : Zeroth pass
A : works well




program
A : seek time
C : access time
D : Transfer time
A : Polling
B : Inspection
C : Reviewing
D : Echoing
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : PS
B : TOP
C : fork
D : kill
B : control program
D : All
A : Interrupts
B : Memory mapping
D : DMA
A : Stop
B : Return
C : OP
D : End
A : END
B : ENDS
C : MEND
D : ENDD
A : SJF-P
B : FCFS
C : RR
D : Priority
A : all process
C : parent process
D : init process
B : File system
A : frame bit
B : page number
C : page offset
D : frame offset
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : process
A : magnetic disks
C : assemblies
D : cylinders
A : key
B : value
C : bit value
D : constant
C : seek time
A : any language
C : c language

D : expanding macro
C : lexical errors
A : Indexed files
B : Direct files
A : USING
B : BALR
C : DROP
D : ORG
operating system
A : Source code
C : Target code
D : tokens
A : is in the TLB
B : has data in it
object program
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
D : translator
B : LRU
C : FIFO
A : Identifier
B : Number
C : Keyword
D : operator
A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
A : Indexed files
B : Direct files
B : Syntax analysis
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : START
B : END
C : ORIGIN
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : object code
D : machine code
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : page-fault rate
C : hit ratio
A : macro prototype
D : macro call
B : Syntax trees
D : Prefix notation
A : System call
B : API
C : library
D : shell
A : FCFS
B : SJF
C : RR
D : priority
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
Q.no 12. A macro is
C : instruction
D : Opcodes
B : blocking I/O
D : synchronous I/O
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
Q.no 19. SJF can be
A : preemptive only
D : sequential
A : Identifier
C : Integer Literal
A : Bit table
C : Indexing
D : Free Block List
A : Attributes
B : Protocol
C : Location
D : Ownership
concerned with
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : Both 1 & 2
B : Syntax analysis
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
_________
D : something else
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : file extension
B : file identifier
C : file name
D : code generation
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these

A : Bit tables
C : Indexing
D : Free Block List
A : works well
A : minimum
B : average
C : maximum
D : approximate
D : resources
A : Second pass
B : First pass
C : Zeroth pass
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2
B : page size




program
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
B : Syntax analysis
A : Left to right
C : Right to left
A : entire thread
D : entire process
A : wait queue
B : ready queue
C : cpu
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
print document ?
A : word proccessor
B : spreadsheet
D : Unix
first?
D : Round Robin
A : assembler
B : compiler
C : loader
D : interpreter
B : code generation
C : syntax analysis
A : SJF-P
B : FCFS
C : RR
D : Priority

A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Machine code
D : A parse tree
A : Source code
C : Target code
D : tokens
D : priority
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
suspended is called
C : process
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
operating system
A : system software
C : both 1 & 2
D : not a software
A : USING
B : BALR
C : DROP
D : ORG
D : critical ratio
C : seek time
B : Compaction
D : Division
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : translator
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : no error occurs
B : LRU
C : FIFO
A : START
B : END
C : ORIGIN
because
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
C : instruction
D : Opcodes
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Identifier
C : Integer Literal
A : FIFO
B : LRU
C : LFU
D : NRU
A : object code
D : machine code
A : END
B : ENDS
C : MEND
D : ENDD
B : control program

D : All
B : blocking I/O
D : synchronous I/O
B : File system
A : System call
B : API
C : library
D : shell
A : PS
B : TOP
C : fork
D : kill
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Stop
B : Return
C : OP
D : End
_________
D : something else
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : file extension
B : file identifier
C : file name
A : is in the TLB
B : has data in it
C : lexical errors

D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
C : System software
A : key
B : value
C : bit value
D : constant
A : START
B : BEGIN
C : MACRO
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Bit tables
C : Indexing
D : Free Block List
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
A : Identifier
B : Number
C : Keyword
D : operator
A : compiler
B : assembler
C : loader
D : interpreter

A : Second pass
B : First pass
C : Zeroth pass
A : works well
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size




program
D : PL domain only
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Parser
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
Q.no 7. SJF can be
A : preemptive only
D : sequential
A : Machine code
D : A parse tree
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : all process
C : parent process
D : init process
B : code generation
C : syntax analysis
A : entire thread
D : entire process
as
A : seek time
C : access time
D : Transfer time
A : wait queue
B : ready queue
C : cpu
A : Text editor
B : Assembler
C : Linker
D : Loader
B : Compaction
D : Division
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
A : Identifiers
B : Constants
C : Keywords
C : SCAN
D : Circular SCAN
B : Syntax analysis
A : system software
C : both 1 & 2
D : not a software
A : Source code
C : Target code
D : tokens
suspended is called
C : seek time
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : code generation
A : Indexed files
B : Direct files
A : procedure
B : subroutine
C : macro
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
D : resources
because
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
B : Syntax analysis
D : translator
A : write ahead
B : read ahead
C : free-behind
D : add-front
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Indexed files
B : Direct files
A : compilation
B : execution
C : loading
D : linking
D : PL domain only
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter
D : data dependant
B : Syntax trees
D : Prefix notation
A : PS
B : TOP
C : fork
D : kill
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
called
A : demand paging
B : virtual memory
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : Left to right
C : Right to left
A : segmentation
B : swapping
D : Both 1 & 3
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : blocking I/O
D : synchronous I/O
A : frame bit
B : page number
C : page offset
D : frame offset
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : is in the TLB
B : has data in it
D : Both 1 & 2
object program
D : Both 1 & 2
A : USING
B : BALR
C : DROP
D : ORG
A : cpu
B : primary memory
A : file extension
B : file identifier
C : file name
D : a key & value

A : Dos
B : Unix
C : System software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : any language
C : c language
operating system
A : minimum
B : average
C : maximum
D : approximate




program
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Stack
B : Queue
C : Linked list
D : no error occurs
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : works well
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
C : Zeroth pass

D : translator
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : entire thread
D : entire process
A : Text editor
B : Assembler
C : Linker
D : Loader
A : assembler
B : compiler
C : loader
D : interpreter
A : object code
D : machine code

B : page-fault rate
C : hit ratio
B : control program
D : All
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : File system
Q.no 17. SJF can be
A : preemptive only
D : sequential
A : job queue
B : ready queue
C : execution queue
D : process queue
A : END
B : ENDS
C : MEND
D : ENDD
A : magnetic disks
C : assemblies
D : cylinders
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : seek time
D : code generation
A : Attributes
B : Protocol
C : Location
D : Ownership
D : critical ratio
A : procedure
B : subroutine
C : macro
A : error
B : protection
D : access
D : priority
A : START
B : BEGIN
C : MACRO
A : Parser
B : Optimizer
C : Scanner
D : Loader
D : resources
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : minimum
B : average
C : maximum
D : approximate
D : PL domain only
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : compiler
B : assembler
C : loader
D : interpreter
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Indexed files
B : Direct files
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
D : data dependant
because
A : segmentation
B : swapping
B : blocking I/O
D : synchronous I/O
B : Logical I/O
C : Device I/O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
C : RR
D : priority
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Left to right
C : Right to left
A : FIFO
B : LRU
C : LFU
D : NRU
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Identifier
C : Integer Literal
B : code generation
C : syntax analysis
A : frame bit
B : page number
C : page offset
D : frame offset
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Stop
B : Return
C : OP
D : End
A : Source code
C : Target code
D : tokens
D : Both 1 & 2
D : expanding macro
B : Syntax analysis
A : USING
B : BALR
C : DROP
D : ORG
C : seek time
_________
D : something else
suspended is called
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Bit table
C : Indexing
D : Free Block List
A : any language
C : c language
C : SCAN
D : Circular SCAN
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : START
B : END
C : ORIGIN
A : Stack
B : Queue
C : Linked list
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Identifier
B : Number
C : Keyword
D : operator





program
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : works well
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : object code
D : machine code
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
Q.no 6. A macro is
A : entire thread
D : entire process
B : page-fault rate
C : hit ratio
A : Machine code
D : A parse tree
D : Both 1 & 3
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin
Q.no 18. SJF can be
A : preemptive only
D : sequential
called
A : demand paging
B : virtual memory
A : END
B : ENDS
C : MEND
D : ENDD
A : is in the TLB
B : has data in it

operating system
D : a key & value
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : YACC
B : BISON
C : FLEX
D : Iburg
C : process
concerned with
A : cpu
B : primary memory
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Attributes
B : Protocol
C : Location
D : Ownership
object program
D : Both 1 & 2
A : Indexed files
B : Direct files
A : system software
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
D : Both 1 & 2
because
B : Syntax analysis
A : compiler
B : assembler
C : loader
D : interpreter
A : compilation
B : execution
C : loading
D : linking
A : minimum
B : average
C : maximum
D : approximate
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
D : translator
D : PL domain only
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : resources
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO
A : PS
B : TOP
C : fork
D : kill
B : Syntax trees
D : Prefix notation
B : Logical I/O
C : Device I/O
A : Identifier
C : Integer Literal
B : File system
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Stop
B : Return
C : OP
D : End
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
as
A : seek time
C : access time
D : Transfer time
B : control program
D : All
A : segmentation
B : swapping
A : FCFS
B : SJF
C : RR
D : priority
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Left to right
C : Right to left
A : wait queue
B : ready queue
C : cpu
B : Syntax analysis
_________
D : something else
C : seek time
A : Source code
C : Target code
D : tokens
C : <macro name>
D : <call macro>
A : file extension
B : file identifier
C : file name
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Bit table
C : Indexing
D : Free Block List
D : expanding macro
suspended is called
C : lexical errors
A : error
B : protection
D : access
B : Compaction
D : Division
D : code generation
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : no error occurs
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Stack
B : Queue
C : Linked list
B : page size
A : Indexed files
B : Direct files




program
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO
A : Second pass
B : First pass
C : Zeroth pass
first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue
Q.no 5. SJF can be
A : preemptive only
D : sequential
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
A : entire thread
D : entire process
called
A : demand paging
B : virtual memory
B : code generation
C : syntax analysis
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
A : object code
D : machine code
D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
C : System software
A : key
B : value
C : bit value
D : constant
A : system software
C : both 1 & 2
D : not a software
A : cpu
B : primary memory
A : START
B : BEGIN
C : MACRO

A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
D : critical ratio
A : any language
C : c language

A : is in the TLB
B : has data in it
A : Identifiers
B : Constants
C : Keywords

B : statement
C : Numeric data
D : ASCII data
A : works well
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
A : START
B : END
C : ORIGIN
D : translator
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : PL domain only
D : resources
A : compiler
B : assembler
C : loader
D : interpreter
C : instruction
D : Opcodes
A : segmentation
B : swapping

A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Parser
C : Code generator
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : blocking I/O
D : synchronous I/O
A : FIFO
B : LRU
C : LFU
D : NRU
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : assembler
B : compiler
C : loader
D : interpreter
A : SJF-P
B : FCFS
C : RR
D : Priority

A : FCFS
B : SJF
C : RR
D : priority
D : code generation
C : SCAN
D : Circular SCAN
concerned with
A : file extension
B : file identifier
C : file name
D : priority
C : seek time
D : Both 1 & 2
A : Source code
C : Target code
D : tokens
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
operating system
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : procedure
B : subroutine
C : macro




program
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
C : Zeroth pass
B : page size
B : Syntax analysis
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : translator
because
A : wait queue
B : ready queue
C : cpu
called
A : demand paging
B : virtual memory
B : page-fault rate
C : hit ratio
B : File system
A : seek time
C : access time
D : Transfer time
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
A : Text editor
B : Assembler
C : Linker
D : Loader
Q.no 14. A macro is
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing

scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Interrupts
B : Memory mapping
D : DMA
A : is in the TLB
B : has data in it
A : Indexed files
B : Direct files
A : magnetic disks
C : assemblies
D : cylinders
object program
D : Both 1 & 2
A : system software
C : both 1 & 2
D : not a software
C : lexical errors
B : Syntax analysis
A : YACC
B : BISON
C : FLEX
D : Iburg

C : process
_________
D : something else
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : minimum
B : average
C : maximum
D : approximate
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list
D : resources
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Indexed files
B : Direct files
D : Both 1 & 2
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : START
B : END
C : ORIGIN
B : LRU
C : FIFO




program
D : no error occurs
B : Syntax trees
D : Prefix notation
first?
D : Round Robin
A : macro prototype
D : macro call
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : segmentation
B : swapping
A : job queue
B : ready queue
C : execution queue
D : process queue
A : Machine code
D : A parse tree
A : SJF-P
B : FCFS
C : RR
D : Priority
A : entire thread
D : entire process
D : Both 1 & 3
B : code generation
C : syntax analysis
A : FCFS
B : SJF
C : RR
D : priority
A : Left to right
C : Right to left
C : SCAN
D : Circular SCAN
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
D : critical ratio
B : Compaction
D : Division
suspended is called
A : Source code
C : Target code
D : tokens
A : file extension
B : file identifier
C : file name
A : Dos
B : Unix
C : System software
A : Attributes
B : Protocol
C : Location
D : Ownership
operating system
C : seek time
A : USING
B : BALR
C : DROP
D : ORG
concerned with
because
A : Second pass
B : First pass
C : Zeroth pass
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : Syntax analysis
A : Identifier
B : Number
C : Keyword
D : operator
B : page size
D : translator
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
Q.no 7. SJF can be
A : preemptive only
D : sequential
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : Stop
B : Return
C : OP
D : End
A : System call
B : API
C : library
D : shell
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : blocking I/O
D : synchronous I/O
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Bit table
C : Indexing
D : Free Block List
C : seek time
C : both 1 & 2
D : function
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : cpu
B : primary memory
D : a key & value
D : code generation
B : statement
C : Numeric data
D : ASCII data

A : system software
C : both 1 & 2
D : not a software
B : LRU
C : FIFO
A : Indexed files
B : Direct files
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : works well
A : Second pass
B : First pass
C : Zeroth pass
A : START
B : END
C : ORIGIN

A : Stack
B : Queue
C : Linked list
D : no error occurs
D : resources
because




program
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A : minimum
B : average
C : maximum
D : approximate
D : PL domain only
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
B : File system
C : instruction
D : Opcodes
A : FCFS
B : SJF
C : RR
D : priority
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : page-fault rate
C : hit ratio
Q.no 11. A macro is
A : job queue
B : ready queue
C : execution queue
D : process queue
A : PS
B : TOP
C : fork
D : kill
A : all process
C : parent process
D : init process
called
A : demand paging
B : virtual memory
A : Left to right
C : Right to left
A : Identifier
C : Integer Literal
operating system
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
B : Syntax analysis
_________
D : something else
suspended is called
A : USING
B : BALR
C : DROP
D : ORG
A : Dos
B : Unix
C : System software
A : is in the TLB
B : has data in it
C : process
C : seek time
D : critical ratio

A : error
B : protection
D : access
D : priority
A : Bit tables
C : Indexing
D : Free Block List
B : page size
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
D : translator
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Bit tables
C : Indexing
D : Free Block List
B : Syntax analysis
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : no error occurs
A : START
B : END
C : ORIGIN
A : FIFO
B : LRU
C : LFU
D : NRU
A : segmentation
B : swapping
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : object code
D : machine code
as
A : seek time
C : access time
D : Transfer time
B : blocking I/O
D : synchronous I/O
A : END
B : ENDS
C : MEND
D : ENDD
B : Syntax trees
D : Prefix notation
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : YACC
B : BISON
C : FLEX
D : Iburg
A : any language
C : c language
object program
D : Both 1 & 2
A : START
B : BEGIN
C : MACRO
B : Compaction
D : Division
A : system software
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Indexed files
B : Direct files
C : seek time
A : key
B : value
C : bit value
D : constant
A : file extension
B : file identifier
C : file name
D : Both 1 & 2
A : Identifiers
B : Constants
C : Keywords
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list
D : resources
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : works well
A : Second pass
B : First pass
C : Zeroth pass

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
A : Indexed files
B : Direct files
A : minimum
B : average
C : maximum
D : approximate




program
B : LRU
C : FIFO
D : translator
A : all process
C : parent process
D : init process
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : System call
B : API
C : library
D : shell
A : frame bit
B : page number
C : page offset
D : frame offset
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Logical I/O
C : Device I/O
A : Stop
B : Return
C : OP
D : End
A : Parser
C : Code generator
A : macro prototype
D : macro call
B : code generation
C : syntax analysis
A : wait queue
B : ready queue
C : cpu
A : Polling
B : Inspection
C : Reviewing
D : Echoing
D : Both 1 & 3
A : entire thread
D : entire process
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
C : lexical errors
B : statement
C : Numeric data
D : ASCII data
A : is in the TLB
B : has data in it
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B

D : priority
B : Syntax analysis
C : <macro name>
D : <call macro>
A : Attributes
B : Protocol
C : Location
D : Ownership
D : expanding macro
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : START
B : END
C : ORIGIN

A : Identifier
B : Number
C : Keyword
D : operator
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
D : no error occurs
D : data dependant
B : Syntax analysis
A : compiler
B : assembler
C : loader
D : interpreter
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : Bit tables
C : Indexing
D : Free Block List
A : assembler
B : compiler
C : loader
D : interpreter
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Interrupts
B : Memory mapping
D : DMA
Q.no 7. A macro is
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
B : Syntax trees
D : Prefix notation
A : FCFS
B : SJF
C : RR
D : priority
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
Q.no 17. SJF can be
A : preemptive only
D : sequential

print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Indexed files
B : Direct files
A : key
B : value
C : bit value
D : constant
A : Dos
B : Unix
C : System software
A : USING
B : BALR
C : DROP
D : ORG
operating system
A : Identifiers
B : Constants
C : Keywords
C : seek time
B : Compaction
D : Division
C : process
A : Parser
B : Optimizer
C : Scanner
D : Loader
D : critical ratio
A : cpu
B : primary memory
A : any language
C : c language
_________
D : something else




program
in hardware?
A : Counters
B : RAM & Registers

D : Registers
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Indexed files
B : Direct files
A : works well
D : resources
A : minimum
B : average
C : maximum
D : approximate
A : compilation
B : execution
C : loading
D : linking
B : LRU
C : FIFO
A : Second pass
B : First pass
C : Zeroth pass
because
D : translator
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List
A : seek time
C : access time
D : Transfer time
A : Left to right
C : Right to left
B : File system
B : page-fault rate
C : hit ratio
A : Machine code
D : A parse tree
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Parser
C : Code generator
B : blocking I/O
D : synchronous I/O
called
A : demand paging
B : virtual memory
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
B : control program
D : All
C : instruction
D : Opcodes
D : code generation
C : SCAN
D : Circular SCAN
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : a key & value
D : Both 1 & 2
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : Attributes
B : Protocol
C : Location
D : Ownership
A : Source code
C : Target code
D : tokens
D : priority
A : system software
C : both 1 & 2
D : not a software
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : procedure
B : subroutine
C : macro
A : YACC
B : BISON
C : FLEX
D : Iburg
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Stack
B : Queue
C : Linked list
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3




program
A : compiler
B : assembler
C : loader
D : interpreter
B : page size
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs
B : Syntax analysis
D : Both 1 & 2
A : works well
D : Both 1 & 3

A : System call
B : API
C : library
D : shell
A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : END
B : ENDS
C : MEND
D : ENDD
A : macro prototype
D : macro call
Q.no 9. SJF can be
A : preemptive only
D : sequential
A : Stop
B : Return
C : OP
D : End
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue
Q.no 18. A macro is
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : Syntax trees
D : Prefix notation
B : Syntax analysis
C : seek time
A : is in the TLB
B : has data in it
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : key
B : value
C : bit value
D : constant
A : Compiler
B : Interpreter
C : Assembler
D : Loader
D : expanding macro
A : file extension
B : file identifier
C : file name
A : error
B : protection
D : access

A : START
B : BEGIN
C : MACRO
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : PL domain only
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : translator
A : Bit tables
C : Indexing
D : Free Block List
A : Second pass
B : First pass
C : Zeroth pass
A : compilation
B : execution
C : loading
D : linking
D : resources
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : minimum
B : average
C : maximum
D : approximate
because
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : wait queue
B : ready queue
C : cpu
B : page-fault rate
C : hit ratio
as
A : waiting time
B : turnaround time
C : response time
D : throughput
called
A : demand paging
B : virtual memory
A : all process
C : parent process
D : init process
A : segmentation
B : swapping
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : SJF-P
B : FCFS
C : RR
D : Priority
A : FCFS
B : SJF
C : RR
D : priority
A : Dos
B : Unix
C : System software
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : both 1 & 2
D : function
A : magnetic disks
C : assemblies
D : cylinders
A : any language
C : c language
C : lexical errors
concerned with
B : Compaction
D : Division
C : <macro name>
D : <call macro>
object program
D : Both 1 & 2
D : Both 1 & 2
_________
D : something else
C : process
suspended is called
B : Syntax analysis
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : works well

A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs




program
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
A : Bit tables
C : Indexing
D : Free Block List
D : translator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : assembler
B : compiler
C : loader
D : interpreter
A : frame bit
B : page number
C : page offset
D : frame offset
A : object code
D : machine code
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : job queue
B : ready queue
C : execution queue
D : process queue
first?
D : Round Robin
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
as
A : seek time
C : access time
D : Transfer time
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
D : Both 1 & 3
A : Machine code
D : A parse tree
A : Parser
C : Code generator

D : critical ratio
A : file extension
B : file identifier
C : file name
A : START
B : BEGIN
C : MACRO
A : procedure
B : subroutine
C : macro
C : seek time
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : error
B : protection
D : access
C : seek time
A : Bit tables
C : Indexing
D : Free Block List
because
A : Indexed files
B : Direct files
B : Syntax analysis
A : Second pass
B : First pass
C : Zeroth pass
A : minimum
B : average
C : maximum
D : approximate
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : resources
A : START
B : END
C : ORIGIN
D : PL domain only
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : LRU
C : FIFO
D : translator
A : END
B : ENDS
C : MEND
D : ENDD
A : entire thread
D : entire process
A : segmentation
B : swapping

A : SJF-P
B : FCFS
C : RR
D : Priority
B : Syntax trees
D : Prefix notation
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : code generation
C : syntax analysis
A : Interrupts
B : Memory mapping
D : DMA
B : control program
D : All
B : Logical I/O
C : Device I/O
C : instruction
D : Opcodes
A : Identifiers
B : Constants
C : Keywords
concerned with
B : statement
C : Numeric data
D : ASCII data
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : YACC
B : BISON
C : FLEX
D : Iburg
B : Syntax analysis
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Indexed files
B : Direct files
A : is in the TLB
B : has data in it
A : key
B : value
C : bit value
D : constant
D : priority
A : system software
C : both 1 & 2
D : not a software
A : Bit table
C : Indexing
D : Free Block List
A : Dos
B : Unix
C : System software
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Identifier
B : Number
C : Keyword
D : operator
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list

of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size




program
D : no error occurs
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN






















































Seat No -

Time : 1hr
Max Marks : 50
N.B
A : wait queue
B : ready queue
C : cpu
A : END
B : ENDS
C : MEND
D : ENDD
A : Text editor
B : Assembler
C : Linker
D : Loader
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : System call
B : API
C : library
D : shell
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : Logical I/O
C : Device I/O
called
A : demand paging
B : virtual memory
A : macro prototype
D : macro call
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : PS
B : TOP
C : fork
D : kill
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : object code
D : machine code
A : Identifiers
B : Constants
C : Keywords
A : key
B : value
C : bit value
D : constant
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
C : process
A : is in the TLB
B : has data in it
D : a key & value
A : file extension
B : file identifier
C : file name
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Indexed files
B : Direct files
A : Compiler
B : Interpreter
C : Assembler
D : Loader
suspended is called
A : procedure
B : subroutine
C : macro
A : any language
C : c language
object program
D : Both 1 & 2
D : translator
D : PL domain only
B : page size
A : minimum
B : average
C : maximum
D : approximate
A : Indexed files
B : Direct files
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Identifier
B : Number
C : Keyword
D : operator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
because
D : no error occurs
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list

D : Both 1 & 3
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
A : assembler
B : compiler
C : loader
D : interpreter
A : segmentation
B : swapping
A : Identifier
C : Integer Literal
A : Polling
B : Inspection
C : Reviewing
D : Echoing
first?
D : Round Robin
B : code generation
C : syntax analysis
as
A : seek time
C : access time
D : Transfer time

A : Left to right
C : Right to left
A : FIFO
B : LRU
C : LFU
D : NRU
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B

C : seek time
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
concerned with
A : Attributes
B : Protocol
C : Location
D : Ownership
D : something else
C : lexical errors
B : Syntax analysis
A : Source code
C : Target code
D : tokens
A : Bit table

C : Indexing
D : Free Block List
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : both 1 & 2
D : function
B : Compaction
D : Division




program
A : Second pass
B : First pass
C : Zeroth pass

A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO

D : Both 1 & 2
D : resources
A : works well


A : START
B : END
C : ORIGIN
A : Bit tables
C : Indexing
D : Free Block List
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : Syntax analysis
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these




A : job queue
B : ready queue
C : execution queue
D : process queue
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : entire thread
D : entire process
A : macro prototype
D : macro call
C : instruction
D : Opcodes

A : FCFS
B : SJF
C : RR
D : priority
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Stop
B : Return
C : OP
D : End
B : page-fault rate
C : hit ratio
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : is in the TLB
B : has data in it
D : critical ratio
A : magnetic disks
C : assemblies
D : cylinders
C : SCAN
D : Circular SCAN
C : process

A : error
B : protection
D : access
D : priority
A : USING
B : BALR
C : DROP
D : ORG
D : expanding macro

A : any language
C : c language


A : procedure
B : subroutine
C : macro

D : PL domain only
A : Stack
B : Queue
C : Linked list
D : no error occurs
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size
D : data dependant
because
A : minimum
B : average
C : maximum
D : approximate




program
A : compilation
B : execution
C : loading
D : linking
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : compiler
B : assembler
C : loader
D : interpreter
D : translator



A : all process
C : parent process
D : init process
A : Double buffer
B : Single buffer
: Linear buffer D
: Circular buffer
A : Parser
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
Q.no 8. SJF can be
A : preemptive only
D : sequential
Q.no 9. A macro is
B : blocking I/O
D : synchronous I/O
B : Syntax trees
D : Prefix notation
as
A : seek time
C : access time
D : Transfer time
called
A : demand paging
B : virtual memory
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : code generation
C : syntax analysis
A : Left to right

C : Right to left
A : PS
B : TOP
C : fork
D : kill
A : Machine code
D : A parse tree
D : Both 1 & 2
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : cpu
B : primary memory
B : Syntax analysis
A : file extension
B : file identifier
C : file name
D : code generation
operating system
A : START
B : BEGIN
C : MACRO
A : Dos
B : Unix
C : System software
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : START
B : END
C : ORIGIN
B : Syntax analysis
D : resources
A : Second pass
B : First pass
C : Zeroth pass

D : Both 1 & 2
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter

A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list
D : data dependant


A : END
B : ENDS
C : MEND
D : ENDD
B : File system
A : segmentation
B : swapping
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Stop
B : Return
C : OP
D : End
A : Text editor
B : Assembler
C : Linker
D : Loader
B : control program
D : All
A : FIFO
B : LRU
C : LFU
D : NRU
B : page-fault rate
C : hit ratio

A : Identifier
C : Integer Literal
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code

A : Attributes
B : Protocol
C : Location
D : Ownership
C : SCAN
D : Circular SCAN
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Parser
B : Optimizer
C : Scanner
D : Loader
B : statement
C : Numeric data
D : ASCII data
A : YACC
B : BISON
C : FLEX
D : Iburg
A : key
B : value
C : bit value
D : constant
A : Bit table
C : Indexing
D : Free Block List

object program
D : Both 1 & 2
A : Identifiers
B : Constants
C : Keywords
C : both 1 & 2
D : function
C : seek time
D : priority
A : Source code
C : Target code
D : tokens
A : write ahead
B : read ahead
C : free-behind
D : add-front


A : compilation
B : execution
C : loading
D : linking
because
A : Identifier
B : Number
C : Keyword
D : operator
B : Syntax analysis
A : Indexed files
B : Direct files
A : works well
A : minimum
B : average
C : maximum
D : approximate



program
A : START
B : END
C : ORIGIN

D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
D : translator


A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Syntax trees
D : Prefix notation
A : Machine code
D : A parse tree
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : assembler
B : compiler
C : loader
D : interpreter
first?
D : Round Robin
A : wait queue
B : ready queue
C : cpu
A : macro prototype
D : macro call
A : job queue
B : ready queue
C : execution queue
D : process queue
D : Both 1 & 3
Q.no 14. A macro is
A : System call
B : API
C : library
D : shell
Q.no 16. SJF can be
A : preemptive only
D : sequential

C : instruction
D : Opcodes
called
A : demand paging
B : virtual memory
B : Logical I/O
C : Device I/O
B : blocking I/O
D : synchronous I/O
D : critical ratio
B : Syntax analysis
A : cpu
B : primary memory
A : procedure
B : subroutine
C : macro
A : system software
C : both 1 & 2
D : not a software

C : <macro name>
D : <call macro>
A : file extension
B : file identifier
C : file name
B : Compaction
D : Division
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
suspended is called
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : START
B : BEGIN
C : MACRO

of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
D : data dependant
D : resources
D : PL domain only
A : compiler
B : assembler
C : loader
D : interpreter
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Second pass
B : First pass
C : Zeroth pass
A : works well




program




A : seek time
C : access time
D : Transfer time
A : Polling
B : Inspection
C : Reviewing
D : Echoing
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : PS
B : TOP
C : fork
D : kill
B : control program
D : All
A : Interrupts
B : Memory mapping
D : DMA
A : Stop
B : Return
C : OP
D : End
A : END
B : ENDS
C : MEND
D : ENDD
A : SJF-P
B : FCFS
C : RR
D : Priority
A : all process
C : parent process
D : init process
B : File system
A : frame bit
B : page number
C : page offset
D : frame offset
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : process
A : magnetic disks
C : assemblies
D : cylinders
A : key
B : value
C : bit value
D : constant
C : seek time
A : any language
C : c language
D : expanding macro
C : lexical errors
A : Indexed files
B : Direct files
A : USING
B : BALR
C : DROP
D : ORG
operating system
A : Source code
C : Target code
D : tokens
A : is in the TLB
B : has data in it
object program
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
D : translator
B : LRU
C : FIFO
A : Identifier
B : Number
C : Keyword
D : operator
A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
A : Indexed files
B : Direct files
B : Syntax analysis
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : START
B : END
C : ORIGIN
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers




A : object code
D : machine code
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : page-fault rate
C : hit ratio
A : macro prototype
D : macro call
B : Syntax trees
D : Prefix notation
A : System call
B : API
C : library
D : shell
A : FCFS
B : SJF
C : RR
D : priority
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
Q.no 12. A macro is
C : instruction
D : Opcodes
B : blocking I/O
D : synchronous I/O
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
Q.no 19. SJF can be
A : preemptive only
D : sequential
A : Identifier
C : Integer Literal
A : Bit table
C : Indexing
D : Free Block List
A : Attributes
B : Protocol
C : Location
D : Ownership
concerned with
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : Both 1 & 2
B : Syntax analysis
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
D : something else
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : file extension
B : file identifier
C : file name
D : code generation
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Bit tables
C : Indexing
D : Free Block List
A : works well
A : minimum
B : average
C : maximum
D : approximate
D : resources
A : Second pass
B : First pass
C : Zeroth pass
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2
B : page size




program
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
B : Syntax analysis


A : Left to right
C : Right to left
A : entire thread
D : entire process
A : wait queue
B : ready queue
C : cpu
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
print document ?
A : word proccessor
B : spreadsheet
D : Unix
first?
D : Round Robin
A : assembler
B : compiler
C : loader
D : interpreter
B : code generation
C : syntax analysis
A : SJF-P
B : FCFS
C : RR
D : Priority
A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Machine code
D : A parse tree
A : Source code
C : Target code
D : tokens
D : priority
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
suspended is called
C : process
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
operating system
A : system software
C : both 1 & 2
D : not a software
A : USING
B : BALR
C : DROP
D : ORG
D : critical ratio
C : seek time
B : Compaction
D : Division
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : translator
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : no error occurs
B : LRU
C : FIFO
A : START
B : END
C : ORIGIN
because
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis

C : instruction
D : Opcodes
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Identifier
C : Integer Literal
A : FIFO
B : LRU
C : LFU
D : NRU
A : object code
D : machine code
A : END
B : ENDS
C : MEND
D : ENDD
B : control program

D : All
B : blocking I/O
D : synchronous I/O
B : File system
A : System call
B : API
C : library
D : shell
A : PS
B : TOP
C : fork
D : kill
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Stop
B : Return
C : OP
D : End
D : something else
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : file extension
B : file identifier
C : file name
A : is in the TLB
B : has data in it
C : lexical errors

D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
C : System software
A : key
B : value
C : bit value
D : constant
A : START
B : BEGIN
C : MACRO

A : Bit tables
C : Indexing
D : Free Block List

A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Bit tables
C : Indexing
D : Free Block List
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
A : Identifier
B : Number
C : Keyword
D : operator
A : compiler
B : assembler
C : loader
D : interpreter
A : Second pass
B : First pass
C : Zeroth pass
A : works well
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size





program
D : PL domain only





A : SJF-P
B : FCFS
C : RR
D : Priority
A : Parser
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
Q.no 7. SJF can be
A : preemptive only
D : sequential
A : Machine code
D : A parse tree
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : all process
C : parent process
D : init process
B : code generation
C : syntax analysis
A : entire thread
D : entire process
as
A : seek time
C : access time
D : Transfer time
A : wait queue
B : ready queue
C : cpu
A : Text editor
B : Assembler
C : Linker
D : Loader


B : Compaction
D : Division
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
A : Identifiers
B : Constants
C : Keywords
C : SCAN
D : Circular SCAN
B : Syntax analysis
A : system software
C : both 1 & 2
D : not a software
A : Source code
C : Target code
D : tokens
suspended is called
C : seek time

A : Swapping
B : Paging
C : Segmentation
D : Demand paging

D : code generation
A : Indexed files
B : Direct files
A : procedure
B : subroutine
C : macro
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
D : resources
because

A : Absolute Loader
B : Loader
C : Linker
D : Assembler

B : Syntax analysis
D : translator
A : write ahead
B : read ahead
C : free-behind
D : add-front
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A : Indexed files
B : Direct files
A : compilation
B : execution
C : loading
D : linking

D : PL domain only
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter

D : data dependant




B : Syntax trees
D : Prefix notation
A : PS
B : TOP
C : fork
D : kill
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
called
A : demand paging
B : virtual memory
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : Left to right
C : Right to left
A : segmentation
B : swapping
D : Both 1 & 3
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : blocking I/O
D : synchronous I/O

A : frame bit
B : page number
C : page offset
D : frame offset
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : is in the TLB
B : has data in it
D : Both 1 & 2

object program
D : Both 1 & 2
A : USING
B : BALR
C : DROP
D : ORG
A : cpu
B : primary memory
A : file extension
B : file identifier
C : file name


D : a key & value

A : Dos
B : Unix
C : System software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : any language
C : c language
operating system
A : minimum
B : average
C : maximum
D : approximate




program
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Stack
B : Queue
C : Linked list
D : no error occurs

D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : works well

A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
C : Zeroth pass

D : translator

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : entire thread
D : entire process
A : Text editor
B : Assembler
C : Linker
D : Loader
A : assembler
B : compiler
C : loader
D : interpreter
A : object code
D : machine code


B : page-fault rate
C : hit ratio
B : control program
D : All
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : File system
Q.no 17. SJF can be
A : preemptive only
D : sequential
A : job queue
B : ready queue
C : execution queue
D : process queue
A : END
B : ENDS
C : MEND
D : ENDD
A : magnetic disks
C : assemblies
D : cylinders
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : seek time
D : code generation
A : Attributes
B : Protocol
C : Location
D : Ownership
D : critical ratio
A : procedure
B : subroutine
C : macro
A : error
B : protection
D : access
D : priority
A : START
B : BEGIN
C : MACRO

A : Parser
B : Optimizer
C : Scanner
D : Loader
D : resources
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : minimum
B : average
C : maximum
D : approximate
D : PL domain only

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : compiler
B : assembler
C : loader
D : interpreter
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Indexed files
B : Direct files
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
D : data dependant
because



A : segmentation
B : swapping
B : blocking I/O
D : synchronous I/O
B : Logical I/O
C : Device I/O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
C : RR
D : priority
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Left to right
C : Right to left
A : FIFO
B : LRU
C : LFU
D : NRU
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Identifier
C : Integer Literal
B : code generation
C : syntax analysis
A : frame bit
B : page number
C : page offset
D : frame offset
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Stop
B : Return
C : OP
D : End
A : Source code
C : Target code
D : tokens
D : Both 1 & 2
D : expanding macro
B : Syntax analysis
A : USING
B : BALR
C : DROP
D : ORG
C : seek time
D : something else
suspended is called

A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Bit table
C : Indexing
D : Free Block List
A : any language
C : c language
C : SCAN
D : Circular SCAN
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : START
B : END
C : ORIGIN
A : Stack
B : Queue
C : Linked list
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Identifier
B : Number
C : Keyword
D : operator




program
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : works well
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front



A : object code
D : machine code
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
Q.no 6. A macro is

A : entire thread
D : entire process
B : page-fault rate
C : hit ratio
A : Machine code
D : A parse tree
D : Both 1 & 3
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin
Q.no 18. SJF can be
A : preemptive only
D : sequential
called
A : demand paging
B : virtual memory
A : END
B : ENDS
C : MEND
D : ENDD
A : is in the TLB
B : has data in it

operating system
D : a key & value

A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : YACC
B : BISON
C : FLEX
D : Iburg
C : process
concerned with
A : cpu
B : primary memory
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Attributes
B : Protocol
C : Location
D : Ownership
object program
D : Both 1 & 2
A : Indexed files
B : Direct files
A : system software
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
D : Both 1 & 2
because
B : Syntax analysis
A : compiler
B : assembler
C : loader
D : interpreter
A : compilation
B : execution
C : loading
D : linking
A : minimum
B : average
C : maximum
D : approximate
of the disk.
A : Bit tables
C : Indexing
D : Free Block List

D : data dependant
D : translator

D : PL domain only
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : resources
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO


A : PS
B : TOP
C : fork
D : kill
B : Syntax trees
D : Prefix notation
B : Logical I/O
C : Device I/O
A : Identifier
C : Integer Literal
B : File system

A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Stop
B : Return
C : OP
D : End

of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
as
A : seek time
C : access time
D : Transfer time
B : control program
D : All

A : segmentation
B : swapping
A : FCFS
B : SJF
C : RR
D : priority
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Left to right
C : Right to left
A : wait queue
B : ready queue
C : cpu
B : Syntax analysis
D : something else
C : seek time
A : Source code
C : Target code
D : tokens
C : <macro name>
D : <call macro>

A : file extension
B : file identifier
C : file name

A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Bit table
C : Indexing
D : Free Block List
D : expanding macro
suspended is called
C : lexical errors
A : error
B : protection
D : access
B : Compaction
D : Division
D : code generation
A : write ahead
B : read ahead
C : free-behind
D : add-front

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : no error occurs
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Stack
B : Queue
C : Linked list
B : page size
A : Indexed files
B : Direct files




program
A : Bit tables
C : Indexing
D : Free Block List

B : LRU
C : FIFO

A : Second pass
B : First pass
C : Zeroth pass




first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue
Q.no 5. SJF can be
A : preemptive only
D : sequential
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
A : entire thread
D : entire process
called
A : demand paging
B : virtual memory
B : code generation
C : syntax analysis
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
A : object code
D : machine code


D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
C : System software

A : key
B : value
C : bit value
D : constant
A : system software
C : both 1 & 2
D : not a software
A : cpu
B : primary memory
A : START
B : BEGIN
C : MACRO

A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
D : critical ratio
A : any language
C : c language
A : is in the TLB
B : has data in it
A : Identifiers
B : Constants
C : Keywords

B : statement
C : Numeric data
D : ASCII data
A : works well
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
A : START
B : END
C : ORIGIN
D : translator
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : PL domain only
D : resources
A : compiler
B : assembler
C : loader
D : interpreter




C : instruction
D : Opcodes
A : segmentation
B : swapping
A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Parser
C : Code generator
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : blocking I/O
D : synchronous I/O
A : FIFO
B : LRU
C : LFU
D : NRU
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : assembler
B : compiler
C : loader
D : interpreter
A : SJF-P
B : FCFS
C : RR
D : Priority

A : FCFS
B : SJF
C : RR
D : priority

D : code generation
C : SCAN
D : Circular SCAN
concerned with
A : file extension
B : file identifier
C : file name

D : priority
C : seek time
D : Both 1 & 2
A : Source code
C : Target code
D : tokens
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK

operating system
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : procedure
B : subroutine
C : macro




program
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List

A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
C : Zeroth pass

B : page size
B : Syntax analysis

D : data dependant

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : translator
because



A : wait queue
B : ready queue
C : cpu
called
A : demand paging
B : virtual memory
B : page-fault rate
C : hit ratio
B : File system
A : seek time
C : access time
D : Transfer time

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
A : Text editor
B : Assembler
C : Linker
D : Loader
Q.no 14. A macro is
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Interrupts
B : Memory mapping
D : DMA

A : is in the TLB
B : has data in it

A : Indexed files
B : Direct files
A : magnetic disks
C : assemblies
D : cylinders
object program
D : Both 1 & 2
A : system software
C : both 1 & 2
D : not a software
C : lexical errors
B : Syntax analysis
A : YACC
B : BISON
C : FLEX
D : Iburg

C : process
D : something else
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : minimum
B : average
C : maximum
D : approximate
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List

D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list

D : resources
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Indexed files
B : Direct files
D : Both 1 & 2
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : START
B : END
C : ORIGIN
B : LRU
C : FIFO



program
D : no error occurs




B : Syntax trees
D : Prefix notation
first?
D : Round Robin
A : macro prototype
D : macro call
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language

A : segmentation
B : swapping
A : job queue
B : ready queue
C : execution queue
D : process queue

A : Machine code
D : A parse tree
A : SJF-P
B : FCFS
C : RR
D : Priority
A : entire thread
D : entire process
D : Both 1 & 3
B : code generation
C : syntax analysis
A : FCFS
B : SJF
C : RR
D : priority
A : Left to right
C : Right to left
C : SCAN
D : Circular SCAN
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
D : critical ratio
B : Compaction
D : Division
suspended is called
A : Source code
C : Target code
D : tokens
A : file extension
B : file identifier
C : file name
A : Dos
B : Unix
C : System software
A : Attributes
B : Protocol
C : Location
D : Ownership

operating system
C : seek time
A : USING
B : BALR
C : DROP
D : ORG
concerned with

because
A : Second pass
B : First pass
C : Zeroth pass
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : Syntax analysis
A : Identifier
B : Number
C : Keyword
D : operator
B : page size
D : translator
A : Bit tables
C : Indexing
D : Free Block List

A : compiler
B : assembler
C : loader
D : interpreter
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2

A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler

Q.no 7. SJF can be
A : preemptive only
D : sequential
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Stop
B : Return
C : OP
D : End
A : System call
B : API
C : library
D : shell
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA

B : blocking I/O
D : synchronous I/O
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Bit table
C : Indexing
D : Free Block List

C : seek time
C : both 1 & 2
D : function
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : cpu
B : primary memory


D : a key & value
D : code generation
B : statement
C : Numeric data
D : ASCII data

A : system software
C : both 1 & 2
D : not a software
B : LRU
C : FIFO
A : Indexed files
B : Direct files

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : works well
A : Second pass
B : First pass
C : Zeroth pass
A : START
B : END
C : ORIGIN

A : Stack
B : Queue
C : Linked list
D : no error occurs
D : resources
because




program
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A : minimum
B : average
C : maximum
D : approximate
D : PL domain only




A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
B : File system
C : instruction
D : Opcodes
A : FCFS
B : SJF
C : RR
D : priority
print document ?
A : word proccessor
B : spreadsheet
D : Unix

B : page-fault rate
C : hit ratio
Q.no 11. A macro is

A : job queue
B : ready queue
C : execution queue
D : process queue
A : PS
B : TOP
C : fork
D : kill
A : all process
C : parent process
D : init process
called
A : demand paging
B : virtual memory

A : Left to right
C : Right to left

A : Identifier
C : Integer Literal
operating system

A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
B : Syntax analysis
D : something else
suspended is called
A : USING
B : BALR
C : DROP
D : ORG

A : Dos
B : Unix
C : System software
A : is in the TLB
B : has data in it
C : process
C : seek time
D : critical ratio

A : error
B : protection
D : access
D : priority
A : Bit tables
C : Indexing
D : Free Block List

B : page size
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator

D : translator
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Bit tables
C : Indexing
D : Free Block List
B : Syntax analysis
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

D : no error occurs
A : START
B : END
C : ORIGIN




A : FIFO
B : LRU
C : LFU
D : NRU

A : segmentation
B : swapping
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : object code
D : machine code

as
A : seek time
C : access time
D : Transfer time
B : blocking I/O
D : synchronous I/O
A : END
B : ENDS
C : MEND
D : ENDD
B : Syntax trees
D : Prefix notation

A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : YACC
B : BISON
C : FLEX
D : Iburg

A : any language
C : c language
object program
D : Both 1 & 2
A : START
B : BEGIN
C : MACRO
B : Compaction
D : Division
A : system software
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Indexed files
B : Direct files
C : seek time
A : key
B : value
C : bit value
D : constant
A : file extension
B : file identifier
C : file name


D : Both 1 & 2
A : Identifiers
B : Constants
C : Keywords
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list
D : resources
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : works well
A : Second pass
B : First pass
C : Zeroth pass

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
A : Indexed files
B : Direct files
A : minimum
B : average
C : maximum
D : approximate




program
B : LRU
C : FIFO
D : translator

A : all process
C : parent process
D : init process
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : System call
B : API
C : library
D : shell
A : frame bit
B : page number
C : page offset
D : frame offset
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Logical I/O
C : Device I/O
A : Stop
B : Return
C : OP
D : End
A : Parser
C : Code generator
A : macro prototype
D : macro call
B : code generation
C : syntax analysis
A : wait queue
B : ready queue
C : cpu
A : Polling
B : Inspection
C : Reviewing
D : Echoing
D : Both 1 & 3
A : entire thread
D : entire process
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
C : lexical errors
B : statement
C : Numeric data
D : ASCII data


A : is in the TLB
B : has data in it
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
D : priority
B : Syntax analysis
C : <macro name>
D : <call macro>
A : Attributes
B : Protocol
C : Location
D : Ownership
D : expanding macro
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : START
B : END
C : ORIGIN

A : Identifier
B : Number
C : Keyword
D : operator
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
D : no error occurs
D : data dependant
B : Syntax analysis
A : compiler
B : assembler
C : loader
D : interpreter
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : Bit tables
C : Indexing
D : Free Block List




A : assembler
B : compiler
C : loader
D : interpreter
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Interrupts
B : Memory mapping
D : DMA
Q.no 7. A macro is

A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
B : Syntax trees
D : Prefix notation

A : FCFS
B : SJF
C : RR
D : priority
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj

Q.no 17. SJF can be
A : preemptive only
D : sequential

print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Indexed files
B : Direct files
A : key
B : value
C : bit value
D : constant

A : Dos
B : Unix
C : System software
A : USING
B : BALR
C : DROP
D : ORG
operating system

A : Identifiers
B : Constants
C : Keywords
C : seek time
B : Compaction
D : Division
C : process

A : Parser
B : Optimizer
C : Scanner
D : Loader
D : critical ratio

A : cpu
B : primary memory
A : any language
C : c language
D : something else




program
in hardware?
A : Counters
B : RAM & Registers

D : Registers
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Indexed files
B : Direct files

A : works well

D : resources
A : minimum
B : average
C : maximum
D : approximate
A : compilation
B : execution
C : loading
D : linking
B : LRU
C : FIFO
A : Second pass
B : First pass
C : Zeroth pass
because





D : translator
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List

A : seek time
C : access time
D : Transfer time
A : Left to right
C : Right to left
B : File system
B : page-fault rate
C : hit ratio
A : Machine code
D : A parse tree
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer

A : Parser
C : Code generator
B : blocking I/O
D : synchronous I/O
called
A : demand paging
B : virtual memory
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
B : control program
D : All
C : instruction
D : Opcodes

D : code generation
C : SCAN
D : Circular SCAN
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging

D : a key & value
D : Both 1 & 2
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : Attributes
B : Protocol
C : Location
D : Ownership
A : Source code
C : Target code
D : tokens
D : priority
A : system software
C : both 1 & 2
D : not a software
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : procedure
B : subroutine
C : macro
A : YACC
B : BISON
C : FLEX
D : Iburg
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Stack
B : Queue
C : Linked list
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3




program
A : compiler
B : assembler
C : loader
D : interpreter
B : page size
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs
B : Syntax analysis
D : Both 1 & 2
A : works well


D : Both 1 & 3

A : System call
B : API
C : library
D : shell
A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : END
B : ENDS
C : MEND
D : ENDD

A : macro prototype
D : macro call
Q.no 9. SJF can be
A : preemptive only
D : sequential
A : Stop
B : Return
C : OP
D : End

A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue

Q.no 18. A macro is
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : Syntax trees
D : Prefix notation
B : Syntax analysis
C : seek time
A : is in the TLB
B : has data in it
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : key
B : value
C : bit value
D : constant
A : Compiler
B : Interpreter
C : Assembler
D : Loader

D : expanding macro
A : file extension
B : file identifier
C : file name
A : error
B : protection
D : access

A : START
B : BEGIN
C : MACRO
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : PL domain only
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : translator
A : Bit tables
C : Indexing
D : Free Block List
A : Second pass
B : First pass
C : Zeroth pass
A : compilation
B : execution
C : loading
D : linking
D : resources
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : minimum
B : average
C : maximum
D : approximate
because
A : Absolute Loader
B : Loader
C : Linker
D : Assembler




A : wait queue
B : ready queue
C : cpu
B : page-fault rate
C : hit ratio

as
A : waiting time
B : turnaround time
C : response time
D : throughput
called
A : demand paging
B : virtual memory
A : all process
C : parent process
D : init process

A : segmentation
B : swapping
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : SJF-P
B : FCFS
C : RR
D : Priority
A : FCFS
B : SJF
C : RR
D : priority

A : Dos
B : Unix
C : System software
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : both 1 & 2
D : function
A : magnetic disks
C : assemblies
D : cylinders
A : any language
C : c language
C : lexical errors
concerned with

B : Compaction
D : Division
C : <macro name>
D : <call macro>
object program
D : Both 1 & 2
D : Both 1 & 2

D : something else
C : process
suspended is called
B : Syntax analysis
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : works well

A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs




program
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
A : Bit tables
C : Indexing
D : Free Block List
D : translator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List




A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : assembler
B : compiler
C : loader
D : interpreter
A : frame bit
B : page number
C : page offset
D : frame offset
A : object code
D : machine code
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : job queue
B : ready queue
C : execution queue
D : process queue
first?
D : Round Robin
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
as
A : seek time
C : access time
D : Transfer time
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler

D : Both 1 & 3
A : Machine code
D : A parse tree
A : Parser
C : Code generator
D : critical ratio
A : file extension
B : file identifier
C : file name
A : START
B : BEGIN
C : MACRO
A : procedure
B : subroutine
C : macro
C : seek time
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : error
B : protection
D : access
C : seek time
A : Bit tables
C : Indexing
D : Free Block List
because
A : Indexed files
B : Direct files
B : Syntax analysis
A : Second pass
B : First pass
C : Zeroth pass
A : minimum
B : average
C : maximum
D : approximate
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : resources
A : START
B : END
C : ORIGIN
D : PL domain only
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : LRU
C : FIFO
D : translator




A : END
B : ENDS
C : MEND
D : ENDD
A : entire thread
D : entire process
A : segmentation
B : swapping

A : SJF-P
B : FCFS
C : RR
D : Priority
B : Syntax trees
D : Prefix notation
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : code generation
C : syntax analysis
A : Interrupts
B : Memory mapping
D : DMA
B : control program
D : All
B : Logical I/O
C : Device I/O
C : instruction
D : Opcodes
A : Identifiers
B : Constants
C : Keywords
concerned with
B : statement
C : Numeric data
D : ASCII data
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : YACC
B : BISON
C : FLEX
D : Iburg
B : Syntax analysis
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Indexed files
B : Direct files
A : is in the TLB
B : has data in it
A : key
B : value
C : bit value
D : constant
D : priority
A : system software
C : both 1 & 2
D : not a software
A : Bit table
C : Indexing
D : Free Block List
A : Dos
B : Unix
C : System software
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Identifier
B : Number
C : Keyword
D : operator
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size




program
D : no error occurs
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN



Seat No -

Time : 1hr
Max Marks : 50
N.B
A : wait queue
B : ready queue
C : cpu

A : all process
C : parent process
D : init process
A : System call
B : API
C : library
D : shell
A : assembler
B : compiler
C : loader
D : interpreter
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
3
A : Identifier
C : Integer Literal
D : Both 1 & 3
B : code generation
C : syntax analysis
A : Stop
B : Return
C : OP
D : End
A : PS
B : TOP
C : fork
D : kill
A : FCFS
B : SJF
C : RR
D : priority
A : frame bit
B : page number
C : page offset
D : frame offset
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : job queue
B : ready queue
C : execution queue
D : process queue
A : error
B : protection
D : access

D : Both 1 & 2
A : Indexed files
B : Direct files
performed by
B : Syntax analysis
page
A : is in the TLB
B : has data in it
A : file extension
C : file name
D : something else
D : expanding macro
A : magnetic disks
C : assemblies
D : cylinders
A : procedure
B : subroutine
C : macro
the jobs.
D : critical ratio
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Attributes
B : Protocol
C : Location
D : Ownership
C : both 1 & 2
D : function
C : seek time
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : compiler
B : assembler
C : loader
D : interpreter
D : translator
A : Bit tables
C : Indexing
D : Free Block List
A : minimum
B : average
C : maximum
D : approximate
B : Syntax analysis
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator




program

D : data dependant
time.
A : Indexed files
B : Direct files
A : Counters
B : RAM & Registers
D : Registers
specification.
A : START
B : END
C : ORIGIN
B : page size

called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : waiting time
B : turnaround time
C : response time
D : throughput
A : END
B : ENDS
C : MEND
D : ENDD
A : macro prototype
D : macro call
A : Left to right
C : Right to left
C : instruction
D : Opcodes
B : File system
in memory is called
A : demand paging
B : virtual memory

B : Syntax trees
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU

B : Compaction
D : Division
C : process

C : lexical errors
A : key
B : value
C : bit value
D : constant
A : USING
B : BALR
C : DROP
D : ORG

A : cpu
B : primary memory
A : any language
C : c language

A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
C : seek time
A : Bit table
C : Indexing
D : Free Block List
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

D : no error occurs
D : Both 1 & 2
D : PL domain only
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : Stack
B : Queue
C : Linked list
A : works well

D : resources
A : Second pass
B : First pass
C : Zeroth pass
A : compilation
B : execution
C : loading
D : linking
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
A : Machine code
D : A parse tree

Q.no 5. SJF can be
A : preemptive only
D : sequential
A : Interrupts
B : Memory mapping
D : DMA
A : frame bit
B : page number
C : page offset
D : frame offset
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : page-fault rate
C : hit ratio
A : SJF-P
B : FCFS
C : RR
D : Priority
A : System call
B : API
C : library
D : shell
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : control program
D : All

A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
dynamic loading

C : SCAN
D : Circular SCAN
performed by
B : Syntax analysis

C : <macro name>
D : <call macro>
A : Source code
C : Target code
D : tokens
algorithm
algorithm
D : code generation

A : Paging
B : Demand paging
C : Segmentation
D : Swapping
D : priority
time?

A : Attributes
B : Protocol
C : Location
D : Ownership
A : Identifiers
B : Constants
C : Keywords
D : translator

specification.
A : START
B : END
C : ORIGIN



program
time.
A : Indexed files
B : Direct files
A : Counters
B : RAM & Registers
D : Registers
A : compiler
B : assembler
C : loader
D : interpreter
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
B : page size
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

B : Syntax analysis
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : all process
C : parent process
D : init process
A : segmentation
B : swapping
B : Syntax trees
track is known as
A : seek time
C : access time
D : Transfer time
D : Round Robin
A : Parser
C : Code generator
in memory is called
A : demand paging
B : virtual memory

A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : entire thread

D : entire process
A : wait queue
B : ready queue
C : cpu
A : Left to right
C : Right to left
C : instruction
D : Opcodes
D : Both 1 & 3
A : FCFS
B : SJF
C : RR
D : priority
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : START
B : BEGIN
C : MACRO
A : file extension
C : file name
A : magnetic disks
C : assemblies
D : cylinders

D : Both 1 & 2

A : error
B : protection
D : access
the jobs.

D : critical ratio
A : Indexed files
B : Direct files
A : key
B : value
C : bit value
D : constant
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Dos
B : Unix
C : System software
D : a key & value
A : system software
C : both 1 & 2
D : not a software
A : Stack
B : Queue
C : Linked list
D : translator

D : resources
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only
A : Bit tables
C : Indexing
D : Free Block List
A : Second pass
B : First pass
C : Zeroth pass
A : works well
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
D : no error occurs
D : Both 1 & 2
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : compilation
B : execution
C : loading
D : linking
B : page size

A : Text editor
B : Assembler
C : Linker
D : Loader
A : Interrupts
B : Memory mapping
D : DMA

B : Logical I/O
C : Device I/O
B : File system
B : blocking I/O
D : synchronous I/O
A : job queue
B : ready queue
C : execution queue
D : process queue
A : frame bit
B : page number
C : page offset
D : frame offset
A : word proccessor
B : spreadsheet
D : Unix
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : control program
D : All
A : waiting time
B : turnaround time
C : response time
D : throughput
Q.no 19. A macro is
A : object code
D : machine code
C : seek time
A : any language
C : c language
B : statement
C : Numeric data
D : ASCII data
D : priority

C : lexical errors
A : Bit table
C : Indexing
D : Free Block List
C : seek time
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : USING
B : BALR
C : DROP
D : ORG
dynamic loading
time?
A : Source code
C : Target code
D : tokens

A : Identifiers
B : Constants
C : Keywords
A : Stack
B : Queue
C : Linked list
B : Syntax analysis
specification.
A : START
B : END
C : ORIGIN

time.
A : Indexed files
B : Direct files
A : Counters
B : RAM & Registers
D : Registers
A : compiler
B : assembler
C : loader
D : interpreter
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
D : data dependant
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these



program
A : minimum
B : average
C : maximum
D : approximate

B : page size
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
C : RR
D : priority
A : System call
B : API
C : library
D : shell
C : instruction
D : Opcodes
track is known as
A : seek time
C : access time
D : Transfer time
in memory is called
A : demand paging
B : virtual memory
A : macro prototype
D : macro call

occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
A : Stop
B : Return
C : OP
D : End
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
Q.no 12. SJF can be
A : preemptive only
D : sequential

B : page-fault rate
C : hit ratio

A : Dos
B : Unix
C : System software
page
A : is in the TLB
B : has data in it
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : procedure
B : subroutine
C : macro
performed by
B : Syntax analysis
algorithm
algorithm
D : something else
B : Compaction
D : Division

space of a process
A : file extension
C : file name
A : Parser
B : Optimizer
C : Scanner
D : Loader
C : process
A : Attributes
B : Protocol
C : Location
D : Ownership
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : cpu
B : primary memory
C : <macro name>
D : <call macro>
A : Stack
B : Queue
C : Linked list
A : Second pass
B : First pass
C : Zeroth pass
B : Syntax analysis
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

A : compilation
B : execution
C : loading
D : linking
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Bit tables
C : Indexing
D : Free Block List
specification.
A : START
B : END
C : ORIGIN
D : no error occurs
A : works well

A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only

A : word proccessor
B : spreadsheet
D : Unix

A : all process
C : parent process
D : init process
A : Machine code
D : A parse tree
D : Round Robin
B : Logical I/O
C : Device I/O
A : Left to right
C : Right to left
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language

D : Both 1 & 3
A : SJF-P
B : FCFS
C : RR
D : Priority
A : segmentation
B : swapping

A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : END
B : ENDS
C : MEND
D : ENDD
A : assembler
B : compiler
C : loader
D : interpreter
B : control program
D : All
D : expanding macro
B : statement
C : Numeric data
D : ASCII data
C : seek time
time?
D : code generation
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : Identifiers
B : Constants
C : Keywords
A : START
B : BEGIN
C : MACRO

D : a key & value

D : Both 1 & 2
A : Bit table
C : Indexing
D : Free Block List
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : minimum
B : average
C : maximum
D : approximate
A : compiler
B : assembler
C : loader
D : interpreter
time.
A : Indexed files
B : Direct files
D : data dependant

D : resources
A : Counters
B : RAM & Registers
D : Registers
D : translator
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
specification.
A : START
B : END
C : ORIGIN
A : Bit tables
C : Indexing
D : Free Block List
B : code generation
C : syntax analysis
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : frame bit
B : page number
C : page offset
D : frame offset
A : PS
B : TOP
C : fork
D : kill
A : job queue
B : ready queue
C : execution queue
D : process queue
B : File system
A : wait queue
B : ready queue
C : cpu
Q.no 12. SJF can be
A : preemptive only
D : sequential
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : page-fault rate
C : hit ratio
Q.no 16. A macro is
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : file extension
C : file name
A : Source code
C : Target code
D : tokens
A : Indexed files
B : Direct files
A : error
B : protection
D : access
A : magnetic disks
C : assemblies
D : cylinders
A : system software
C : both 1 & 2
D : not a software
the jobs.
D : critical ratio
C : both 1 & 2
D : function
A : any language
C : c language
D : priority
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : cpu
B : primary memory
Belady’s Anomaly?
B : LRU
C : FIFO

A : Stack
B : Queue
C : Linked list
A : Bit tables
C : Indexing
D : Free Block List
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : works well
A : Second pass
B : First pass
C : Zeroth pass
B : page size
D : no error occurs



program
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
D : Both 1 & 2
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler

D : PL domain only
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : object code
D : machine code

C : instruction
D : Opcodes
A : segmentation
B : swapping
A : Interrupts
B : Memory mapping
D : DMA
D : Round Robin
A : FCFS
B : SJF
C : RR
D : priority

A : System call
B : API
C : library
D : shell
B : Syntax trees

A : Parser
C : Code generator
A : Left to right
C : Right to left
A : SJF-P
B : FCFS
C : RR
D : Priority

in memory is called
A : demand paging
B : virtual memory
A : waiting time
B : turnaround time
C : response time
D : throughput

C : process
D : something else

C : <macro name>
D : <call macro>
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : seek time
time?
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Dos
B : Unix
C : System software
D : code generation
C : SCAN
D : Circular SCAN
B : Compaction
D : Division
D : expanding macro

A : minimum
B : average
C : maximum
D : approximate
D : translator
A : compiler
B : assembler
C : loader
D : interpreter
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these

specification.
A : START
B : END
C : ORIGIN

A : Counters
B : RAM & Registers
D : Registers
time.
A : Indexed files
B : Direct files
D : data dependant
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

D : resources
D : PL domain only
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Text editor
B : Assembler
C : Linker
D : Loader
B : Logical I/O
C : Device I/O
Q.no 3. A macro is
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj

A : all process
C : parent process
D : init process
A : macro prototype
D : macro call

A : Stop
B : Return
C : OP
D : End
B : control program
D : All
track is known as
A : seek time
C : access time
D : Transfer time
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : Machine code
D : A parse tree
B : statement
C : Numeric data
D : ASCII data
A : procedure
B : subroutine
C : macro
algorithm
algorithm
space of a process
A : magnetic disks
C : assemblies
D : cylinders
C : lexical errors
page
A : is in the TLB
B : has data in it

A : Identifiers
B : Constants
C : Keywords
A : key
B : value
C : bit value
D : constant

D : priority
A : START
B : BEGIN
C : MACRO
A : USING
B : BALR
C : DROP
D : ORG
A : system software
C : both 1 & 2
D : not a software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2

A : Bit tables
C : Indexing
D : Free Block List
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
B : page size
A : Bit tables
C : Indexing
D : Free Block List




program
A : works well
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
Seat No -

Time : 1hr
Max Marks : 50
N.B
A : wait queue
B : ready queue
C : cpu
A : END
B : ENDS
C : MEND
D : ENDD
A : Text editor
B : Assembler
C : Linker
D : Loader
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : System call
B : API
C : library
D : shell
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : Logical I/O
C : Device I/O
called
A : demand paging
B : virtual memory
A : macro prototype
D : macro call
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : PS
B : TOP
C : fork
D : kill
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : object code
D : machine code
A : Identifiers
B : Constants
C : Keywords
A : key
B : value
C : bit value
D : constant
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
C : process
A : is in the TLB
B : has data in it
D : a key & value
A : file extension
B : file identifier
C : file name
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Indexed files
B : Direct files
A : Compiler
B : Interpreter
C : Assembler
D : Loader
suspended is called
A : procedure
B : subroutine
C : macro
A : any language
C : c language
object program
D : Both 1 & 2
D : translator
D : PL domain only
B : page size
A : minimum
B : average
C : maximum
D : approximate
A : Indexed files
B : Direct files
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Identifier
B : Number
C : Keyword
D : operator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
because
D : no error occurs
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list

D : Both 1 & 3
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
A : assembler
B : compiler
C : loader
D : interpreter
A : segmentation
B : swapping
A : Identifier
C : Integer Literal
A : Polling
B : Inspection
C : Reviewing
D : Echoing
first?
D : Round Robin
B : code generation
C : syntax analysis
as
A : seek time
C : access time
D : Transfer time

A : Left to right
C : Right to left
A : FIFO
B : LRU
C : LFU
D : NRU
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B

C : seek time
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
concerned with
A : Attributes
B : Protocol
C : Location
D : Ownership
D : something else
C : lexical errors
B : Syntax analysis
A : Source code
C : Target code
D : tokens
A : Bit table

C : Indexing
D : Free Block List
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : both 1 & 2
D : function
B : Compaction
D : Division




program
A : Second pass
B : First pass
C : Zeroth pass

A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO

D : Both 1 & 2
D : resources
A : works well


A : START
B : END
C : ORIGIN
A : Bit tables
C : Indexing
D : Free Block List
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : Syntax analysis
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these




A : job queue
B : ready queue
C : execution queue
D : process queue
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : entire thread
D : entire process
A : macro prototype
D : macro call
C : instruction
D : Opcodes

A : FCFS
B : SJF
C : RR
D : priority
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Stop
B : Return
C : OP
D : End
B : page-fault rate
C : hit ratio
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : is in the TLB
B : has data in it
D : critical ratio
A : magnetic disks
C : assemblies
D : cylinders
C : SCAN
D : Circular SCAN
C : process

A : error
B : protection
D : access
D : priority
A : USING
B : BALR
C : DROP
D : ORG
D : expanding macro

A : any language
C : c language


A : procedure
B : subroutine
C : macro

D : PL domain only
A : Stack
B : Queue
C : Linked list
D : no error occurs
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size
D : data dependant
because
A : minimum
B : average
C : maximum
D : approximate




program
A : compilation
B : execution
C : loading
D : linking
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : compiler
B : assembler
C : loader
D : interpreter
D : translator



A : all process
C : parent process
D : init process
A : Double buffer
B : Single buffer
: Linear buffer D
: Circular buffer
A : Parser
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
Q.no 8. SJF can be
A : preemptive only
D : sequential
Q.no 9. A macro is
B : blocking I/O
D : synchronous I/O
B : Syntax trees
D : Prefix notation
as
A : seek time
C : access time
D : Transfer time
called
A : demand paging
B : virtual memory
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
B : code generation
C : syntax analysis
A : Left to right

C : Right to left
A : PS
B : TOP
C : fork
D : kill
A : Machine code
D : A parse tree
D : Both 1 & 2
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : cpu
B : primary memory
B : Syntax analysis
A : file extension
B : file identifier
C : file name
D : code generation
operating system
A : START
B : BEGIN
C : MACRO
A : Dos
B : Unix
C : System software
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : START
B : END
C : ORIGIN
B : Syntax analysis
D : resources
A : Second pass
B : First pass
C : Zeroth pass

D : Both 1 & 2
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter

A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list
D : data dependant


A : END
B : ENDS
C : MEND
D : ENDD
B : File system
A : segmentation
B : swapping
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Stop
B : Return
C : OP
D : End
A : Text editor
B : Assembler
C : Linker
D : Loader
B : control program
D : All
A : FIFO
B : LRU
C : LFU
D : NRU
B : page-fault rate
C : hit ratio

A : Identifier
C : Integer Literal
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code

A : Attributes
B : Protocol
C : Location
D : Ownership
C : SCAN
D : Circular SCAN
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Parser
B : Optimizer
C : Scanner
D : Loader
B : statement
C : Numeric data
D : ASCII data
A : YACC
B : BISON
C : FLEX
D : Iburg
A : key
B : value
C : bit value
D : constant
A : Bit table
C : Indexing
D : Free Block List

object program
D : Both 1 & 2
A : Identifiers
B : Constants
C : Keywords
C : both 1 & 2
D : function
C : seek time
D : priority
A : Source code
C : Target code
D : tokens
A : write ahead
B : read ahead
C : free-behind
D : add-front


A : compilation
B : execution
C : loading
D : linking
because
A : Identifier
B : Number
C : Keyword
D : operator
B : Syntax analysis
A : Indexed files
B : Direct files
A : works well
A : minimum
B : average
C : maximum
D : approximate



program
A : START
B : END
C : ORIGIN

D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
D : translator


A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Syntax trees
D : Prefix notation
A : Machine code
D : A parse tree
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : assembler
B : compiler
C : loader
D : interpreter
first?
D : Round Robin
A : wait queue
B : ready queue
C : cpu
A : macro prototype
D : macro call
A : job queue
B : ready queue
C : execution queue
D : process queue
D : Both 1 & 3
Q.no 14. A macro is
A : System call
B : API
C : library
D : shell
Q.no 16. SJF can be
A : preemptive only
D : sequential

C : instruction
D : Opcodes
called
A : demand paging
B : virtual memory
B : Logical I/O
C : Device I/O
B : blocking I/O
D : synchronous I/O
D : critical ratio
B : Syntax analysis
A : cpu
B : primary memory
A : procedure
B : subroutine
C : macro
A : system software
C : both 1 & 2
D : not a software

C : <macro name>
D : <call macro>
A : file extension
B : file identifier
C : file name
B : Compaction
D : Division
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
suspended is called
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : START
B : BEGIN
C : MACRO

of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
D : data dependant
D : resources
D : PL domain only
A : compiler
B : assembler
C : loader
D : interpreter
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Second pass
B : First pass
C : Zeroth pass
A : works well




program




A : seek time
C : access time
D : Transfer time
A : Polling
B : Inspection
C : Reviewing
D : Echoing
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : PS
B : TOP
C : fork
D : kill
B : control program
D : All
A : Interrupts
B : Memory mapping
D : DMA
A : Stop
B : Return
C : OP
D : End
A : END
B : ENDS
C : MEND
D : ENDD
A : SJF-P
B : FCFS
C : RR
D : Priority
A : all process
C : parent process
D : init process
B : File system
A : frame bit
B : page number
C : page offset
D : frame offset
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : process
A : magnetic disks
C : assemblies
D : cylinders
A : key
B : value
C : bit value
D : constant
C : seek time
A : any language
C : c language
D : expanding macro
C : lexical errors
A : Indexed files
B : Direct files
A : USING
B : BALR
C : DROP
D : ORG
operating system
A : Source code
C : Target code
D : tokens
A : is in the TLB
B : has data in it
object program
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
D : translator
B : LRU
C : FIFO
A : Identifier
B : Number
C : Keyword
D : operator
A : compilation
B : execution
C : loading
D : linking
A : Bit tables
C : Indexing
D : Free Block List
A : Indexed files
B : Direct files
B : Syntax analysis
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : START
B : END
C : ORIGIN
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers




A : object code
D : machine code
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : page-fault rate
C : hit ratio
A : macro prototype
D : macro call
B : Syntax trees
D : Prefix notation
A : System call
B : API
C : library
D : shell
A : FCFS
B : SJF
C : RR
D : priority
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
Q.no 12. A macro is
C : instruction
D : Opcodes
B : blocking I/O
D : synchronous I/O
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
Q.no 19. SJF can be
A : preemptive only
D : sequential
A : Identifier
C : Integer Literal
A : Bit table
C : Indexing
D : Free Block List
A : Attributes
B : Protocol
C : Location
D : Ownership
concerned with
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
D : Both 1 & 2
B : Syntax analysis
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
D : something else
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : file extension
B : file identifier
C : file name
D : code generation
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Bit tables
C : Indexing
D : Free Block List
A : works well
A : minimum
B : average
C : maximum
D : approximate
D : resources
A : Second pass
B : First pass
C : Zeroth pass
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2
B : page size




program
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
B : Syntax analysis


A : Left to right
C : Right to left
A : entire thread
D : entire process
A : wait queue
B : ready queue
C : cpu
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
print document ?
A : word proccessor
B : spreadsheet
D : Unix
first?
D : Round Robin
A : assembler
B : compiler
C : loader
D : interpreter
B : code generation
C : syntax analysis
A : SJF-P
B : FCFS
C : RR
D : Priority
A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Machine code
D : A parse tree
A : Source code
C : Target code
D : tokens
D : priority
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
suspended is called
C : process
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
operating system
A : system software
C : both 1 & 2
D : not a software
A : USING
B : BALR
C : DROP
D : ORG
D : critical ratio
C : seek time
B : Compaction
D : Division
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Indexed files
B : Direct files
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : translator
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : no error occurs
B : LRU
C : FIFO
A : START
B : END
C : ORIGIN
because
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis

C : instruction
D : Opcodes
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Identifier
C : Integer Literal
A : FIFO
B : LRU
C : LFU
D : NRU
A : object code
D : machine code
A : END
B : ENDS
C : MEND
D : ENDD
B : control program

D : All
B : blocking I/O
D : synchronous I/O
B : File system
A : System call
B : API
C : library
D : shell
A : PS
B : TOP
C : fork
D : kill
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Stop
B : Return
C : OP
D : End
D : something else
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : file extension
B : file identifier
C : file name
A : is in the TLB
B : has data in it
C : lexical errors

D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
C : System software
A : key
B : value
C : bit value
D : constant
A : START
B : BEGIN
C : MACRO

A : Bit tables
C : Indexing
D : Free Block List

A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Bit tables
C : Indexing
D : Free Block List
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
A : Identifier
B : Number
C : Keyword
D : operator
A : compiler
B : assembler
C : loader
D : interpreter
A : Second pass
B : First pass
C : Zeroth pass
A : works well
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
B : page size





program
D : PL domain only





A : SJF-P
B : FCFS
C : RR
D : Priority
A : Parser
C : Code generator
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
Q.no 7. SJF can be
A : preemptive only
D : sequential
A : Machine code
D : A parse tree
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : all process
C : parent process
D : init process
B : code generation
C : syntax analysis
A : entire thread
D : entire process
as
A : seek time
C : access time
D : Transfer time
A : wait queue
B : ready queue
C : cpu
A : Text editor
B : Assembler
C : Linker
D : Loader


B : Compaction
D : Division
A : YACC
B : BISON
C : FLEX
D : Iburg
C : seek time
A : Identifiers
B : Constants
C : Keywords
C : SCAN
D : Circular SCAN
B : Syntax analysis
A : system software
C : both 1 & 2
D : not a software
A : Source code
C : Target code
D : tokens
suspended is called
C : seek time

A : Swapping
B : Paging
C : Segmentation
D : Demand paging

D : code generation
A : Indexed files
B : Direct files
A : procedure
B : subroutine
C : macro
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : LRU
C : FIFO
D : resources
because

A : Absolute Loader
B : Loader
C : Linker
D : Assembler

B : Syntax analysis
D : translator
A : write ahead
B : read ahead
C : free-behind
D : add-front
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A : Indexed files
B : Direct files
A : compilation
B : execution
C : loading
D : linking

D : PL domain only
A : Bit tables
C : Indexing
D : Free Block List
A : compiler
B : assembler
C : loader
D : interpreter

D : data dependant




B : Syntax trees
D : Prefix notation
A : PS
B : TOP
C : fork
D : kill
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
called
A : demand paging
B : virtual memory
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : Left to right
C : Right to left
A : segmentation
B : swapping
D : Both 1 & 3
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : blocking I/O
D : synchronous I/O

A : frame bit
B : page number
C : page offset
D : frame offset
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : is in the TLB
B : has data in it
D : Both 1 & 2

object program
D : Both 1 & 2
A : USING
B : BALR
C : DROP
D : ORG
A : cpu
B : primary memory
A : file extension
B : file identifier
C : file name


D : a key & value

A : Dos
B : Unix
C : System software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : any language
C : c language
operating system
A : minimum
B : average
C : maximum
D : approximate




program
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Stack
B : Queue
C : Linked list
D : no error occurs

D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : works well

A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
C : Zeroth pass

D : translator

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : entire thread
D : entire process
A : Text editor
B : Assembler
C : Linker
D : Loader
A : assembler
B : compiler
C : loader
D : interpreter
A : object code
D : machine code


B : page-fault rate
C : hit ratio
B : control program
D : All
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : File system
Q.no 17. SJF can be
A : preemptive only
D : sequential
A : job queue
B : ready queue
C : execution queue
D : process queue
A : END
B : ENDS
C : MEND
D : ENDD
A : magnetic disks
C : assemblies
D : cylinders
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : seek time
D : code generation
A : Attributes
B : Protocol
C : Location
D : Ownership
D : critical ratio
A : procedure
B : subroutine
C : macro
A : error
B : protection
D : access
D : priority
A : START
B : BEGIN
C : MACRO

A : Parser
B : Optimizer
C : Scanner
D : Loader
D : resources
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : minimum
B : average
C : maximum
D : approximate
D : PL domain only

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : compiler
B : assembler
C : loader
D : interpreter
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Indexed files
B : Direct files
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
D : data dependant
because



A : segmentation
B : swapping
B : blocking I/O
D : synchronous I/O
B : Logical I/O
C : Device I/O
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
C : RR
D : priority
A : Interrupts
B : Memory mapping
D : DMA
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Left to right
C : Right to left
A : FIFO
B : LRU
C : LFU
D : NRU
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Identifier
C : Integer Literal
B : code generation
C : syntax analysis
A : frame bit
B : page number
C : page offset
D : frame offset
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Stop
B : Return
C : OP
D : End
A : Source code
C : Target code
D : tokens
D : Both 1 & 2
D : expanding macro
B : Syntax analysis
A : USING
B : BALR
C : DROP
D : ORG
C : seek time
D : something else
suspended is called

A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Bit table
C : Indexing
D : Free Block List
A : any language
C : c language
C : SCAN
D : Circular SCAN
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : START
B : END
C : ORIGIN
A : Stack
B : Queue
C : Linked list
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Identifier
B : Number
C : Keyword
D : operator




program
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : works well
B : page size
A : Bit tables
C : Indexing
D : Free Block List
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : write ahead
B : read ahead
C : free-behind
D : add-front



A : object code
D : machine code
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
Q.no 6. A macro is

A : entire thread
D : entire process
B : page-fault rate
C : hit ratio
A : Machine code
D : A parse tree
D : Both 1 & 3
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin
Q.no 18. SJF can be
A : preemptive only
D : sequential
called
A : demand paging
B : virtual memory
A : END
B : ENDS
C : MEND
D : ENDD
A : is in the TLB
B : has data in it

operating system
D : a key & value

A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : YACC
B : BISON
C : FLEX
D : Iburg
C : process
concerned with
A : cpu
B : primary memory
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Attributes
B : Protocol
C : Location
D : Ownership
object program
D : Both 1 & 2
A : Indexed files
B : Direct files
A : system software
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
D : Both 1 & 2
because
B : Syntax analysis
A : compiler
B : assembler
C : loader
D : interpreter
A : compilation
B : execution
C : loading
D : linking
A : minimum
B : average
C : maximum
D : approximate
of the disk.
A : Bit tables
C : Indexing
D : Free Block List

D : data dependant
D : translator

D : PL domain only
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : resources
A : Bit tables
C : Indexing
D : Free Block List
B : LRU
C : FIFO


A : PS
B : TOP
C : fork
D : kill
B : Syntax trees
D : Prefix notation
B : Logical I/O
C : Device I/O
A : Identifier
C : Integer Literal
B : File system

A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Stop
B : Return
C : OP
D : End

of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
as
A : seek time
C : access time
D : Transfer time
B : control program
D : All

A : segmentation
B : swapping
A : FCFS
B : SJF
C : RR
D : priority
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Left to right
C : Right to left
A : wait queue
B : ready queue
C : cpu
B : Syntax analysis
D : something else
C : seek time
A : Source code
C : Target code
D : tokens
C : <macro name>
D : <call macro>

A : file extension
B : file identifier
C : file name

A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : Bit table
C : Indexing
D : Free Block List
D : expanding macro
suspended is called
C : lexical errors
A : error
B : protection
D : access
B : Compaction
D : Division
D : code generation
A : write ahead
B : read ahead
C : free-behind
D : add-front

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : no error occurs
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
A : Stack
B : Queue
C : Linked list
B : page size
A : Indexed files
B : Direct files




program
A : Bit tables
C : Indexing
D : Free Block List

B : LRU
C : FIFO

A : Second pass
B : First pass
C : Zeroth pass




first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue
Q.no 5. SJF can be
A : preemptive only
D : sequential
as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : System call
B : API
C : library
D : shell
A : entire thread
D : entire process
called
A : demand paging
B : virtual memory
B : code generation
C : syntax analysis
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
A : object code
D : machine code


D : a key & value
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Dos
B : Unix
C : System software

A : key
B : value
C : bit value
D : constant
A : system software
C : both 1 & 2
D : not a software
A : cpu
B : primary memory
A : START
B : BEGIN
C : MACRO

A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
D : critical ratio
A : any language
C : c language
A : is in the TLB
B : has data in it
A : Identifiers
B : Constants
C : Keywords

B : statement
C : Numeric data
D : ASCII data
A : works well
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
D : Both 1 & 2
A : minimum
B : average
C : maximum
D : approximate
A : START
B : END
C : ORIGIN
D : translator
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
D : no error occurs
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : PL domain only
D : resources
A : compiler
B : assembler
C : loader
D : interpreter




C : instruction
D : Opcodes
A : segmentation
B : swapping
A : all process
C : parent process
D : init process
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Parser
C : Code generator
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : blocking I/O
D : synchronous I/O
A : FIFO
B : LRU
C : LFU
D : NRU
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
D : Both 1 & 3
A : assembler
B : compiler
C : loader
D : interpreter
A : SJF-P
B : FCFS
C : RR
D : Priority

A : FCFS
B : SJF
C : RR
D : priority

D : code generation
C : SCAN
D : Circular SCAN
concerned with
A : file extension
B : file identifier
C : file name

D : priority
C : seek time
D : Both 1 & 2
A : Source code
C : Target code
D : tokens
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK

operating system
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : procedure
B : subroutine
C : macro




program
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List

A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator
A : Second pass
B : First pass
C : Zeroth pass

B : page size
B : Syntax analysis

D : data dependant

A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
D : translator
because



A : wait queue
B : ready queue
C : cpu
called
A : demand paging
B : virtual memory
B : page-fault rate
C : hit ratio
B : File system
A : seek time
C : access time
D : Transfer time

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
A : Text editor
B : Assembler
C : Linker
D : Loader
Q.no 14. A macro is
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : Interrupts
B : Memory mapping
D : DMA

A : is in the TLB
B : has data in it

A : Indexed files
B : Direct files
A : magnetic disks
C : assemblies
D : cylinders
object program
D : Both 1 & 2
A : system software
C : both 1 & 2
D : not a software
C : lexical errors
B : Syntax analysis
A : YACC
B : BISON
C : FLEX
D : Iburg

C : process
D : something else
A : any language
C : c language
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : minimum
B : average
C : maximum
D : approximate
in hardware?
A : Counters
B : RAM & Registers
D : Registers
of the disk.
A : Bit tables
C : Indexing
D : Free Block List

D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : Stack
B : Queue
C : Linked list

D : resources
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Indexed files
B : Direct files
D : Both 1 & 2
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : START
B : END
C : ORIGIN
B : LRU
C : FIFO



program
D : no error occurs




B : Syntax trees
D : Prefix notation
first?
D : Round Robin
A : macro prototype
D : macro call
as
A : waiting time
B : turnaround time
C : response time
D : throughput
B : Logical I/O
C : Device I/O
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language

A : segmentation
B : swapping
A : job queue
B : ready queue
C : execution queue
D : process queue

A : Machine code
D : A parse tree
A : SJF-P
B : FCFS
C : RR
D : Priority
A : entire thread
D : entire process
D : Both 1 & 3
B : code generation
C : syntax analysis
A : FCFS
B : SJF
C : RR
D : priority
A : Left to right
C : Right to left
C : SCAN
D : Circular SCAN
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
D : critical ratio
B : Compaction
D : Division
suspended is called
A : Source code
C : Target code
D : tokens
A : file extension
B : file identifier
C : file name
A : Dos
B : Unix
C : System software
A : Attributes
B : Protocol
C : Location
D : Ownership

operating system
C : seek time
A : USING
B : BALR
C : DROP
D : ORG
concerned with

because
A : Second pass
B : First pass
C : Zeroth pass
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : Syntax analysis
A : Identifier
B : Number
C : Keyword
D : operator
B : page size
D : translator
A : Bit tables
C : Indexing
D : Free Block List

A : compiler
B : assembler
C : loader
D : interpreter
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2

A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : END
B : ENDS
C : MEND
D : ENDD
A : Interrupts
B : Memory mapping
D : DMA
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler

Q.no 7. SJF can be
A : preemptive only
D : sequential
B : control program
D : All
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Stop
B : Return
C : OP
D : End
A : System call
B : API
C : library
D : shell
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA

B : blocking I/O
D : synchronous I/O
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Bit table
C : Indexing
D : Free Block List

C : seek time
C : both 1 & 2
D : function
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : cpu
B : primary memory


D : a key & value
D : code generation
B : statement
C : Numeric data
D : ASCII data

A : system software
C : both 1 & 2
D : not a software
B : LRU
C : FIFO
A : Indexed files
B : Direct files

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : works well
A : Second pass
B : First pass
C : Zeroth pass
A : START
B : END
C : ORIGIN

A : Stack
B : Queue
C : Linked list
D : no error occurs
D : resources
because




program
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers

D : Registers
A : minimum
B : average
C : maximum
D : approximate
D : PL domain only




A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : frame bit
B : page number
C : page offset
D : frame offset
A : SJF-P
B : FCFS
C : RR
D : Priority
B : File system
C : instruction
D : Opcodes
A : FCFS
B : SJF
C : RR
D : priority
print document ?
A : word proccessor
B : spreadsheet
D : Unix

B : page-fault rate
C : hit ratio
Q.no 11. A macro is

A : job queue
B : ready queue
C : execution queue
D : process queue
A : PS
B : TOP
C : fork
D : kill
A : all process
C : parent process
D : init process
called
A : demand paging
B : virtual memory

A : Left to right
C : Right to left

A : Identifier
C : Integer Literal
operating system

A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
B : Syntax analysis
D : something else
suspended is called
A : USING
B : BALR
C : DROP
D : ORG

A : Dos
B : Unix
C : System software
A : is in the TLB
B : has data in it
C : process
C : seek time
D : critical ratio

A : error
B : protection
D : access
D : priority
A : Bit tables
C : Indexing
D : Free Block List

B : page size
D : Both 1 & 2
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Identifier
B : Number
C : Keyword
D : operator

D : translator
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Bit tables
C : Indexing
D : Free Block List
B : Syntax analysis
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

D : no error occurs
A : START
B : END
C : ORIGIN




A : FIFO
B : LRU
C : LFU
D : NRU

A : segmentation
B : swapping
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
first?
D : Round Robin

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : object code
D : machine code

as
A : seek time
C : access time
D : Transfer time
B : blocking I/O
D : synchronous I/O
A : END
B : ENDS
C : MEND
D : ENDD
B : Syntax trees
D : Prefix notation

A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
termed as
A : waiting time
B : turnaround time
C : response time
D : throughput
A : YACC
B : BISON
C : FLEX
D : Iburg

A : any language
C : c language
object program
D : Both 1 & 2
A : START
B : BEGIN
C : MACRO
B : Compaction
D : Division
A : system software
C : both 1 & 2
D : not a software
A : magnetic disks
C : assemblies
D : cylinders
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : Indexed files
B : Direct files
C : seek time
A : key
B : value
C : bit value
D : constant
A : file extension
B : file identifier
C : file name


D : Both 1 & 2
A : Identifiers
B : Constants
C : Keywords
because
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Stack
B : Queue
C : Linked list
D : resources
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : works well
A : Second pass
B : First pass
C : Zeroth pass

A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
A : Indexed files
B : Direct files
A : minimum
B : average
C : maximum
D : approximate




program
B : LRU
C : FIFO
D : translator

A : all process
C : parent process
D : init process
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : System call
B : API
C : library
D : shell
A : frame bit
B : page number
C : page offset
D : frame offset
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
B : Logical I/O
C : Device I/O
A : Stop
B : Return
C : OP
D : End
A : Parser
C : Code generator
A : macro prototype
D : macro call
B : code generation
C : syntax analysis
A : wait queue
B : ready queue
C : cpu
A : Polling
B : Inspection
C : Reviewing
D : Echoing
D : Both 1 & 3
A : entire thread
D : entire process
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
C : lexical errors
B : statement
C : Numeric data
D : ASCII data


A : is in the TLB
B : has data in it
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
D : priority
B : Syntax analysis
C : <macro name>
D : <call macro>
A : Attributes
B : Protocol
C : Location
D : Ownership
D : expanding macro
A : Compiler
B : Interpreter
C : Assembler
D : Loader
C : both 1 & 2
D : function
A : START
B : END
C : ORIGIN

A : Identifier
B : Number
C : Keyword
D : operator
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
D : no error occurs
D : data dependant
B : Syntax analysis
A : compiler
B : assembler
C : loader
D : interpreter
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : Bit tables
C : Indexing
D : Free Block List




A : assembler
B : compiler
C : loader
D : interpreter
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Interrupts
B : Memory mapping
D : DMA
Q.no 7. A macro is

A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
B : Syntax trees
D : Prefix notation

A : FCFS
B : SJF
C : RR
D : priority
A : SJF-P
B : FCFS
C : RR
D : Priority
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj

Q.no 17. SJF can be
A : preemptive only
D : sequential

print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Indexed files
B : Direct files
A : key
B : value
C : bit value
D : constant

A : Dos
B : Unix
C : System software
A : USING
B : BALR
C : DROP
D : ORG
operating system

A : Identifiers
B : Constants
C : Keywords
C : seek time
B : Compaction
D : Division
C : process

A : Parser
B : Optimizer
C : Scanner
D : Loader
D : critical ratio

A : cpu
B : primary memory
A : any language
C : c language
D : something else




program
in hardware?
A : Counters
B : RAM & Registers

D : Registers
D : PL domain only
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Indexed files
B : Direct files

A : works well

D : resources
A : minimum
B : average
C : maximum
D : approximate
A : compilation
B : execution
C : loading
D : linking
B : LRU
C : FIFO
A : Second pass
B : First pass
C : Zeroth pass
because





D : translator
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Bit tables
C : Indexing
D : Free Block List

A : seek time
C : access time
D : Transfer time
A : Left to right
C : Right to left
B : File system
B : page-fault rate
C : hit ratio
A : Machine code
D : A parse tree
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer

A : Parser
C : Code generator
B : blocking I/O
D : synchronous I/O
called
A : demand paging
B : virtual memory
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
B : control program
D : All
C : instruction
D : Opcodes

D : code generation
C : SCAN
D : Circular SCAN
C : <macro name>
D : <call macro>
A : Swapping
B : Paging
C : Segmentation
D : Demand paging

D : a key & value
D : Both 1 & 2
A : Bit table
C : Indexing
D : Free Block List
B : statement
C : Numeric data
D : ASCII data
A : Attributes
B : Protocol
C : Location
D : Ownership
A : Source code
C : Target code
D : tokens
D : priority
A : system software
C : both 1 & 2
D : not a software
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : procedure
B : subroutine
C : macro
A : YACC
B : BISON
C : FLEX
D : Iburg
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Stack
B : Queue
C : Linked list
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3




program
A : compiler
B : assembler
C : loader
D : interpreter
B : page size
A : START
B : END
C : ORIGIN
A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs
B : Syntax analysis
D : Both 1 & 2
A : works well


D : Both 1 & 3

A : System call
B : API
C : library
D : shell
A : FIFO
B : LRU
C : LFU
D : NRU
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : END
B : ENDS
C : MEND
D : ENDD

A : macro prototype
D : macro call
Q.no 9. SJF can be
A : preemptive only
D : sequential
A : Stop
B : Return
C : OP
D : End

A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
first?
D : Round Robin
A : job queue
B : ready queue
C : execution queue
D : process queue

Q.no 18. A macro is
print document ?
A : word proccessor
B : spreadsheet
D : Unix
B : Syntax trees
D : Prefix notation
B : Syntax analysis
C : seek time
A : is in the TLB
B : has data in it
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : key
B : value
C : bit value
D : constant
A : Compiler
B : Interpreter
C : Assembler
D : Loader

D : expanding macro
A : file extension
B : file identifier
C : file name
A : error
B : protection
D : access

A : START
B : BEGIN
C : MACRO
A : write ahead
B : read ahead
C : free-behind
D : add-front
B : LRU
C : FIFO
in hardware?
A : Counters
B : RAM & Registers
D : Registers
D : PL domain only
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : translator
A : Bit tables
C : Indexing
D : Free Block List
A : Second pass
B : First pass
C : Zeroth pass
A : compilation
B : execution
C : loading
D : linking
D : resources
A : Indexed files
B : Direct files
A : Bit tables
C : Indexing
D : Free Block List
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : minimum
B : average
C : maximum
D : approximate
because
A : Absolute Loader
B : Loader
C : Linker
D : Assembler




A : wait queue
B : ready queue
C : cpu
B : page-fault rate
C : hit ratio

as
A : waiting time
B : turnaround time
C : response time
D : throughput
called
A : demand paging
B : virtual memory
A : all process
C : parent process
D : init process

A : segmentation
B : swapping
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : Identifier
C : Integer Literal
A : Text editor
B : Assembler
C : Linker
D : Loader
A : SJF-P
B : FCFS
C : RR
D : Priority
A : FCFS
B : SJF
C : RR
D : priority

A : Dos
B : Unix
C : System software
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : both 1 & 2
D : function
A : magnetic disks
C : assemblies
D : cylinders
A : any language
C : c language
C : lexical errors
concerned with

B : Compaction
D : Division
C : <macro name>
D : <call macro>
object program
D : Both 1 & 2
D : Both 1 & 2

D : something else
C : process
suspended is called
B : Syntax analysis
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
A : works well

A : Identifier
B : Number
C : Keyword
D : operator
D : no error occurs




program
D : data dependant
A : compiler
B : assembler
C : loader
D : interpreter
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size
A : Bit tables
C : Indexing
D : Free Block List
D : translator
of the disk.
A : Bit tables
C : Indexing
D : Free Block List




A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
scheduler?
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
A : assembler
B : compiler
C : loader
D : interpreter
A : frame bit
B : page number
C : page offset
D : frame offset
A : object code
D : machine code
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : job queue
B : ready queue
C : execution queue
D : process queue
first?
D : Round Robin
print document ?
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
as
A : seek time
C : access time
D : Transfer time
of computer system
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler

D : Both 1 & 3
A : Machine code
D : A parse tree
A : Parser
C : Code generator
D : critical ratio
A : file extension
B : file identifier
C : file name
A : START
B : BEGIN
C : MACRO
A : procedure
B : subroutine
C : macro
C : seek time
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : error
B : protection
D : access
C : seek time
A : Bit tables
C : Indexing
D : Free Block List
because
A : Indexed files
B : Direct files
B : Syntax analysis
A : Second pass
B : First pass
C : Zeroth pass
A : minimum
B : average
C : maximum
D : approximate
A : write ahead
B : read ahead
C : free-behind
D : add-front
D : resources
A : START
B : END
C : ORIGIN
D : PL domain only
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : compilation
B : execution
C : loading
D : linking
in hardware?
A : Counters
B : RAM & Registers
D : Registers
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
B : LRU
C : FIFO
D : translator




A : END
B : ENDS
C : MEND
D : ENDD
A : entire thread
D : entire process
A : segmentation
B : swapping

A : SJF-P
B : FCFS
C : RR
D : Priority
B : Syntax trees
D : Prefix notation
A : macro prototype
D : macro call
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : code generation
C : syntax analysis
A : Interrupts
B : Memory mapping
D : DMA
B : control program
D : All
B : Logical I/O
C : Device I/O
C : instruction
D : Opcodes
A : Identifiers
B : Constants
C : Keywords
concerned with
B : statement
C : Numeric data
D : ASCII data
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : YACC
B : BISON
C : FLEX
D : Iburg
B : Syntax analysis
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : Indexed files
B : Direct files
A : is in the TLB
B : has data in it
A : key
B : value
C : bit value
D : constant
D : priority
A : system software
C : both 1 & 2
D : not a software
A : Bit table
C : Indexing
D : Free Block List
A : Dos
B : Unix
C : System software
A : works well
A : compiler
B : assembler
C : loader
D : interpreter
A : Identifier
B : Number
C : Keyword
D : operator
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Stack
B : Queue
C : Linked list
of the disk.
A : Bit tables
C : Indexing
D : Free Block List
D : data dependant
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
B : page size




program
D : no error occurs
A : Bit tables
C : Indexing
D : Free Block List
A : START
B : END
C : ORIGIN



Seat No -

Time : 1hr
Max Marks : 50
N.B
A : wait queue
B : ready queue
C : cpu

A : all process
C : parent process
D : init process
A : System call
B : API
C : library
D : shell
A : assembler
B : compiler
C : loader
D : interpreter
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
3
A : Identifier
C : Integer Literal
D : Both 1 & 3
B : code generation
C : syntax analysis
A : Stop
B : Return
C : OP
D : End
A : PS
B : TOP
C : fork
D : kill
A : FCFS
B : SJF
C : RR
D : priority
A : frame bit
B : page number
C : page offset
D : frame offset
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
A : object code
D : machine code
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : job queue
B : ready queue
C : execution queue
D : process queue
A : error
B : protection
D : access

D : Both 1 & 2
A : Indexed files
B : Direct files
performed by
B : Syntax analysis
page
A : is in the TLB
B : has data in it
A : file extension
C : file name
D : something else
D : expanding macro
A : magnetic disks
C : assemblies
D : cylinders
A : procedure
B : subroutine
C : macro
the jobs.
D : critical ratio
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Attributes
B : Protocol
C : Location
D : Ownership
C : both 1 & 2
D : function
C : seek time
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
A : compiler
B : assembler
C : loader
D : interpreter
D : translator
A : Bit tables
C : Indexing
D : Free Block List
A : minimum
B : average
C : maximum
D : approximate
B : Syntax analysis
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator




program

D : data dependant
time.
A : Indexed files
B : Direct files
A : Counters
B : RAM & Registers
D : Registers
specification.
A : START
B : END
C : ORIGIN
B : page size

called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : waiting time
B : turnaround time
C : response time
D : throughput
A : END
B : ENDS
C : MEND
D : ENDD
A : macro prototype
D : macro call
A : Left to right
C : Right to left
C : instruction
D : Opcodes
B : File system
in memory is called
A : demand paging
B : virtual memory

B : Syntax trees
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU

B : Compaction
D : Division
C : process

C : lexical errors
A : key
B : value
C : bit value
D : constant
A : USING
B : BALR
C : DROP
D : ORG

A : cpu
B : primary memory
A : any language
C : c language

A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
C : seek time
A : Bit table
C : Indexing
D : Free Block List
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

D : no error occurs
D : Both 1 & 2
D : PL domain only
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : Stack
B : Queue
C : Linked list
A : works well

D : resources
A : Second pass
B : First pass
C : Zeroth pass
A : compilation
B : execution
C : loading
D : linking
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
A : Machine code
D : A parse tree

Q.no 5. SJF can be
A : preemptive only
D : sequential
A : Interrupts
B : Memory mapping
D : DMA
A : frame bit
B : page number
C : page offset
D : frame offset
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : page-fault rate
C : hit ratio
A : SJF-P
B : FCFS
C : RR
D : Priority
A : System call
B : API
C : library
D : shell
A : Text editor
B : Assembler
C : Linker
D : Loader
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
B : control program
D : All

A : Hex code
B : Mnenonics
C : ASCII code
D : C Language
dynamic loading

C : SCAN
D : Circular SCAN
performed by
B : Syntax analysis

C : <macro name>
D : <call macro>
A : Source code
C : Target code
D : tokens
algorithm
algorithm
D : code generation

A : Paging
B : Demand paging
C : Segmentation
D : Swapping
D : priority
time?

A : Attributes
B : Protocol
C : Location
D : Ownership
A : Identifiers
B : Constants
C : Keywords
D : translator

specification.
A : START
B : END
C : ORIGIN



program
time.
A : Indexed files
B : Direct files
A : Counters
B : RAM & Registers
D : Registers
A : compiler
B : assembler
C : loader
D : interpreter
A : minimum
B : average
C : maximum
D : approximate
D : data dependant
B : page size
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

B : Syntax analysis
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing

A : all process
C : parent process
D : init process
A : segmentation
B : swapping
B : Syntax trees
track is known as
A : seek time
C : access time
D : Transfer time
D : Round Robin
A : Parser
C : Code generator
in memory is called
A : demand paging
B : virtual memory

A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj
A : entire thread

D : entire process
A : wait queue
B : ready queue
C : cpu
A : Left to right
C : Right to left
C : instruction
D : Opcodes
D : Both 1 & 3
A : FCFS
B : SJF
C : RR
D : priority
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : START
B : BEGIN
C : MACRO
A : file extension
C : file name
A : magnetic disks
C : assemblies
D : cylinders

D : Both 1 & 2

A : error
B : protection
D : access
the jobs.

D : critical ratio
A : Indexed files
B : Direct files
A : key
B : value
C : bit value
D : constant
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Dos
B : Unix
C : System software
D : a key & value
A : system software
C : both 1 & 2
D : not a software
A : Stack
B : Queue
C : Linked list
D : translator

D : resources
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only
A : Bit tables
C : Indexing
D : Free Block List
A : Second pass
B : First pass
C : Zeroth pass
A : works well
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
D : no error occurs
D : Both 1 & 2
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : compilation
B : execution
C : loading
D : linking
B : page size

A : Text editor
B : Assembler
C : Linker
D : Loader
A : Interrupts
B : Memory mapping
D : DMA

B : Logical I/O
C : Device I/O
B : File system
B : blocking I/O
D : synchronous I/O
A : job queue
B : ready queue
C : execution queue
D : process queue
A : frame bit
B : page number
C : page offset
D : frame offset
A : word proccessor
B : spreadsheet
D : Unix
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : control program
D : All
A : waiting time
B : turnaround time
C : response time
D : throughput
Q.no 19. A macro is
A : object code
D : machine code
C : seek time
A : any language
C : c language
B : statement
C : Numeric data
D : ASCII data
D : priority

C : lexical errors
A : Bit table
C : Indexing
D : Free Block List
C : seek time
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
A : USING
B : BALR
C : DROP
D : ORG
dynamic loading
time?
A : Source code
C : Target code
D : tokens

A : Identifiers
B : Constants
C : Keywords
A : Stack
B : Queue
C : Linked list
B : Syntax analysis
specification.
A : START
B : END
C : ORIGIN

time.
A : Indexed files
B : Direct files
A : Counters
B : RAM & Registers
D : Registers
A : compiler
B : assembler
C : loader
D : interpreter
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
D : data dependant
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these



program
A : minimum
B : average
C : maximum
D : approximate

B : page size
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer
A : FCFS
B : SJF
C : RR
D : priority
A : System call
B : API
C : library
D : shell
C : instruction
D : Opcodes
track is known as
A : seek time
C : access time
D : Transfer time
in memory is called
A : demand paging
B : virtual memory
A : macro prototype
D : macro call

occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
A : Stop
B : Return
C : OP
D : End
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Swapping
B : Spooling
C : Semaphore
D : Scheduler
Q.no 12. SJF can be
A : preemptive only
D : sequential

B : page-fault rate
C : hit ratio

A : Dos
B : Unix
C : System software
page
A : is in the TLB
B : has data in it
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : procedure
B : subroutine
C : macro
performed by
B : Syntax analysis
algorithm
algorithm
D : something else
B : Compaction
D : Division

space of a process
A : file extension
C : file name
A : Parser
B : Optimizer
C : Scanner
D : Loader
C : process
A : Attributes
B : Protocol
C : Location
D : Ownership
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
A : cpu
B : primary memory
C : <macro name>
D : <call macro>
A : Stack
B : Queue
C : Linked list
A : Second pass
B : First pass
C : Zeroth pass
B : Syntax analysis
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3

A : compilation
B : execution
C : loading
D : linking
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
D : Both 1 & 2
A : Bit tables
C : Indexing
D : Free Block List
specification.
A : START
B : END
C : ORIGIN
D : no error occurs
A : works well

A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Bit tables
C : Indexing
D : Free Block List
D : PL domain only

A : word proccessor
B : spreadsheet
D : Unix

A : all process
C : parent process
D : init process
A : Machine code
D : A parse tree
D : Round Robin
B : Logical I/O
C : Device I/O
A : Left to right
C : Right to left
A : Hex code
B : Mnenonics
C : ASCII code
D : C Language

D : Both 1 & 3
A : SJF-P
B : FCFS
C : RR
D : Priority
A : segmentation
B : swapping

A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : END
B : ENDS
C : MEND
D : ENDD
A : assembler
B : compiler
C : loader
D : interpreter
B : control program
D : All
D : expanding macro
B : statement
C : Numeric data
D : ASCII data
C : seek time
time?
D : code generation
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : Identifiers
B : Constants
C : Keywords
A : START
B : BEGIN
C : MACRO

D : a key & value

D : Both 1 & 2
A : Bit table
C : Indexing
D : Free Block List
A : Swapping
B : Paging
C : Segmentation
D : Demand paging
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : minimum
B : average
C : maximum
D : approximate
A : compiler
B : assembler
C : loader
D : interpreter
time.
A : Indexed files
B : Direct files
D : data dependant

D : resources
A : Counters
B : RAM & Registers
D : Registers
D : translator
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these
specification.
A : START
B : END
C : ORIGIN
A : Bit tables
C : Indexing
D : Free Block List
B : code generation
C : syntax analysis
A : Double buffer
B : Single buffer
C : Linear buffer
D : Circular buffer

A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : frame bit
B : page number
C : page offset
D : frame offset
A : PS
B : TOP
C : fork
D : kill
A : job queue
B : ready queue
C : execution queue
D : process queue
B : File system
A : wait queue
B : ready queue
C : cpu
Q.no 12. SJF can be
A : preemptive only
D : sequential
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
B : page-fault rate
C : hit ratio
Q.no 16. A macro is
occurs?
A : FIFO
B : LRU
C : LFU
D : NRU
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : file extension
C : file name
A : Source code
C : Target code
D : tokens
A : Indexed files
B : Direct files
A : error
B : protection
D : access
A : magnetic disks
C : assemblies
D : cylinders
A : system software
C : both 1 & 2
D : not a software
the jobs.
D : critical ratio
C : both 1 & 2
D : function
A : any language
C : c language
D : priority
C : seek time
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : cpu
B : primary memory
Belady’s Anomaly?
B : LRU
C : FIFO

A : Stack
B : Queue
C : Linked list
A : Bit tables
C : Indexing
D : Free Block List
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : works well
A : Second pass
B : First pass
C : Zeroth pass
B : page size
D : no error occurs



program
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
D : Both 1 & 2
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler

D : PL domain only
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Bit tables
C : Indexing
D : Free Block List
A : Bit tables
C : Indexing
D : Free Block List
A : object code
D : machine code

C : instruction
D : Opcodes
A : segmentation
B : swapping
A : Interrupts
B : Memory mapping
D : DMA
D : Round Robin
A : FCFS
B : SJF
C : RR
D : priority

A : System call
B : API
C : library
D : shell
B : Syntax trees

A : Parser
C : Code generator
A : Left to right
C : Right to left
A : SJF-P
B : FCFS
C : RR
D : Priority

in memory is called
A : demand paging
B : virtual memory
A : waiting time
B : turnaround time
C : response time
D : throughput

C : process
D : something else

C : <macro name>
D : <call macro>
A : Compiler
B : Interpreter
C : Assembler
D : Loader
A : Reduce - Reduce
B : Shift - Reduce
C : Shift - Shift
D : Both A and B
A : Paging
B : Demand paging
C : Segmentation
D : Swapping
C : seek time
time?
A : YACC
B : BISON
C : FLEX
D : Iburg
A : Dos
B : Unix
C : System software
D : code generation
C : SCAN
D : Circular SCAN
B : Compaction
D : Division
D : expanding macro

A : minimum
B : average
C : maximum
D : approximate
D : translator
A : compiler
B : assembler
C : loader
D : interpreter
called
A : Ambiguous
B : Unambiguous
C : Regular
D : None of these

specification.
A : START
B : END
C : ORIGIN

A : Counters
B : RAM & Registers
D : Registers
time.
A : Indexed files
B : Direct files
D : data dependant
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator

D : resources
D : PL domain only
performed by
A : Absolute Loader
B : Loader
C : Linker
D : Assembler
A : Text editor
B : Assembler
C : Linker
D : Loader
B : Logical I/O
C : Device I/O
Q.no 3. A macro is
A : Exceptions
B : Signal handling
C : Interrupts
D : DMA
A : word proccessor
B : spreadsheet
D : Unix
A : Myfile.e
B : Myfile.yy.c
C : Myfile.lex
D : Myfile.obj

A : all process
C : parent process
D : init process
A : macro prototype
D : macro call

A : Stop
B : Return
C : OP
D : End
B : control program
D : All
track is known as
A : seek time
C : access time
D : Transfer time
A : Dispatcher
B : interrupt
C : scheduler
D : interpreter
called as
A : Polling
B : Inspection
C : Reviewing
D : Echoing
A : Assembler
B : Linking loader
C : Cross compiler
D : Load and Go

A : Machine code
D : A parse tree
B : statement
C : Numeric data
D : ASCII data
A : procedure
B : subroutine
C : macro
algorithm
algorithm
space of a process
A : magnetic disks
C : assemblies
D : cylinders
C : lexical errors
page
A : is in the TLB
B : has data in it

A : Identifiers
B : Constants
C : Keywords
A : key
B : value
C : bit value
D : constant

D : priority
A : START
B : BEGIN
C : MACRO
A : USING
B : BALR
C : DROP
D : ORG
A : system software
C : both 1 & 2
D : not a software
A : LOOK
B : SCAN
C : C-SCAN
D : C-LOOK
A : Parser
B : Optimizer
C : Scanner
D : Loader
A : write ahead
B : read ahead
C : free-behind
D : add-front
A : Lex
B : Yacc
C : Iburg
D : both 1 & 3
A : Second pass
B : First pass
C : Zeroth pass
D : no error occurs
A : Stack
B : Queue
C : Linked list
D : Both 1 & 2

A : Bit tables
C : Indexing
D : Free Block List
Belady’s Anomaly?
B : LRU
C : FIFO
A : Bit tables
C : Indexing
D : Free Block List
A : compilation
B : execution
C : loading
D : linking
B : Syntax analysis
B : page size
A : Bit tables
C : Indexing
D : Free Block List




program
A : works well
category of 'var1 '
A : Identifier
B : Number
C : Keyword
D : operator
TatyaVinchu Original
TatyaVinchu s'
System Programing Operating System
Viva Questions
A list of top frequently asked SPOS viva questions and

answers are given below.
1) What is an operating system?
The operating system is a software program that
facilitates computer hardware to communicate and
operate with the computer software. It is the most
important part of a computer system without it
computer is just like a box.
2) What is the main purpose of an operating system?
There are two main purposes of an operating system:
It is designed to make sure that a computer system
performs well by managing its computational
activities.
It provides an environment for the development and
execution of programs.
3) What are the different operating systems?
Batched operating systems
Distributed operating systems

Timesharing operating systems
Multi-programmed operating systems
Real-time operating systems
4) What is a socket?
A socket is used to make connection between two
applications. Endpoints of the connection are called
socket.
5) What is a real-time system?
Real-time system is used in the case when rigid-time
requirements have been placed on the operation of a
processor. It contains a well defined and fixed time
constraints.
6) What is kernel?
Kernel is the core and most important part of a
computer operating system which provides basic
services for all parts of the OS.
7) What is monolithic kernel?
A monolithic kernel is a kernel which includes all
operating system code is in single executable image.
8) What do you mean by a process?
An executing program is known as process. There are
two types of processes:
Operating System Processes
User Processes
9) What are the different states of a process?
A list of different states of process:
New Process
Running Process
Waiting Process
Ready Process
Terminated Process
10) What is the difference between micro kernel and
macro kernel?
Micro kernel: micro kernel is the kernel which runs
minimal performance affecting services for operating
system. In micro kernel operating system all other
operations are performed by processor.
Macro Kernel: Macro Kernel is a combination of
micro and monolithic kernel.
11) What is the concept of reentrancy?
It is a very useful memory saving technique that is
used for multi-programmed time sharing systems. It
provides functionality that multiple users can share a
single copy of program during the same period.
It has two key aspects:
The program code cannot modify itself.
The local data for each user process must be stored
separately.
12) What is the difference between process and
program?
A program while running or executing is known as a
process.
13) What is the use of paging in operating system?
Paging is used to solve the external fragmentation
problem in operating system. This technique ensures
that the data you need is available as quickly as

possible.
14) What is the concept of demand paging?
Demand paging specifies that if an area of memory is
not currently being used, it is swapped to disk to
make room for an application's need.
15) What is the advantage of a multiprocessor
system?
As many as processors are increased, you will get the
considerable increment in throughput. It is cost
effective also because they can share resources. So,
the overall reliability increases.
16) What is virtual memory?
Virtual memory is a very useful memory
management technique which enables processes to
execute outside of memory. This technique is
especially used when an executing program cannot fit
in the physical memory.
17) What is thrashing?
Thrashing is a phenomenon in virtual memory
scheme when the processor spends most of its time in
swapping pages, rather than executing instructions.
18) What are the four necessary and sufficient
conditions behind the deadlock?
These are the 4 conditions:
1) Mutual Exclusion Condition: It specifies that the
resources involved are non-sharable.
2) Hold and Wait Condition: It specifies that there
must be a process that is holding a resource already
allocated to it while waiting for additional resource
that are currently being held by other processes.
3) No-Preemptive Condition: Resources cannot be

taken away while they are being used by processes.
4) Circular Wait Condition: It is an explanation of the
second condition. It specifies that the processes in the
system form a circular list or a chain where each
process in the chain is waiting for a resource held by
next process in the chain.
19) What is a thread?
A thread is a basic unit of CPU utilization. It consists
of a thread ID, program counter, register set and a
stack.
20) What is FCFS?
FCFS stands for First Come, First Served. It is a type of
scheduling algorithm. In this scheme, if a process
requests the CPU first, it is allocated to the CPU first.
Its implementation is managed by a FIFO queue.
21) What is SMP?
SMP stands for Symmetric MultiProcessing. It is the
most common type of multiple processor system. In
SMP, each processor runs an identical copy of the
operating system, and these copies communicate with
one another when required.
22) What is RAID? What are the different RAID levels?
RAID stands for Redundant Array of Independent
Disks. It is used to store the same data redundantly to
improve the overall performance.
Following are the different RAID levels:
RAID 0 - Stripped Disk Array without fault tolerance
RAID 1 - Mirroring and duplexing
RAID 2 - Memory-style error-correcting codes
RAID 3 - Bit-interleaved Parity

RAID 4 - Block-interleaved Parity
RAID 5 - Block-interleaved distributed Parity
RAID 6 - P+Q Redundancy
23) What is deadlock? Explain.
Deadlock is a specific situation or condition where
two processes are waiting for each other to complete
so that they can start. But this situation causes hang
for both of them.
24) Which are the necessary conditions to achieve a
deadlock?
There are 4 necessary conditions to achieve a
deadlock:
Mutual Exclusion: At least one resource must be held
in a non-sharable mode. If any other process requests
this resource, then that process must wait for the
resource to be released.
Hold and Wait: A process must be simultaneously
holding at least one resource and waiting for at least
one resource that is currently being held by some
other process.
No preemption: Once a process is holding a resource (
i.e. once its request has been granted ), then that
resource cannot be taken away from that process
until the process voluntarily releases it.
Circular Wait: A set of processes { P0, P1, P2, . . ., PN }
must exist such that every P[ i ] is waiting for P[ ( i + 1
) % ( N + 1 ) ].
Note: This condition implies the hold-and-wait
condition, but it is easier to deal with the conditions if
the four are considered separately.
25) What is Banker's algorithm?

Banker's algorithm is used to avoid deadlock. It is the
one of deadlock-avoidance method. It is named as
Banker's algorithm on the banking system where
bank never allocates available cash in such a manner
that it can no longer satisfy the requirements of all of
its customers.
26) What is the difference between logical address
space and physical address space?
Logical address space specifies the address that is
generated by CPU. On the other hand physical
address space specifies the address that is seen by the
memory unit.
27) What is fragmentation?
Fragmentation is a phenomenon of memory wastage.
It reduces the capacity and performance because
space is used inefficiently.
28) How many types of fragmentation occur in
Operating System?
There are two types of fragmentation:
Internal fragmentation: It is occurred when we deal
with the systems that have fixed size allocation units.
External fragmentation: It is occurred when we deal
with systems that have variable-size allocation units.
29) What is spooling?
Spooling is a process in which data is temporarily
gathered to be used and executed by a device,
program or the system. It is associated with printing.
When different applications send output to the
printer at the same time, spooling keeps these all jobs
into a disk file and queues them accordingly to the

printer.
30) What is the difference between internal
commands and external commands?
Internal commands are the built-in part of the
operating system while external commands are the
separate file programs that are stored in a separate
folder or directory.
31) What is semaphore?
Semaphore is a protected variable or abstract data
type that is used to lock the resource being used. The
value of the semaphore indicates the status of a
common resource.
There are two types of semaphore:
Binary semaphores
Counting semaphores
32) What is a binary Semaphore?
Binary semaphore takes only 0 and 1 as value and
used to implement mutual exclusion and synchronize
concurrent processes.
33) What is Belady's Anomaly?
Belady's Anomaly is also called FIFO anomaly.
Usually, on increasing the number of frames allocated
to a process virtual memory, the process execution is
faster, because fewer page faults occur. Sometimes,
the reverse happens, i.e., the execution time increases
even when more frames are allocated to the process.
This is Belady's Anomaly. This is true for certain page
reference patterns.
34) What is starvation in Operating System?
Starvation is Resource management problem. In this

problem, a waiting process does not get the resources
it needs for a long time because the resources are
being allocated to other processes.
35) What is aging in Operating System?
Aging is a technique used to avoid the starvation in
resource scheduling system.
36) What are the advantages of multithreaded
programming?
A list of advantages of multithreaded programming:
Enhance the responsiveness to the users.
Resource sharing within the process.
Economical
Completely utilize the multiprocessing architecture.
37) What is the difference between logical and
physical address space?
Logical address specifies the address which is
generated by the CPU whereas physical address
specifies to the address which is seen by the memory
unit.
After fragmentation
38) What are overlays?
Overlays makes a process to be larger than the
amount of memory allocated to it. It ensures that only
important instructions and data at any given time are
kept in memory.
39) When does trashing occur?
Thrashing specifies an instance of high paging
activity. This happens when it is spending more time
paging instead of executing.

Basic OS Interview Questions
1. Why is the operating system important?
OS is the most essential and vital part of a computer
without which it is considered useless. It enables an
interface or acts like a link for interaction between
computer software that is installed on OS and users.
It also helps to communicate with hardware and also
maintains balance among hardware and CPU. It also
provides services to users and a platform for
programs to run on. It performs all common tasks
applications require.
2. What's the main purpose of an OS? What are the
different types of OS?
The main purpose of an OS is to execute user
programs and make it easier for users to understand
and interact with computers as well as run
applications. It is specially designed to ensure that the
computer system performs better by managing all
computational activities. It also manages computer
memory, processes, and operation of all hardware
and software.
Types of OS:
Batched OS (Example: Payroll System, Transactions
Process, etc.)
Multi-Programmed OS (Example: Windows O/S, UNIX
O/S, etc.)
Timesharing OS (Example: Multics, etc.)
Distributed OS (LOCUS, etc.)
Real-Time OS (PSOS, VRTX, etc.)
3. What are the benefits of a multiprocessor system?
A Multiprocessor system is a type of system that

includes two or more CPUs. It involves the processing
of different computer programs at the same time
mostly by a computer system with two or more CPUs
that are sharing single memory.
Benefits:
Such systems are used widely nowadays to improve
performance in systems that are running multiple
programs concurrently.
By increasing the number of processors, a greater
number of tasks can be completed in unit time.
One also gets a considerable increase in throughput
and is cost-effective also as all processors share the
same resources.
It simply improves the reliability of the computer
system.
4. What is RAID structure in OS? What are the
different levels of RAID configuration?
RAID (Redundant Arrays of Independent Disks) is a
method used to store data on Multiple hard disks
therefore it is considered as data storage
virtualization technology that combines multiple
hard disks. It simply balances data protection, system
performance, storage space, etc. It is used to improve
the overall performance and reliability of data
storage. It also increases the storage capacity of the
system and its main purpose is to achieve data
redundancy to reduce data loss.
Different levels of RAID
Nowadays, RAID is available in various schemes or
RAID level as given below:
RAID 0 - Non-redundant striping: This level is used to

increase the performance of the server.
RAID 1 - Mirroring and duplexing: This level is also
known as disk mirroring and is considered the
simplest way to implement fault tolerance.
RAID 2 - Memory-style error-correcting codes: This
level generally uses dedicated hamming code parity
I.e., a liner form of error correction code.
RAID 3 - Bit-interleaved Parity: This level requires a
dedicated parity drive to store parity information.
RAID 4 - Block-interleaved Parity: This level is similar
to RAID 5 but the only difference is that this level
confines all parity data to a single drive.
RAID 5 - Block-interleaved distributed Parity: This
level provides far better performance than disk
mirroring and fault tolerance.
RAID 6 - P+Q Redundancy: This level generally
provides fault tolerance for two drive failures.
5. What is GUI?
GUI (Graphical User Interface) is basically a type of
user interface that allows users to use graphics to
interact with OS. GUI is created because it is more
user-friendly, less complex, and easier to understand
rather than a command-line interface. Its main goal is
to increase efficiency and ease of use. Instead of
having to memorize commands, users can just click
on a button to simply execute the procedure.
Examples of GUI include Microsoft Windows, macOS,
Apple’s iOS, etc.
6. What is a Pipe and when it is used?
The pipe is generally a connection among two or
more processes that are interrelated to each other. It
is a mechanism that is used for inter-process

communication using message passing. One can
easily send information such as the output of one
program process to another program process using a
pipe. It can be used when two processes want to
communicate one-way i.e., inter-process
communication (IPC).
7. What are the different kinds of operations that are
possible on semaphore?
There are basically two atomic operations that are
possible:
Wait()
Signal()
8. What is a bootstrap program in OS?
It is generally a program that initializes OS during
startup i.e., first code that is executed whenever
computer system startups. OS is loaded through a
bootstrapping process or program commonly known
as booting. Overall OS only depends on the bootstrap
program to perform and work correctly. It is fully
stored in boot blocks at a fixed location on the disk. It
also locates the kernel and loads it into the main
memory after which the program starts its execution.
9. Explain demand paging?
Demand paging is a method that loads pages into
memory on demand. This method is mostly used in
virtual memory. In this, a page is only brought into
memory when a location on that particular page is
referenced during execution. The following steps are
generally followed:
Attempt to access the page.
If the page is valid (in memory) then continue

processing instructions as normal.
If a page is invalid then a page-fault trap occurs.
Check if the memory reference is a valid reference to
a location on secondary memory. If not, the process is
terminated (illegal memory access). Otherwise, we
have to page in the required page.
Schedule disk operation to read the desired page into
main memory.
Restart the instruction that was interrupted by the
operating system trap.
10. What do you mean by RTOS?
Real Time Operating System (RTOS) is an operating
system that is used for real-time applications i.e., for
those applications where data processing should be
done in a fixed and small measure of time. It
performs much better on tasks that are needed to be
executed within a short time. It also takes care of
execution, monitoring, and all-controlling processes.
It also occupies less memory and consumes fewer
resources.
Types of RTOS:
Hard Real-Time
Firm Real-Time
Soft Real-Time
RTOS is used in Air traffic control systems, Anti-lock
Brake Systems, and Heart pacemakers.
11. What do you mean by process synchronization?
Process synchronization is basically a way to
coordinate processes that use shared resources or
data. It is very much essential to ensure synchronized

execution of cooperating processes so that will
maintain data consistency. Its main purpose is to
share resources without any interference using
mutual exclusion. There are two types of process
synchronization:
Independent Process
Cooperative Process
12. What is IPC? What are the different IPC
mechanisms?
IPC (Interprocess Communication) is a mechanism
that requires the use of resources like a memory that
is shared between processes or threads. With IPC, OS
allows different processes to communicate with each
other. It is simply used for exchanging data between
multiple threads in one or more programs or
processes. In this mechanism, different processes can
communicate with each other with the approval of
the OS.
Different IPC Mechanisms:
Pipes
Message Queuing
Semaphores
Socket
Shared Memory
Signals
13. What is different between main memory and
secondary memory.
Main memory: Main memory in a computer is RAM
(Random Access Memory). It is also known as
primary memory or read-write memory or internal

memory. The programs and data that the CPU
requires during the execution of a program are
stored in this memory.
Secondary memory: Secondary memory in a
computer are storage devices that can store data and
programs. It is also known as external memory or
additional memory or backup memory or auxiliary
memory. Such storage devices are capable of storing
high-volume data. Storage devices can be hard drives,
USB flash drives, CDs, etc.
Primary MemorySecondary MemoryData can be
directly accessed by the processing unit.Firstly, data is
transferred to primary memory and after then routed
to the processing unit.It can be both volatile and non-
volatile in nature.It is non-volatile in nature.It is more
costly than secondary memory.It is more cost-
effective or less costly than primary memory.It is
temporary because data is stored temporarily.It is
permanent because data is stored permanently.In this
memory, data can be lost whenever there is a power
failure.In this memory, data is stored permanently
and therefore cannot be lost even in case of power
failure.It is much faster than secondary memory and
saves data that is currently used by the computer.It is
slower as compared to primary memory and saves
different kinds of data in different formats.It can be
accessed by data.It can be accessed by I/O channels.
14. What do you mean by overlays in OS?
Overlays is basically a programming method that
divides processes into pieces so that instructions that
are important and need can be saved in memory. It
does not need any type of support from the OS. It can
run programs that are bigger in size than physical
memory by only keeping only important data and

instructions that can be needed at any given time.
15. Write top 10 examples of OS?
Some of the top OS’s that are used mostly are given
below:
MS-Windows
Ubuntu
Mac OS
Fedora
Solaris
Free BSD
Chrome OS
CentOS
Debian
Android
Intermediate OS Interview Questions
16. What is virtual memory?
It is a memory management technique feature of OS
that creates the illusion to users of a very large (main)
memory. It is simply space where a greater number of
programs can be stored by themselves in the form of
pages. It enables us to increase the use of physical
memory by using a disk and also allows us to have
memory protection. It can be managed in two
common ways by OS i.e., paging and segmentation. It
acts as temporary storage that can be used along with
RAM for computer processes.
17. What is thread in OS?
Thread is a path of execution that is composed of a

program counter, thread id, stack, and set of registers
within the process. It is a basic unit of CPU utilization
that makes communication more effective and
efficient, enables utilization of multiprocessor
architectures to a greater scale and greater efficiency,
and reduces the time required in context switching. It
simply provides a way to improve and increase the
performance of applications through parallelism.
Threads are sometimes called lightweight
processes because they have their own stack but can
access shared data.
Multiple threads running in a process share: Address
space, Heap, Static data, Code segments, File
descriptors, Global variables, Child processes,
Pending alarms, Signals, and signal handlers.
Each thread has its own: Program counter, Registers,
Stack, and State.
18. What is a process? What are the different states of
a process?
The process is basically a program that is currently
under execution. The main function of an OS is to
manage and handle all of these processes. When a
program is loaded into the memory and it becomes a
process, it can be divided into four sections ─ stack,
heap, text, and data. There are two types of processes:
Operating System Processes
User Processes
States of Process:
Different states of the process through which process
goes are given below:
New State: In this state, a process is just created.

Running: In this state, the CPU starts working on the
process’s instructions.
Waiting: In this state, the process cannot run because
it just waits for some event to occur
Ready: In this state, the process has all resources
available that are required to run but it waits to get
assigned to a processor because CPUs are not working
currently on instructions passed by the process.
Terminate: In this state, the process is completed I.e.,
the process has finished execution.
19. What do you mean by FCFS?
FCFS (First Come First Serve) is a type of OS
scheduling algorithm that executes processes in the
same order in which processes arrive. In simple
words, the process that arrives first will be executed
first. It is non-preemptive in nature. FCFS scheduling
may cause the problem of starvation if the burst time
of the first process is the longest among all the jobs.
Burst time here means the time that is required in
milliseconds by the process for its execution. It is also
considered the easiest and simplest OS scheduling
algorithm as compared to others. Implementation of
FCFS is generally managed with help of the FIFO
(First In First Out) queue.
20. What is Reentrancy?
Reentrant is simply a function in which various
clients can use and shares a single copy of a program
during a similar period. This concept is generally
associated with OS code and does not deal with
concurrency. It has two major functions:
Program code cannot change or modify itself.
Local data for every client process needs to be stored

in different disks.
21. What is a Scheduling Algorithm? Name different
types of scheduling algorithms.
A scheduling algorithm is a process that is used to
improve efficiency by utilizing maximum CPU and
providing minimum waiting time to tasks. It simply
deals with the problem of deciding which of
outstanding requests is to be allocated resources. Its
main aim is to reduce resource starvation and to
ensure fairness amongst parties that are utilizing the
resources. In simple words, it is used to allocate
resources among various competing tasks.
Types of Scheduling Algorithm
There are different types of scheduling algorithms as
given below:
First-Come, First-Served (FCFS) Scheduling
Shortest-Job-Next (SJN) Scheduling
Priority Scheduling
Shortest Remaining Time
Round Robin(RR) Scheduling
Multiple-Level Queues Scheduling
First Come First Serve (FCFS)
Jobs are executed on first come, first serve basis.
It is a non-preemptive, pre-emptive scheduling
algorithm.
Easy to understand and implement.
Its implementation is based on FIFO queue.
Poor in performance as average wait time is high.
Shortest Job Next (SJN)

This is also known as shortest job first, or SJF
This is a non-preemptive, pre-emptive scheduling
algorithm.
Best approach to minimize waiting time.
Easy to implement in Batch systems where required
CPU time is known in advance.
Impossible to implement in interactive systems
where required CPU time is not known.
The processer should know in advance how much
time process will take.
Priority Based Scheduling
Priority scheduling is a non-preemptive algorithm
and one of the most common scheduling algorithms
in batch systems.
Each process is assigned a priority. Process with
highest priority is to be executed first and so on.
Processes with same priority are executed on first
come first served basis.
Priority can be decided based on memory
requirements, time requirements or any other
resource requirement.
Shortest Remaining Time
Shortest remaining time (SRT) is the preemptive
version of the SJN algorithm.
The processor is allocated to the job closest to
completion but it can be preempted by a newer ready
job with shorter time to completion.
Impossible to implement in interactive systems

where required CPU time is not known.
It is often used in batch environments where short
jobs need to give preference.
Round Robin Scheduling
Round Robin is the preemptive process scheduling
algorithm.
Each process is provided a fix time to execute, it is
called a quantum.
Once a process is executed for a given time period, it
is preempted and other process executes for a given
time period.
Context switching is used to save states of preempted
processes.
Multiple-Level Queues Scheduling
Multiple-level queues are not an independent
scheduling algorithm. They make use of other
existing algorithms to group and schedule jobs with
common characteristics.
Multiple queues are maintained for processes with
common characteristics.
Each queue can have its own scheduling algorithms.
Priorities are assigned to each queue.
For example, CPU-bound jobs can be scheduled in one
queue and all I/O-bound jobs in another queue. The
Process Scheduler then alternately selects jobs from
each queue and assigns them to the CPU based on the
algorithm assigned to the queue.
22. What is the difference between paging and
segmentation?
Paging: It is generally a memory management

technique that allows OS to retrieve processes from
secondary storage into main memory. It is a non-
contiguous allocation technique that divides each
process in the form of pages.
Segmentation: It is generally a memory management
technique that divides processes into modules and
parts of different sizes. These parts and modules are
known as segments that can be allocated to process.
PagingSegmentationIt is invisible to a programmer.It
is visible to a programmer.In this, the size of pages is
fixed.In this, the size of segments is not
fixed.Procedures and data cannot be separated in
paging.Procedures and data can be separated in
segmentation.It allows a cumulative total of virtual
address spaces to cross physical main memory.It
allows all programs, data, and codes to break up into
independent address spaces.It is mostly available on
CPUs and MMU chips.It is mostly available on
Windows servers that may support backward
compatibility, while Linux has limited support.It is
faster for memory access as compared to
segmentation.It is slower as compared to paging.In
this, OS needs to maintain a free frame.In this, OS
needs to maintain a list of holes in the main
memory.In paging, the type of fragmentation is
internal.In segmentation, the type of fragmentation is
external.The size of the page is determined by
available memory.The size of the page is determined
by the user.
23. What is thrashing in OS?
It is generally a situation where the CPU performs less
productive work and more swapping or paging work.
It spends more time swapping or paging activities
rather than its execution. By evaluating the level of
CPU utilization, a system can detect thrashing. It

occurs when the process does not have enough pages
due to which the page-fault rate is increased. It
inhibits much application-level processing that causes
computer performance to degrade or collapse.
24. What is the main objective of multiprogramming?
It refers to the ability to execute or perform more
than one program on a single processor machine.
This technique was introduced to overcome the
problem of underutilization of CPU and main
memory. In simple words, it is the coordination of
execution of various programs simultaneously on a
single processor (CPU). The main objective of
multiprogramming is to have at least some processes
running at all times. It simply improves the
utilization of the CPU as it organizes many jobs where
the CPU always has one to execute.
25. What do you mean by asymmetric clustering?

Asymmetric Clustering is generally a system in which
one of the nodes among all nodes is in hot standby
mode whereas the rest of all nodes run different
applications. It simply uses whole or entire hardware
resources therefore it is considered a more reliable
system as compared to others.
26. What is the difference between multitasking and
multiprocessing OS?
Multitasking: It is a system that allows more efficient
use of computer hardware. This system works on
more than one task at one time by rapidly switching
between various tasks. These systems are also known
as time-sharing systems.
Multiprocessing: It is a system that allows multiple or

various processors in a computer to process two or
more different portions of the same program
simultaneously. It is used to complete more work in a
shorter period of time.

MultitaskingMultiprocessingIt performs more than
one task at a time using a single processor.It performs
more than one task at a time using multiple
processors.In this, the number of CPUs is only one.In
this, the number of CPUs is more than one.It is more
economical.It is less economical.It is less efficient
than multiprocessing.It is more efficient than
multitasking.It allows fast switching among various
tasks.It allows smooth processing of multiple tasks at
once.It requires more time to execute tasks as
compared to multiprocessing.It requires less time for
job processing as compared to multitasking.
27. What do you mean by Sockets in OS?
The socket in OS is generally referred to as an
endpoint for IPC (Interprocess Communication). Here,
the endpoint is referred to as a combination of an IP
address and port number. Sockets are used to make
it easy for software developers to create network-
enabled programs. It also allows communication or
exchange of information between two different
processes on the same or different machines. It is
mostly used in client-server-based systems.
Types of Sockets
There are basically four types of sockets as given
below:
Stream Sockets
Datagram Sockets
Sequenced Packet Sockets

Raw Sockets
28. Explain zombie process?
Zombie process, referred to as a defunct process, is
basically a process that is terminated or completed
but the whole process control block is not cleaned up
from the main memory because it still has an entry in
the process table to report to its parent process. It
does not consume any of the resources and is dead,
but it still exists. It also shows that resources are held
by process and are not free.
29. What do you mean by cascading termination?
Cascading termination is a process termination in
which if the parent process is exiting or terminating
then the children process will also get terminated. It
does not allow the child to continue processing as its
parent process terminates. It is generally initiated by
OS.
30. What is starvation and aging in OS?
Starvation: It is generally a problem that usually
occurs when a process has not been able to get the
required resources it needs for progress with its
execution for a long period of time. In this condition,
low priority processes get blocked and only high
priority processes proceed towards completion
because of which low priority processes suffer from
lack of resources.
Aging: It is a technique that is used to overcome the
situation or problem of starvation. It simply increases
the priority of processes that wait in the system for
resources for a long period of time. It is considered
the best technique to resolve the problem of
starvation as it adds an aging factor to the priority of
each and every request by various processes for

resources. It also ensures that low-level queue jobs or
processes complete their execution.
Advanced OS Interview Questions
31. What do you mean by Semaphore in OS? Why is it
used?
Semaphore is a signaling mechanism. It only holds
one positive integer value. It is simply used to solve
the problem or issue of critical sections in the
synchronization process by using two atomic
operations i.e., wait() and signal().
Types of Semaphore
There are usually two types of semaphores as given
below:
Binary Semaphore
Counting Semaphore
Binary SemaphoreMutexIt allows various process
threads to get the finite instance of the resource until
resources are available.It allows various process
threads to get single shared resource only at a time.Its
functions are based upon signaling mechanisms.Its
functions are based upon a locking
mechanism.Binary semaphores are much faster as
compared to Mutex.Mutex is slower as compared to
binary semaphores.It is basically an integer.It is
basically an object.
32. What is Kernel and write its main functions?
The kernel is basically a computer program usually
considered as a central component or module of OS.
It is responsible for handling, managing, and
controlling all operations of computer systems and
hardware. Whenever the system starts, the kernel is
loaded first and remains in the main memory. It also

acts as an interface between user applications and
hardware.
Functions of Kernel:
It is responsible for managing all computer resources
such as CPU, memory, files, processes, etc.
It facilitates or initiates the interaction between
components of hardware and software.
It manages RAM memory so that all running
processes and programs can work effectively and
efficiently.
It also controls and manages all primary tasks of the
OS as well as manages access and use of various
peripherals connected to the computer.
It schedules the work done by the CPU so that the
work of each user is executed as efficiently as
possible.
33. What are different types of Kernel?
There are basically five types of Kernels as given
below:
Monolithic Kernel
MicroKernel
Hybrid Kernel
Nano Kernel
Exo Kernel
34. Write difference between micro kernel and
monolithic kernel?
MicroKernel: It is a minimal OS that executes only

important functions of OS. It only contains a near-
minimum number of features and functions that are
required to implement OS.
Example: QNX, Mac OS X, K42, etc.
Monolithic Kernel: It is an OS architecture that
supports all basic features of computer components
such as resource management, memory, file, etc.
Example: Solaris, DOS, OpenVMS, Linux, etc.
MicroKernelMonolithic KernelIn this software or
program, kernel services and user services are
present in different address spaces.In this software or
program, kernel services and user services are
usually present in the same address space.It is
smaller in size as compared to the monolithic
kernel.It is larger in size as compared to a
microkernel.It is easily extendible as compared to a
monolithic kernel.It is hard to as extend as compared
to a microkernel.If a service crashes, it does affect on
working of the microkernel.If a service crashes, the
whole system crashes in a monolithic kernel.It uses
message queues to achieve inter-process
communication.It uses signals and sockets to achieve
inter-process communication.
35. What is SMP (Symmetric Multiprocessing)?
SMP is generally referred to as computer architecture
in which the processing of programs is done by
multiple processors that share a common OS and
memory. SMP is very much required if you want to
take advantage of multiprocessor hardware. It simply
enables any processor to work on any of the tasks no
matter where data or resources for that particular
task are located in memory. These systems are more
reliable than single-processor systems.
36. What is a time-sharing system?

It is a system that allows more than one user to access
the resources of a particular system in many
locations. In simple words, it performs multiple tasks
on a single processor or CPU. As the name suggests, it
means to share time into multiple slots in several
processes. It also allows different users from different
locations to use a particular computer system at the
same time therefore it is considered one of the
important types of OS.
37. What is Context Switching?
Context switching is basically a process of saving the
context of one process and loading the context of
another process. It is one of the cost-effective and
time-saving measures executed by CPU the because it
allows multiple processes to share a single CPU.
Therefore, it is considered an important part of a
modern OS. This technique is used by OS to switch a
process from one state to another i.e., from running
state to ready state. It also allows a single CPU to
handle and control various different processes or
threads without even the need for additional
resources.
38. What is difference between Kernel and OS?
Kernel: Kernel is a system program that controls all
programs running on the computer. The kernel is
basically a bridge between the software and
hardware of the system.
Operating System: Operating system is a system
program that runs on the computer to provide an
interface to the computer user so that they can easily
operate on the computer.
KernelOSIt is considered a central component of OSIt
is considered system software.It is generally
responsible for converting user commands into

machine-level commands.It is generally responsible
for managing the resources of system.It simply acts as
an interface between hardware and applications.It
simply acts as an interface between hardware and
user.It also performs functions like process
management, file management, device management,
I/O communication, etc.It also performs functions like
providing security to data and files in the the system,
providing access controls to users, maintaining the
system privacy, etc.Its type includes Microkernel,
Monolithic kernel, etc.Its type includes Single and
Multiprogramming batch systems, Distributed OS,
Real-time OS.
39. What is difference between process and thread?
Process: It is basically a program that is currently
under execution by one or more threads. It is a very
important part of the modern-day OS.
Thread: It is a path of execution that is composed of
the program counter, thread id, stack, and set of
registers within the process.
ProcessThreadIt is a computer program that is under
execution.It is the component or entity of the process
that is the smallest execution unit.These are heavy-
weight operators.These are lightweight operators.It
has its own memory space.It uses the memory of the
process they belong to.It is more difficult to create a
process as compared to creating a thread.It is easier
to create a thread as compared to creating a process.It
requires more resources as compared to thread.It
requires fewer resources as compared to processes.It
takes more time to create and terminate a process as
compared to a thread.It takes less time to create and
terminate a thread as compared to a process.It
usually run-in separate memory space.It usually run-
in shared memory space.It does not share data.It

shares data with each other.It can be divided into
multiple threads.It can’t be further subdivided.
40. What are various sections of the process?
There are basically four sections in the process as
given below:
Stack: It is used for local variables and returns
addresses.
Heap: It is used for dynamic memory allocation.
Data: It stores global and static variables.
Code or text: It comprises compiled program code.
41. What is a deadlock in OS? What are the necessary
conditions for a deadlock?
Deadlock is generally a situation where a set of
processes are blocked as each process is holding
resources and waits to acquire resources held by
another process. In this situation, two or more
processes simply try to execute simultaneously and
wait for each to finish their execution because they
are dependent on each other. We can see a hand
problem in our system whenever a deadlock occurs
in a program. It is one of the common problems you
can see in multiprocessing.
Necessary Conditions for Deadlock
There are basically four necessary conditions for
deadlock as given below:
Mutual Exclusion
Hold and Wait
No Pre-emption
Circular Wait or Resource Wait
42. What do you mean by Belady’s Anomaly?

In the Operating System, process data is loaded in
fixed-sized chunks and each chunk is referred to as a
page. The processor loads these pages in the fixed-
sized chunks of memory called frames. Belady’s
Anomaly is a phenomenon in which if we increase
the number of frames in memory, then the number of
page faults also increases. It is generally experienced
when we use FIFO (First in First out) page
replacement algorithm.
43. What is spooling in OS?
Spooling simply stands for Simultaneous peripheral
operations online. It is referred to as putting data of
various I/O jobs in a buffer. Here, buffer means a
special area in memory or hard disk that can be
accessible to an I/O device. It is used for mediation
between a computer application and a slow
peripheral. It is very useful and important because
devices access or acquire data at different rates. This
operation also uses disk as a very large buffer and is
capable of overlapping I/O operations for one task
with processor operations for another task.
Question: What is an operating system?
Answer: It is a program that provides an interface
between the software and hardware of a computer.
In other words, an OS offers an environment for the
user to execute software using hardware.
Question: Name some functions of the operating
system.
Answer:
Memory management
Processor management
Device management
File management
Security
Job accounting
Control over system performance
Error detection
Communicate between user and software
Communication between software and hardware.
Question: Name the different operating systems.
Answer:
Batched operating system.
Interactive operating system
Multi-processing operating system
Multitasking operating system
Distributed operating system
Multi-programmed operating system
Real-Time operating system
Timesharing operating system
Question: List the basic functions of OS file
management.
Answer:
Create and delete directories and files.
Use secondary storage for creating backup files.
Map file in secondary storage.
Give support to file modification.
Question: What is booting?

Answer: It is a procedure of turning on the computer
by loading the kernel.
Question: What is the bootstrap program?
Answer: It is a program that resides in the kernel of
an operating system, and when we boot the system, it
is the first program that executes and stores the read-
only memory (ROM).
Question: What is the use of an operating system?
Answer: An operating system acts as a management
system between the system software and hardware,
and guides hardware to act according to the provided
software. It also controls the flow of the program and
provides an environment so the software can
communicate with system hardware.
Question: Define a multi-programming system.
Answer: In the multi-programming system, the
system keeps different programs in different parts of
the main memory simultaneously, and executes each
of those concurrently.
Question: Define multitasking systems.
Answer: In a multitasking system, programs are kept
in the main memory so the system can execute them
simultaneously.
Question: What are the time-sharing systems?
Answer: In time-sharing systems, multiple users can
use a specific program from different terminals at the
same time.
Operating System Interview Questions Set-II [11 to 20]
Question: Give the advantages of a multiprocessor

system.
Answer: Multi-processor, as the name suggests, uses
more than one processor. With an increase in the
processor count, the processing capability of the
system increases too.
Question: What is virtual memory?
Answer: Virtual memory is a memory management
method that helps to execute a process using primary
and secondary memories. Though the program gets
executed using the main memory, the resources and
pages load from the secondary memory.
Question: What is a kernel in an operating system?
Answer: It is an essential part of the operating
system, also known as the core of the OS. It is present
in the main memory of the system and loads before
any other part of the operating system. Every OS
consists of a kernel. For example, the Linux kernel is
one of the famous kernels, and Android also uses this
kernel.
Question: What are the main functions of a kernel in
an operating system?
Answer:
Process management
Resource management
Disk management
Memory management
Device management
Facilitate communication between hardware and
software.
Question: Define the 2 most popular types of kernels.

Answer: Though there are many types of kernels,
only 2 of them are the most popular:
Monolithic Kernel
MicroKernel
Monolithic Kernel: In this type of OS kernel, all the
user services and kernel services reside in the same
memory space. Old operating systems would use this
type of kernel. Some examples are Windows 95, 98,
and Unix. Linux also uses it.
MicroKernel: This type of kernel is small in size, and
all the user and kernel services reside in different
memory addresses. Operating systems like macOS
and Windows use microkernel.
Question: Give some disadvantages of Microkernel.
Answer:
Complex process management.
Debugging the messaging is complex.
Loss in performance because of the requirement of
more software.
Question: What is SMP?
Answer: It stands for Symmetric Multiprocessing
(SMP), and it is an architecture that contains multiple
processors to complete the process. All the processors
share a single memory.
Question: What is asymmetric clustering?
Answer: Asymmetric clustering occurs when the
server running the application finds some kind of
cluster. In asymmetric clustering, one server tries to
run the server application while others remain on

standby mode.
Question: Explain a thread?
Answer: It is a flow of execution through the process
code. A thread deals with the instruction to be
executed.
Question: What is demanding paging?
Answer: Demanding pages is a concept used by the
virtual machine. Only a part of the process needs to
be present in the main memory to execute some
process, which means that only a few pages will only
be present in the main memory at any time, and the
rest will be kept in the secondary memory.
Operating System Interview Questions Set-III [21 to
30]
Question: What is a process?
Answer: A program in execution is known as a
process.
Question: Name all the states of a Process.
Answer:
New
Running
Waiting
Ready
Terminate
Question: How is a thread different from a process?
Answer:
The process is independent, whereas a thread is not.
A thread can assist other threads, whereas the

process can not.
If one thread stops, the next thread starts executing,
but this is not the case with a process.
Question: What is a deadlock?
Answer: When 2 processes are trying to execute
simultaneously, and they are waiting for each other to
finish the execution, as they are dependent on each
other, this halt in execution is known as a deadlock.
When the deadlock occurs in the program, the system
usually freezes.
Question: What are the necessary conditions for a
deadlock?
Answer:
Mutual Exclusion
Hold and wait
No preemption
Circular wait
Question: What is starvation?
Answer: When a program is in process, and it does
not get all the resources to execute, because other
processes are using the same resources then this
problem of not getting all needed resources is known
as starvation.
Question: What is the difference between
multitasking and multi-processing operating systems?
Answer:
Multi-TaskingMulti-ProcessingThe operating system
executes more than one task simultaneously using a
single processor.The operating system executes more
than one task using multiple processors.Only one

processor executes the tasks.More than one processor
executes tasks.It takes a moderate amount of time to
execute all the tasks.It generally takes very little time
to execute all tasks.The processor shifts from one task
to another, which makes it look like it is executing
multiple tasks simultaneously, but, actually, here we
only have one processor for task execution.Here, we
have more than one processor. So multiple processes
can be executed at the same time.
Question: Differentiate between paging and
segmentation.
Answer:
PagingSegmentationDivides the virtual memory into
physical memory.Divides the physical memory to the
logical memory.Paging divides the memory into fixed
length.Segmentation divides the memory into
arbitrary memory length.Only loads information
about the process.Loads the full logical portion of the
page.Pages are smaller than segments.Segments are
generally larger.It’s the hardware that divides the
paging memory.The software divides the
segmentation memory.
Question: What is a command interpreter?
Answer: It is a text field I/O interface between the
user and the operating system. In the command
interpreter, the user gives input through the
keyboard using CLI commands. Command Prompt in
Windows and Terminal in Linux and macOS are
examples of the command interpreter.
Question: What is a daemon?
Answer: It stands for Disk and Execution monitor,
and it is a long-running background process that acts
on the request. The life cycle of the daemon
commences with the system booting and continues

until the system shuts down.
Operating System Interview Questions Set-IV [31 to
40]
Question: From where does the daemon originate and
how we classify it?
Answer: The term daemon originated with UNIX.
In UNIX, the daemon conventionally ends with ‘d’, for
example ‘inetd’, ‘nfsd’, httpd’, and ‘lpd’.
Question: What is the race condition?
Answer: It is a situation that occurs when different
operations are performed on the same data
simultaneously, and the outcome of the execution
depends on the order of the operations performed on
the data. Evidently, the race condition can provide an
undesirable outcome.
Question: What is process synchronization?
Answer: When the race condition occurs, it can lead
to an undesirable outcome. So to prevent the race
condition, we follow a process known as
synchronization. Here, we ensure that only one
process executes at a time.
Question: Explain PCB?
Answer: PCB stands for Process Control Block, and it
an operating system data structure, which can collect
and store information about the processes. It is also
known as the process descriptor.
As soon as a process gets created, the OS creates a
corresponding PCB to store the process status and
information. With each transition, OS updates the
PCB data structure.
Question: What is Semaphore?

Answer: It is a variable that is used to create a
synchronized process. There are 2 types of
semaphores:
Counting semaphore.
Binary semaphore.
Counting semaphore can have positive integer values,
and Binary semaphore can only have 1 and 0 as
variables.
Question: Explain FCFS and the main problem it
causes.
Answer: It stands for First Come First Serve (FCFS),
and it is a scheduling algorithm. According to this
algorithm, the CPU serves that process first, which
approaches it first. FCFS can cause the starvation
problem in which the process does not get the proper
resources.
Question: Name the different RAID levels.
Answer:
0 – Non-redundant striping
1 – Mirrored Disks
2 – Memory-style error-correcting codes
3 – Bit-interleaved Parity
4 – Block-interleaved Parity
5 – Block-interleaved distributed Parity
6 – P+Q Redundancy
Question: What is cache memory?
Answer: It is a volatile computer memory directly

attached to the register, which provides high-speed
data access to the processor.
Question: What is IPC?
Answer: IPC stands for Inter-Process Communication,
and it is a mechanism, in which various processes can
communicate with each other with the approval of
the OS.
Question: Name the Various IPC mechanisms.
Answer:
Sockets
Pipe
Shared Memory
Signals
Message Queues
Operating System Interview Questions Set-V [41 to 50]
Question: What is a context switch?
Answer: Context can be referred to as the data in the
register. A context switch is a procedure in which the
CPU changes from one task to another task.
Question: Give the difference between compiler and
Interpreter.
Answer: A compiler first reads all the code at once
and then tries to execute it, whereas an interpreter
reads the code line by line and simultaneously
executes it.
Question: What are sockets?
Answer: Sockets are the Inter-process
Communication mechanisms that are used to provide
point-to-point communication between 2 processes.

Sockets are often utilized in client-server applications
because many protocols, such as FTP, SMTP, and POP3
use sockets to implement the connection between
server and client.
Question: What do you understand by the main
memory and secondary memory?
Answer: Main memory is directly connected to the
computer processor, and it acts as a bridge between
computer processors and secondary memory. The
main objective of the main memory is to get the data
from the secondary memory and feed it to the
processor so that the appropriate actions could be
performed.
RAM and ROM are the 2 main memories used by the
system, whereas hard disk and other large-sized
memories form the secondary memory.
As compared to the secondary memory, the main
memory is straightforward and it is fast to access data
from the main memory. That’s why processors
directly communicate with the main memory.
Generally, the main memory does not store data
permanently. Instead, it only holds data for a specific
time and tries to give it to the processor for the
further execution process.
Question: Can there be a deadlock situation with a
single process?
Answer: No, to occur a deadlock situation, we need at
least 2 dependent processes. A deadlock situation can
only arise when these 4 conditions coincide:
Hold and Wait
No Preemption
Mutual Exclusion
Circular wait.
Question: What are interrupts?
Answer: These are the signals generated by the
external input devices to stop the ongoing active
process of the CPU. Interrupts use context switching
so the CPU can switch between the current process
and the new signal generated by the external device.
Interrupts help in prioritizing the process execution
of the CPU.
Question: What are zombie processes?
Answer: Formally, these processes are known
as defunct processes. If a child process is still in the
process table even after the parent process has been
executed, this scenario could cause a zombie process.
Even the kill commands do not have any effect on
these processes. If the Wait System Call read the exit
status of the process, then the zombie process would
remove from the process table.
Question: Explain pipe in OS?
Answer: Pipe is the method for exchanging
information between processes. Generally, pipe forms
a one-way communication, which means by using a
pipe, a process can only send information, such as
output or other parameters of the process to another
process.
For setting a two-way communication between 2
processes, we require 2 pipes for both directions.
Question: What is the limitation of pipes for two-way
communication between 2 processes?
Answer: If both the processes are the child process of

the same parent, then only two-way pipe
communication could be set between the processes.
Question: What do you know about the named pipe?
Answer: Generally, we use the un-named pipe to set
communication between the related process, but if
we want to communicate unrelated processes, then
we need to use named pipes. Like a traditional
unnamed pipe, named pipe is also a part of IPC
(Interprocess Communication), and its life remains
until the system is on.
Operating System Interview Questions Set-VI [51 to
60]
Question: Name the operations which are possible on
a semaphore.
Answer: We can only perform 2 operations on a
semaphore:
Wait, and
Signal.
Question: What do you know about mutex?
Answer: It is an abbreviation for Mutual Exclusion. It
is a userspace program object that helps multiple
threads to access the same resource, but not
simultaneously. The sole purpose of a mutex is to lock
a thread with a resource so the other threads can not
use the same resource until the first thread finish
executing.
Question: What is a critical section?
Answer: The program will behave oddly if program
parts perform concurrent access to the shared
resources. So to protect the shared resources of a
program, we create a protected section, which is

known as the critical section or critical region.
A critical section can only execute one process at a
time, and this eliminates the problems that can be
caused by concurrent accessing resources.
Question: What is process scheduling?
Answer: It is a routine followed by the process
manager of the system. In this, the process manager
can use different methods and strategies to remove a
particular running process or select another process
for the CPU.
Question: What is the difference between preemptive
and non-preemptive scheduling?
Answer: Scheduling is divided into 2 categories;
preemptive scheduling and non-preemptive
scheduling.
Preemptive SchedulingNon-Preemptive
SchedulingProcesses are allocated to the CPU for a
limited period.A process remains in the CPU till it gets
entirely executed.If there is a new process that comes
with high priority, then the ongoing CPU process has
to stop.Here the priority of the process does not
matter. The new process has to wait until the first
process finishes execution.There is a continuous
switching between the running and ready states of
the processes.This is not the case in non-preemptive
scheduling.Preemptive schedules the process on the
basis of their priority.Non-preemptive uses the
process burst time.There is a high probability that the
process with less priority will starve.Here process
with less burst time will starve.
Question: Name the various scheduling algorithms.
Answer:
First Come First Serve (FCFS).

Shortest Job First (SJF).
Priority Scheduling
Round Robin Scheduling
First Come First Serve: It follows the non-preemptive
scheduling, and here the process requesting first gets
the CPU.
Shortest Job First: It could be preemptive or non-
preemptive. In this algorithm, that process gets the
CPU that is closest to its execution. Here, CPU gives
priority to those jobs which have a low execution
time.
Priority Based Scheduling: It is also a preemptive
algorithm, and here CPU is allocated to those
processes first that have a high priority.
Round Robin Scheduling: It is a preemptive
scheduling algorithm, and here each process gets
equal time for execution.
Question: What are condition variables?
Answer: These are the synchronization objects, which
can set some conditions for threads, and if the
condition occurs then only the appropriate
operations can be performed by the threads.
If the situation does not arise, then the threads have
to wait for further execution. A condition variable is
often used with critical sections and slim readers,
where they help in binding and holding the threads.
Question: What is the reader-writer lock?
Answer: Reader-writer lock is used to prevent data
integrity. This lock allows concurrent access to read
operation, which means multiple threads can read

data simultaneously.
But it does not allow concurrent write, and if one
thread wants to modify data via writing, then all the
other threads will be blocked from reading or writing
data.
Question: What are the different types of memory
used by the system?
Answer:
Main memory, such as RAM and ROM.
Secondary memory, such as hard disk and e-drives.
Cache.
Internal process memory, such as registers.
Question: What is compaction?
Answer: The free memory of the system gets split into
smaller pieces when a process loads or is removed
from the memory. Compaction helps in accumulating
these small loose pieces of memory into one
substantial chunk so that more memory can be
allocated to other processes.
Operating System Interview Questions Set-VII [61 to
70]
Question: What is a page in OS?
Answer: A page can be defined as the smallest unit of
data, and it is a fixed-length contiguous block of
virtual memory.
Question: Explain page frames.
Answer: When a page is transferred from the
secondary memory to the main memory, then it
requires a fixed length of a continuous physical
memory block, known as a page frame. It is the job of

the operating system to map the pages in the page
frames.
Question: What is the difference between logical and
physical addresses?
Answer:
Logical AddressPhysical AddressThe CPU generates
it.It is the real address of the program in the
memory.A user can access the logical address of the
program.The physical address can be accessed
directly.CPU generates a logical address at the
execution time.It is generated by the Memory
Management Unit(MMU) at the creation time.
Question: What is the page fault?
Answer: It is an error that occurs when the CPU tries
to access a specific block of memory address that is
not present in the physical memory (RAM).
Question: What is thrashing?
Answer: It is a scenario when continuous page fault
and paging activities occur. Thrashing could lead to a
program collapse and degraded CPU performance.
Question: What do you know about the library?
Answer: A library is a collection of files that contains
subroutines, data, and other objects that can be used
by other programs.
Question: What is the difference between a program
and a process?
Answer:
ProgramProcessIt is a set of instructions that are
written in a specific programming language.It is an
instance of a program that is about to be executed by
one or many threads.A program is static in nature

that is present in the file.Processes are dynamic and
generated during execution time.Programs are
generally stored in secondary memory, which makes
them portable.Processes are not portable and they
reside in the main memory.The program can live in
the main memory for eternity.A process time period
is limited and it either executes or fails.Programs are
passives entities.Processes are active entities.
Question: What are APIs?
Answer: API stands for Application Program
Interface, and it is a collection of libraries and
subprograms. APIs are used to set communication
between 2 programs i.e. API provides a general way
of sending and receiving data between applications.
Question: What is Belady’s anomaly?
Answer: It is a situation that occurs in the OS when
there is an increase in page faults by the CPU because
additional memory has been introduced to the
system, which results in increasing page frames.
Question: What do you know about cascading
termination?
Answer: When a process finishes execution, then the
OS terminates the process via the exit system call.
Only the parent process can cause the termination of
its child processes, so when the parent process gets
entirely executed and terminated, then its child
process also gets terminated automatically.
This phenomenon of a process triggering termination
of another process is known as cascading termination
System Software LAB Viva Questions :-
1. Explain system software.
It consists of variety of programs that supports the

operation of the
computer. This software makes it possible for the
user to focus on the other problems to be solved with
out needing to know how the machine works
internally.
Eg: operating system, assembler, loader.
2. Give some applications of operating system.
to make the computer easier to use
to manage the resources in computer
process management
data and memory management
to provide security to the user.
Operating system acts as an interface between the
user and the system
Eg:windows,linux,unix,dos
3. Explain compiler and interpreter.
Compiler is a set of program which converts the
whole high level
language program to machine language program.
Interpreter is a set of programs which converts high
level language program to machine
language program line by line.
4. Explain loader.
Loader is a set of program that loads the machine
language translated by the translator into the main
memory and makes it ready for execution.
5. What is the need of MAR register?
MAR (memory address register) is used to store the

address of the
memory from which the data is to be read or to
which the data is to be written.
6. Draw SS instruction format.
opcode L B1 D1 B2 D2
0 7 8 15 16 19 20 31 32 35 36 47
It is a 6 byte instruction used to move L+I bytes data
fro the storage
location1 to the storage location2.
Storage location1 = D1+[B1]
Storage location2 = D2+[B2]
Eg: MOV 60,400(3),500(4)
7. Give any two differences between base relative
addressing and program counter
relative addressing used in SIC/XE.
8. Explain indirect addressing
In the case of immediate addressing the operand field
gives the memory
location. The word from the given address is fetched
and it gives the address of the operand.
Eg:ADD R5, [600]
Here the second operand is given in indirect
addressing mode. First the word in memory location
600 is fetched and which will give the address of the
operand.
9. Explain immediate addressing.
In this addressing mode the operand value is given

directly. There is no need to refer memory. The
immediate addressing is indicated by the prefix ‘#’.
Eg: ADD #5
In this instruction one operand is in accumulator and
the second operand is an immediate value the value 5
is directly added with the accumulator content and
the result is stored in accumulator.
10. List out any two CISC and RISC machine.
CISC –Power PC, Cray T3E
RISC – VAX,Pentium Pro architecture
11. Following is a memory configuration:
Address Value Register R
155
57
65
12. Following is a memory configuration:
Address Value Register R
496
57
62
13. What is the name of A and L register in SIC
machine and also specify its use.
A-accumulator: Used for arithmetic operation. i.e., in
the case of arithmetic operations one operand is in
the accumulator, and other operand may be an
immediate value, register operand or memory
content. The operation given in the instruction is
performed and the result is stored in the accumulator

register.
L-linkage register: It is used to store the return
address in the case of jump to subroutine (JSUB)
instructions.
14. What are the instruction formats used in SIC/XE
architecture? Give any one format.
Format 1 (1 byte), Format 2 (2 bytes), Format 3 (3
bytes) & Format 4(4
bytes)
Format 2:
844
OPCODE R1 R2
15. Consider the instructions in SIC/ XE programming
10 1000 LENGTH RESW 4
22
20 —– NEW WORD 3
16. What is the difference between the instructions
LDA # 3 and LDA THREE?
In the first instruction immediate addressing is used.
Here the value 3 is directly loaded into the
accumulator register. In the second instruction the
memory reference is used. Here the address(address
assigned for the symbol THREE) is loaded into the
accumulator register.
17. Differentiate trailing numeric and leading
separate numeric.
The numeric format is used to represent numeric
values with one digit per byte. In the numeric format
if the sign appears in the last byte it is known as the

trailing numeric. If the sign appears in a separate
byte preceding the first digit then it is called as
leading separate
numeric.
18. What are the addressing modes used in VAX
architecture?
Register direct; register deferred, auto increment and
decrement,
program counter relative, base relative, index
register mode and indirect addressing are the various
addressing modes in VAX architecture.
19. How do you calculate the actual address in the
case of register indirect with immediate index mode?
Here the target address is calculated using the
formula
T.A =(register) + displacement.
20. Write the sequence of instructions to perform the
operation BETA = ALPHA + 1 using SIC instructions.
LDA ALPHA
ADD ONE
STA BETA
…. ….
ALPHA RESW 1
BETA RESW 1
ONE RESW 1
21. Write the sequence of instructions to perform the
operation
BETA = ALPHA+5
using SIC/XE instructions.
23
LDA ALPHA
ADD #1
STA BETA
…. ….
ALPHA RESW 1
BETA RESW 1
22. What is the use of TD instruction in SIC
architecture?
The test device (TD) instruction tests whether the
addressed device is
ready to send or receive a byte of data. The condition
code is set to indicate the result of this test. Setting of
< means the device is ready to send or receive, and =
means the device is not ready.
23. What is the result of the following statement?
SUB 4(direct) to R (direct)
Here one operand is in the address location 4(direct
addressing) and the next operand is in the register
(register direct).
The resultant value is 9 –6 =3.
24. What is the result of the following statement?
Base relative addressing PC relative addressing Here
the Target address is calculated using the formula
Target address = Displacement + [B] B-base register
Here the target address is calculated using the

formula Target address = Displacement + [PC]
PC-program counter
Displacement lies between 0 to 4095 Displacement
lies between –2048 to
2047
21
ADD 6(immediate) to R (indirect)
Here 6 is the immediate data and the next value is
indirect data. ie, the register contains the address of
the operand. Here the address of the operand is 5 and
its corresponding value is 7.
6 + [R] = 6+ [5] = 6+ 7 =13
25. What is the value assign to the symbol NEW?
In the line 10 the address is 1000 and the instruction
is RESW 4.It
reserves 4 word (3 x 4 =12) areas for the symbol
LENGTH. hence 12 is added to the LOCCTR. Thus the
value of the symbol NEW is 1000+12 =100C.
ASSEMBLERS ::
26. Define the basic functions of assembler.
* Translating mnemonic operation codes to their
machine language
equivalents.
* Assigning machine addresses to symbolic labels
used by the
programmer.
27. What is meant by assembler directives? Give

example.
These are the statements that are not translated into
machine instructions, but they provide instructions to
assembler itself.
example START,END,BYTE,WORD,RESW and RESB.
28. What are forward references?
It is a reference to a label that is defined later in a
program.
Consider the statement
10 1000 STL RETADR
....
....
80 1036 RETADR RESW 1
The first instruction contains a forward reference
RETADR. If we attempt to translate the program line
by line, we will unable to process the statement in
line10 because we do not know the address that will
be assigned to RETADR .The address is assigned
later(in line 80) in the program.
29. What are the three different records used in
object program?
The header record, text record and the end record are
the three different records used in object program.
The header record contains the program name,
starting address and
length of the program.
Text record contains the translated instructions and
data of the program.
End record marks the end of the object program and

specifies the address in the program where execution
is to begin.
30. What is the need of SYMTAB (symbol table) in
assembler?
The symbol table includes the name and value for
each symbol in the
source program, together with flags to indicate error
conditions. Some times it may contain details about
the data area. SYMTAB is usually organized as a hash
table for efficiency of insertion and retrieval.
31. What is the need of OPTAB (operation code table)
in assembler?
The operation code table contains the mnemonic
operation code and its
machine language equivalent. Some assemblers it
may also contain information about instruction
format and length. OPTAB is usually organized as a
hash table, with mnemonic operation code as the key.
32. What are the symbol defining statements
generally used in assemblers?
‘EQU’-it allows the programmer to define symbols and
specify their
values directly. The general format is Symbol EQU
value
‘ORG’-it is used to indirectly assign values to symbols.
When this
statement is encountered the assembler resets its
location counter to the specified value. The general
format is ORG value
In the above two statements value is a constant or an

expression
involving constants and previously defined symbols.
33. Explain relocatable program.
An object program that contains the information
necessary to perform
required modification in the object code depends on
the starting location of the program during load time
is known as relocatable program.
34. Differentiate absolute expression and relative
expression.
If the result of the expression is an absolute value
(constant) then it is known as absolute expression.
Eg: BUFEND – BUFFER
If the result of the expression is relative to the
beginning of the program then it is known as relative
expression. label on instructions and data areas and
references to the location counter values are relative
terms.
Eg: BUFEND + BUFFER
35. Write the steps required to translate the source
program to object program.
Convert mnemonic operation codes to their machine
language
equivalents.
Convert symbolic operands to their equivalent
machine addresses
Build the machine instruction in the proper format.
Convert the data constants specified in the source

program into their internal machine representation
Write the object program and assembly listing.
36. What is the use of the variable LOCCTR (location
counter) in assembler?
This variable is used to assign addresses to the
symbols. LOCCTR is
initialized to the beginning address specified in the
START statement. After each source statement is
processed the length of the assembled instruction or
data area to be generated is added to LOCCTR and
hence whenever we reach a label in the source
program the current value of
LOCCTR gives the address associated with the label.
37. Define load and go assembler.
One pass assembler that generates their object code
in memory for
immediate execution is known as load and go
assembler. Here no object programmer is written out
and hence no need for loader.
38. What are the two different types of jump
statements used in MASM assembler?
Near jump
A near jump is a jump to a target in the same segment
and it is assembled by using a current
code segment CS.
Far jump
A far jump is a jump to a target in a different code
segment and it is assembled by using different
segment registers .
39. What is the use of base register table in AIX

assembler?
A base register table is used to remember which of
the general purpose
registers are currently available as base registers and
also the base addresses they contain.
.USING statement causes entry to the table and .DROP
statement
removes the corresponding table entry.
40. Differentiate the assembler directives RESW and
RESB.
RESW –It reserves the indicated number of words for
data area.
Eg: 10 1003 THREE RESW 1
In this instruction one word area (3 bytes) is reserved
for the symbol
THREE. If the memory is byte addressable then the
address assigned for the next symbol is 1006.
RESB –It reserves the indicated number of bytes for
data area.
Eg: 10 1008 INPUT RESB 1
In this instruction one byte area is reserved for the
symbol INPUT .Hence the address assigned for the
next symbol is 1009.
41. Define modification record and give its format.
This record contains the information about the
modification in the object code during program
relocation. the general format is Col 1 M
Col 2-7 Starting location of the address field to be

modified relative to the beginning of the program
Col 8-9 length of the address field to be modified in
half bytes.
42. Write down the pass numbers (PASS 1/ PASS 2) of
the following activities that occur in a two pass
assembler:
a. Object code generation
b. Literals added to literal table
c. Listing printed
d. Address location of local symbols
Answer:
a. Object code generation – PASS 2
b. Literals added to literal table – PASS 1
c. Listing printed – PASS2
d. Address location of local symbols – PASS1
43. What is meant by machine independent
assembler features?
The assembler features that do not depend upon the
machine
architecture are known as machine independent
assembler features.
Eg: program blocks, Literals.
44. How the register to register instructions are
translated in assembler?
In the case of register to register instructions the
operand field contains the register name. During the
translation first the object code is converted into its
corresponding machine language equivalent with the

help of OPTAB. Then the SYMTAB is searched for the
numeric equivalent of register and that value is
inserted into the operand field.
Eg: 125 1036 RDREC CLEAR X B410
B4-macine equivalent of the opcode CLEAR
10-numeric equivalent of the register X.
45. What is meant by external references?
Assembler program can be divided into many
sections known as control
sections and each control section can be loaded and
relocated independently of the others. If the
instruction in one control section need to refer
instruction or data in another control section.the
assembler is unable to process these references in
normal way. Such
references between control are called external
references.
46. Define control section.
A control section is a part of the program that
maintains its identity after assembly; each control
section can be loaded and relocated independently of
the others. Control sections are most often used for
subroutines. The major benefit of using control
sections is to increase flexibility.
47. What is the difference between the assembler
directive EXTREF and EXTDEF.
EXTDEF names external symbols that are defined in a
particular control
section and may be used in other sections. EXTREF

names external symbols that are referred in a
particular control section and defined in another
control section.
48. Give the general format of define record.
This record gives information about external symbols
that are defined in a particular control section. The
format is
Col 1 D
Col 2-7 name of external symbol defined in this
control section
Col 8-13 relative address of the symbol with in this
control section
Col 14-73 name and relative address for other
external symbols.
49. Give the use of assembler directive CSECT and USE
CSECT – used to divide the program into many control
sections
USE – used to divide the program in to many blocks
called program blocks
50. What is the use of the assembler directive START?
The assembler directive START gives the name and
starting address of
the program.
The format is
PN START 1000
Here
PN – Name of the program
1000 – Starting address of the program.

SS LAB VIVA Questions ::
LOADERS AND LINKERS ::
1. What are the basic functions of loaders?
Loading – brings the object program into memory for
execution
Relocation – modifies the object program so that it
can be loaded at an address different from the
location originally specified
Linking – combines two or more separate object
programs and also
supplies the information needed to reference them.
2. Define absolute loader.
The loader, which is used only for loading, is known
as absolute loader.
e.g. Bootstrap loader
3. What is meant by bootstrap loader?
This is a special type of absolute loader which loads
the first program to be run by the computer. (usually
an operating system)
4. What are relative (relocative) loaders?
Loaders that allow for program relocation are called
relocating
(relocative) loaders.
5. What is the use of modification record?
Modification record is used for program relocation.
Each modification
record specifies the starting address and the length of

the field whose value is to be altered and also
describes the modification to be performed.
6. What are the 2 different techniques used for
relocation?
Modification record method and relocation bit
method.
7. Define Relocation bit method.
If the relocation bit corresponding to a word of object
code is set to 1, the program’s starting address is to be
added to this word when the program is relocated. Bit
value 0 indicates no modification is required.
8. Define bit mask.
The relocation bits are gathered together following
the length indicator in each text record and which is
called as bit mask. For e.g. the bit mask
FFC(111111111100) specifies that the first 10 words of
object code are to be modified during relocation.
9. What is the need of ESTAB?
It is used to store the name and address of the each
external symbol. It also indicates in which control
section the symbol is defined.
10. What is the use of the variable PROGADDR?
It gives the beginning address in memory where the
linked program is to be loaded. The starting address is
obtained from the operating system.
11. Write the two passes of a linking loader.
Pass1: assigns address to all external symbols
Pass2: it performs actual loading, relocation and
linking.
12. Define automatic library search.

In many linking loaders the subroutines called by the
program being
loaded are automatically fetched from the library,
linked with the main program and loaded. This
feature is referred to as automatic library search.
13. List the loader options INCLUDE &DELETE.
The general format of INCLUDE is INCLUDE
program_name (library name)
This command direct the loader to read the
designated object program
from a library and treat it as the primary loader
input.
The general format of DELETE command is
DELETE Csect-name
It instructs the loader to delete the named control
sections from the sets of programs loaded.
14. Give the functions of the linking loader.
The linking loader performs the process of linking
and relocation. It
includes the operation of automatic library search
and the linked programs are directly loaded into the
memory.
15. Define dynamic linking.
If the subroutine is loaded and linked to the program
during its first call (run time), then it is called as
dynamic loading or dynamic linking.
16. Write the advantage of dynamic linking.
It has the ability to load the routine only when they

are needed.
The dynamic linking avoids the loading of entire
library for each execution.
17. What is meant by static executable and dynamic
executable?
In static executable, all external symbols are bound
and ready to run. In dynamic executables some
symbols are bound at run time.
18. What is shared and private data?
The data divided among processing element is called
shared data. If the data is not shared among
processing elements then it is called private data.
19. Write the absolute loader algorithm.
Begin
Read Header record
Verify program name and length
Read first text record
While record type != ‘E’ do
Begin
Moved object code to specified location in memory
Read next object program record
End
Jump to address specified in End record
MACRO PROCESSORS ::
1. Define macro processor.
Macro processor is system software that replaces

each macro instruction with the corresponding group
of source language statements. This is also called as
expanding of macros.
2. What do macro expansion statements mean?
These statements give the name of the macro
instruction being invoked
and the arguments to be used in expanding the
macros. These statements are also known as macro
call.
3. What are the directives used in macro definition?
MACRO – it identifies the beginning of the macro
definition
MEND – it marks the end of the macro definition
4. What are the data structures used in macro
processor?
DEFTAB – the macro definitions are stored in a
definition table i.e. it contains a macro prototype and
the statements that make up the macro body.
NAMTAB – it is used to store the macro names and it
contains two
pointers for each macro instruction which indicate
the starting and end location of macro definition in
DEFTAB. it also serves as an index to DEFTAB
ARGTAB – it is used to store the arguments during the
expansion of macro invocations.
5. Define conditional macro expansion.
If the macro is expanded depends upon some
conditions in macro
definition (depending on the arguments supplied in

the macro expansion) then it is called as conditional
macro expansion.
6. What is the use of macro time variable?
Macro time variable can be used to store working
values during the macro expansion. Any symbol that
begins with the character & and then is not a macro
instruction parameter is assumed to be a macro time
variable.
7. What are the statements used for conditional
macro expansion?
IF-ELSE-ENDIF statement
WHILE-ENDW statement
8. What is meant by positional parameters?
If the parameters and arguments were associated
with each other
according to their positions in the macro prototype
and the macro invocation statement, then these
parameters in macro definitions are called as
positional parameters.
9. Consider the macro definition
#define DISPLAY (EXPR) Printf (“EXPR = %d\n”, EXPR)
Expand the macro instruction DISPLAY (ANS)
Ans.: Printf (“EXPR = %d\n”, ANS)
10. What are known as nested macro call?
The statement, in which a macro calls on another
macro, is called nested macro call. In the nested
macro call, the call is done by outer macro and the
macro called is the inner macro.
11. How the macro is processed using two passes?
Pass1: processing of definitions

Pass2:actual-macro expansion.
12. Give the advantage of line by line processors.
It avoids the extra pass over the source program
during assembling.
It may use some of the utility that can be used by
language translators so that can be loaded once.
13. What is meant by line by line processor?
This macro processor reads the source program
statements, process the
statements and then the output lines are passed to the
language translators as they are generated, instead of
being written in an expanded file.
14. Give the advantages of general-purpose macro
processors.
The programmer does not need to learn about a
macro facility for each compiler.
Overall saving in software development cost and
maintenance cost.
15. What is meant by general-purpose macro
processors?
The macro processors that are not dependent on any
particular
programming language, but can be used with a
variety of different languages are known as general
purpose macro processors.
Eg. The ELENA macro processor.
16. What are the important factors considered while
designing general purpose macro processors?
• comments
• grouping of statements
• tokens
• syntax used for macro definitions
17. What is the symbol used to generate unique
labels?
$ symbol is used in macro definition to generate
unique symbols. Each
macro expansion the $ symbol is replaced by $XX,
where XX is the alpha
numeric character.
18. How the nested macro calls are executed?
The execution of nested macro call follows the LIFO
rule. In case of nested macro calls the expansion of
the latest macro call is completed first.
19. Mention the tasks involved in macro expansion.
identify the macro calls in the program
the values of formal parameters are identified
maintain the values of expansion time variables
declared in a macro
expansion time control flow is organized
determining the values of sequencing symbols
expansion of a model statement is performed
20. How to design the pass structure of a macro
assembler?
To design the structure of macro-assembler, the
functions of macro
preprocessor and the conventional assembler are

merged. After merging, the functions are structured
into passes of the macro assembler.
TEXT EDITORS ::
1. Define interactive editor?
An interactive editor is a computer program that
allows a user to create and revise a target document.
The term document includes objects such as
computer programs, text, equations, tables, diagrams,
line art, and photographs any thing that one might
find on a printed page.
2. What are the tasks performed in the editing
process?
4 tasks
Select the part of the target document to be viewed
and manipulated.
Determine how to format this view on-line and how
to display it.
Specify and execute operations that modify the target
document.
Update the view appropriately.
3. What are the three categories of editor’s devices?
Text device/ String devices
Button device/Choice devices
Locator device
4. What is the function performed in editing phase?
In the actual editing phase, the target document is
created or altered with a set of operations such as
insert, delete, replace, move and copy.
5. Define Locator device?

Locator devices are two-dimensional analog-to-digital
converters that
position a cursor symbol on the screen by observing
the user’s movement of the device. The most common
such devices for editing applications are the mouse
and the data tablet.
6. What is the function performed in voice input
device?
Voice-input devices, which translate spoken words to
their textual
equivalents, may prove to be the text input devices of
the future. Voice recognizers are currently available
for command input on some systems.
7. What are called tokens?
The lexical analyzer tracks the source program one
character at a time by making the source program
into sequence of atomic units is called tokens.
8. Name some of typical tokens.
Identifiers, keywords, constants, operators and
punctuation symbols such as commas and
parentheses are typical tokens.
9. What is meant by lexeme?
The character that forms a token is said to be a
lexeme.
10. Mention the main disadvantage of interpreter.
The main disadvantage of interpreter is that the
execution time of
interpreted program is slower than that of a
corresponding compiled object program.
11. What is meant by code optimization?

The code optimization is designed to improve the
intermediate code,
which helps the object program to run faster and
takes less space.
12. What is error handler?
The error handler is used to check if there is an error
in the program. If any error, it should warn the
programmer by instructions to proceed from phase to
phase.
13. Name some of text editors.
line editors
stream editors
screen editors
word processors
structure editors
14. What for debug monitors are used?
Debug monitors are used in obtaining information for
localization of
errors.
15. Mention the features of word processors.
moving text from one place to another
merging of text
searching
word replacement
16. What are the phases in performing editing
process?
Traveling phase
Filtering phase
Formatting phase
Editing phase
17. Define traveling phase.
The phase specifies the region of interest. Traveling is
achieved using operations such as next screenful,
bottom, find pattern.
18. Filtering phase.
The selection of what is to be viewed and
manipulated in given by
filtering.
19. Editing phase
In this phase, the target document is altered with the
set of operations such as insert, delete, replace, move
and copy.
20. Define user interface?
User interface is one, which allows the user to
communicate with the
system in order to perform certain tasks. User
interface is generally designed in a computer to make
it easier to use.
21. Define input device?
Input device is an electromechanical device, which
accepts data from the outside world and translates
them into a form, which the computer can interpret.
22.Define output devices
Output devices the user to view the elements being

edited and the results of the editing operations.
23. What are the methods in Interaction language of a
text editor?
Typing –oriented or text command oriented method
Function key interfaces
menu oriented method
24. Define interactive debugging systems.
An interactive debugging system provides
programmers with facilities
that aid in the testing and debugging of programs.
Debugging functions and capabilities
Relationship with other parts of the system
User interface criteria.
25. Define editor structure.
The command language processor accepts input from
the users input
devices and analyzes the tokens and syntactic
structure of the commands.
26. Give the components of editor structure 4
components
Editing component
Traveling component
Viewing component
Display component
27. What are the basic types of computing
environments used in editor’s functions?
Editor’s function in three basic types of computing

environments
Time sharing
Stand-alone
Distributed
1. Define lex and yacc tools
Lex:- scanner that can identify those tokens
Yacc:- parser.yacc takes a concise description of a
grammar and produces a C routine that can parse
that grammar.
2. Give the structure of the lex program
Definition section- any intitial ‘c’ program code % %
Rules section- pattern and action separated by white
space %%
User subroutines section-concsit of any legal code.
3. The lexer produced by lex in a ‘c’ routine is called
yylex()
4. Explain yytext?
contains the text that matched the pattern.
5. The yacc produced by parser is called yyparse().
6. Why we have to include ‘y.tab.h’ in lex?
y.tab.h contains token definitions eg:- #define letter
258.
7. Explain the structure of a yacc program?
Defn section- declarations of the tokens used in the
grammar %%
The rules section-pattern action %%
Users subroutines section

8. Explain yyleng?
Yyleng-contains the length of the string our lexer
recognizes.
9. Features of unix
multitasking,mutiuser,online help facility,security,file
& process.
10. What is an internal command?give an example?
Command which is shell built-in eg:echo
11. What is an external command?give a example?
Command which resides in other directories-eg:cd in
/bin
12. What is an absolute path name?give an example?
A file name identification with respect to the root. Eg:-
/home/kumar/f1
13. Differentiate the commands cp and mv?
Cp- copy the files
mv- renaming the file.
14. Explain mkdir command?
Used to create a directory
Eg:mkdir m1,m2
15. What are tokens or terminal symbols?
Symbols that appear in the input are returned by the
lexer are terminal symbols.
SYSTEM Programming Viva Questions ::
16. What type of data structures is used by

shift/reduce parsing?
Stack.
17. Shell- it is a command interpreter
kernel- is the core of the operating system.
18. What is lexical analyzer?
Lex taking a set of descriptions of possible tokensand
producing a ‘C” routine is called a lexical analyzer
(or) lexer (or) scanner.
19. Define grammer?
The list of rules that define the relationship that the
program understands is a grammar.
20. What is symbol table?
The table of words is a simple symbol table,a
common structure in lex and yacc applications.
21. What is pseudo token
A pseudo token standing for unary minus, has no
associativity is at the highest precedence.
22. What does $$ represents?
$$ represents the value of the left hand side.
23. What are shell scripts?
Using a program, we can run more than one
command.
24. What is the usage of grep command?
Grep command is used to search a pattern in a
database.
25. What is exit status command?
Exit 0- return success,command executed

successfully.
Exit 1 – return failure.
26. What are daemons?
They are one system processes
27. Uname
tells you the name of the unix system you are using.
28. Umask
tells unix which permissions to give to files and
directories you create.
29. tty
displays the device name of your terminal
30. Vi editor
(visual editor)- used to write programs.
31. $ls-l
lists the attributes of a file.
32. What is an relative path name?
A file identification not with respect to the root.
Seat No -
PWD10271_DESIGN AND ANALYSIS OF ALGORITHMS

Time : 1hr
Max Marks : 50
N.B
Q.no 1. Problems that cannot be solved by any algorithm are called?
A : tractable problems
B : intractable problems
C : undecidable problems
D : decidable problems
Q.no 2. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
Q.no 3. With minimal weighted external path length obtained by an optimal set Huffman codes
are the applications of?
A : BST
B : MST
C : Binary Tree
D : Weighted Graph
Q.no 4. Two main measures for the efficiency of an algorithm are 1)time 2) space 3) lines of code
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
Q.no 5. Algorithm can be represented as
A : Pseudocode
B : Flowchart
C : None of the above
D : both 1and 2
Q.no 6. Example of O(n) algorithms is______________
A : Multiplying two numbers.
B : linear search
C : assigning a value to a variable
D : displaying some integer on console
Q.no 7. _____is the average number of steps that can be executed for given input
A : Average case
B : Best case
C : Worst case
D : Time complexity
Q.no 8. In the absence of a exit condition in a recursive function, the following error is given by?
A : Compile time error

B : Run time error
C : Logical error
D : No error
Q.no 9. Master theorem applies to recurrences of the form (a=1 and b>1) are two constants.
Select one:
A : T(N)=A.T(N/B)+F(N)
B : T(n)=n.T(n/2)+b.f(n)
C : T(N)=A.T(N-1)+B
D : T(N)=N.T(N-3)+B
Q.no 10. If a problem X is in NP and a polynomial time algorithm for X could also be used to
solve problem Y in polynomial time, then Y is also in NP
A : true
B : false
C:
D:
Q.no 11. Dijkstra’s Algorithm is used to solve ………. problems.
A : All pair shortest path
B : Single source shortest path
C : Network flow
D : Sorting
Q.no 12. Fill in the blank. The notion of correctness for approximation algorithms is
…………...straightforward
than it is for exact algorithms
A : More
B : Less
C:
D:
Q.no 13. 0 1 knapsack is based on which method?
A : greedy method
B : branch and bound
C : dynamic programming
D : divide and conquer
Q.no 14. Which of the following methods can be used to solve the Knapsack problem?
A : Brute force algorithm
B : Recursion
C : Dynamic programming
D : Brute force, Recursion and Dynamic Programming
Q.no 15. What approach is being followed in Floyd Warshall Algorithm?
A : Greedy Technique
B : Dynamic Programming
C : Linear Programming
D : Backtracking
Q.no 16. If t1 (n) = O(f(n)), t2 (n)= O(g(n)). Then t1 (n).t2 (n)=_____
A : O(f(n))
B : O(g(n))
C : O(f(n)g(n))
D : O(f(n)+ g(n))
Q.no 17. Which of the following problems should be solved using dynamic programming?
A : Mergesort
B : Binary search
C : Longest Common Subsequence
D : Quicksort
Q.no 18. Which of the following standard algorithms is not a Greedy algorithm?
A : Dijkstra's shortest path algorithm

B : Prim's algorithm
C : Kruskal algorithm
D : Bellmen Ford Shortest path algorithm
Q.no 19. When an algorithm is written in the form of a specific programming language, it
becomes a _________
A : Pseudocode
B : Programme
C:
D:
Q.no 20. Recursion is similar to which of the following?
A : Switch Case
B : Loop
C : If else
D : if elif else
Q.no 21. what are the basic rules of recursion
A : Each recursive call should be on a smaller instance of the same problem, that is, a smaller
subproblem
B : The recursive calls must eventually reach a base case, which is solved without further recursion.
C : both 1 and 2
D : Either 1 or 2
Q.no 22. Given items as {value,weight} pairs {{60,20},{50,25},{20,5}}. The capacity of knapsack is
40. Find the maximum value output assuming items to be divisible and nondivisible respectively.
A : 100, 80
B : 110, 70
C : 130, 110
D : 110, 80
Q.no 23. we can refere to the common sense/ intution while specifing the algorithm
A : true
B : false
C:
D:
Q.no 24. A problem in NP is NP-complete if
A : It can be reduced to the 3-SAT problem in polynomial time
B : The 3-SAT problem can be reduced to it in polynomial time
C : It can be reduced to any other problem in NP in polynomial time
D : some problem in NP can be reduced to it in polynomial time
Q.no 25. Which of the following branch and bound strategy leads to breadth first search?
A : Lifo Branch And Bound
B : Fifo Branch And Bound
C : Lowest Cost Branch And Bound
D : Highest Cost Branch And Bound
Q.no 26. What is the basic principle in Rabin Karp algorithm?
A : Sorting
B : Hashing
C : Augmenting
D : Dynamic Programming
Q.no 27. Choose the correct statement from the following.
A : Branch And Bound Isworst Method
B : Branch And Bound Is Not Suitable Where A Greedy Algorithm Is Not Applicable
C : Branch And Bound Divides A Problem Into At Least 2 New Restricted Sub Problems
D : Backtracking Divides A Problem Into At Least 2 New Restricted Sub Problems
Q.no 28. Given items as {value,weight} pairs {{40,20},{30,10},{20,5}}. The capacity of

knapsack=20. Find the
maximum value output assuming items to be divisible.
A : 60
B : 80
C : 100
D : 40
Q.no 29. Arrange following from lowest to highest order by complexity wise A log n B n! C nlogn
A : A,B, C
B : B, C, A
C : A, C, B
D : B,A, C
Q.no 30. The number of trees in a binomial heap with n nodes is
A : log n
B:n
C : n log n
D : n/2
Q.no 31. Which data structure has a better amortized running time than others?
A : Queue
B : Stack
C : Priority Queue
D : List
Q.no 32. What is the purpose of using randomized quick sort over standard quick sort?
A : To reduce worst case space complexity
B : To reduce worst case time complexity
C : To improve average case time complexity
D : To improve accuracy
Q.no 33. The first step of the genetic algorithm is
A : Applying Selection Of Letter

B : Applying Crossover Operator
C : Applying Nutrition Operator
D : Generated Initial Population
Q.no 34. In the development of dynamic programming the value of an optimal solution is
computed in Select one:
A : Top Up Fashion
B : Bottom Up Fashion
C : In Any Way
D : Random
Q.no 35. Genetic algorithm uses
A : No Population
B : Chromosomes
C : Not Gene,
D : Not Allele
Q.no 36. Which of the following problems can’t be solved using recursion?
A : Factorial of a number
B : Nth fibonacci number
C : Length of a string
D : Problems without base case
Q.no 37. A binomial heap with n nodes contains not more than ………. binomial trees.
A : O(n)
B : O(log n)
C : O(n+1)
D : O(n-1)
Q.no 38. Consider the following three claims
1. (n + k)m = Θ(nm), where k and m are constants

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
Which of these claims are correct ?
A : 1 and 2
B : 1 and 3
C : 2 and 3
D : 1, 2, and 3
Q.no 39. Why can’t we design a perfect neural network?
A : Full Operation Is Still Known Of Biological Neurons
B : Number Of Neuron Is Itself Not Precisely Known
C : Number Of Interconnection Is Very Less & Is Very Easy
D : Easy Network
Q.no 40. In dynamic programming, the technique of storing the previously calculated values is
called ___________
A : Saving Value Property
B : Storing Value Property
C : Memoization
D : Mapping
Q.no 41. What is recurrence for worst case of QuickSort and what is the time complexity in
Worst case?
A : Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n^2)
B : Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n^2)
C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(n log n)
D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(n log n)
Q.no 42. What is the induction hypothesis assumption for the inequality m ! > 2^m where m>=4?
A : for m=k, k+1!>2^k holds
B : for m=k, k!>2^k holds
C : for m=k, k!>2^(k+1) holds
D:
Q.no 43. Ram and Shyam have been asked to show that a certain problem Π is NP-complete.
Ram shows a polynomial time reduction from the 3-SAT problem to Π, and Shyam shows a
polynomial time reduction from Π to 3-SAT. Which of the following can be inferred from these
reductions ?
A : Π is NP-hard but not NP-complete
B : Π is in NP, but is not NP-complete
C : Π is NP-complete
D : Π is neither NP-hard, nor in NP
Q.no 44. In a proof by mathematical induction that for all positive integers n, is the "Summation
of numbers from 1 to n is equal to n(n + 1)/2" , inductive hypothesis would be to assume that
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2

maximum value output assuming items to be divisible and nondivisible respectively.
A : 10080
B : 11070
C : 130110
D : 11080
Q.no 46. In knapsack problem which ratio is used to find out the best solution if used W for
weight P for price m for capacity?
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
Q.no 47. Given items as profit=(100,180,120,120) and weight=(10,40,20,24).The capacity of

maximum profit using fractional knapsack.
A : 400
B : 420
C : 500
D : 440
Q.no 48. What is the feature of ANNs due to which they can deal with noisy, fuzzy, inconsistent
data?
A : Non Associative Nature Of Networks
B : Distributive Nature Of Networks
C : Non Distributive Nature Of Networks
D : Is A Meta Heuristic Search Method
Q.no 49. The main time taking step in fractional knapsack problem is?
A : Breaking items into fraction
B : Adding items into knapsack
C : Sorting
D : Looping through sorted items
Q.no 50. If a problem can be broken into subproblems which are reused several times, the
problem possesses ____________ property.
A : Overlapping Subproblems
B : Optimal Substructure
C : Memoization
D : Greedy
Q.no 51. Find out one solution store it in solution set again find out another solution store in it
solution set, again find out the another solution store into the solution set, now from the solution
set we find out the best solution, which maybe best solution for optimal solution, this is which
type of solution strategy?
A : Dynamic programming
B : Greedy method
C : backtracking
D : Neither Dynamic Nor Greedy
Q.no 52. Consider the two matrices P and Q which are 10 x 20 and 20 x 30 matrices respectively.
What is the number of multiplications required to multiply the two matrices?
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
Q.no 53. A binomial heap with n = 13 nodes consists of ……….. Tree.
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
Q.no 54. what are the ways to remove the redundant computation outside the loop
A : Code motion
B : frequency reduction
C : Strength reduction
D : All of these
Q.no 55. Assertion is
A : statement that is true all the time
B : statement about state of program
C : statement describing program statement
D:
Q.no 56. Characteristics of EAs ( Evolutionary Algorithm)
A : Not Flexible
B : Robust
C : Inappropriate
D : Not In Iterative Nature
Q.no 57. Consider the following code snippet. What will happen when the above snippet is
executed?
A : The code will be executed successfully and no output will be generated
B : The code will run for some time and stop when the stack overflows
C : The code will be executed successfully and random output will be generated
D : The code will show a compile time error
Q.no 58. Mathematical induction can be used to prove that, for any positive integer n,
"Summation of first 1 to n numbers " is
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n(n-1)/2
D:
Q.no 59. How many times is the recursive function called, when the following code is executed?
A:7
B:9
C : 11
D : 13
Q.no 60. Time complexity of fractional knapsack problem is?
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. What is flowchart ?
A : Representation of memory usage in algorithm
B : Representation of Time required to execute algorithm
C : visual representaion of algorithm
D:
Q.no 2. In a max-heap, element with the greatest key is always in the which node?
A : Leaf node
B : First node of left sub tree
C : Root node
D : First node of right sub tree
Q.no 3. O(2^n) means computing time is ____
A : Linear
B : polynomial
C : quadratic
D : exponential
Q.no 4. In recursion, the condition for which the function will stop calling itself is
A : Best case
B : Worst case
C : Base case
D : There is no such condition
Q.no 5. The best suited algorithm could be decided using proof technique
A : false
B : true
C:
D:
Q.no 6. In Huffman coding, data in a tree is always present at?
A : Roots
B : Leafs
C : Left Sub Trees
D : Right Sub Trees
Q.no 7. Matrix chain multiplication problem is solved by which approach?
A : Divide And Conquer
C : Backtracking
D : Greedy Approach
Q.no 8. What does the algorithmic analysis count?
A : The number of arithmetic and the operations that are required to run the program
B : The number of lines required by the program

C : The number of seconds required by the program to execute
D : The size of the input
Q.no 9. When an algorithm is written in the form of a specific programming language, it becomes
a _________
A : Pseudocode
B : Programme
C:
D:
Q.no 10. What is best case complexity of selection sort
A:n
B : n^2
C : nlogn
D:
Q.no 11. which of the following is not a proof technique
A : Contradiction
B : Approximation
C : Mathematical induction
D:
Q.no 12. In Huffman coding, data in a tree always occur?
A : roots
B : leaves
C : left sub trees
D : right sub trees
Q.no 13. if x and y are Irrational numbers then x**y is
A : Rational
B : Irrational
C:
D:
Q.no 14. What is the time complexity of following code: int a = 0;

for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
a = a + i + j;
}
}
A : O(N)
B : O(N*log(N))
C : O(N * Sqrt(N))
D : O(N*N)
Q.no 15. Which of the following case does not exist in complexity theory?
A : Best case
B : Average case
C : Null case
D : Worst case
Q.no 16. What is tail recursion?
A : A recursive function that has two base cases
B : A function where the recursive functions leads to an infinite loop
C : A recursive function where the function doesn’t return anything and just prints the values
D : A function where the recursive call is the last thing executed by the function
Q.no 17. What is the time complexity of following code: int a = 0, i = N;

while (i > 0) {
a += i;
i /= 2;
}
A : O(n)
B : O(Logn)
C : O(n^2)
D : O(n^2Logn)
Q.no 18. _____is the minimum number of steps that can be executed for given input
A : Average case
B : Best case
C : Worst case
D : Time complexity
A : Mergesort
B : Binary search
D : Quicksort
Q.no 20. What is the average case time complexity of merge sort?
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
A : 1 and 2
B : 1 and 3
C : 2 and 3
D : 1, 2, and 3
Q.no 22. From the following choose the one which belongs to the algorithm paradigm other than
to which others from the following belongs to.
A : Minimum & Maximum problem
B : Knapsack problem
C : Selection problem
D : Merge sort
Q.no 24. One important class of concurrency platform is
A : Parallel Programming
C : Serial Programming
D : Multiprogramming
Q.no 25. Crossover operator of genetic algorithms is
A : Join Operator
B : Two Point Crossover
C : Selection
D : Multiplication
Q.no 26. If T= abcabaabc & P= abaa then what will be the value of s?
A:4
B:2
C:3
D:1
Q.no 27. Dynamic programming is used to find:
A : All Optimal Solution Is Generated
B : One Solution Is Generated
C : No Optimal Solution Is Generated

D : Partial Solution Is Generated
Q.no 28. What is the time, space complexity of following code: int a = 0, b = 0;
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}
A : O(N * M) time, O(1) space
B : O(N + M) time, O(N + M) space
C : O(N + M) time, O(1) space
D : O(N * M) time, O(N + M) space
Q.no 29. Many multithreaded algorithms involving nested parallelism follow naturally from
A : Dynamic Programming
B : Divide and conquer
C : Greedy Method
D : Branch and Bound Method
Q.no 30. Which of the following is false in the case of a spanning tree of a graph G?
A : It is tree that spans G
B : It is a subgraph of the G
C : It includes every vertex of the G
D : It can be either cyclic or acyclic
Q.no 31. What is base case in the given code?
A : Fn(10)
B : return
C : if (n==0)
D : Fn(n-1)
D : Easy Network
A : 100, 80
B : 110, 70
C : 130, 110
D : 110, 80
Q.no 34. 0/1 knapsack is based on which method?
A : greedy method
Q.no 35. From the following which is not return optimal solution
B : Backtracking
C : Branch and bound
D : Greedy method
Q.no 36. subjective decision is important aspect of algorithm
A : true
B : false
C:
D:
Q.no 37. An algorithm that always runs in polynomial time but possibly returns erroneous
answers is called a …………
A : Las Vegas Algorithm
B : Monte Carlo Algorithm
C : Atlantic City Algorithm
D : Approximation algorithm
A : A,B, C
B : B, C, A
C : A, C, B
D : B,A, C
Q.no 39. job sequencing with deadline is based on which method?
A : Divide and conquer method
B : Dynamic programming
C : Greedy method
D : Branch and bound
Q.no 40. The main time taking step in fractional knapsack problem is
C : Sorting
A:7
B:9
C : 11
D : 13
Q.no 42. Consider the following two problems of graph. 1) Given a graph, find if the graph has a
cycle that visits every vertex exactly once except the first visited vertex which must be visited
again to complete the cycle. 2) Given a graph, find if the graph has a cycle that visits every edge
exactly once. Which of the following is true about above two problems.
A : Problem 1 belongs NP Complete set and 2 belongs to P
B : Problem 1 belongs to P set and 2 belongs to NP Complete set
C : Both problems belong to P set
D : Both problems belong to NP complete set
Q.no 43. The name backtrack was first coined by _________
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
Q.no 44. When recursive call is the last thing executed by the function is called?
A : Mutual Recursion
B : Tail Recursion
C : Exponential Recursion
D : Recursion
Q.no 45. Genetic Algorithm is a part of
A : Not Evolutionary Computing
B : Inspired By Monte-Carlo'S Theory About Evolution
C : Are Adaptive Heuristic Search Algorithm Based On The Evolutionary Ideas Of Natural Selection
And Genetics
D : The Fitness Function Not Used

A : 400
B : 420
C : 500
D : 440
Q.no 47. Tabu search is
A : A Binary Search Method
B : Mathematical Optimization Method
C : C) Non Associative
D : D) The Acceptance Probability Function Is Used
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
Q.no 49. Basic operations like insertion, look-up and removal in splay trees are performed in
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
A : Not Flexible
B : Robust
C : Inappropriate
Q.no 51. Given items as value=(12,10,20,15) and weight=(2,1,3,2).The capacity of knapsack=5.

Find the
A : 38
B : 40
C : 38.3
D : 45

A : 10080
B : 11070
C : 130110
D : 11080
D:
Q.no 54. Given items I = (I1,I2,I3,I4,I5), w = (5, 10, 20, 30, 40) and v = (30, 20, 100, 90,160). The
capacity of knapsack W = 60. Find the
A : 250
B : 270
C : 290
D : 130
C : Sorting
"Summation of first 1 to n numbers cube" is
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
Q.no 57. Core of soft Computing is
A : Fuzzy Computing, Neural Computing, Genetic Algorithms
B : Fuzzy Networks And Artificial Intelligence
C : Artificial Intelligence And Neural Science
D : Neural Science And Genetic Science
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
Q.no 59. algorithms performance is characterized by
A : size of a computation
B : computing resources required
C : actual time required
D : actual memory required
D:

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. What are dendrites?
A : Fibers Of Nerves
B : nuclear projections
C : Other Name For Nucleus
D : Twisted Network
Q.no 2. The best data structure to check whether an arithmetic expression has balanced
parentheses is a
A : queue
B : stack
C : tree
D : list
Q.no 3. What is the type of the algorithm used in solving the 8 Queens problem?
A : Backtracking
C : Branch And Bound
D : Divide And Conquer
A : Contradiction
B : Approximation
D:
Q.no 6. What’s happen if base condition is not defined in recursion ?
A : stack underflow
B : stack overflow
C : both
D:
Q.no 7. O(n^3) means computing time is ____
A : Linear
B : polynomial
C : quadratic
D : exponential
Q.no 8. To which of the following class does a CNF-satisfiability problem belong?
A : NP class
B : P class
C : NP Complete
D : NP Hard
Q.no 10. Fractional knapsack problem is also known as
A : 0/1 knapsack problem
B : Continuous knapsack problem
C : Divisible knapsack problem
D : Non continuous knapsack problem
Q.no 11. If f(n) = ______, then there exists positive constants c, n0 such that 0 ≤ c.g(n) ≤ f(n), for
all n ≥ n0
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
A : Mergesort
B : Binary search
D : Quicksort
Q.no 13. The goal of structured programming is to
A : have well indented programs
B : be able to infer the flow of control from the compiled code
C : be able to infer the flow of control from the program text
D : avoid the use of GOTO statements
Q.no 14. The choice of polynomial class has led to the development of an extensive theory called
________
A : computational complexity
B : time complexity
C : problem complexity
D : decision complexity
Q.no 15. Which of the following algorithms is the best approach for solving Huffman codes?
A : Exhaustive Search
B : Greedy Algorithm
C : Brute Force Algorithm
D : Divide And Conquer Algorithm
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
Q.no 17. Which is a condition about the relationship between the variables of our program which
is definitely true immediately before and immediately after each iteration of the loop?
A : For condition
B : Loop invariant condition
C : Both a and b
D : If condition
Q.no 18. Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a
A : Greedy Algorithm
B : Dynamic programming algorithm
C : Divide and Conquer Algorithm
D : Backtracking Algorithm
Q.no 19. Which is the process of executing a correct program on data sets and
measuring the time and space it takes tocompute the results.
A : Debugging
B : Profiling
C : Conquer
D : Combining
Q.no 20. State whether True or False An algorithm is said to be correct if, for every input
instance, it halts with the correct output
A : true
B : false
C:
D:
Q.no 21. Which data structure is most suitable for implementing best first branch and bound
strategy?
A : Stack
B : Queue
C : Priority Queue
D : Linked List
A : No Population
B : Chromosomes
C : Not Gene,
D : Not Allele
Q.no 23. Running the program many times is sufficient to prove the correctness of program
A : true
B : false
C:
D:
Q.no 24. Which of the following is/are property/properties of a dynamic programming problem?
A : Evolutionary Approach
B : Require More Time
C : Greedy Approach
D : Optimal Substructure And Overlapping Subproblems
A : greedy method
A : true
B : false
C:
D:
Q.no 27. Which of the following problems is NOT solved using dynamic programming?
A : 0/1 Knapsack Problem
B : Matrix Chain Multiplication Problem
C : Edit Distance Problem
D : Fractional Knapsack Problem
Q.no 28. The time taken by nondeterministic sorting algorithm is ______
A : O(1)
B : O(log n)
C : O(n)
D : O(n^2)
Q.no 29. What is work?
A : Execution time of single thread
B : Average of all threads
C : Sum of the times taken by each thread
D : Sum of the times taken by child threads only
Q.no 30. What are desirable characteristics of Algorithm with efficiency 1)Generality 2)
Availability 3) Simplicity
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
Q.no 31. Consider the following function f:

int f(int n)
{
int s = 0;
while(n > 1)
{
n = n/2;
s++;
}
return s;
}
What is the asymptotic complexity in terms of n? (Pick the smallest correct answer)
A : O(nlog n)
B : O(n^2 )
C : O(n)
D : O(log n )
Q.no 32. What is the basic principle in Rabin Karp algorithm?
A : Sorting
B : Hashing
C : Augmenting
C : Greedy method
Q.no 34. Which of these is false about recursion?
A : Recursive function can be replaced by a non-recursive function
B : Recursive functions usually take more memory space than non-recursive function
C : Recursive functions run faster than non-recursive function
D : Recursion makes programs easier to understand
A:4
B:2
C:3
D:1
Q.no 36. Simulated annealing (SA) is
A : A Probabilistic Technique For Approximating The Global Optimum Of A Given Function
B : It Is A Exact Local Optimization In A Small Search Space For Problem
C : The Energy (Goal) Function Is Not Used
D : It Is Not Used When The Search Space Is Discrete
Q.no 37. The Knapsack problem where the objective function is to minimize the profit is______
A : Greedy
C : Back Tracking
D : Branch & Bound
A : log n
B:n
C : n log n
D : n/2
Q.no 39. When a thread u spawns a new thread v, then (u,v) is called a
A : Simple edge
B : Return edge
C : Continuation edge
D : spawn edge
A : Join Operator
C : Selection
D : Multiplication
Q.no 41. When a top-down approach of dynamic programming is applied to a problem, it usually
_____________
A : Decreases Both, The Time Complexity And The Space Complexity
B : Decreases The Time Complexity And Increases The Space Complexity
C : Increases The Time Complexity And Decreases The Space Complexity
D : Increases Both, The Time Complexity And The Space Complexity
B : Tail Recursion
D : Recursion
reductions ?
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
B : Sorting Algorithm
C : Monte-Carlo Algorithm
D : Brute Force, Recursion And Dynamic Programming
Q.no 48. Time complexity of LCS Select one:
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A : 250
B : 270
C : 290
D : 130
Q.no 50. In greedy method which type of solution is generated
A : Optimal solution
B : Best solution
C : Worst solution
D : All solutions
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
D:
D:
And Genetics
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
Q.no 59. For any integer m>=3, the series 2+4+6+…+(4m) can be equivalent to ________
A : m^2 + 3
B : m^m
C:m
D : m+1
A:7
B:9
C : 11
D : 13

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. Pseudocode is______________
A : Language dependent
B : Language independent
C:
D:
Q.no 2. Which of the following problems is NOT NP complete?
A : Hamiltonian circuit
B : Bin packing
C : Partition problem
D : Halting problem
Q.no 3. The space factor when determining the efficiency of algorithm is measured by
A : Counting the maximum memory needed by the algorithm

B : Counting the minimum memory needed by the algorithm
C : Counting the average memory needed by the algorithm
D : Counting the maximum disk space needed by the algorithm
A : More
B : Less
C:
D:
A : Switch Case
B : Loop
C : If else
D : if elif else
Q.no 6. Dijkstra’s Algorithm cannot be applied on ………….
A : Directed and weighted graphs
B : Graphs having negative weight function
C : Unweighted graphs
D : Undirected and unweighted graphs
A : Leaf node
C : Root node
Q.no 8. Fractional knapsack problem is solved most efficiently by which of the following
algorithm?
C : Greedy Algorithm
D : Backtracking
Q.no 9. Which algorithm design strategy is followed by Dijkstra’s Algorithm?
A : Greedy strategy
B : Branch and bound
C : Backtracking
D : Dynamic programming
all n ≥ n0
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
B : Branch And Bound
C : Backtracking
D : Greedy Method
Q.no 13. Halting problem is an example for?
A : decidable problem
B : undecidable problem
C : complete problem
D : trackable problem
A : Dijkstra’s shortest path algorithm
B : Prim’s algorithm
C : Huffman Coding
A : Mergesort
B : Binary search
D : Quicksort
A : roots
B : leaves
C : left sub trees
D : right sub trees
Q.no 17. What is best case complexity of Insertion sort
A:n
B : n^2
C : nlogn
D:
Q.no 18. Algorithm must produce one output
A : true
B : false
C:
D:
A : Roots
B : Leafs
C : Left Sub Trees
D : Right Sub Trees
Q.no 20. The complexity of Binary search algorithm is___
A : O(n)
B : O(log n)
C : O( n^2)
D : O(n log n)
Q.no 21. Genetic algorithm is
A : A Intelligent Simple Specified Search Technique
B : Used To Solve Non Optimization Problem
C : Is A Part Of Evolutionary Computing
D : Simulated Annealing
Q.no 22. In analysis of algorithm, approximate relationship between the size of the job and the
amount of work required to do is expressed by using
A : Central tendency
B : Differential equation
C : Order of execution
D : Order of Storage
Q.no 23. Given an array of elements 5, 7, 9, 1, 3, 10, 8, 4. Which of the following is the correct
sequences of elements after inserting all the elements in a min-heap?
A : 1,3,4,5,7,8,9,10
B : 1,4,3,9,8,5,7,10
C : 1,3,4,5,8,7,9,10
D : 1,3,7,4,8,5,9,10
Q.no 24. To prove the statement " There are infinitely many prime numbers" by contradiction
what is the assumption for P?
A : P is infinite set
B : P is finite set
C:
D:
Q.no 26. Which of the following statement about 0/1 knapsack and fractional knapsack problem
is correct?
A : In 0/1 Knapsack Problem Items Are Divisible And In Fractional Knapsack Items Are Indivisible
B : Both Are The Same
C : 0/1 Knapsack Is Solved Using A Greedy Algorithm And Fractional Knapsack Is Solved Using
Dynamic Programming
D : In 0/1 Knapsack Problem Items Are Indivisible And In Fractional Knapsack Items Are Divisible
Q.no 27. If txt[] = "THIS IS A TEST TEXT" and pat[] = "TEST", what will be the index of
pattern?
A:9
B : 13
C : 11
D : 10
Q.no 28. A strand of maximal length is called as ______________
A : Process
B : Work
C : Thread
D : Span
A : Top Up Fashion
C : In Any Way
D : Random
Q.no 30. The Knapsack problem where the objective function is to minimize the profit is
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
D : Branch & Bound 0/1
Q.no 31. Choose the correct steps required to prove that a problem is NP complete?
A : 1. prove that problem is in P 2. Prove that every problem in P is reducible to the problem in
question in polynomial time.
B : 1.prove that problem is in P 2. Prove that the problem in question is reducible to any problem in P
in polynomial time.
C : 1.prove that problem is in NP 2. Prove that every problem in NP is reducible to the problem in
D : 1.prove that problem is P 2. Prove that the problem in question is reducible to any problem in P in
polynomial time.
Q.no 32. What is worst case in Naive Pattern matching algorithm.
A : The first character of the pattern is not present in text at all.
B : When all characters of the text and pattern are same.
C : when only the last character is different.
D : Both B and C
Q.no 34. which is not the important aspect of Loop
A : Initial condition
B : nested loop
C : invariant relation
D : termination
Q.no 35. loop termination condition along with what makes loop correct
A : loop condition
B : loop increment variable
C : loop invariant
D : none of these
Q.no 36. Proof by contradiction is also known as
A : inverse proof
B : indirect proof
C : reverse proof
D:
Q.no 37. For a good loop invariant, following property is not important
A : Initialization
B : Maintenance
C : Termination:
D : loop condition
A : true
B : false
C:
D:
Q.no 40. In amortized analysis, which method overcharges for operations early to compensate for
under-charges later?
A : Aggregate method
B : Accounting method
C : Potential method
D : Both aggregate and potential method
B : Greedy method
C : backtracking
Q.no 42. What are requirements should a problem satisfy in order to be suitable for solving it by
a Genetic Algorithm?
A : The Fitness Function Cannot Be Well–Defined.
B : Solutions Should Be Decomposable Into Steps (Building Blocks) Which Could Be Then Encoded
As Chromosomes.
C : The Member Function Can Be Well–Defined.
D : Minimize Functions
C : Memoization
D : Greedy
reductions ?

A : 400
B : 420
C : 500
D : 440
D:
B : Best solution
C : Worst solution
D : All solutions
C : Sorting
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
Q.no 51. Identify incorrect statement
A : f(n) = Θ(g(n)) and g(n) = Θ(h(n)), then f(n) = Θ(h(n))
B : f(n) = Θ(g(n)) if and only if g(n) = Θ(f(n))
C : f(n) = O(g(n)) if and only if g(n) = Ω(f(n))
D : If f(n) = O(g(n)) and g(n) = O(h(n)), then f(n) ≠ O(h(n))
Q.no 52. Fill in the blank. Proof by induction is a technique used to prove statements about
objects that can be defined using …………………
A : recursive functions.
B : iterative function
C : built in function
D:
Q.no 54. What is worst case in Rabin-Karp string matching algorithm.
A : when all characters of pattern and text are same as the hash values of all the substrings of text]
match with hash value of pattren.
B : when all characters of pattern and text are different as the hash values of all the substrings of text]
C : Both a and b
D : neither a nor b
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
B : Tail Recursion
D : Recursion
Q.no 58. What is time complexity of fun()? int fun(int n)

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
A : O(nlog n)
B : O(n^2 )
C : O( n)
D : O(log n)
A : Not Flexible
B : Robust
C : Inappropriate
D:

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Pseudocode
B : Flowchart
D : both 1and 2
Q.no 3. Uniprocessor executes____instruction at a time
A : Many
B : Two
C : One
D : Three
Q.no 4. If f(n) = ______, then there exists positive constants c1, c2, n0 such that 0 ≤ c1.g(n) ≤ f(n)
≤ c2.g(n), for all n ≥ n0
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
C:
D:
D : Twisted Network
Q.no 7. Which of the following algorithms has better time complexity?
A : insertion sort
B : binary search
C : linear search
D : merge sort
C : Backtracking
D : Greedy Method
Q.no 9. Which data structure is used for implementing a FIFO branch and bound strategy?
A : Stack
B : Queue
C : Array
D : Linked List
Q.no 10. Keywords________indicates that iteration of the loop may run concurrently.
A : Parallel loop
B : Thread
C : Parallel for
D : Multithreading
Q.no 11. The main distinguishable characteristic of a binomial heap from a binary heap is that
A : It allows union operations very efficiently.
B : It does not allow union operations that could easily be implemented in binary heap.
C : The heap structure is not similar to complete binary tree.
D : The location of child node is not fixed.
A : Linear
B : polynomial
C : quadratic
D : exponential
Q.no 13. The Data structure used in standard implementation of Breadth First search
is___________
A : Stack
B : Queue
C : Linked List
D : Tree
A : roots
B : leaves
C : left sub trees
D : right sub trees
A : NP
B:P
C : Hard
D : Complete
A:n
B : n^2
C : nlogn
D:
A : greedy method
becomes a _________
A : Pseudocode
B : Programme
C:
D:
Q.no 19. Merge sort uses which of the following technique to implement sorting?
A : Backtracking
C : Divide And Conquer
Q.no 20. If f(n) = ______, then there exists positive constants c, n0 such that 0 ≤ f(n) ≤ c.g(n), for
all n ≥ n0
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : Little o(g(n))
D : Easy Network
Q.no 23. Which of the following methods can be used to solve the matrix chain multiplication
problem?
B : Greedy
C : Backtracking
D : Dynamic Programming, Brute Force, Recursion
Q.no 24. Multithreaded computation can be better understood with the help of a
A : Computation undirected acyclic graph
B : Computation directed cyclic graph
C : Computation directed acyclic graph
D : Computation undirected cyclic graph
Q.no 25. Which of the given options provides the increasing order of asymptotic complexity of
functions f1, f2, f3 and f4?
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)
A : f3, f2, f4, f1
B : f3, f2, f1, f4
C : f2, f3, f1, f4
D : None of these
C : Greedy method
A : Process
B : Work
C : Thread
D : Span
Q.no 28. Loop invariant is inert assertion and not useful in analysis of program.
A : true
B : false
C:
D:
Q.no 29. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.
A : proof by induction
B : proof by deduction
C : proof by contradiction
D:
Q.no 30. Let X be a problem that belongs to the class NP. Then which one of the following is
TRUE?
A : There is no polynomial time algorithm for X.
B : If X can be solved deterministically in polynomial time, then P = NP.
C : If X is NP-hard, then it is NP-complete.
D : X may be undecidable.
Q.no 31. Parallel loops are like an ordinary_______________except that the iterations of the loop
can execute concurrently.
A : While loop
B : For Loop
C : Do while loop
D : If statement
A : inverse proof
B : indirect proof
C : reverse proof
D:
Q.no 33. Problems that can be solved in polynomial time are known as ……… problems.
A : Intractable
B : Tractable
C : Undecidable
D : Decidable
A : true
B : false
C:
D:
D : Both B and C
pattern?
A:9
B : 13
C : 11
D : 10
Q.no 38. The type of encoding where no character code is the prefix of another character code is
called?
A : optimal encoding
B : prefix encoding
C : Fequency encoding
D : Trie encoding
Q.no 39. Consider the strings “PQRSTPQRS” and “PRATPBRQRPS”. What is the length of the
longest common subsequence?
A:9
B:8
C:7
D:6
Q.no 40. If an optimal solution can be created for a problem by constructing optimal solutions
for its subproblems, the problem possesses ____________ property.
C : Memoization
D : Greedy
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A : 250
B : 270
C : 290
D : 130
C : Sorting
D:
And Genetics
Worst case?
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
Q.no 50. What are the parameters of annealing?
A : The Energy (Goal) Function Is Not Used
B : The Annealing Schedule Temperature()
C : The Un-Acceptance Probability Function P()
D : Not Flexible
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n(n-1)/2
D:

A : 10080
B : 11070
C : 130110
D : 11080

Find the
A : 38
B : 40
C : 38.3
D : 45
_____________
A : Code motion
D : All of these
As Chromosomes.
C : Both a and b
D : neither a nor b
executed?

Seat No -

Time : 1hr
Max Marks : 50
N.B
………
A : time complexity
B : space complexity
C : computational complexity
D : problem complexity
Q.no 2. Recursive function must have
A : switch -case
B : exit condition
C : loop
D:
Q.no 3. What is the worst case time complexity of merge sort?
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Best case
B : Average case
C : Null case
D : Worst case
Q.no 5. In Algorithm Specification the blockes are indicated with matching
A : Braces
B : Parenthesis
C : Square Brackets
D : Slashes
A : BST
B : MST
C : Binary Tree
D : Weighted Graph
B : Bin packing
D : Halting problem
Q.no 8. Operations in the neural networks can perform what kind of operations?
A : Not In Serial
B : Not In Parallel
C : Serial Or Parallel
D : Partial
Q.no 9. Dijkstra algorithm, which solves the single-source shortest--paths problem, is a
A : O(n)
B : O(log n)
C : O( n^2)
D : O(n log n)
Q.no 11. Steps of Divide and Conquer approach are______
A : Divide, Conquer And Combine
B : Combine, Conquer and Divide
C : Combine, Divide And Conquer
D : Divide, Combine And Conquer
Q.no 12. Which data structure is used for implementing a LIFO branch and bound strategy?
A : Stack
B : Queue
C : Array
D : Linked List
Q.no 13. In artificial Neural Network interconnected processing elements are called
A : Nodes Or Neurons
B : Weights
C : Axons
D : Soma
parentheses is a
A : queue
B : stack
C : tree
D : list
Q.no 16. Which of the following methods can be used to solve the longest common subsequence
problem?
A : Not Recursion
D : Greedy Algorithm
A : NP class
B : P class
C : NP Complete
D : NP Hard
A : More
B : Less
C:
D:
A : Contradiction
B : Approximation
D:
Q.no 20. steps followed in mathematical induction are 1)basis 2)Induction step 3) Induction
hypothesis
A : steps 1and 2 only
B : steps 2 and 3 only
C : steps 1,2, 3
D : steps 1 and 3 only
D : Both B and C
pattern?
A:9
B : 13
C : 11
D : 10
Q.no 25. which of the following is not basic control structure
A : the process
B : the decision
C : the loop
D : the sequential
Q.no 26. Which algorithm startegy builds up a solution by choosing the option that looks the best
at every step.
A : greedy method
Q.no 27. What will be the position of 6, when a max heap is constructed on the input elements 6,
71, 46, 8, 13, 16, 14, 66, 31, 27?
A : 6 will be at the root
B : 6 will be at the last level
C : 6 will be at the second level
D : 6 can be anywhere in the heap
Q.no 28. What is the time complexity of following code: int i, j, k = 0;

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}
A : O(n)
B : O(nLogn)
C : O(n^2)
D : O(n^2Logn)
C : Sorting
B : Backtracking
D : Greedy method
Q.no 32. Which of the following problems is equivalent to the 0-1 Knapsack problem?
A : You are given a bag that can carry a maximum weight of W. You are given N items which have a
weight of {w1, w2, w3,…., wn} and a value of {v1, v2, v3,…., vn}. You can break the items into
smaller pieces. Choose the items in such a way that you get the maximum value
B : You are studying for an exam and you have to study N questions. The questions take {t1, t2, t3,….,
tn} time(in hours) and carry {m1, m2, m3,…., mn} marks. You can study for a maximum of T hours.
You can either study a question or leave it. Choose the questions in such a way that your score is
maximized
C : You are given infinite coins of denominations {v1, v2, v3,….., vn} and a sum S. You have to find
the minimum number of coins required to get the sum S
D : You are given a suitcase that can carry a maximum weight of 15kg. You are given 4 items which
have a weight of {10, 20, 15,40} and a value of {1, 2, 3,4}. You can break the items into smaller
pieces. Choose the items in such a way that you get the maximum value
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}
A : Queue
B : Stack
C : Priority Queue
D : List
strategy?
A : Stack
B : Queue
C : Priority Queue
D : Linked List

A : true
B : false
C:
D:
Q.no 38. Choose the correct steps to prove if the vertex cover problem is NP-Complete. I-- Vertex
Cover problem is in NP II--Clique problem is in NP III--Prove that Clique problem ≤ Vertex
Cover Problem in polynomial time IV---Prove that Vertex Cover problem ≤ Clique Problem in
polynomial time
A : I and III
B : I and IV
C : II and III
D : II and IV
A : Greedy
C : Back Tracking
D : Branch & Bound
A : 1,3,4,5,7,8,9,10
B : 1,4,3,9,8,5,7,10
C : 1,3,4,5,8,7,9,10
D : 1,3,7,4,8,5,9,10
B : Greedy method
C : backtracking
And Genetics

A : 400
B : 420
C : 500
D : 440
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
A : m^2 + 3
B : m^m
C:m
D : m+1
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n(n-1)/2
D:
B : Tail Recursion
D : Recursion
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
D : Not Flexible
C : Memoization
D : Greedy
A : Not Flexible
B : Robust
C : Inappropriate
C : Both a and b
D : neither a nor b
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3

Find the
A : 38
B : 40
C : 38.3
D : 45

Seat No -

Time : 1hr
Max Marks : 50
N.B
B : Recursion
Q.no 3. Which design strategy stops the execution when it finds the solution otherwise starts the
problem from top again?
A : Back Tracking
B : Branch and Bound
A : Linear
B : polynomial
C : quadratic
D : exponential
Q.no 6. Alorithm should have finite number of steps
A : true
B : false
C:
D:
A : Dijkstra's shortest path algorithm
B : Prim's algorithm
C : Kruskal algorithm
Q.no 8. Binomial tree with zero order has only
A : 1 Node
B : 2 Nodes
C : 3 Nodes
D : 4 Nodes
Q.no 9. What will be the best case time complexity of merge sort?
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
Select one:
B : T(n)=n.T(n/2)+b.f(n)
C : T(N)=A.T(N-1)+B
D : T(N)=N.T(N-3)+B
Q.no 11. What term is used to describe O(n) algorithm?
A : Constant
B : Non polynomial deterministic
C : logarithmic
D : linear
A : Backtracking
A : true
B : false
C:
D:
Q.no 14. Which of the following is true about Huffman Coding.
A : Huffman coding may become lossy in some cases
B : Huffman Codes may not be optimal lossless codes in some cases
C : In Huffman coding, no code is prefix of any other code.
D : Huffman Codes may not be optimal lossy codes in some cases
Q.no 15. For the improvement of efficiency of quick sort the pivot can be____
A : the first element
B : the middle element
C : the last element
D : any random element
Q.no 16. Which Data Structure is used to perform Recursion?
A : Array
B : queue
C : stack
D : linked list
Q.no 17. Genetic algorithms are
A : Adaptive Heuristic Search Algorithm
B : Binary search algorithm
C : Simulated Annealing
D : Adaptive Linear
A : stack underflow
B : stack overflow
C : both
D:
Q.no 19. Fractional knapsack is based on which method?
A : greedy method
Q.no 20. Which Programming is based on stepwise refinement process.
A : Structural
B : C programming
C : Procedural
D : Fine
Q.no 21. Which of the following statements about loop invariants is false?
A : Loop invariants are used to show that algorithms produce the correct results.
B : A loop invariant is the opposite, that is the negation, of the condition of the loop.
C : To prove that a statement is a loop invariant, we use mathematical induction.
D : Loop invariants remain true each time a loop is executed.

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}
A : O(n)
B : O(nLogn)
C : O(n^2)
D : O(n^2Logn)
A:9
B:8
C:7
D:6
B : P is finite set
C:
D:
C : Memoization
D : Greedy
A : 100, 80
B : 110, 70
C : 130, 110
D : 110, 80
Q.no 27. Prims algorithm is based on which method?
C : Greedy method
A : true
B : false
C:
D:
A : true
B : false
C:
D:
Q.no 31. The term ________ refers to all state space search methods in which all children of the –
nodes are generated before any other live node can become the E-node.
A : Backtacking
B : Depth First Search
D : Breadth First Search
Q.no 32. What is true about Dynamic Programming
A : It Didn’T Find All Possible Solution
B : It Is Not Suitable For Solving Optimization Problems
C : Avoid The Re-Computation Of Overlapping Sub-Problems
D : Reliability Design Problem Is Not Solved
Q.no 34. Loop invariant is inert assertion and not useful in analysis of program.
A : true
B : false
C:
D:
Q.no 35. Which one of the following is true about Binary search?
A : the best-case occurs when the target item is in the beginning of the search list
B : the best-case occurs when the target is at the end of the search list
C : the worst-case is when the target item is not in the search list
D : the worst-case is when the target is found in the middle of the search list
Q.no 37. Which of the following options match the given statement:
The algorithms that use the random input to reduce the expected running time or memory usage,
but always terminate with a correct result in a bounded amount of time.
B : nested loop
D : termination
A : greedy method
_____________
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n(n-1)/2
D:
And Genetics
As Chromosomes.
B : Best solution
C : Worst solution
D : All solutions

Find the
A : 38
B : 40
C : 38.3
D : 45
A : m^2 + 3
B : m^m
C:m
D : m+1

A : 400
B : 420
C : 500
D : 440
B : Greedy method
C : backtracking
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
reductions ?
Q.no 54. To calculate c(i, j )’s, w( i, j)’s and r(i, j)’s; the OBST algorithm in worst case takes the
following time.
A : O(Log N)
B : O (N*N)
C : O (N*N*N)
D : O (N Log N)
A : 250
B : 270
C : 290
D : 130
D : Not Flexible
B : Tail Recursion
D : Recursion
executed?
data?
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. Crossover, mutation, and selection are the
A : Operators Of Genetic
B : Functions of Genetic
C : Population Of Genetic
D : Member Function
Q.no 2. All the iterations in the parallel loop should be __________
A : Independent
B : Dependent
C:
D:
Q.no 3. Which of the following is not characteristic of Algorithm
A : Definiteness
B : finiteness
C : scalability
D : effectiveness
Q.no 4. Which element of an input array is chosen as pivot in Randomized Quicksort?
A : First
B : Last
C : Median
D : Random number
Q.no 5. parallel algorithms that can run on a ____________ that permits multiple instructions to
execute concurrently
A : Uniprocessor
B : Serial Computer
C : Mainframe Computer
D : Multiprocessor computer
A:n
B : n^2
C : nlogn
D:
A : Contradiction
B : Approximation
D:
Q.no 8. Which of the following is incorrect? Algorithms can be represented:
A : Pseudocode
B : Programme
C : Grammar
D : flowchart
Q.no 9. To solve one problem how many algorithms are possible?
A : one
B : two
C : several
D:
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
Q.no 11. state whether True or false. Algorithms are as impotant as advanced technologies
A : true
B : false
C:
D:
Q.no 12. goto statement is?
A : Used to jump the control of program.
B : Used for iteration
C : same as switch statement
D : Not Used for iteration
Q.no 13. def f():

int a[n][n]
// Finding sum of elements of a matrix that are above or on the diagonal.
sum = 0
for i = 1 to n:
for j = i to n:
sum += a[i][j]
print(sum)
Time Complexity of this program:
A : O(n)
B : O(nlogn)
C : O(n^2)
D : O(n^3)
Q.no 15. Algorithm must have atleast one external input
A : true
B : false
C:
D:
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
………
A : time complexity
C : Backtracking
D : Greedy Approach
A : true
B : false
C:
D:
Q.no 20. Two main measure of efficiency of an algorithm
A : processor and memory
B : time and space
C : date and space
D : date and capacity
A : Simple edge
B : Return edge
D : spawn edge
A : Fn(10)
B : return
C : if (n==0)
D : Fn(n-1)
Q.no 24. loop invariant property can be proved using
A : Mathematical Induction
B : Proof by cases
D : direct proof
Q.no 26. In the principle of mathematical induction, which of the following steps is mandatory?
A : induction hypothesis
B : induction reference
C : induction set assumption
D:
Q.no 27. Choose the option with function having same complexity for a Fibonacci heap.
A : Insertion, Merge
B : Insertion, Deletion
C : ExtractMin, Insertion
D : Merge, Deletion
C : Greedy method
D : Merge sort
Q.no 30. Time complexity of fractional knapsack problem is
A : O(n log n)
B : O(n)
C : O(1)
D : O(nW)
A : loop condition
C : loop invariant
D : none of these
problem?
B : Greedy
C : Backtracking
A : Intractable
B : Tractable
C : Undecidable
D : Decidable
Q.no 34. which of the following is not a characteristics of good algorithm
A : precise
B : Ambigous
C : finite number of steps
D : logical flow of control
Q.no 35. Arrange following from highest to lowest order by complexity wise A log n B n! C nlogn
A : A,B, C
B : B, C, A
C : C, B ,A
D : B,A, C
Q.no 36. Power saving is an important job in embedded systm and sensor network.
A : true
B : false
C:
D:
strategy?
A : Stack
B : Queue
C : Priority Queue
D : Linked List
Q.no 38.
A : 10
B:1
C : 10 9 8 ……1 0
D : 10 9 8 ……1
Worst case?
A : Not Flexible
B : Robust
C : Inappropriate
B : Best solution
C : Worst solution
D : All solutions
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
C : Memoization
D : Greedy
And Genetics
D:
B : Greedy method
C : backtracking
D:
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
A : m^2 + 3
B : m^m
C:m
D : m+1

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
A : O(nlog n)
B : O(n^2 )
C : O( n)
D : O(log n)
Q.no 55. What are the issues on which biological networks proves to be superior than AI
networks?
A : Robustness & Fault Tolerance
B : Inflexibility
C : Single Computation
D : No Computation
executed?
A : 250
B : 270
C : 290
D : 130
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : O(n)
B : O(log n)
C : O( n^2)
D : O(n log n)
A : true
B : false
C:
D:
C:
D:
Q.no 4. The fundamental unit of neural network is
A : Brain
B : Nucleus
C : Neuron
D : Axon
Q.no 6. Branch and bound is a __________
A : Problem Solving Technique
B : Data Structure
C : Sorting Algorithm
D : Type Of Tree
Q.no 7. Which of the following is the most commonly used data structure for implementing
Dijkstra’s Algorithm?
A : Max priority queue
B : Stack
C : Circular queue
D : Min priority queue
________
B : time complexity
A : greedy method
Q.no 10. One can have __________, where each processor can directly access any location of
memory
A : Shared Memory
B : Cache Memory
C : Distributed Memory
D : Private Memory
all n ≥ n0
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : Little o(g(n))
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
Q.no 13. def f():

int a[n][n]

sum = 0
for i = 1 to n:
for j = i to n:
sum += a[i][j]
print(sum)
A : O(n)
B : O(nlogn)
C : O(n^2)
D : O(n^3)
Q.no 14. Who created the Rabin Karp Algorithm?
A : Joseph Rabin and Michael Karp
B : Michael Rabin and Joseph Karp
C : Richard Karp and Michael Rabin
D : Michael Karp and Richard Rabin
Q.no 16. q29.jpeg
A : 111
B : 101
C : 110
D : 11
algorithm?
D : Backtracking
A : Contradiction
B : Approximation
D:
Q.no 19. What is the time complexity of Dijikstra’s algorithm?
A : O(n)
B : O(n^3)
C : O(n^2)
D : O(log n)
Q.no 20. The time factor when determining the efficiency of algorithm is measured by
A : Counting microseconds
B : Counting the number of key operations
C : Counting the kilobytes of algorithm
D:
A : Process
B : Work
C : Thread
D : Span
A : Top Up Fashion
C : In Any Way
D : Random
A : O(n log n)
B : O(n)
C : O(1)
D : O(nW)
Q.no 24. Which of the following branch and bound strategy leads to depth first search?
A : F1()
B : return
C : both
D : neither 1 nor 2
A:4
B:2
C:3
D:1
called ___________
C : Memoization
D : Mapping
Q.no 28. The speed up of a computation on P processors is defined as
A : T1 / T∞
B : T1 / Tp
C : Tp / T1
D : T∞/T1
A : Greedy
C : Back Tracking
D : Branch & Bound
Q.no 31. 0/1 knapsack is based on which method?
A : greedy method
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
Q.no 34. Mathematical induction proves
A : Correctness of algorithm
B : Efficiency of algorithm
C : both
D:
Q.no 36. How many stages(steps) of procedure does a non-deterministic algorithm consist of?
A:1
B:2
C:3
D:4
C : Greedy method

int f(int n)
{
int s = 0;
while(n > 1)
{
n = n/2;
s++;
}
return s;
}
A : O(nlog n)
B : O(n^2 )
C : O(n)
D : O(log n )
A : true
B : false
C:
D:
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
And Genetics
Worst case?
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
D:
C : Memoization
D : Greedy
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
B : Greedy method
C : backtracking
following time.
A : O(Log N)
B : O (N*N)
C : O (N*N*N)
D : O (N Log N)
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
A:7
B:9
C : 11
D : 13
_____________
reductions ?
executed?
As Chromosomes.

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. Heap can be used as ……………….
A : Priority queue
B : Stack
C : A decreasing order array
D : Normal Array
A : greedy method

Q.no 4. Amortized analysis is a technique that, given a sequence of operations, permits sharing
the cost of a single expensive operation with many other cheaper ones.
A : true
B : false
C:
D:
Q.no 5. Express the formula (n-2)*(n-4) in terms of Theta Ɵ Notation
A : Ɵ(n^2)
B : Ɵ(8)
C : Ɵ(log n)
D : Ɵ(n)
Q.no 6. If f(n) = ______, then there exists positive constants c, n0 such that 0 ≤ c.g(n) ≤ f(n), for all
n ≥ n0
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
A : For condition
C : Both a and b
D : If condition
hypothesis
C : steps 1,2, 3
Q.no 10. Problems that can be solved in polynomial time are known as?
A : intractable
B : tractable
C : decision
D : complete
A : Best case
B : Worst case
C : Base case
Q.no 12. Which of the following statements is true?
A : Recursion is always better than iteration
B : Recursion uses more memory compared to iteration
C : Recursion uses less memory compared to iteration
D : Iteration is always better and simpler than recursion
Q.no 13. A Greedy Algorithm can be used to solve all the Dynamic Programming problems.
A : True
B : FALSE
C:
D:
A : O(n log n)
B : O(n^2)
C : O(n^2 log n)
D : O(n log n^2)
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
A : Debugging
B : Profiling
C : Conquer
D : Combining
A:n
B : n^2
C : nlogn
D:
Q.no 20. Which element of an input array is chosen as pivot in Randomized Quicksort?
A : First
B : Last
C : Median
D : Random number
A : Fn(10)
B : return
C : if (n==0)
D : Fn(n-1)
B : Proof by cases
D : direct proof
A : precise
B : Ambigous
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
Q.no 26. You are given a knapsack that can carry a maximum weight of 60. There are 4 items
with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the maximum value of the items
you can carry using the knapsack?
A : 160
B : 200
C : 170
D : 90
A : true
B : false
C:
D:
Q.no 28. Which of the following problems is similar to that of a Hamiltonian path problem?
A : knapsack problem
B : closest pair problem
C : travelling salesman problem
D : assignment problem
A : O(n)
B : O(log n)
C : O(n+1)
D : O(n-1)
Q.no 31. Mathematical induction allows us to prove the correctness and efficiency of algorithm
both
A : true
B : false
C:
D:
A : true
B : false
C:
D:
B : Backtracking
D : Greedy method
A:1
B:2
C:3
D:4
in polynomial time.
polynomial time.

A : 60
B : 80
C : 100
D : 40
A : A,B, C
B : B, C, A
C : C, B ,A
D : B,A, C
A : O(1)
B : O(log n)
C : O(n)
D : O(n^2)
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
B : Greedy method
C : backtracking
A : 250
B : 270
C : 290
D : 130
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
executed?
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
data?
D : Not Flexible
D:

A : 10080
B : 11070
C : 130110
D : 11080
A:7
B:9
C : 11
D : 13
_____________
C : Both a and b
D : neither a nor b
following time.
A : O(Log N)
B : O (N*N)
C : O (N*N*N)
D : O (N Log N)
C : Memoization
D : Greedy
D:

Seat No -

Time : 1hr
Max Marks : 50
N.B
problem?
A : Not Recursion
A : Independent
B : Dependent
C:
D:
A : More
B : Less
C:
D:
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Back Tracking
Q.no 7. What is best case complexity of Insertion sort
A:n
B : n^2
C : nlogn
D:
Q.no 8. _____is the maximum number of steps that can be executed for given input
A : Average case
B : Best case
C : Worst case
D : Time complexity
A : Linear
B : polynomial
C : quadratic
D : exponential
A : Average case
B : Best case
C : Worst case
D : Time complexity
A : Pseudocode
B : Flowchart
D : both 1and 2
Q.no 12. In recursion, the condition for which the function will stop calling itself is?
A : Best case
B : Worst case
C : Base case
Q.no 13. def f():

int a[n][n]
sum = 0
for i = 1 to n:
for j = i to n:
sum += a[i][j]
print(sum)
A : O(n)
B : O(nlogn)
C : O(n^2)
D : O(n^3)
A : Braces
B : Parenthesis
C : Square Brackets
D : Slashes
A : Structural
B : C programming
C : Procedural
D : Fine
C : Huffman Coding
all n ≥ n0
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
A : Constant
C : logarithmic
D : linear
Q.no 19. For the improvement of efficiency of quick sort the pivot can be____
A : the first element
B : the middle element
C : the last element
D : any random element
A : Backtracking
both
A : true
B : false
C:
D:
A : precise
B : Ambigous
Q.no 27. ____________ is an algorithm design method that can be used when the solution to a
problem can be viewed as the result of a sequence of decisions
B : Backtracking
D : Greedy Method
A : 1,3,4,5,7,8,9,10
B : 1,4,3,9,8,5,7,10
C : 1,3,4,5,8,7,9,10
D : 1,3,7,4,8,5,9,10
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
A : Fn(10)
B : return
C : if (n==0)
D : Fn(n-1)
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)
A : f3, f2, f4, f1
B : f3, f2, f1, f4
C : f2, f3, f1, f4
D : None of these
D : Merge sort
for (i = 0; i < N; i++) {
a = a + rand();
}
for (j = 0; j < M; j++) {
b = b + rand();
}
D:
Q.no 35. What is the time complexity of Huffman Coding?
A : O(n)
B : O(NlogN)
C:
D:
A : log n
B:n
C : n log n
D : n/2
A : A,B, C
B : B, C, A
C : A, C, B
D : B,A, C
TRUE?
B : P is finite set
C:
D:
A : Code motion
D : All of these
_____________
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
C : Memoization
D : Greedy
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)

A : 10080
B : 11070
C : 130110
D : 11080
D:
A : m^2 + 3
B : m^m
C:m
D : m+1
D:
Worst case?
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
D:

A : 400
B : 420
C : 500
D : 440
D : Not Flexible
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. What approach is being followed in Floyd Warshall Algorithm?
A : Greedy Technique
C : Linear Programming
D : Backtracking
hypothesis
C : steps 1,2, 3
Q.no 3. Which of the following is incorrect for the given phrase: ’solvable by non deterministic
algorithms in polynomial time’
A : NP problems
B : P problem
C : NP complete problem
D : NP hard problem
Q.no 4. If the children of the root,from left to right, are the roots of Bk−1, Bk−2, . . . , B1, B0,
then root has degree .........
A : K-1
B:K
C : K+1
D : K+2
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
A : Independent
B : Dependent
C:
D:
Q.no 7. Which is an essential tool for proving the statement that proves an algorithm's
correctness.
A : Mathematical induction
B : Flow chart
C : Pseudo code
D : Recursion
Q.no 8. In a binomial heap the root value is greater than left child and less than right child.
A : true
B : false
C:
D:
B : Bin packing
D : Halting problem
A : Average case
B : Best case
C : Worst case
D : Time complexity
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Many
B : Two
C : One
D : Three
A : Brain
B : Nucleus
C : Neuron
D : Axon
Q.no 15. What is the best case time complexity of binary search?
A : O(n)
B : O(1)
C : O(log n)
D : O(n^2)
A : Debugging
B : Profiling
C : Conquer
D : Combining
A : 1 Node
B : 2 Nodes
C : 3 Nodes
D : 4 Nodes
A : Linear
B : polynomial
C : quadratic
D : exponential
A : Constant
C : logarithmic
D : linear
A : BST
B : MST
C : Binary Tree
D : Weighted Graph
A : While loop
B : For Loop
C : Do while loop
D : If statement
D : Both B and C
A : Intractable
B : Tractable
C : Undecidable
D : Decidable
A : Process
B : Work
C : Thread
D : Span
A : Greedy
C : Back Tracking
D : Branch & Bound
A : log n
B:n
C : n log n
D : n/2
Q.no 31. A Fibonacci heap uses ………… memory than a binary heap.
A : less
B : equal
C : more
D : cannot say
B : Backtracking
D : Greedy method
A : 100, 80
B : 110, 70
C : 130, 110
D : 110, 80

A : 60
B : 80
C : 100
D : 40
subproblem
C : both 1 and 2
D : Either 1 or 2
A : Queue
B : Stack
C : Priority Queue
D : List
71, 46, 8, 13, 16, 14, 66, 31, 27?
A : F1()
B : return
C : both
D : neither 1 nor 2
data?
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
Worst case?
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
A:7
B:9
C : 11
D : 13
A : 250
B : 270
C : 290
D : 130
D:
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
B : Greedy method
C : backtracking
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
C : Memoization
D : Greedy
C : Both a and b
D : neither a nor b
reductions ?
D:

A : 10080
B : 11070
C : 130110
D : 11080

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Roots
B : Leafs
C : Left Sub Trees
D : Right Sub Trees
Q.no 2. Who created the Rabin Karp Algorithm?
A : Joseph Rabin and Michael Karp
B : Michael Rabin and Joseph Karp
C : Richard Karp and Michael Rabin
D : Michael Karp and Richard Rabin
A : greedy method
C : Backtracking
D : Greedy Approach
Q.no 5. There are four algorithms A1, A2, A3, A4 to solve the given problem with the order
log(n), nlog(n), log(log(n)), n^2, Which is the best algorithm.
A : A1
B : A2
C : A3
D : A4
A : Problem Solving Technique
B : Data Structure
C : Sorting Algorithm
D : Type Of Tree
A : false
B : true
C:
D:
A : Pseudocode
B : Programme
C : Grammar
D : flowchart
A : true
B : false
C:
D:
C : Backtracking
D : Greedy Method
B : Run time error
C : Logical error
D : No error
Q.no 12. Choose the correct option
D : Iterative function is always better and simpler to write than recursion
A : 1 Node
B : 2 Nodes
C : 3 Nodes
D : 4 Nodes
A : Uniprocessor
B : Serial Computer
A : intractable
B : tractable
C : decision
D : complete
________
B : time complexity
B : Bin packing
D : Halting problem
is___________
A : Stack
B : Queue
C : Linked List
D : Tree
A : 1,3,4,5,7,8,9,10
B : 1,4,3,9,8,5,7,10
C : 1,3,4,5,8,7,9,10
D : 1,3,7,4,8,5,9,10
A : While loop
B : For Loop
C : Do while loop
D : If statement
problem?
B : Greedy
C : Backtracking
D:

A : 60
B : 80
C : 100
D : 40
A : Backtacking
C : Sorting
A : true
B : false
C:
D:
Q.no 29. Time taken in decreasing the node value in a binomial heap is
A : O(n)
B : O(1)
C : O(log n)
D : O(n log n)
A : O(n)
B : O(log n)
C : O(n+1)
D : O(n-1)
A : O(1)
B : O(log n)
C : O(n)
D : O(n^2)

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
A : 1 and 2
B : 1 and 3
C : 2 and 3
D : 1, 2, and 3
polynomial time
A : I and III
B : I and IV
C : II and III
D : II and IV
C : Greedy method
A : Initialization
B : Maintenance
C : Termination:
D : loop condition
maximized
D : Easy Network
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
C : Sorting
D : Not Flexible
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
executed?
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2
data?
D:
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
B : Best solution
C : Worst solution
D : All solutions
And Genetics
D:
B : Tail Recursion
D : Recursion
C : Both a and b
D : neither a nor b

Find the
A : 38
B : 40
C : 38.3
D : 45
A : m^2 + 3
B : m^m
C:m
D : m+1
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Not In Serial
B : Not In Parallel
D : Partial
D : Adaptive Linear
Q.no 4. Which of the following is the most commonly used data structure for implementing
Dijkstra’s Algorithm?
A : Max priority queue
B : Stack
C : Circular queue
D : Min priority queue
A : greedy method
Q.no 6. What is the time complexity of Dijikstra’s algorithm?
A : O(n)
B : O(n^3)
C : O(n^2)
D : O(log n)
A : Many
B : Two
C : One
D : Three
A : Uniprocessor
B : Serial Computer
Q.no 9. if x and y are Irrational numbers then x**y is
A : Rational
B : Irrational
C:
D:
Q.no 10. Dijkstra’s Algorithm is used to solve ………. problems.
C : Network flow
D : Sorting
A : Leaf node
C : Root node
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Average case
B : Best case
C : Worst case
D : Time complexity
C:
D:
A : K-1
B:K
C : K+1
D : K+2
Q.no 18. In an amortized analysis, the time required to perform a sequence of data structure
operations is summed over all the operations performed. This statement is true or false.
A : true
B : false
C:
D:
B : linear search
A : Natural Functions
B : Fitness Functions
C : Minimize Objective Functions
D : Member Function
A : true
B : false
C:
D:
A : the process
B : the decision
C : the loop
D : the sequential
A : true
B : false
C:
D:
B : P is finite set
C:
D:
71, 46, 8, 13, 16, 14, 66, 31, 27?
Q.no 28. Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally
need to show that:
A : There is a checking algorithm for C.
B : Every instance of C maps to an instance of SAT.
C : Every instance of SAT maps to an instance of C.
D : C does not have an efficient algorithm.
A : loop condition
C : loop invariant
D : none of these
maximized
TRUE?

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
A : 1 and 2
B : 1 and 3
C : 2 and 3
D : 1, 2, and 3
A : Initialization
B : Maintenance
C : Termination:
D : loop condition
A : Fn(10)
B : return
C : if (n==0)
D : Fn(n-1)
called ___________
C : Memoization
D : Mapping
D : Easy Network
A : Process
B : Work
C : Thread
D : Span
A : 1,3,4,5,7,8,9,10
B : 1,4,3,9,8,5,7,10
C : 1,3,4,5,8,7,9,10
D : 1,3,7,4,8,5,9,10
Q.no 40. Choose the correct steps to prove if the 3 SAT CNF problem is NP-Complete. I-- SAT
problem is in NP II--3 SAT CNF problem is in NP III--Prove that SAT ≤ 3 SAT CNF Problem in
polynomial time IV---Prove that 3 SAT CNF problem ≤ SAT Problem in polynomial time
A : I and III
B : I and IV
C : II and III
D : II and IV
B : Tail Recursion
D : Recursion
B : Greedy method
C : backtracking

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
A : O(nlog n)
B : O(n^2 )
C : O( n)
D : O(log n)
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
D : Not Flexible
D:
data?
A : Code motion
D : All of these
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
D:
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
D:
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A:7
B:9
C : 11
D : 13
reductions ?
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
A : Not Flexible
B : Robust
C : Inappropriate
A : 250
B : 270
C : 290
D : 130

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Pseudocode
B : Programme
C : Grammar
D : flowchart
A : true
B : false
C:
D:
Q.no 3. Hamiltonian path problem is _________
A : NP problem
B : N class problem
C : P class problem
D : NP complete problem
A : true
B : false
C:
D:
A : For condition
C : Both a and b
D : If condition
A : Contradiction
B : Approximation
D:
Q.no 8. Algorithm must have atleast one external input
A : true
B : false
C:
D:
Q.no 9. Which of the following is incorrect for the given phrase: ’solvable by non deterministic
algorithms in polynomial time’
A : NP problems
B : P problem
C : NP complete problem
D : NP hard problem
parentheses is a
A : queue
B : stack
C : tree
D : list
Q.no 11. def f():

int a[n][n]
sum = 0
for i = 1 to n:
for j = i to n:
sum += a[i][j]
print(sum)
A : O(n)
B : O(nlogn)
C : O(n^2)
D : O(n^3)
C:
D:
Select one:
B : T(n)=n.T(n/2)+b.f(n)
C : T(N)=A.T(N-1)+B
D : T(N)=N.T(N-3)+B
Q.no 14. In computer science, algorithm refers to a special method usable by a computer for the
solution to a problem.
A : true
B : false
C:
D:
Q.no 15. One can have __________, where each processor can directly access any location of
memory
A : Shared Memory
B : Cache Memory
C : Distributed Memory
D : Private Memory
Q.no 16. Two main measures for the efficiency of an algorithm are
A : Processor and memory
B : Complexity and capacity
C : Time and Space
D : Speed and Storage
Q.no 17. In a computational complexity theory, a problem with decision making is said to be NP-
complete when it is both in NP and NP-hard. What does NP mean?
A : Non Polynomial time
B : Non-deterministic Probabilistic
C : Non-deterministic Polynomial time
D : Non Probabilistic time
A : stack underflow
B : stack overflow
C : both
D:
A : O(n)
B : O(1)
C : O(log n)
D : O(n^2)
Q.no 20. Which of the following statements is true?
D : Iteration is always better and simpler than recursion
Q.no 22. Generally greedy algorithms are are in nature of
A : Iterative
B : Recursive
C : Both A and B
D : Neither A Nor B
A : greedy method
A : the process
B : the decision
C : the loop
D : the sequential
D:
Q.no 27. When the proof of a statement is started by assuming the statement is false the type of
proof is called _________.
A : proof by induction
B : proof by deduction
D:
both
A : true
B : false
C:
D:

int f(int n)
{
int s = 0;
while(n > 1)
{
n = n/2;
s++;
}
return s;
}
A : O(nlog n)
B : O(n^2 )
C : O(n)
D : O(log n )
A : 160
B : 200
C : 170
D : 90
Q.no 33. Which of the following statement about 0 1 knapsack and fractional knapsack problem
is correct?
A : In 0 1 knapsack problem items are divisible and in fractional knapsack items are indivisible
B : Both are the same
C : 0 1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic
programming
D : In 0 1 knapsack problem items are indivisible and in fractional knapsack items are divisible
maximized
A : Top Up Fashion
C : In Any Way
D : Random
A : Intractable
B : Tractable
C : Undecidable
D : Decidable
B : nested loop
D : termination
at every step.
A : greedy method
is correct?
Dynamic Programming
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
Worst case?
A : 250
B : 270
C : 290
D : 130
A : Not Flexible
B : Robust
C : Inappropriate
C : Sorting
data?
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n(n-1)/2
D:
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
D:
A:7
B:9
C : 11
D : 13
following time.
A : O(Log N)
B : O (N*N)
C : O (N*N*N)
D : O (N Log N)
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Best case
B : Worst case
C : Base case
A : true
B : false
C:
D:
Q.no 3. In computer science, algorithm refers to a special method usable by a computer for the
solution to a problem.
A : true
B : false
C:
D:
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Ɵ(n^2)
B : Ɵ(8)
C : Ɵ(log n)
D : Ɵ(n)
A : Definiteness
B : finiteness
C : scalability
D : effectiveness
A : Structural
B : C programming
C : Procedural
D : Fine
A : Roots
B : Leafs
C : Left Sub Trees
D : Right Sub Trees
Q.no 10. Which of the following can traverse the state space tree only in DFS manner?
A : Branch And Bound
D : Backtracking
Q.no 11. Algorithm must produce one output
A : true
B : false
C:
D:
Q.no 12. What is the objective of the knapsack problem?
A : To Get Maximum Total Value In The Knapsack
B : To Get Minimum Total Value In The Knapsack
C : To Get Maximum Weight In The Knapsack
D : To Get Minimum Weight In The Knapsack
A : Pseudocode
B : Flowchart
D : both 1and 2
………
A : time complexity
A : Constant
C : logarithmic
D : linear
problem?
A : Not Recursion
A : Linear
B : polynomial
C : quadratic
D : exponential
A : true
B : false
C:
D:
Q.no 19. Which of the following algorithms has worst time complexity?
A : insertion sort
B : binary search
C : linear search
D : merge sort
A : Contradiction
B : Approximation
D:
A : T1 / T∞
B : T1 / Tp
C : Tp / T1
D : T∞/T1
Q.no 22. Dynamic Programming uses
A : Member Function
B : Principle Of Optimality
C : Fitness Function
D : Minimize Objective Function
C : Memoization
D : Greedy
A:9
B:8
C:7
D:6
A : true
B : false
C:
D:
A : true
B : false
C:
D:
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
C : Sorting
C : Greedy Approach
A : O(n log n)
B : O(n)
C : O(1)
D : O(nW)
A : true
B : false
C:
D:
Q.no 35. Many multithreaded algorithms involving nested parallelism follow naturally from
C : Greedy Method
D : Branch and Bound Method
Q.no 38. The parallelism of a multithreaded computation is given by
A : T1 / Tp
B : T1 / T∞
C : T∞/T1
D : Tp / T1
A : greedy method
D : Merge sort
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
A : 250
B : 270
C : 290
D : 130
D:
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2
And Genetics
D:
B : Best solution
C : Worst solution
D : All solutions
networks?
B : Inflexibility
D : No Computation
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
A : O(nlog n)
B : O(n^2 )
C : O( n)
D : O(log n)
C : Both a and b
D : neither a nor b
Worst case?
A : Code motion
D : All of these

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. To solve one problem how many algorithms are possible?
A : one
B : two
C : several
D:
C:
D:
A : Linear
B : polynomial
C : quadratic
D : exponential
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Average case
B : Best case
C : Worst case
D : Time complexity
Q.no 7. Running time of algorithm varies with the size of the input called____
A : Growth of Function
B : Order of growth
C : Growth Rate
D : Growth of log function
Q.no 8. Recursion is a method in which the solution of a problem depends on?
A : Larger instances of different problems
B : Larger instances of the same problem

C : Smaller instances of the same problem
D : Smaller instances of different problems
B : time and space
C : date and space
A : insertion sort
B : binary search
C : linear search
D : merge sort
Q.no 11. Keywords________indicates that iteration of the loop may run concurrently.
A : Parallel loop
B : Thread
C : Parallel for
D : Multithreading
Q.no 12. What is the time complexity of following code: int a = 0;

for (i = 0; i < N; i++) {
for (j = N; j > i; j--) {
a = a + i + j;
}
}
A : O(N)
B : O(N*log(N))
C : O(N * Sqrt(N))
D : O(N*N)
A : Best case
B : Worst case
C : Base case
A : NP
B:P
C : Hard
D : Complete
A : intractable
B : tractable
C : decision
D : complete
C : Backtracking
D : Greedy Approach
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : true
B : false
C:
D:
A : greedy method
A : Join Operator
C : Selection
D : Multiplication
Q.no 22. Which of the following method is used for sorting in merge sort?
A : Merging
B : Partitioning
C : Selection
D : Exchanging
Q.no 23. The procedure FindMin() to find the minimum element and the procedure DeleteMin()
to delete the minimum element in min heap take ……….
A : logarithmic and linear time constant respectively
B : constant and linear time respectively
C : constant and quadratic time respectively
D : constant and logarithmic time respectively

A : 60
B : 80
C : 100
D : 40
Q.no 26. Choose the option with function having same complexity for a Fibonacci heap.
A : Insertion, Merge
B : Insertion, Deletion
C : ExtractMin, Insertion
D : Merge, Deletion
Q.no 27. Which of the following can be used to define NP complete class? I) polynomial time
Verifier II) Polynomial time reducibility of the known NP complete problem
A : only I
B : only II
C : both I and II
D : neither I nor II
A : T1 / T∞
B : T1 / Tp
C : Tp / T1
D : T∞/T1
A : true
B : false
C:
D:
A : Simple edge
B : Return edge
D : spawn edge
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
B : nested loop
D : termination
f1(n) = 2^n
f2(n) = n^(3/2)
f3(n) = nLogn
f4(n) = n^(Logn)
A : f3, f2, f4, f1
B : f3, f2, f1, f4
C : f2, f3, f1, f4
D : None of these
A : precise
B : Ambigous
Q.no 36.
A : 10
B:1
C : 10 9 8 ……1 0
D : 10 9 8 ……1
C : Greedy Approach
following time.
A : O(Log N)
B : O (N*N)
C : O (N*N*N)
D : O (N Log N)
And Genetics
B : Greedy method
C : backtracking
C : Sorting
D:
executed?

A : 400
B : 420
C : 500
D : 440
A : Code motion
D : All of these
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
D : Not Flexible
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30

A : 10080
B : 11070
C : 130110
D : 11080
B : Tail Recursion
D : Recursion
A : m^2 + 3
B : m^m
C:m
D : m+1
As Chromosomes.
networks?
B : Inflexibility
D : No Computation
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. A Greedy Algorithm can be used to solve all the Dynamic Programming problems.
A : True
B : FALSE
C:
D:
A : Backtracking
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Backtracking
C : Time and Space
A : true
B : false
C:
D:
is___________
A : Stack
B : Queue
C : Linked List
D : Tree
A : Braces
B : Parenthesis
C : Square Brackets
D : Slashes
A : Uniprocessor
B : Serial Computer
C : Backtracking
D : Greedy Approach
A : O(f(n))
B : O(g(n))
C : O(f(n)g(n))
D : O(f(n)+ g(n))
A : insertion sort
B : binary search
C : linear search
D : merge sort
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
C : Backtracking
D : Greedy Method
A : NP class
B : P class
C : NP Complete
D : NP Hard
A : Stack
B : Queue
C : Array
D : Linked List
B : Weights
C : Axons
D : Soma
Q.no 20. The time factor when determining the efficiency of algorithm is measured by
A : Counting microseconds
B : Counting the number of key operations
C : Counting the kilobytes of algorithm
D:
B : Backtracking
D : Greedy Method
C : Greedy method

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
A : 1 and 2
B : 1 and 3
C : 2 and 3
D : 1, 2, and 3
A : 100, 80
B : 110, 70
C : 130, 110
D : 110, 80
A : precise
B : Ambigous
Q.no 27. Generally greedy algorithms are are in nature of
A : Iterative
B : Recursive
C : Both A and B
D : Neither A Nor B
A : Queue
B : Stack
C : Priority Queue
D : List
A : F1()
B : return
C : both
D : neither 1 nor 2
A : greedy method
C : Memoization
D : Greedy
A : I and III
B : I and IV
C : II and III
D : II and IV
Q.no 35. What is the pre-processing time of Rabin and Karp Algorithm?
A : Theta(m2)
B : Theta(mlogn)
C : Theta(m)
D : Big-Oh(n)
A : While loop
B : For Loop
C : Do while loop
D : If statement
subproblem
C : both 1 and 2
D : Either 1 or 2
A : O(1)
B : O(log n)
C : O(n)
D : O(n^2)
pattern?
A:9
B : 13
C : 11
D : 10
A : Backtacking
networks?
B : Inflexibility
D : No Computation
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
D:
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
_____________
A : 250
B : 270
C : 290
D : 130
reductions ?
executed?
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
B : Best solution
C : Worst solution
D : All solutions
And Genetics
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
A : m^2 + 3
B : m^m
C:m
D : m+1
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
C : Both a and b
D : neither a nor b
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
A : Code motion
D : All of these
D : Not Flexible

Seat No -

Time : 1hr
Max Marks : 50
N.B
B : Run time error
C : Logical error
D : No error
Q.no 2. Which strategy is followed by QuickSort?
A : Greedy strategy
B : Brute Force technique
D : Divide and conquer
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
A : K-1
B:K
C : K+1
D : K+2
Q.no 5. The problem of finding a path in a graph that visits every vertex exactly once is called?
A : Hamiltonian cycle problem
B : Hamiltonian path problem
C : Subset sum problem
D : Turnpike reconstruction problem
A : Back Tracking
A : Definiteness
B : finiteness
C : scalability
D : effectiveness
Q.no 9. state whether True or false.. The solid base of algorithmic knowledge and technique is
one characteristic that separates the truly skilled programmers from the novices
A : true
B : false
C:
D:
A : false
B : true
C:
D:
C : Backtracking
D : Greedy Method
B : linear search
Q.no 14. Fibonacci heap has better amortized running time compared to a binomial heap.
A : true
B : false
C:
D:
A : NP class
B : P class
C : NP Complete
D : NP Hard
becomes a _________
A : Pseudocode
B : Programme
C:
D:
A : 1 Node
B : 2 Nodes
C : 3 Nodes
D : 4 Nodes
A : BST
B : MST
C : Binary Tree
D : Weighted Graph
B : P is finite set
C:
D:
Q.no 23.
A : 10
B:1
C : 10 9 8 ……1 0
D : 10 9 8 ……1
A : only I
B : only II
C : both I and II

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}
A : O(n)
B : O(nLogn)
C : O(n^2)
D : O(n^2Logn)
A : inverse proof
B : indirect proof
C : reverse proof
D:
D : Both B and C
Q.no 32. What is the time complexity of Huffman Coding?
A : O(n)
B : O(NlogN)
C:
D:
A : Greedy
C : Back Tracking
D : Branch & Bound
A : A,B, C
B : B, C, A
C : A, C, B
D : B,A, C
B : Proof by cases
D : direct proof
A : the process
B : the decision
C : the loop
D : the sequential
pattern?
A:9
B : 13
C : 11
D : 10

2. 2n + 1 = O(2n)
3. 22n + 1 = O(2n)
A : 1 and 2
B : 1 and 3
C : 2 and 3
D : 1, 2, and 3
A : Queue
B : Stack
C : Priority Queue
D : List
D:

Find the
A : 38
B : 40
C : 38.3
D : 45
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2
data?
reductions ?
C : Both a and b
D : neither a nor b
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
A : Code motion
D : All of these
……. time.
A : O(1)
B : O(n)
C : O(log n)
D : O(n log n)
_____________
D : Not Flexible
As Chromosomes.
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
C : Sorting
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n(n-1)/2
D:

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
A : O(nlog n)
B : O(n^2 )
C : O( n)
D : O(log n)

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : roots
B : leaves
C : left sub trees
D : right sub trees
Q.no 2. In a binomial heap the root value is greater than left child and less than right child.
A : true
B : false
C:
D:
A : greedy method
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
A : Debugging
B : Profiling
C : Conquer
D : Combining
Q.no 7. There are four algorithms A1, A2, A3, A4 to solve the given problem with the order
log(n), nlog(n), log(log(n)), n^2, Which is the best algorithm.
A : A1
B : A2
C : A3
D : A4
Q.no 9. waiting for the hardware advancements are always fruitful than finding the better
algorithm
A : true
B : false
C:
D:
A : Independent
B : Dependent
C:
D:
A : greedy method
Q.no 12. Recursive function must have
A : switch -case
B : exit condition
C : loop
D:
Q.no 13. Heap can be used as ……………….
A : Priority queue
B : Stack
C : A decreasing order array
D : Normal Array
A : true
B : false
C:
D:
A : K-1
B:K
C : K+1
D : K+2
A : Brain
B : Nucleus
C : Neuron
D : Axon
Q.no 17. What is flowchart ?
A : Representation of memory usage in algorithm
B : Representation of Time required to execute algorithm
C : visual representaion of algorithm
D:
problem?
A : Not Recursion
problem?
B : Greedy
C : Backtracking
C : Greedy Approach
Q.no 24. In amortized analysis, which method overcharges for operations early to compensate for
under-charges later?
A : Aggregate method
B : Accounting method
C : Potential method
D : Both aggregate and potential method
A : true
B : false
C:
D:
B : Backtracking
D : Greedy Method
B : P is finite set
C:
D:
A : Backtacking
A : Queue
B : Stack
C : Priority Queue
D : List
C : Sorting
A : true
B : false
C:
D:
A : true
B : false
C:
D:
A : only I
B : only II
C : both I and II
TRUE?
A : 1 and 2
B : 2 and 3
C : 1 and 3
D:
A : Join Operator
C : Selection
D : Multiplication
A : Intractable
B : Tractable
C : Undecidable
D : Decidable
C : Both a and b
D : neither a nor b
Worst case?
networks?
B : Inflexibility
D : No Computation
B : Best solution
C : Worst solution
D : All solutions
D:
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2

A : 10080
B : 11070
C : 130110
D : 11080
A : m^2 + 3
B : m^m
C:m
D : m+1
And Genetics
B : Tail Recursion
D : Recursion
A : B0, B2,B3
B : B2,B3,B4
C : B1,B2,B3,B4
D : B1,B2,B3
A : Not Flexible
B : Robust
C : Inappropriate
executed?
A:7
B:9
C : 11
D : 13
C : Sorting

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
A : O(nlog n)
B : O(n^2 )
C : O( n)
D : O(log n)
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
D:

Seat No -
10682_DESIGN AND ANALYSIS OF ALGORITHMS

Time : 1hr
Max Marks : 50
N.B
Q.no 1. The worst-case efficiency of solving a problem in polynomial time is?
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
Q.no 2. Application of Heap is
A : To search an element in the array
B : To sort the array
C : To evaluate a mathematical expression
D : To store an element in the array
Q.no 3. Dijkstra’s Algorithm is used to solve _____________ problems.

C : Network flow
D : Sorting
Q.no 4. What happens when the backtracking algorithm reaches a complete solution?
A : It backtracks to the root
B : It continues searching for other possible solutions
C : It traverses from a different route
D : Recursively traverses through the same route
Q.no 5. What is vertex coloring of a graph?
A : A condition where any two vertices having a common edge should not have same color
B : A condition where any two vertices having a common edge should always have same color
C : A condition where all vertices should have a different color
D : A condition where all vertices should have same color
Q.no 6. Which of the following is true?
A : Prim’s algorithm initialises with a vertex
B : Prim’s algorithm initialises with an edge
C : Prim’s algorithm initialises with a vertex which has smallest edge
D : Prim’s algorithm initialises with a forest
Q.no 7. Two sets are called disjoint if there _____________ is the empty set.
A : Union
B : Difference
C : Intersection
D : Complement
Q.no 8. Which is not a criteria of algorithm
A : Input
B : Output
C : Best case
D : Time complexity
Q.no 10. Who invented the word Algorithm
A : Abu Ja’far Muhammed ibn Uthman
B : Abu Ja’far Muhammed ibn Musa
C : Abu Ja’far Muhammed Ali Khan
D : Abu Ja’far Muhammed Kasim
Q.no 11. Which of the following is not a limitation of the binary search algorithm
A : Array must be sorted
B : Requirement of sorted array is expensive when lot of insertions and deletions are required
C : When the elements are more than 1000
D : There must be a mechanism to access the middle elements directly
Q.no 12. Which of the following is not a branch and bound strategy to generate branches?
A : LIFO branch and bound
B : FIFO branch and bound
C : Lowest cost branch and bound
D : Highest cost branch and bound
Q.no 13. The union of the sets {1, 2, 5} and {1, 2, 6} is the set _______________
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
Q.no 14. Which one of the following option is true for merge sort?
A : It uses greedy approach
B : It uses heuristic search
C : It uses divide and conquer strategy
D : It uses backtracking approach
Q.no 15. The running time of Quick sort depends on
A : Array size
B : Pivot element
C : Arrangement of elements
D : Number of inputs
________
B : time complexity
A : Problem solving technique
B : Data structure
C : Sorting algorithm
D : Type of tree
Q.no 18. Which of the following is an NP complete problem?
A : Hamiltonian cycle
B : Travelling salesman problem
C : Calculating chromatic number of graphs
D : Finding maximum element in an array
A : intractable
B : tractable
C : decision
D : complete
Q.no 20. In algorithm comments begin with
A:/
B : /*
C : */
D : //
A : Merge sort
B : Binary search
C : Longest common subsequence
D : Quicksort
Q.no 22. Which of the following algorithm follows Divide & Conquer technique
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
Q.no 23. Placing n-queens so that no two queens attack each other is called?
A : N-queen’s problem
B : 8-queen’s problem
C : Hamiltonian circuit problem
D : Subset sum problem

Q.no 24. Dijkstra’s Algorithm is the prime example for ___________.
A : Greedy algorithm
C : Back tracking
Q.no 25. How many stages of procedure does a non-deterministic algorithm consist of?
A:1
B:2
C:3
D:4
Q.no 26. Which of the following algorithm takes non linear time for sorting?
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
Q.no 27. Consider an array L. If an element in an array L is greater than all elements to the right
of it then it is called a leader. The best algorithm to find all leaders in an array
A : Solves it in time θ (n²)
B : Solves it in linear time using a left to right pass of the array
C : Solves it in linear time using a right to left pass of the array
D : Solves it using divide and conquer in time θ (n logn)
Q.no 28. To which class does the Euler’s circuit problem belong?
A : P class
B : NP class
C : Partition class
D : Complete class
Q.no 29. Minimum number of unique colors required for vertex coloring of a graph is called?
A : Vertex matching
B : Chromatic index
C : Chromatic number
D : Color number
Q.no 30. Worst case occurs in linear search algorithm when—
A : Item is somewhere in the middle of the array
B : Item is the first element of the array
C : Item is the last element of the array
D : Item is not in the array
Q.no 31. The travelling salesman problem can be solved using _________.
A : A spanning tree
B : A minimum spanning tree
C : Bellman – Ford algorithm
D : DFS traversal
Q.no 32. O(1) means computing time is
A : Constant
B : Linear
C : Quadratic
D : Cubic
A : NP
B:P
C : Hard
D : Complete
Q.no 34. In stable sort algorithm
A : Only one array is needed
B : More than one array is required.
C : Duplicate values remain in same relative position after sorting
D : Values remain in same relative position after sorting
Q.no 35. We have two sorted lists whose sizes are a and b. For merging these two lists into a
sorted list of size a + b, we require comparisons of
A : O (log a + log b)
B : O (a + b)
C : O(a)
D : O(b)
Q.no 36. Which of the following is false?
A : The spanning trees do not have any cycles
B : MST have n – 1 edges if the graph has n edges
C : Edge e belonging to a cut of the graph if has the weight smaller than any other edge in the same cut,
then the edge e is present in all the MSTs of the graph
D : Removing one edge from the spanning tree will not make the graph disconnected
Q.no 37. Which of the following is not an example of non comparison sort?
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
Q.no 38. The complexity of which of the following sorting algorithms remains to be the same in
its best,average and worst case?
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
Q.no 39. How many unique colors will be required for proper vertex coloring of an empty graph
having n vertices?
A:0
B:1
C:2
D:n
Q.no 40. Prim’s algorithm is a ______.
A : Divide and conquer algorithm
B : Greedy algorithm
C : Dynamic Programming
A : linked list
B : stack
C : queue
D : array
strategy?
A : stack
B : queue
C : priority queue
D : linked list
Q.no 43. In Divide and Conquer process,breaking the problem into smaller subproblems is the
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
Q.no 44. Merge sort uses which of the following method to implement sorting?
A : Merging
B : Partitioning
C : Selection
D : Exchange
Q.no 45. Job sequencing with deadline is based on ___method
A : Greedy method
Q.no 46. 0/1 knapsack is based on __method
A : Greedy Method
B : Branch and bound 2 8 7 1 3 5 6 4
Q.no 47. Counting sort performs …………. Numbers of comparisons between input elements.
A:0
B:n
C : nlogn
D : n/2
Q.no 48. In what manner is a state-space tree for a backtracking algorithm constructed?
A : Depth-first search
B : Breadth-first search
C : Twice around the tree

D : Nearest neighbour first
Q.no 49. The general criteria of algorithm-each instruction is clear and unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
Q.no 50. The functions f & g are non negative functions. The function f(n)=
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
Q.no 51. To implement Dijkstra’s shortest path algorithm on unweighted graphs so that it runs in
linear time, the data structure to be used is: Select one:
A : Heap
B : Stack
C : B-Tree
D : Queue
Q.no 52. Recurrence equation formed for the tower of Hanoi problem is given by _________
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
Q.no 53. Which of the problems cannot be solved by backtracking method?
A : N-queen problem
B : Subset sum problem
D : travelling salesman problem
Q.no 54. Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid
values(corresponding array elements) generated in the first and second iterations?
A : 90 and 99
B : 90 and 100
C : 89 and 94
D : 94 and 99
Q.no 55. Given two non negative functions f(n)=6n2+5n+1 and g(n)=n2 . Calculate the lower
bound value for c
A : c=5
B : c=1
C : c=2
D : c=6
Q.no 56. Minimum number of moves required to solve a tower of hanoi problem with n disks is
__________
A:n
B : 2^n-1
C : n/2
D : n^2
Q.no 57. Time complexity of the given algorithm – Algorithm Sum(a){s:=0.0;
A : 3n+2
B : 2n+3
C : 4n+2
D : 4n+4
Q.no 58. Consider a complete graph G with 4 vertices. The graph G has ____ spanning trees.
A : 15
B:8
C : 16
D : 13
Q.no 59. Which of the following is NOT a rule of tower of Hanoi puzzle?
A : No disk should be placed over a smaller disk
B : Disk can only be moved if it is the uppermost disk of the stack
C : No disk should be placed over a larger disk
D : Only one disk can be moved at a time
Q.no 60. T1 and T2 are the time taken by the Quicksort program P to sort the inputs [1 2 3 4]
and [5 4 3 2 1] in ascending order respectively. The statement that holds true is
A : T1 = T2
B : T1<T2
C : T1>T2
D : T1 = T2 + 5 log 5

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
________
B : time complexity
Q.no 3. Algorithms like Quick sort, Merge sort and Binary Search are based on
A : Greedy Method
B : Divide and Conquer Method
C : Backtracking method
D : Hashing method
A : intractable
B : tractable
C : decision
D : complete
A : Merge sort
B : Binary search
D : Quicksort
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
Q.no 10. Which of the following methods can be used to solve n-queen’s problem?
C : Iterative improvement
D : Backtracking
B : Data structure
D : Type of tree
A:1
B:2
C:3
D:4
A : Input
B : Output
C : Best case
D : Time complexity
A : Array size
B : Pivot element
C : Network flow
D : Sorting

A : Union
B : Difference
C : Intersection
D : Complement
C : Back tracking
A:0
B:n
C : nlogn
D : n/2
A : Output
B : Effectiveness
C : Definiteness
D : Input
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
A : P class
B : NP class
C : Partition class
D : Complete class
strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : Greedy Method
A : Constant
B : Linear
C : Quadratic
D : Cubic
having n vertices?
A:0
B:1
C:2
D:n
B : O (a + b)
C : O(a)
D : O(b)
A : linked list
B : stack
C : queue
D : array
A : Merging
B : Partitioning
C : Selection
D : Exchange
A : Greedy method
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : NP
B:P
C : Hard
D : Complete
Q.no 44. The Knapsack problem where the objective function is to minimize the profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A : Vertex matching
B : Chromatic index
D : Color number
A : branch and bound
B : dynamic programming
C : greedy algorithm
D : backtracking
A : A spanning tree
D : DFS traversal
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
A : P class
B : NP class
C : NP hard
D : NP complete
A : T1 = T2
B : T1<T2
C : T1>T2
D : T1 = T2 + 5 log 5
A : 15
B:8
C : 16
D : 13
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
A : 3n+2
B : 2n+3
C : 4n+2
D : 4n+4
A : 160
B : 200
C : 170
D : 90
A : Heap
B : Stack
C : B-Tree
D : Queue
A : N-queen problem
A : backtracking divides a problem into at least 2 new restricted sub problems
B : branch and bound is more efficient than backtracking
C : branch and bound is not suitable where a greedy algorithm is not applicable
D : branch and bound divides a problem into at least 2 new restricted sub problems

Seat No -

Time : 1hr
Max Marks : 50
N.B
C : Back tracking
D : Backtracking
A : intractable
B : tractable
C : decision
D : complete
A : Array size
B : Pivot element
C : Network flow
D : Sorting
A : Input
B : Output
C : Best case
D : Time complexity
A : Merge sort
B : Binary search

D : Quicksort
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A:1
B:2
C:3
D:4
B : Data structure
D : Type of tree
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
________
B : time complexity
A : Greedy Method
D : Hashing method
Q.no 24. Graphical representation of algorithm is-----
A : Pseudo code
B : Graph Coloring
C : Flow chart
Q.no 26. The complexity of binary search algorithm is----
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : Greedy method

A : Greedy Method
A : Merging
B : Partitioning
C : Selection
D : Exchange
having n vertices?
A:0
B:1
C:2
D:n
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
D : backtracking
A : A spanning tree
D : DFS traversal
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : NP
B:P
C : Hard
D : Complete
A:0
B:n
C : nlogn
D : n/2
A : linked list
B : stack
C : queue
D : array
strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : Vertex matching
B : Chromatic index
D : Color number
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
A : P class
B : NP class
C : Partition class
D : Complete class
A : 15
B:8
C : 16
D : 13
A : N-queen problem
Q.no 53. The time complexity of the solution tower of Hanoi problem using recursion is
_________
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
A : Heap
B : Stack
C : B-Tree
D : Queue
A : 160
B : 200
C : 170
D : 90
__________
A:n
B : 2^n-1
C : n/2
D : n^2
A : 90 and 99
B : 90 and 100
C : 89 and 94
D : 94 and 99
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Merge sort
B : Binary search
D : Quicksort
A : Input
B : Output
C : Best case
D : Time complexity
C : Back tracking
A : Array size
B : Pivot element
A : Greedy Method

D : Hashing method
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A:1
B:2
C:3
D:4
A : Union
B : Difference
C : Intersection
D : Complement

A:/
B : /*
C : */
D : //
B : Data structure
D : Type of tree
________
B : time complexity
C : Network flow
D : Sorting
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A : intractable
B : tractable
C : decision
D : complete
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : Vertex matching
B : Chromatic index
D : Color number
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : linked list
B : stack
C : queue
D : array

A : Greedy method
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
having n vertices?
A:0
B:1
C:2
D:n
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
A:0
B:n
C : nlogn
D : n/2
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
A : P class
B : NP class
C : Partition class
D : Complete class
A : NP
B:P
C : Hard
D : Complete
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A : Merging
B : Partitioning
C : Selection
D : Exchange
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
A : Constant
B : Linear
C : Quadratic
D : Cubic
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : A spanning tree
D : DFS traversal
A : Greedy Method
strategy?
A : stack
B : queue
C : priority queue
D : linked list
_________
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
A : Heap
B : Stack
C : B-Tree
D : Queue
A : 90 and 99
B : 90 and 100
C : 89 and 94
D : 94 and 99
A : 160
B : 200
C : 170
D : 90
A : T1 = T2
B : T1<T2
C : T1>T2
D : T1 = T2 + 5 log 5
A : N-queen problem
A : 15
B:8
C : 16
D : 13
A : P class
B : NP class
C : NP hard
D : NP complete

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Array size
B : Pivot element

B : Data structure
D : Type of tree
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : Input
B : Output
C : Best case
D : Time complexity
A : Greedy Method
D : Hashing method
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A : Union
B : Difference
C : Intersection
D : Complement
A : intractable
B : tractable
C : decision
D : complete
C : Back tracking
C : Network flow
D : Sorting
________
B : time complexity
A:/
B : /*
C : */
D : //
A : Pseudo code
B : Graph Coloring
C : Flow chart
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
D : backtracking
B : O (a + b)
C : O(a)
D : O(b)
A : Greedy Method
A : P class
B : NP class
C : Partition class
D : Complete class
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
A : Vertex matching
B : Chromatic index
D : Color number
A : NP
B:P
C : Hard
D : Complete
A : Greedy method
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : linked list
B : stack
C : queue
D : array
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
A : Constant
B : Linear
C : Quadratic
D : Cubic
A:0
B:n
C : nlogn
D : n/2
A : A spanning tree
D : DFS traversal
A : 160
B : 200
C : 170
D : 90
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
A : 3n+2
B : 2n+3
C : 4n+2
D : 4n+4
A : 15
B:8
C : 16
D : 13
A : T1 = T2
B : T1<T2
C : T1>T2
D : T1 = T2 + 5 log 5
A : Heap
B : Stack
C : B-Tree
D : Queue
_________
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
A : N-queen problem
bound value for c
A : c=5
B : c=1
C : c=2
D : c=6

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A:/
B : /*
C : */
D : //

B : Data structure
D : Type of tree
A : Pseudo code
B : Graph Coloring
C : Flow chart
C : Back tracking
A : Union
B : Difference
C : Intersection
D : Complement
A : Merge sort
B : Binary search
D : Quicksort

A : intractable
B : tractable
C : decision
D : complete
C : Network flow
D : Sorting
A : Greedy Method
D : Hashing method
A : Array size
B : Pivot element
D : Backtracking
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}

A : Input
B : Output
C : Best case
D : Time complexity
________
B : time complexity
A : NP
B:P
C : Hard
D : Complete
strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
A : Greedy Method
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A : linked list
B : stack
C : queue
D : array
A : Greedy method
A : Output
B : Effectiveness
C : Definiteness
D : Input
A:0
B:n
C : nlogn
D : n/2
D : backtracking
A : Vertex matching
B : Chromatic index
D : Color number
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : A spanning tree
D : DFS traversal

A : Constant
B : Linear
C : Quadratic
D : Cubic
A : P class
B : NP class
C : Partition class
D : Complete class
having n vertices?
A:0
B:1
C:2
D:n
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
A : Merging
B : Partitioning
C : Selection
D : Exchange
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
A : N-queen problem
A : Heap
B : Stack
C : B-Tree
D : Queue
_________
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
bound value for c
A : c=5
B : c=1
C : c=2
D : c=6
A : 90 and 99
B : 90 and 100
C : 89 and 94
D : 94 and 99
A : 15
B:8
C : 16
D : 13
A : T1 = T2
B : T1<T2
C : T1>T2
D : T1 = T2 + 5 log 5

Seat No -

Time : 1hr
Max Marks : 50
N.B
C : Network flow
D : Sorting

A : Pseudo code
B : Graph Coloring
C : Flow chart

A : Merge sort
B : Binary search
D : Quicksort
A:/
B : /*
C : */
D : //

A : intractable
B : tractable
C : decision
D : complete
C : Back tracking
A:1
B:2
C:3
D:4
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
________
B : time complexity
A : Input
B : Output
C : Best case
D : Time complexity
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A : Greedy Method
D : Hashing method
B : Data structure
D : Type of tree
D : Backtracking
strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : P class
B : NP class
C : Partition class
D : Complete class
A : Vertex matching
B : Chromatic index
D : Color number
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
having n vertices?
A:0
B:1
C:2
D:n
A : A spanning tree
D : DFS traversal
A : Constant
B : Linear
C : Quadratic
D : Cubic
A : Greedy method
A : linked list
B : stack
C : queue
D : array
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
A:0
B:n
C : nlogn
D : n/2
A : Merging
B : Partitioning
C : Selection
D : Exchange

A : Greedy Method
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
B : O (a + b)
C : O(a)
D : O(b)
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
D : backtracking
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : NP
B:P
C : Hard
D : Complete
A : N-queen problem
__________
A:n
B : 2^n-1
C : n/2
D : n^2
A : 160
B : 200
C : 170
D : 90
_________
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
A : 15
B:8
C : 16
D : 13
A : 3n+2
B : 2n+3
C : 4n+2
D : 4n+4
bound value for c
A : c=5
B : c=1
C : c=2
D : c=6
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
A : 90 and 99
B : 90 and 100
C : 89 and 94
D : 94 and 99

Seat No -

Time : 1hr
Max Marks : 50
N.B
A:1
B:2
C:3
D:4
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A : intractable
B : tractable
C : decision
D : complete
A : O(p(n))
B : O(p( n log n))

C : O(p(n2))
D : O(p(m log n))
A : Pseudo code
B : Graph Coloring
C : Flow chart
A : Union
B : Difference
C : Intersection
D : Complement
A : Array size
B : Pivot element
C : Network flow
D : Sorting
A : Input
B : Output
C : Best case
D : Time complexity
B : Data structure
D : Type of tree
C : Back tracking
A:/
B : /*
C : */
D : //
D : Backtracking
A : Merge sort
B : Binary search
D : Quicksort
A : Greedy Method
D : Hashing method
________
B : time complexity
A : Constant
B : Linear
C : Quadratic
D : Cubic
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A : Merging
B : Partitioning
C : Selection
D : Exchange
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
D : backtracking
A : Greedy method
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : Vertex matching
B : Chromatic index
D : Color number
A : Greedy Method
A:0
B:n
C : nlogn
D : n/2
A : linked list
B : stack
C : queue
D : array
B : O (a + b)
C : O(a)
D : O(b)
A : P class
B : NP class
C : Partition class
D : Complete class
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
having n vertices?
A:0
B:1
C:2
D:n
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
strategy?
A : stack
B : queue
C : priority queue
D : linked list
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
A : T1 = T2
B : T1<T2
C : T1>T2
D : T1 = T2 + 5 log 5
A : Heap
B : Stack
C : B-Tree
D : Queue
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
A : 160
B : 200
C : 170
D : 90
A : 90 and 99
B : 90 and 100
C : 89 and 94
D : 94 and 99
bound value for c
A : c=5
B : c=1
C : c=2
D : c=6
A : 3n+2
B : 2n+3
C : 4n+2
D : 4n+4
A : 15
B:8
C : 16
D : 13

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Merge sort
B : Binary search
D : Quicksort
B : Data structure
D : Type of tree
A:/
B : /*
C : */
D : //
A:1
B:2
C:3
D:4

A : Pseudo code
B : Graph Coloring
C : Flow chart
A : Greedy Method
D : Hashing method
________
B : time complexity
A : Array size
B : Pivot element
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
C : Back tracking
A : intractable
B : tractable
C : decision
D : complete
D : Backtracking
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
C : Network flow
D : Sorting
A : Union
B : Difference
C : Intersection
D : Complement

A : Input
B : Output
C : Best case
D : Time complexity
A : Constant
B : Linear
C : Quadratic
D : Cubic
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
A : linked list
B : stack
C : queue
D : array
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
having n vertices?
A:0
B:1
C:2
D:n
A : A spanning tree
D : DFS traversal
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
B : O (a + b)
C : O(a)
D : O(b)
A : Greedy Method
A:0
B:n
C : nlogn
D : n/2
D : backtracking
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A : NP
B:P
C : Hard
D : Complete
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
A : Greedy method
strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : Merging
B : Partitioning
C : Selection
D : Exchange
A : P class
B : NP class
C : Partition class
D : Complete class
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
A : 160
B : 200
C : 170
D : 90
A : 90 and 99
B : 90 and 100
C : 89 and 94
D : 94 and 99
A : Heap
B : Stack
C : B-Tree
D : Queue
A : N-queen problem
A : 15
B:8
C : 16
D : 13
A : 3n+2
B : 2n+3
C : 4n+2
D : 4n+4
_________
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
__________
A:n
B : 2^n-1
C : n/2
D : n^2
bound value for c
A : c=5
B : c=1
C : c=2
D : c=6
A : P class
B : NP class
C : NP hard
D : NP complete

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Pseudo code
B : Graph Coloring
C : Flow chart

B : Data structure
D : Type of tree
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
D : Backtracking

A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A : Union
B : Difference
C : Intersection
D : Complement
C : Back tracking
A : intractable
B : tractable
C : decision
D : complete
C : Network flow
D : Sorting
A : Array size
B : Pivot element
A : Greedy Method
D : Hashing method
A : Input
B : Output
C : Best case
D : Time complexity
A:/
B : /*
C : */
D : //
A:1
B:2
C:3
D:4
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : NP
B:P
C : Hard
D : Complete
A : Merging
B : Partitioning
C : Selection
D : Exchange
A : Constant
B : Linear
C : Quadratic
D : Cubic
A : f(n) <= c*g(n)
B : f(n)>= c*g(n)
C : c*g(n) <= f(n) >= c*g(n)
D : c*g(n) >= f(n) <= c*g(n)
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
A : Vertex matching
B : Chromatic index
D : Color number
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
A : Greedy Method
D : backtracking
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
B : O (a + b)
C : O(a)
D : O(b)
A:0
B:n
C : nlogn
D : n/2
A : linked list
B : stack
C : queue
D : array
responsibility of
A : Divide/Break
B : Sorting/Divide
C : Conquer/Solve
D : Merge/combine
having n vertices?
A:0
B:1
C:2
D:n
strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : Greedy method
A : A spanning tree
D : DFS traversal
A : N-queen problem
A : Heap
B : Stack
C : B-Tree
D : Queue
A : P class
B : NP class
C : NP hard
D : NP complete
A : 3n+2
B : 2n+3
C : 4n+2
D : 4n+4
_________
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
A : 15
B:8
C : 16
D : 13
A : 90 and 99
B : 90 and 100
C : 89 and 94
D : 94 and 99
bound value for c
A : c=5
B : c=1
C : c=2
D : c=6
A : 160
B : 200
C : 170
D : 90
__________
A:n
B : 2^n-1
C : n/2
D : n^2

Seat No -
11028_IT 44 DESIGN AND ANALYSIS OF ALGORITHM

Time : 1hr
Max Marks : 50
N.B
Q.no 1. Which of the following is not a branch and bound strategy to generate
branches?
B : Data structure
D : Type of tree
B : Requirement of sorted array is expensive when lot of insertions and deletions are
required
Q.no 5. How many stages of procedure does a non-deterministic algorithm consist

of?
A:1
B:2
C:3
D:4
A : A condition where any two vertices having a common edge should not have same
color
B : A condition where any two vertices having a common edge should always have
same color
Q.no 7. The worst-case efficiency of solving a problem in polynomial time is?
A : O(p(n))
B : O(p( n log n))

C : O(p(n2))
D : O(p(m log n))
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
Q.no 11. What happens when the backtracking algorithm reaches a complete
solution?
A : intractable
B : tractable
C : decision
D : complete
Q.no 13. On which algorithm is heap sort based on?
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO
A : Pseudo code
B : Graph Coloring
C : Flow chart
A : Array size
B : Pivot element

D : Backtracking
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A:/
B : /*
C : */
D : //
C : Back tracking
Q.no 22. Which of the following problems should be solved using dynamic
programming?
A : Merge sort
B : Binary search
D : Quicksort
A : Input
B : Output
C : Best case
D : Time complexity
Q.no 24. In heap sort, after deleting the last minimum element, the array will
contain elements in?
A : tree preorder
B : increasing sorting order
C : decreasing sorting order
D : tree inorder
C : Network flow
D : Sorting
A : Greedy Method
Q.no 27. _________ is the class of decision problems that can be solved by non-
deterministic polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
Q.no 29. The complexity of which of the following sorting algorithms remains to
be the same in its best,average and worst case?
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
Q.no 30. We have two sorted lists whose sizes are a and b. For merging these two
lists into a sorted list of size a + b, we require comparisons of
B : O (a + b)
C : O(a)
D : O(b)
A : A spanning tree
D : DFS traversal

C : Edge e belonging to a cut of the graph if has the weight smaller than any other edge
in the same cut, then the edge e is present in all the MSTs of the graph
A : Greedy method
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
Q.no 35. Counting sort performs …………. Numbers of comparisons between input
elements.
A:0
B:n
C : nlogn
D : n/2
Q.no 36. Minimum number of unique colors required for vertex coloring of a
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
Q.no 37. Which of the following is not true about comparison based sorting
algorithms?
A : The minimum possible time complexity of a comparison based sorting algorithm is

O(nLogn) for a random input array
B : Any comparison based sorting algorithm can be made stable by using position as a
criteria when two elements are compared
C : Counting Sort is not a comparison based sorting algortihm
D : Heap Sort is not a comparison based sorting algorithm.
A : Merging
B : Partitioning
C : Selection
D : Exchange
Q.no 39. In what manner is a state-space tree for a backtracking algorithm

constructed?
A : Depth-first search
B : Breadth-first search
D : Nearest neighbour first
Q.no 40. The general criteria of algorithm-each instruction is clear and

unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
Q.no 42. What is recurrence for worst case of QuickSort and what is the time
complexity in Worst case?
C : Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(nLogn)
D : Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(nLogn)
Q.no 43. The Knapsack problem where the objective function is to minimize the
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
Q.no 44. The recurrence relation capturing the optimal time of the Tower of
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1
Q.no 45. How many arrays are required to perform deletion operation in a heap?
A:1
B:2
C:3
D:4
Q.no 46. In what position does the array for heap sort contains data?
A:0
B:1
C : -1
D : anywhere in the array
Q.no 47. Which data structure is used for implementing a LIFO branch and bound
strategy?
A : linked list
B : stack
C : queue
D : array
Q.no 48. Consider an array L. If an element in an array L is greater than all

elements to the right of it then it is called a leader. The best algorithm to find all
leaders in an array
A : P class
B : NP class
C : Partition class
D : Complete class
Q.no 50. How many unique colors will be required for proper vertex coloring of
an empty graph having n vertices?
A:0
B:1
C:2
D:n
Q.no 51. Recurrence equation formed for the tower of Hanoi problem is given by
_________
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
Q.no 52. Consider a complete graph G with 4 vertices. The graph G has ____
spanning trees.
A : 15
B:8
C : 16
D : 13
Q.no 53. What is the average number of comparisons used to heap sort a random
permutation of N distinct items?
A : 2N log N-O(N)
B : 2N log N-O(N log N)
C : 2N log N-O(N log log N)
D : 2N log N-O(log N)
Q.no 54. Which of the following is not O(n^2)?
A : (15^10) * n + 12099
B : n^1.98
C : n^3 / (sqrt(n))
D : (2^20) * n
A : backtracking
B : greedy algorithm
C : divide and conquer

D : dynamic programming
Q.no 56. What is the time taken to perform a delete min operation?
A : O(N)
B : O(N log N)
C : O(log N)
D : O(N2)
Q.no 57. The loop invariant condition at the end of the ith iteration is:
A : n = D1D2….Dm-i and rev = DmDm-1…Dm-i+1
B : n = Dm-i+1…Dm-1Dm and rev = Dm-1….D2D1
C : n != rev
D : n = D1D2….Dm and rev = DmDm-1…D2D1
Q.no 58. If an optimal solution can be created for a problem by constructing

optimal solutions for its subproblems, the problem possesses ____________
property.
A : Overlapping subproblems
B : Optimal substructure
C : Memoization
D : Greedy
Q.no 59. To which of the following class does a CNF-satisfiability problem belong?
A : P class
B : NP class
C : NP hard
D : NP complete
Q.no 60. The time complexity of the solution tower of Hanoi problem using
recursion is _________
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)




Seat No -

Time : 1hr
Max Marks : 50
N.B
branches?

B : Data structure
D : Type of tree
C : Back tracking

programming?
A : Merge sort
B : Binary search
D : Quicksort
A : Pseudo code
B : Graph Coloring
C : Flow chart
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : Input
B : Output
C : Best case
D : Time complexity

A:/
B : /*
C : */
D : //
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO
A : tree preorder
D : tree inorder
solution?

D : Backtracking
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A : Greedy Method
D : Hashing method
A : Array size
B : Pivot element
color
same color
Q.no 23. How many stages of procedure does a non-deterministic algorithm

consist of?
A:1
B:2
C:3
D:4
A : intractable
B : tractable
C : decision
D : complete
A:0
B:1
C:2
D:n
A : Greedy Method
A : A spanning tree
D : DFS traversal

unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
B : O (a + b)
C : O(a)
D : O(b)
A : P class
B : NP class
C : Partition class
D : Complete class
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1
Q.no 34. Which data structure is most suitable for implementing best first branch
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list

constructed?
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
leaders in an array
A:0
B:1
C : -1
A : Greedy method
A : Merging
B : Partitioning
C : Selection
D : Exchange

graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
algorithms?

A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
Q.no 49. Which of the following can traverse the state space tree only in DFS
manner?
D : backtracking
A : NP
B:P
C : Hard
D : Complete
Q.no 51. You are given a knapsack that can carry a maximum weight of 60. There
are 4 items with weights {20, 30, 40, 70} and values {70, 80, 90, 200}. What is the
maximum value of the items you can carry using the knapsack?
A : 160
B : 200
C : 170
D : 90
A : 2N log N-O(N)
C : n != rev
A : (15^10) * n + 12099
B : n^1.98
C : n^3 / (sqrt(n))
D : (2^20) * n
A : O(N)
B : O(N log N)
C : O(log N)
D : O(N2)
spanning trees.
A : 15
B:8
C : 16
D : 13
A : backtracking
A : P class
B : NP class
C : NP hard
D : NP complete
A : N-queen problem
Q.no 60. To implement Dijkstra’s shortest path algorithm on unweighted graphs

so that it runs in linear time, the data structure to be used is: Select one:
A : Heap
B : Stack
C : B-Tree
D : Queue




Seat No -

Time : 1hr
Max Marks : 50
N.B

of?
A:1
B:2
C:3
D:4

C : Back tracking
C : Network flow
D : Sorting
A:/
B : /*
C : */
D : //
A : Array size
B : Pivot element

solution?
D : Backtracking
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A : tree preorder
D : tree inorder
A : Pseudo code
B : Graph Coloring
C : Flow chart
A : Greedy Method
D : Hashing method
B : Data structure
D : Type of tree
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A : Input
B : Output
C : Best case
D : Time complexity
programming?
A : Merge sort
B : Binary search
D : Quicksort
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
required
color
same color
algorithms?

A : NP
B:P
C : Hard
D : Complete
B : O (a + b)
C : O(a)
D : O(b)
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list
unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
elements.
A:0
B:n
C : nlogn
D : n/2
A : P class
B : NP class
C : Partition class
D : Complete class
manner?
D : backtracking

constructed?
A : Greedy method
A:0
B:1
C : -1
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : Merging
B : Partitioning
C : Selection
D : Exchange
A:1
B:2
C:3
D:4
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A : Greedy Method

A : A spanning tree
D : DFS traversal
strategy?
A : linked list
B : stack
C : queue
D : array

leaders in an array

property.
C : Memoization
D : Greedy
spanning trees.
A : 15
B:8
C : 16
D : 13
A : 160
B : 200
C : 170
D : 90
A : N-queen problem
B : branch and bound is more efficient than backtracking
A : (15^10) * n + 12099
B : n^1.98
C : n^3 / (sqrt(n))
D : (2^20) * n
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
_________
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n

A : Heap
B : Stack
C : B-Tree
D : Queue

C : n != rev





Seat No -

Time : 1hr
Max Marks : 50
N.B
branches?
A : Array size
B : Pivot element
B : Data structure
D : Type of tree
C : Network flow
D : Sorting

programming?
A : Merge sort
B : Binary search
D : Quicksort
A : Input
B : Output
C : Best case
D : Time complexity
required
C : Back tracking
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A:/
B : /*
C : */
D : //
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))

A : Greedy Method
D : Hashing method

consist of?
A:1
B:2
C:3
D:4
D : Backtracking
A : tree preorder
D : tree inorder
color
same color
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO
A : Pseudo code
B : Graph Coloring
C : Flow chart
solution?

leaders in an array

A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : Greedy Method
A : Merging
B : Partitioning
C : Selection
D : Exchange
A:0
B:1
C:2
D:n
A : Greedy method
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
strategy?
A : linked list
B : stack
C : queue
D : array
elements.
A:0
B:n
C : nlogn
D : n/2
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
A:1
B:2
C:3
D:4
B : O (a + b)
C : O(a)
D : O(b)
A : A spanning tree
D : DFS traversal
manner?
D : backtracking
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1
A : P class
B : NP class
C : Partition class
D : Complete class
algorithms?

A:0
B:1
C : -1
A : NP
B:P
C : Hard
D : Complete
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)

Q.no 52. Minimum number of moves required to solve a tower of hanoi problem
with n disks is __________
A:n
B : 2^n-1
C : n/2
D : n^2
_________
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n

property.
C : Memoization
D : Greedy
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)

A : Heap
B : Stack
C : B-Tree
D : Queue
A : backtracking
A : N-queen problem
A : 2N log N-O(N)
spanning trees.
A : 15
B:8
C : 16
D : 13




Seat No -

Time : 1hr
Max Marks : 50
N.B


of?
A:1
B:2
C:3
D:4
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
D : Backtracking
A : Input
B : Output
C : Best case
D : Time complexity
A : Array size
B : Pivot element
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO

A : Greedy Method
D : Hashing method
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A:/
B : /*
C : */
D : //
A : Pseudo code
B : Graph Coloring
C : Flow chart

color
same color
B : Data structure
D : Type of tree
A : tree preorder
D : tree inorder
C : Back tracking
solution?

programming?
A : Merge sort
B : Binary search
D : Quicksort
required
C : Network flow
D : Sorting
manner?
D : backtracking
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
A : Greedy method
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1
strategy?
A : linked list
B : stack
C : queue
D : array
A : Merging
B : Partitioning
C : Selection
D : Exchange
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A:1
B:2
C:3
D:4

unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : A spanning tree
D : DFS traversal
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : Greedy Method

constructed?
A : P class
B : NP class
C : Partition class
D : Complete class
A : NP
B:P
C : Hard
D : Complete
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
elements.
A:0
B:n
C : nlogn
D : n/2

leaders in an array
A:0
B:1
C:2
D:n
algorithms?

A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : O(N)
B : O(N log N)
C : O(log N)
D : O(N2)
A : N-queen problem
C : n != rev
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)
A:n
B : 2^n-1
C : n/2
D : n^2
A : 160
B : 200
C : 170
D : 90
A : 2N log N-O(N)
A : P class
B : NP class
C : NP hard
D : NP complete
_________
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
A : backtracking




Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Pseudo code
B : Graph Coloring
C : Flow chart

solution?

branches?
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO
color
same color

A : intractable
B : tractable
C : decision
D : complete

of?
A:1
B:2
C:3
D:4
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A : Input
B : Output
C : Best case
D : Time complexity
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A : Greedy Method
D : Hashing method
D : Backtracking
A : tree preorder
D : tree inorder
B : Data structure
D : Type of tree
C : Back tracking
A : Array size
B : Pivot element
required
C : Network flow
D : Sorting
manner?
D : backtracking
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : Greedy Method
A : Greedy method
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A:0
B:1
C:2
D:n
A : Merging
B : Partitioning
C : Selection
D : Exchange

constructed?
algorithms?

A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort

leaders in an array
A:1
B:2
C:3
D:4
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort

unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
elements.
A:0
B:n
C : nlogn
D : n/2
A : A spanning tree
D : DFS traversal
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1
B : O (a + b)
C : O(a)
D : O(b)
A : NP
B:P
C : Hard
D : Complete
strategy?
A : linked list
B : stack
C : queue
D : array

A : 160
B : 200
C : 170
D : 90
A : backtracking
A : (15^10) * n + 12099
B : n^1.98
C : n^3 / (sqrt(n))
D : (2^20) * n

A : Heap
B : Stack
C : B-Tree
D : Queue

property.
C : Memoization
D : Greedy
spanning trees.
A : 15
B:8
C : 16
D : 13
C : n != rev
A : P class
B : NP class
C : NP hard
D : NP complete
A : 2N log N-O(N)




Seat No -

Time : 1hr
Max Marks : 50
N.B

solution?

required
B : Data structure
D : Type of tree
C : Back tracking
A : Array size
B : Pivot element
color
same color

A : Greedy Method
D : Hashing method
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
programming?
A : Merge sort
B : Binary search
D : Quicksort
A : Input
B : Output
C : Best case
D : Time complexity
A:/
B : /*
C : */
D : //
D : Backtracking
C : Network flow
D : Sorting
A : intractable
B : tractable
C : decision
D : complete
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
branches?
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A : tree preorder

D : tree inorder
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO
A : Pseudo code
B : Graph Coloring
C : Flow chart
A : Greedy Method
manner?
D : backtracking
A : Greedy method

unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1
A:0
B:1
C : -1

constructed?
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : A spanning tree
D : DFS traversal
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort

A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A:1
B:2
C:3
D:4
A : NP
B:P
C : Hard
D : Complete
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
algorithms?

A:0
B:1
C:2
D:n
B : O (a + b)
C : O(a)
D : O(b)
A : P class
B : NP class
C : Partition class
D : Complete class
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number

leaders in an array
strategy?
A : linked list
B : stack
C : queue
D : array
C : n != rev
A : backtracking
A : 2N log N-O(N)
A : P class
B : NP class
C : NP hard
D : NP complete

A : Heap
B : Stack
C : B-Tree
D : Queue
spanning trees.
A : 15
B:8
C : 16
D : 13
A:n
B : 2^n-1
C : n/2
D : n^2
A : 160
B : 200
C : 170
D : 90

property.
C : Memoization
D : Greedy
Seat No -

Time : 1hr
Max Marks : 50
N.B
A:/
B : /*
C : */
D : //
A : tree preorder
D : tree inorder
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
C : Back tracking
D : Backtracking
A : Array size
B : Pivot element
A : Input
B : Output
C : Best case
D : Time complexity
programming?
A : Merge sort
B : Binary search
D : Quicksort
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}

consist of?
A:1
B:2
C:3
D:4

A : intractable
B : tractable
C : decision
D : complete
branches?
required
solution?

A : Pseudo code
B : Graph Coloring
C : Flow chart
color
same color
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO

C : Network flow
D : Sorting
A : Greedy Method
D : Hashing method
manner?
D : backtracking
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
algorithms?

A : Merging
B : Partitioning
C : Selection
D : Exchange
elements.
A:0
B:n
C : nlogn
D : n/2

leaders in an array
A : Greedy Method

A:1
B:2
C:3
D:4
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : Greedy method
A : P class
B : NP class
C : Partition class
D : Complete class
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
strategy?
A : linked list
B : stack
C : queue
D : array

constructed?
B : O (a + b)
C : O(a)
D : O(b)
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1
A : NP
B:P
C : Hard
D : Complete

unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
A:0
B:1
C : -1
A : A spanning tree

D : DFS traversal
A : backtracking
A:n
B : 2^n-1
C : n/2
D : n^2
A : (15^10) * n + 12099
B : n^1.98
C : n^3 / (sqrt(n))
D : (2^20) * n
A : 2N log N-O(N)

A : Heap
B : Stack
C : B-Tree
D : Queue
spanning trees.
A : 15
B:8
C : 16
D : 13
_________
A : T(n) = 2T(n-1)+n
B : T(n) = 2T(n/2)+c
C : T(n) = 2T(n-1)+c
D : T(n) = 2T(n/2)+n
A : P class
B : NP class
C : NP hard
D : NP complete
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)

C : n != rev





Seat No -

Time : 1hr
Max Marks : 50
N.B
A : tree preorder
D : tree inorder

of?
A:1
B:2
C:3
D:4
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO

programming?
A : Merge sort
B : Binary search
D : Quicksort
branches?

color
same color

solution?
C : Network flow
D : Sorting
A : Input
B : Output
C : Best case
D : Time complexity
A:/
B : /*
C : */
D : //
A : Greedy Method
D : Hashing method
A : Array size
B : Pivot element
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
D : Backtracking
A : Pseudo code
B : Graph Coloring
C : Flow chart
A : intractable
B : tractable
C : decision
D : complete
C : Back tracking
required
B : Data structure
D : Type of tree
strategy?
A : linked list
B : stack
C : queue
D : array
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
A:0
B:1
C : -1
A : NP
B:P
C : Hard
D : Complete
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
leaders in an array
A:0
B:1
C:2
D:n
manner?
D : backtracking
A : Merging
B : Partitioning
C : Selection
D : Exchange
elements.
A:0
B:n
C : nlogn
D : n/2
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
B : O (a + b)
C : O(a)
D : O(b)

constructed?

unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
algorithms?

A : P class
B : NP class
C : Partition class
D : Complete class

A:1
B:2
C:3
D:4
A : Greedy Method
A : Bubble sort
B : Quick sort
C : Bucket sort
D : Radix sort
A : Greedy method
A : A spanning tree
D : DFS traversal
A : (15^10) * n + 12099
B : n^1.98
C : n^3 / (sqrt(n))
D : (2^20) * n
spanning trees.
A : 15
B:8
C : 16
D : 13
A : 2N log N-O(N)
A : O(N)
B : O(N log N)
C : O(log N)
D : O(N2)
A : N-queen problem

property.
C : Memoization
D : Greedy

A : Heap
B : Stack
C : B-Tree
D : Queue
A : backtracking
A : 160
B : 200
C : 170
D : 90
Seat No -

Time : 1hr
Max Marks : 50
N.B
color
same color

A:/
B : /*
C : */
D : //
A : fibonacci heap
B : Binary tree
C : Priority queue
D : FIFO
C : Back tracking
A : O(p(n))
B : O(p( n log n))
C : O(p(n2))
D : O(p(m log n))
A : tree preorder
D : tree inorder
A : Greedy Method
D : Hashing method
B : Data structure
D : Type of tree
A : Input
B : Output
C : Best case
D : Time complexity
programming?
A : Merge sort
B : Binary search
D : Quicksort
branches?
D : Backtracking
A : Bubble sort
B : Quick sort
C : Insertion sort
D : Radix sort
A : {1,2,6,1}
B : {1,2,5,6}
C : {1,2,1,2}
D : {1,5,6,3}
solution?
A : Array size
B : Pivot element
A : Pseudo code
B : Graph Coloring
C : Flow chart
required
A : intractable
B : tractable
C : decision
D : complete
A : A spanning tree
D : DFS traversal

unambiguous ----
A : Output
B : Effectiveness
C : Definiteness
D : Input
A : Greedy method
profit is ______.
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
Hanoi
A : T(n) = 2T(n – 2) + 2
B : T(n) = 2T(n – 1) + n
C : T(n) = 2T(n/2) + 1
D : T(n) = 2T(n – 1) + 1

elements.
A:0
B:n
C : nlogn
D : n/2
manner?
D : backtracking
A : P class
B : NP class
C : Partition class
D : Complete class
A : NP
B:P
C : Hard
D : Complete

A : O(n)
B : O(log n)
C : O(n log n)
D : O(n2)
B : O (a + b)
C : O(a)
D : O(b)
A:1
B:2
C:3
D:4
strategy?
A : linked list
B : stack
C : queue
D : array
A:0
B:1
C : -1
A : Quick sort
B : Insertion sort
C : Counting sort
D : Heap sort
A : Bubble sort
B : Counting sort
C : Radix sort
D : Bucket sort
algorithms?


constructed?
graph is called?
A : Vertex matching
B : Chromatic index
D : Color number
A : Greedy Method
and bound strategy?
A : stack
B : queue
C : priority queue
D : linked list
A : Merging
B : Partitioning
C : Selection
D : Exchange
A : backtracking

A : Heap
B : Stack
C : B-Tree
D : Queue
spanning trees.
A : 15
B:8
C : 16
D : 13
A : (15^10) * n + 12099
B : n^1.98
C : n^3 / (sqrt(n))
D : (2^20) * n
A : P class
B : NP class
C : NP hard
D : NP complete
A : 160
B : 200
C : 170
D : 90
A : N-queen problem
C : n != rev
A : O(logn)
B : O(2^n)
C : O(nlogn)
D : O(n)




Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Average case
B : Best case
C : Worst case
D : Time complexity
A : greedy method
D : Member Function
A : To get maximum total value in the knapsack
B : To get minimum total value in the knapsack
C : To get maximum weight in the knapsack
D : To get minimum weight in the knapsack
A : Not In Serial
B : Not In Parallel
D : Partial
D : Adaptive Linear
A : intractable
B : tractable
C : decision
D : complete
problem?
A : Not Recursion
C : Huffman Coding
A : Switch Case
B : Loop
C : If else
D : if elif else
C : Backtracking
D : Greedy Method
C : Backtracking
D : Greedy Approach
all n ≥ n0
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : Little o(g(n))
A : Best case
B : Worst case
C : Base case
D : Twisted Network
A : Backtracking

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}
A : O(n)
B : O(nLogn)
C : O(n^2)
D : O(n^2Logn)
Q.no 23. Suppose SAT reduces to a problem C. To claim that C is NP-complete, we additionally
need to show that:
A : There is a checking algorithm for C.
B : Every instance of C maps to an instance of SAT.
C : Every instance of SAT maps to an instance of C.
D : C does not have an efficient algorithm.
called?
B : prefix encoding
D : Trie encoding
A : loop condition
C : loop invariant
D : none of these
at every step.
A : greedy method
A : Top Up Fashion
C : In Any Way
D : Random
A : only I
B : only II
C : both I and II
A : A,B, C
B : B, C, A
C : C, B ,A
D : B,A, C
B : Backtracking
D : Greedy method
A : Merging
B : Partitioning
C : Selection
D : Exchanging

A : 60
B : 80
C : 100
D : 40
Q.no 40. The Worst case occur in linear search algorithm when
B : Item is not in the array at all
C : Item is the first element in the array
D : Item is the last element in the array or is not there at all
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30
_____________
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
C : Both a and b
D : neither a nor b
B : Greedy method
C : backtracking
D : Not Flexible
following time.
A : O(Log N)
B : O (N*N)
C : O (N*N*N)
D : O (N Log N)

Find the
A : 38
B : 40
C : 38.3
D : 45
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
B : Best solution
C : Worst solution
D : All solutions
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6
And Genetics
C : Memoization
D : Greedy
C : Sorting

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Average case
B : Best case
C : Worst case
D : Time complexity
A : Array
B : queue
C : stack
D : linked list
Q.no 4. Recursion is a method in which the solution of a problem depends on?
A : Larger instances of different problems
B : Larger instances of the same problem
C : Smaller instances of the same problem
D : Smaller instances of different problems
D : Twisted Network
A : Braces
B : Parenthesis
C : Square Brackets
D : Slashes
A : greedy method

A : Linear
B : polynomial
C : quadratic
D : exponential
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
Q.no 13. What is adaline in neural networks?
A : Adaptive Linear Element
B : Automatic Linear Element
C : Adaptive Line Element

D : Adaptive Nonlinear Element
A : Structural
B : C programming
C : Procedural
D : Fine
Q.no 15. Which of the following algorithm can be used to solve the Hamiltonian path problem
efficiently?
B : iterative improvement
D : greedy algorithm
C : Backtracking
D : Greedy Method
A : roots
B : leaves
C : left sub trees
D : right sub trees
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
maximized

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}
A : O(n)
B : O(nLogn)
C : O(n^2)
D : O(n^2Logn)
A : greedy method
A : Join Operator
C : Selection
D : Multiplication
Q.no 28. Which of the following statement about 0 1 knapsack and fractional knapsack problem
is correct?
A : In 0 1 knapsack problem items are divisible and in fractional knapsack items are indivisible
C : 0 1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic
programming
D : In 0 1 knapsack problem items are indivisible and in fractional knapsack items are divisible
A : A,B, C
B : B, C, A
C : A, C, B
D : B,A, C
D : Merge sort
A : I and III
B : I and IV
C : II and III
D : II and IV
C : Greedy method
B : Proof by cases
D : direct proof
polynomial time
A : I and III
B : I and IV
C : II and III
D : II and IV
B : Backtracking
D : Greedy method

A : 60
B : 80
C : 100
D : 40
C : Sorting
C : Sorting
As Chromosomes.
D : Not Flexible

A : 400
B : 420
C : 500
D : 440
_____________
B : Tail Recursion
D : Recursion
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A : m^2 + 3
B : m^m
C:m
D : m+1
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
And Genetics
B : Best solution
C : Worst solution
D : All solutions

Find the
A : 38
B : 40
C : 38.3
D : 45
A : Not Flexible
B : Robust
C : Inappropriate
A : 250
B : 270
C : 290
D : 130
C : Memoization
D : Greedy
following time.
A : O(Log N)
B : O (N*N)
C : O (N*N*N)
D : O (N Log N)
data?
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2

Seat No -

Time : 1hr
Max Marks : 50
N.B
A : Definiteness
B : finiteness
C : scalability
D : effectiveness
Q.no 2. Which of the following statement about 0/1 knapsack and fractional knapsack problem is
correct?
A : In 0/1 knapsack problem items are divisible and in fractional knapsack items are indivisible
C : 0/1 knapsack is solved using a greedy algorithm and fractional knapsack is solved using dynamic
programming
D : In 0/1 knapsack problem items are indivisible and in fractional knapsack items are divisible
B : Run time error
C : Logical error
D : No error
algorithm?
D : Backtracking
A : Best case
B : Average case
C : Null case
D : Worst case
A : Ɵ(n^2)
B : Ɵ(8)
C : Ɵ(log n)
D : Ɵ(n)
hypothesis
C : steps 1,2, 3
Q.no 11. Running time of algorithm varies with the size of the input called____
A : Growth of Function
B : Order of growth
C : Growth Rate
D : Growth of log function
________
B : time complexity
A : O(f(n))
B : O(g(n))
C : O(f(n)g(n))
D : O(f(n)+ g(n))
Q.no 14. Which is an essential tool for proving the statement that proves an algorithm's
correctness.
A : Mathematical induction
B : Flow chart
C : Pseudo code
D : Recursion
A : Average case
B : Best case
C : Worst case
D : Time complexity
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
C : Time and Space
A : Pseudocode
B : Programme
C : Grammar
D : flowchart
A : Backtracking
A : Back Tracking
Q.no 21. Which of the following are not in NP?
A : All problems in P
B : Boolean Satisfiability problems
C : Integer factorization problem
D : Halting problem
TRUE?
A : I and III
B : I and IV
C : II and III
D : II and IV

A : 60
B : 80
C : 100
D : 40
A : Join Operator
C : Selection
D : Multiplication
A : O(1)
B : O(log n)
C : O(n)
D : O(n^2)
A : greedy method
strategy?
A : Stack
B : Queue
C : Priority Queue
D : Linked List
A : Greedy
C : Back Tracking
D : Branch & Bound
A : 160
B : 200
C : 170
D : 90
C : Greedy Approach
B : Backtracking
D : Greedy method
A : Merging
B : Partitioning
C : Selection
D : Exchanging
reductions ?
D : Not Flexible
B : Tail Recursion
D : Recursion
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2
C : Both a and b
D : neither a nor b
networks?
B : Inflexibility
D : No Computation
following time.
A : O(Log N)
B : O (N*N)
C : O (N*N*N)
D : O (N Log N)

A : 400
B : 420
C : 500
D : 440
A : exhaustive search
C : brute force algorithm
D : divide and conquer algorithm
As Chromosomes.
C : Sorting
B : Greedy method
C : backtracking
C : Memoization
D : Greedy
_____________
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6

Find the
A : 38
B : 40
C : 38.3
D : 45

Seat No -

Time : 1hr
Max Marks : 50
N.B
parentheses is a
A : queue
B : stack
C : tree
D : list
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : For condition
C : Both a and b
D : If condition
Q.no 6. def f():

int a[n][n]
sum = 0
for i = 1 to n:
for j = i to n:
sum += a[i][j]
print(sum)
A : O(n)
B : O(nlogn)
C : O(n^2)
D : O(n^3)
A : intractable
B : tractable
C : decision
D : complete
A : Average case
B : Best case
C : Worst case
D : Time complexity
A : Stack
B : Queue
C : Array
D : Linked List
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
B : Recursion
A : Best case
B : Worst case
C : Base case
A : roots
B : leaves
C : left sub trees
D : right sub trees
A : Backtracking

A : Switch Case
B : Loop
C : If else
D : if elif else
A : Θ(g(n))
B : O(g(n))
C : Ω(g(n))
D : little Ω(g(n))
A : Ɵ(n^2)
B : Ɵ(8)
C : Ɵ(log n)
D : Ɵ(n)
A : Top Up Fashion
C : In Any Way
D : Random
A : Backtacking
C : Greedy method
D : Easy Network
A : Merging
B : Partitioning
C : Selection
D : Exchanging

int f(int n)
{
int s = 0;
while(n > 1)
{
n = n/2;
s++;
}
return s;
}
A : O(nlog n)
B : O(n^2 )
C : O(n)
D : O(log n )
A : 160
B : 200
C : 170
D : 90
A : loop condition
C : loop invariant
D : none of these
called?
B : prefix encoding
D : Trie encoding
in polynomial time.
polynomial time.
B : nested loop
D : termination
B : Backtracking
D : Greedy method
A : Initialization
B : Maintenance
C : Termination:
D : loop condition

for (i = n / 2; i <= n; i++) {
for (j = 2; j <= n; j = j * 2) {
k = k + n / 2;
}
}
A : O(n)
B : O(nLogn)
C : O(n^2)
D : O(n^2Logn)
A : No Population
B : Chromosomes
C : Not Gene,
D : Not Allele
TRUE?
C : Both a and b
D : neither a nor b
B : Best solution
C : Worst solution
D : All solutions
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)
And Genetics
data?
A : 10*20
B : 20*30
C : 10*30
D : 10*20*30

Find the
A : 38
B : 40
C : 38.3
D : 45
A : 250
B : 270
C : 290
D : 130

A : 400
B : 420
C : 500
D : 440

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
A : O(nlog n)
B : O(n^2 )
C : O( n)
D : O(log n)
A : Code motion
D : All of these
A : D.H.Lehmer
B : L.Baumert
C : R.J.Walker
D : S. Golomb
C : Memoization
D : Greedy
B : Greedy method
C : backtracking
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
A : Not Flexible
B : Robust
C : Inappropriate
_____________

Seat No -

Time : 1hr
Max Marks : 50
N.B
correct?
programming
Q.no 2. Which data structure is used for implementing a FIFO branch and bound strategy?
A : Stack
B : Queue
C : Array
D : Linked List
Select one:
B : T(n)=n.T(n/2)+b.f(n)
C : T(N)=A.T(N-1)+B
D : T(N)=N.T(N-3)+B
A : Debugging
B : Profiling
C : Conquer
D : Combining
A : Backtracking
A : O(N Log N)
B : O(n*n)
C : O(Log N)
D : O(Log Log N)
A : Linear
B : polynomial
C : quadratic
D : exponential
A : Best case
B : Worst case
C : Base case
A : Best case
B : Average case
C : Null case
D : Worst case
B : linear search

A : Roots
B : Leafs
C : Left Sub Trees
D : Right Sub Trees
A : Average case
B : Best case
C : Worst case
D : Time complexity
B : time and space
C : date and space
efficiently?
A : greedy method
Q.no 19. The space factor when determining the efficiency of algorithm is measured by
A : Counting the maximum memory needed by the algorithm
B : Counting the minimum memory needed by the algorithm
C : Counting the average memory needed by the algorithm
D : Counting the maximum disk space needed by the algorithm
A : loop condition
C : loop invariant
D : none of these
Q.no 23. The Knapsack problem where the objective function is to minimize the profit is
A : Greedy
B : Dynamic 0 / 1
C : Back tracking
problem?
B : Greedy
C : Backtracking
A : only I
B : only II
C : both I and II
A : I and III
B : I and IV
C : II and III
D : II and IV
is correct?
Dynamic Programming
strategy?
A : Stack
B : Queue
C : Priority Queue
D : Linked List

A : 60
B : 80
C : 100
D : 40
Q.no 33. Dynamic Programming uses
A : Member Function
B : Principle Of Optimality
C : Fitness Function
D : Minimize Objective Function
Q.no 34. Which of the following are not in NP?
A : All problems in P
B : Boolean Satisfiability problems
C : Integer factorization problem
D : Halting problem
A : A,B, C
B : B, C, A
C : C, B ,A
D : B,A, C
A : O(1)
B : O(log n)
C : O(n)
D : O(n^2)
B : Backtracking
D : Greedy Method
subproblem
C : both 1 and 2
D : Either 1 or 2
B : Best solution
C : Worst solution
D : All solutions
A : O(M!)
B : O(Mn)
C : O(N!)
D : O(N)
_____________
A : O(n log n)
B : O(n)
C : O(nlogn)
D : O(nW)

A : 400
B : 420
C : 500
D : 440
A : Code motion
D : All of these
C : Sorting
B : Greedy method
C : backtracking
A : n=1
B : k=1
C : 1=1(1+1)/2
D : 1+2+3+…+k = k(k+1)/2

A : 10080
B : 11070
C : 130110
D : 11080
reductions ?
networks?
B : Inflexibility
D : No Computation

{
int count = 0;
for (int i = n; i > 0; i /= 2)
for (int j = 0; j < i; j++)
count += 1;
return count;
}
A : O(nlog n)
B : O(n^2 )
C : O( n)
D : O(log n)
C : Both a and b
D : neither a nor b
A : W divided by P
B : P divided by W
C : m divided by P
D : P divided by m
A : n(n+1)/2
B : n^2(n+1)^2/2
C : n^2(n+1)^2/4
D : n^2(n+1)^2/6

Seat No -

Time : 1hr
Max Marks : 50
N.B
Q.no 1. Which of the following algorithms has better time complexity?
A : insertion sort
B : binary search
C : linear search
D : merge sort
A : O(n)
B : O(1)
C : O(log n)
D : O(n^2)
A : Backtracking
A : Average case
B : Best case
C : Worst case
D : Time complexity
correct?
programming
A : Average case
B : Best case
C : Worst case
D : Time complexity
efficiently?
D : Member Function
A : Constant
C : logarithmic
D : linear
A : Natural Functions
B : Fitness Functions
C : Minimize Objective Functions
D : Member Function
B : Weights
C : Axons
D : Soma
A : Array
B : queue
C : stack
D : linked list
problem?
A : Not Recursion
A : Not In Serial
B : Not In Parallel
D : Partial
D : Adaptive Linear
Q.no 20. Choose the correct option
D : Iterative function is always better and simpler to write than recursion
C : Greedy Approach
A : No Population
B : Chromosomes
C : Not Gene,
D : Not Allele
B : Backtracking
D : Greedy method
C : Greedy method
A:1
B:2
C:3
D:4

Spos Merged

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Spos Merged

Uploaded by

Copyright:

Available Formats

A HA

Join our Telegram channel

PWD10886_SYSTEMS PROGRAMMING AND OPERATING SYSTEM

2) Attempt any 50 questions out of 60.

3) Use of calculator is allowed.

5) Specially abled students are allowed 20 minutes extra for examination.

Q.no 1. The last statement of the source program should be

Q.no 2. Grammar of the programming is checked at ________ phase of compiler

D : Scheduling and control

A : LRU policy (Least Recently Use

Q.no 6. A macro can be deﬁned at

C : after initialisation of program

A : Star BUS structure

B : Multiple BUS structure

C : Single BUS structure

D : Node to Node BUS structure

A : The former offers faster transfer of data

C : The devices have to deal with fewer address lines

D : multilevel queue scheduling algorithm

A : processes tend to the I/O-bound

B : size of pages is reduced

C : processes tend to be CPU-bound

D : locality of reference is applicable to the process

Q.no 12. Which command gives dynamic veiw of process states

Q.no 16. The output of a lexical analyzer is

Q.no 17. Virtual memory is

A : An extremely large main memory

B : An extremely large secondary memory

C : An illusion of extremely large main memory

D : A type of memory used in super computers

A : To indicate the purpose of the code

B : To indicate the starting of the computation code

D : To list the locations of all the registers used

C : In both the passes

D : at the time of synthesis

Q.no 21. Shell is the exclusive feature of

Q.no 22. Each entry in a translation lookaside buffer (TL consists of

A : kernel level thread

B : user level thread

Q.no 27. Which is the most optimal scheduling algorithm?

A : FCFS – First come First served

B : SJF – Shortest Job First

B : random access time

Q.no 29. File type can be represented by

C : assigning running processes to blocked queue

D : assign prcess from wating to ready queue

A : earliest due date

B : slack time remaining

C : ﬁrst come, ﬁrst served

A : Last in ﬁrst out

B : Shortest service time ﬁrst

Q.no 33. Absolute loader loads object code in memory from

A : Fixed location given by proframmer

B : Any location which is free

C : Fixed location given by assembler

D : Any location and overwrites existing contents

Q.no 34. Operating system is

C : between 0 and the segment number

D : greater than the segment number

A : Last in ﬁrst out

B : Shortest service time ﬁrst

Q.no 37. Yacc resolves conﬂicts by of type ?

A : First come First served