📚 Exam by Category
▾
Objective Questions

Latest ISRO Computer Science Exam Question (Objective Questions), MCQ in English

Subjects : Computer Science

Question Bank Computer Science - English
Back to Exam

Computer Science

Question 501Single Answer
What is the minimum number of resources required to ensure that deadlock will never occur, if there are currently three process p1  p2   and p3 running in a system whose maximum demand for the resources of same type are 3,4 and 5 respectively.
  1. A
    3         
  2. B
    7
  3. C
    9      
  4. D
    10
Question 502Single Answer
Consider  the following statements about the context free grammar
G = {S→SS,S →S→ab,S→ba,S→}
1. G is ambiguous
2. G produces all strings with equal number of a’s and b’s
3. G can be accepted by a deterministic PDA.
Which combination below expresses all the true statements about G?
  1. A
    1 only        
  2. B
    1 and 3 only
  3. C
    2 and 3 only    
  4. D
    1,2 and 3
Question 503Single Answer
For a software project, the spiral model was employed. When will the spiral stop?
  1. A
    When the software product is retired
  2. B
    When the software product is retired after Beta testing
  3. C
    When the risk analysis is completed
  4. D
    After completing five loops
Question 504Single Answer
Given a block can hold either 3 records or 10 key pointers. A database contains n records, then how many blocks do we need to hold the data file and the dense index
  1. A
    13n/30    
  2. B
    n/3
  3. C
    n/10                   
  4. D
    n/30
Question 505Single Answer
If L and  are recursively enumerable then L is
  1. A
    regular   
  2. B
    context-free
  3. C
    context-sensitive           
  4. D
    recursise
Question 506Single Answer
Let R =(A,B,C,D,E,F) be a relation scheme with the following dependencies  Which of the following is a key of R ?
  1. A
    CD    
  2. B
    EC
  3. C
    AE                   
  4. D
    AC
Question 507Single Answer
Dirty bit is used to indicate which of the following?
  1. A
    A page fault has occurred
  2. B
    A page has corrupted data
  3. C
    A page has been modified after being loaded into cache
  4. D
    An illegal access of page
Question 508Single Answer
Computation
          S→aSa|bsb|a| b
The language generated by the above grammar over the alphabet{a,b} is the set of
  1. A
    all palindromes
  2. B
    all odd length palindromes
  3. C
    Strings that begin and end with the same symbol
  4. D
    all even length palindromes
Question 509Single Answer
Which of the following is not a valid multicast MAC address?
  1. A
    01 :00:5E:00:00:00
  2. B
    01:00:5E:00:00:FF
  3. C
    01:00:5E:00:FF:FF
  4. D
    01:00:5E:FF:FF:FF
Question 510Single Answer
What is the highest type number that can be assigned to the following grammar?
S →Aa,A→Ba,B →abc
  1. A
    Type 0 
  2. B
    type 1
  3. C
    type 2   
  4. D
    type 3
Question 511Single Answer
Access time of the symbolic table will be logarithmic if is implemented by
  1. A
    Linear list     
  2. B
    Search tree
  3. C
    Hash table
  4. D
    self organization list
Question 512Single Answer
Recursive descent parsing is an example of
  1. A
    Top-down parsers
  2. B
    Bottom-up parsers
  3. C
    Predictive parsers
  4. D
    None of the above
Question 513Single Answer
If D1.D2…DN  are domains in a relational model , then the relation is a table , which is a subset of
  1. A
    D1+D2+…+ Dn
  2. B
    D1xD2x…xD3
  3. C
    D1UD2U…U Dn
  4. D
Question 514Single Answer
A top-down parser generates
  1. A
    Rightmost Derivation
  2. B
    Rightmost derivation in reverse
  3. C
    Leftmost derivation
  4. D
    Leftmost derivation in reverse
Question 515Single Answer
Relative mode of addressing is most relevant to writing
  1. A
    Co-routines
  2. B
    Position-independent code
  3. C
    Shareable code
  4. D
    Interrupt Handlers
Question 516Single Answer
The rank of the matrix is________.
  1. A
    0     
  2. B
    1
  3. C
    2       
  4. D
    3
Question 517Single Answer
A simple two-pass assembler does with of the following in the first pass:
  1. A
    Checks to see if the instructions are legal in the current assembly mode
  2. B
    It allocates space for the literals.
  3. C
    It builds the symbol table for the symbols and their values.
  4. D
    All of these
Question 518Single Answer
Peephole optimization is from of
  1. A
    Loop optimization
  2. B
    Local optimization
  3. C
    Constant folding
  4. D
    Data flow analysis
Question 519Single Answer
What is the median of data if its mode is 15 and the mean is 30?
  1. A
    30
  2. B
    25
  3. C
    22.5    
  4. D
    27.5
Question 520Single Answer
At a particular time of computation the value of a counting semaphore is 7.Then 20 P operations and x V operations were completed on this semaphore. If the new value of semaphore is 5,x will be
  1. A
    18        
  2. B
    22
  3. C
    15      
  4. D
    13
Question 521Single Answer
With single resource, deadlock occurs
  1. A
    if there are more than two processes competing for that resources
  2. B
    if there are only two processes competing for that resources
  3. C
    if there is a single process competing for that resources
  4. D
    None of the above
Question 522Single Answer
Consider the following schema:
Employee (name, sex, salary, dept Name)
Consider the following SQL query
SELECT dept name
FROM Employee
WHERE sex =^ M ^
GROUP by Deptname
Having avg (salary)>(select avg (salary) from EMP}
The output will be
  1. A
    Average salary of male employee is the average salary of the organization
  2. B
    Average salary of male employee is less than the average salary of the organization
  3. C
    Average salary of male employee is equal to the average salary of the organization
  4. D
    Average salary of male employee is more than the average salary of the organization
Question 523Single Answer
An organization is granted the black 130.34.12.64/26.it needs to have 4 subnets. Which of the following is not address of this organization?
  1. A
    130.34.12.124 
  2. B
    130.34.12.132
  3. C
    130.34.12.70 
  4. D
    130.34.12.132
Question 524Single Answer
A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units ,then
  1. A
    Deadlock can never occur
  2. B
    Deadlock may occur
  3. C
    Deadlock has to occur
  4. D
    None of these
Question 525Single Answer
Determine the number of page faults when references to pages occur in the following order:
          1,2,4,5,2,1,2,4
Assume that the main memory can accommodate 3 pages and the main memory already has the page 1 and 2,with page one having brought earlier than page 2.(LRU page replacement algorithm is used)
  1. A
    3   
  2. B
    5
  3. C
    4    
  4. D
    None of these
Question 526Single Answer
A web client sends a request to a web server. The web server transmits a program to that client and executed at client. it creates a web documents what are such web documents called?
  1. A
    Active      
  2. B
    Static
  3. C
    Dynamic
  4. D
    Passive
Question 527Single Answer
Working set (t, k) at an instant of time t is
  1. A
    the set of k future references that the OS will make
  2. B
    the set of future references that the OS will make in next t unit of time
  3. C
    The set of k references with high frequency
  4. D
    the k set of pages that have been referenced in the last t time units
Question 528Single Answer
What is the size of the physical address space in a paging system which has a page table containing 64 entries of 11 bit each (including valid and invalid bit) and a page size of 512 bytes?
  1. A
    211             
  2. B
    215
  3. C
    219      
  4. D
    220
Question 529Single Answer
A CPU generates 32-bit virtual addresses. the page size is 4 kB. the processor has a translation look-aside buffer(TLB) which can hold a total of 128 page table entries and is 4-way set associative. The minimum size of the TLB tag is :
  1. A
    11 bits 
  2. B
    13 bits
  3. C
    15 bits
  4. D
    20 bits
Question 530Single Answer
Given the following expression grammar:

Which of the following is true?
  1. A
    * has higher precedence than +
  2. B
    - has higher precedence than*
  3. C
    + and –have same precedence
  4. D
    + has higher precedence than*
Question 531Single Answer
Which of the following is not an optimization criterion in the design of a CPU scheduling algorithm?
  1. A
    Minimum CPU utilization
  2. B
    Maximum throughput
  3. C
    Minimum turnaround time
  4. D
    Minimum waiting time
Question 532Single Answer
For the real time operating system, which of the following is the most suitable scheduling scheme?
  1. A
    Round robin
  2. B
    First come first server
  3. C
    pre-emptive
  4. D
    Random scheduling
Question 533Single Answer
In which one of the following page replacement policies,Belady’s anomaly may occur?
  1. A
    FIFO   
  2. B
    Optimal
  3. C
    LRU         
  4. D
    MRU
Question 534Single Answer
The number of token in the following C statements is
Printf(^^i = %d,& I =% x^^,I & i);
  1. A
    13    
  2. B
    6
  3. C
    10              
  4. D
    11
Question 535Single Answer
Consider the join of a relation R with a relation S .If R has m tuples and S has n tuples then the maximum and minimum sizes of the join respectively are
  1. A
    m+n and O
  2. B
    mn and O
  3. C
    m+n and|m-n|
  4. D
    mn and m+n
Question 536Single Answer
Let R(a,b,c) and S(d,e,f) be two relations in which d is the foreign key of S that refers to the primary key of R. consider the following four operations R and S
1. Insert into R
2. Insert into S
3. Delete from R
4. Delete from S
Which of the following can cause violation of the referential integrity constraint above?
  1. A
    Both 1 and 4    
  2. B
    Both 2 and 3
  3. C
    All of the
  4. D
    None of these
Question 537Single Answer
Consider the following Deterministic Finite Automation M

Let S denote the set of eight bit strings whose second, third sixth and seventh b its are1.The number of strings in S that are accepted by M is
  1. A
    0  
  2. B
    1
  3. C
    2         
  4. D
    3
Question 538Single Answer
A computing architecture, which allows the user to use computers from multiple administrative domains to reach a common goal is called as
  1. A
    Grid Computing
  2. B
    Neutral Networks
  3. C
    Parallel Processing
  4. D
    Cluster Computing
Question 539Single Answer
The relation book (title, price) contains the titles and prices of different books. Assuming that no two books have same price, what does the following SQL query list?
Select title
From book as B
Where (select count(*)
          From book as T
Where T.price>B.price)<5
  1. A
    Titles of the four most expensive books
  2. B
    Title of the fifth most inexpensive book
  3. C
    Title of the fifth most expensive book
  4. D
    Titles of the five most expensive books
Question 540Single Answer
Goals for the design of the logical scheme include
  1. A
    avoiding  data inconsistency
  2. B
    being able to construct query easily
  3. C
    being able to access data efficiently
  4. D
    all of the above
Question 541Single Answer
Which grammar rules violate the requirement of the operator grammar? A,B, C are variables and a,b,c are terminals
(i) A →Bc                                     (ii) A →CcBb
(iii) A →BaC                                 (iv) A→
  1. A
    (i) only        
  2. B
    (i) and (i)
  3. C
    (i) and (ii)       
  4. D
    (i) and (iv)
Question 542Single Answer
Which one of the following is a top –down parser?
  1. A
    Recursive descent parser
  2. B
    Shift left associative parser
  3. C
    SLR (k) parser
  4. D
    LR (k) parser
Question 543Single Answer
Given the relations:
  • employee (name,salary,dept-no),and
  • department (dept –no,dept-name,address).
Which of the following queries cannot be expressed using the basic relational algebra operations  ?
  1. A
    Department address of every employee
  2. B
    Employees whose name is the same as their department name
  3. C
    The sum of all employees’ salaries
  4. D
    All employees of a given department
Question 544Single Answer
Which of the following is not true with respect to deadlock prevention and deadlock  avoidance schemes?
  1. A
    In deadlock  prevention, the request for resources is always granted if resulting state is safe.
  2. B
    In deadlock  avoidance, the request for resources is always granted if the resulting state is safe.
  3. C
    Deadlock avoidance requires Knowledge of resource requirements a priori.
  4. D
    Deadlock prevention is more restrictive than deadlock avoidance.
Question 545Single Answer
Trigger is
  1. A
    Statement that enables to start any DBMS
  2. B
    statement that is executed by the user when debugging an application program
  3. C
    The condition that the system tests for the validity of the database user
  4. D
    Statement that is executed automatically by the system as a side effect a modification of the database
Question 546Single Answer
Yacc stands for
  1. A
    yet accept compiler constructs
  2. B
    yet accept compiler compiler
  3. C
    yet another compiler constructs
  4. D
    yet another compiler compiler
Question 547Single Answer
The order of a leaf node in B+ tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1 Kbytes, data record pointer is 7 bytes long, the value field is 9 bytes long and a block pointer is 6 bytes long, what is the of leaf node?
  1. A
    36 
  2. B
    64
  3. C
    67
  4. D
    68
Question 548Single Answer
Which one of the following are essential features of object oriented language?
A. Abstraction and encapsulation
B. Strictly-typed
C. Type-safe property coupled with-sub type rule
D. polymorphism in the presence of inheritance
  1. A
    A and B only
  2. B
    A,D and B only
  3. C
    A and D only     
  4. D
    A,C and D only
Question 549Single Answer
Which statements is true?
  1. A
    LALR parser is more powerful and costly as compare to other parsers
  2. B
    All CFG ^are LP and not all grammars are uniquely defined
  3. C
    Every SLR grammar is unambiguous but not every unambiguous grammar is SLR
  4. D
    LR(k) is the most general back tracking shift reduce parsing method
Question 550Single Answer
A clustering index is defined on the fields which are of type
  1. A
    non-key and ordering
  2. B
    non-key and non-key ordering
  3. C
    key and ordering
  4. D
    key and non-ordering
Important Questions Package

ISRO Computer Science Exam Online Question Bank Package

Buy ISRO Computer Science Important Questions, MCQ, question answer in Hindi & English. It will help you to score high marks in ISRO Computer Science question bank 2026 in Online, PDF & Print study material.

+ Free Monthly Current Affairs, GK & more PDF Download
Sr.Package NameAmount
1.ISRO Computer Science Exam - English
Description : 1000 Question with Answer
₹101 [₹500]
2.ISRO Computer Science Exam - English
Description : 1750 Question with Answer
₹141 [₹500]
3.ISRO Computer Science Exam - English
Description : 1000 Question & Answer Download in PDF (Send by Email)
₹151 [₹450]
4.ISRO Computer Science Exam Question Bank Book - English
Description : 1000 Question with Answer (Printed Material)
₹390 [₹600]
← PrevPage 2 of 4Next →
Back to Exam