GATE CS 1999

  • Last Updated : 11 Aug, 2021 



 
  
        
    
   
  

  
          1234567        
  

  



   
   
  
      
      
    
  

  

  

          
Question 1
The number of binary relations on a set with n elements is:
A
n²
B
2^n
C
2^n²
D
None of the above
GATE CS 1999    Set Theory & Algebra    
Discuss it


Question 2
Suppose that the expectation of a random variable X is 5. Which of the following statement is True?

 
A
There is a simple point at which X has  the value 5.
B
There is a simple point at which X has value greater than 5.
C
There is a simple point at which X has a value greater than or equal to 5.
D
None of the above.
GATE CS 1999    Probability    
Discuss it


Question 2 Explanation: 
 E(X)=\int \limits_{-\infty}^{\infty} xf(x)\:dx
The first option is wrong since the Expected value need not be present in the data.
The second option is wrong since in the event where every value in the data is the same, the expected value is the same as every value. So, In this case, there is no value which is greater than the expected value.
The third option is correct, Since there must be some value which is either equal to or greater than the expected value. This is because it is impossible to have all the values less than the expected value as it is analogous to the mean. And the mean value is never greater than all the values of the data.
Question 3
The number of binary strings of n zeros and k ones such that no two ones are adjacent is:

q1
A
a
B
b
C
c
D
d
GATE CS 1999    Combinatorics    
Discuss it


Question 3 Explanation: 
 There are n zeros placed :

_0_0_0_....._0_

So, (n+1) gaps. Now we can place k 1's in those place n+1Ck ways.
 
Option (D) is correct. 
Question 4
Consider the regular expression (0+1)(0+1)... n times. The minimum state finite automaton that recognizes the language represented by this regular expression contains:
A
n states
B
n+1 states
C
n+2 states
D
None of the above
GATE CS 1999    Regular languages and finite automata    
Discuss it


Question 5
Context free languages are closed under-
A
Union, Intersection
B
Union, Kleene closure
C
Intersection, Complement
D
Complement, Kleene closure
GATE CS 1999    Context free languages and Push-down automata    
Discuss it


Question 5 Explanation: 
 Context free languages are closed under: Union, Concatenation and Kleene closure but not in Intersection and Complement.


Option (B) is correct.
Question 6
Let LD  be the set of all languages accepted by a PDA by final state and LF  the set of all languages accepted by empty stack. Which of the following is true?
q2
A
a
B
b
C
c
D
d
GATE CS 1999    Context free languages and Push-down automata    
Discuss it


Question 7
Which of the following expressions is not equivalent to X‾  ?
A
x NAND x
B
x NOR x
C
x NAND 1
D
x NOR 1
GATE CS 1999    Digital Logic & Number representation    
Discuss it


Question 8
Which of the following function implements the Karnaugh map shown below?

q3
A
a
B
b
C
c
D
d
GATE CS 1999    Digital Logic & Number representation    Logic functions and Minimization    
Discuss it


Question 9
Listed below are some operating system abstractions (in the left column) and the hardware components or mechanism (in the right column) that they are abstractions of. Which of the following matching of pairs is correct?

A. Thread                      1. Interrupt
B. Virtual address space       2. Memory
C. File system                 3. CPU
D. Signal                      4. Disk
A
A-2, B-4, C-3, D-1
B
A-1, B-2, C-3, D-4
C
A-3, B-2, C-4, D-1
D
A-4, B-1, C-2, D-3
GATE CS 1999    OS Memory Management    
Discuss it


Question 9 Explanation: 
 
    

  1. Thread is handled by CPU.

    2. 

  2. Virtual address space (it is a set of virtual memory addresses that a process can use) is associated with memory management.

    3. 

  3. File System is used for disk management.

    4. 

  4. Interrupt is a type of signal.

    5. 

Question 10
Which of the following disk strategies is likely to give the best throughput?
A
Farthest cylinder next
B
Nearest cylinder next
C
First come first served
D
Elevator algorithm
GATE CS 1999    OS CPU Scheduling    
Discuss it


Question 10 Explanation: 
 Nearest cylinder next is also known as shortest seek time first and in this algorithm many pages can be accessed in less amount of time. 

So throughput will be high so this is optimal algorithm.

Option (B) is correct.
                
    
  

    
    
   
  
    

  There are 70 questions to complete.  

    
  

  
          1234567        
  

  
    
 
  
    
  
   
   










    

        My Personal Notes
        arrow_drop_up