Online Recruitment Screening Test For Scit, Muj

30 Questions | By Dps158 | Last updated: Mar 19, 2022 | Total Attempts: 187

Questions

Settings

Create your own Quiz

Online Recruitment Screening Test For Scit, Muj - Quiz

Questions and Answers

1.
Which of the following problems are decidable?
1. Does a given program ever produce an output?
2. If L is context-free language, then, is L' also context-free?
3. If L is regular language, then, is L' also regular?
4. If L is recursive language, then, is L' also recursive?
- A.
  
  1,2,3,4
- B.
  
  1,2
- C.
  
  2,3,4
- D.
  
  3,4
2.
Given the language L={ab, aa, baa}, which of the following strings are in L*?
1. abaabaaabaa
2. aaaabaaaa
3. baaaaabaaaab
4. baaaaabaa
- A.
  
  1,2 and 3
- B.
  
  2,3 and 4
- C.
  
  1,2 and 4
- D.
  
  1,3 and 4
3.

Register renaming is done in pipelined processors
- A.
  
  As an alternative to register allocation at compile time
- B.
  
  For efficient access to function parameters and local variables
- C.
  
  To handle certain kinds of hazards
- D.
  
  As part of address translation
4.

The amount of ROM needed to implement a 4 bit multiplier is
- A.
  
  64 bits
- B.
  
  128 bits
- C.
  
  1 Kbits
- D.
  
  2 Kbits
5.

Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?
- A.
  
  A(n) =Ω(W(n))
- B.
  
  A(n) = Ɵ(W(n))
- C.
  
  A(n) = O(W(n))
- D.
  
  A(n) = o(W(n))
6.

Which of the following statements are TRUE about an SQL query?P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clauseQ : An SQL query can contain a HAVING clause only if it has GROUP BY clauseR : All attributes used in the GROUP BY clause must appear in the SELECT clauseS : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
- A.
  
  P and R
- B.
  
  P and S
- C.
  
  Q and R
- D.
  
  Q and S
7.

Given the basic ER and relational models, which of the following is INCORRECT?
- A.
  
  An attribute of an entity can have more than one value
- B.
  
  An attribute of an entity can be composite
- C.
  
  In a row of a relational table, an attribute can have more than one value
- D.
  
  In a row of a relational table, an attribute can have exactly one value or a NULL value
8.

The protocol data unit (PDU) for the application layer in the Internet stack is
- A.
  
  Segment
- B.
  
  Datagram
- C.
  
  Message
- D.
  
  Frame
9.

A process executes the codefork ();fork ();fork ();The total number of child processes created is
- A.
  
  3
- B.
  
  4
- C.
  
  7
- D.
  
  8
10.

The decimal value 0.5 in IEEE single precision floating point representation has
- A.
  
  Fraction bits of 000…000 and exponent value of 0
- B.
  
  Fraction bits of 000…000 and exponent value of -1
- C.
  
  Fraction bits of 100…000 and exponent value of 0
- D.
  
  No exact representation
11.

Which of the following is TRUE?
- A.
  
  Every relation is 3NF is also in BCNF
- B.
  
  A relation R is in 3NF if every non-prime attribute of R is fully functionally dependent on every key of R
- C.
  
  Every relation in BCNF is also in 3NF
- D.
  
  No relation can be in both BCNF and 3NF
12.

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
- 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
13.

A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero(the lowest priority). The scheduler re-evaluates the process priorities in every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
- A.
  
  This algorithm is equivalent to the first-come-first-serve algorithm
- B.
  
  This algorithm is equivalent to the round-robin algorithm
- C.
  
  This algorithm is equivalent to the shortest-job-first algorithm
- D.
  
  This algorithm is equivalent to the shortest-remaining-time-first algorithm
14.

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and unit-production (i.e., of type A→€ and A→a) to a string with n tokens?
- A.
  
  N/2
- B.
  
  N-1
- C.
  
  2n-1
- D.
  
  None
15.

The preorder traversal sequence of a binary search tree is 30, 20, 10, 15, 25, 23, 39, 35, 42. Which one of the following is the postorder traversal sequence of the same tree?
- A.
  
  10,20,15,23,25,35,42,39,30
- B.
  
  15,10,25,23,20,42,35,39,30
- C.
  
  15,20,10,23,25,42,35,39,30
- D.
  
  15,10,23,25,20,35,42,39,30
16.

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 compliers.
- D.
  
  Improve the register allocation.
17.
Which of the following statements are CORRECT?
1. Static allocation of all data areas by a compiler makes it impossible to implement recursion.
2. Automatic garbage collection is essential to implement recursion.
3. Dynamic allocation of activation records is essential to implement recursion.
4. Both heap and stack are essential to implement recursion.
- A.
  
  1 and 2
- B.
  
  2 and 3
- C.
  
  3 and 4
- D.
  
  1 and 3
18.

In the context of modular software design, which one of the following combinations is desirable?
- A.
  
  High cohesion and high coupling
- B.
  
  High cohesion and low coupling
- C.
  
  Low cohesion and high coupling
- D.
  
  Low cohesion and low coupling
19.

A system uses 3 page frames for storing process pages in main memory. It uses the Least Recently Used (LRU) page replacement policy. Assume that all the page frames are initially empty. What is the total number of page faults that will occur while processing the page reference string given below?4, 7, 6, 1, 7, 6, 1, 2, 7, 2
- A.
  
  5
- B.
  
  7
- C.
  
  3
- D.
  
  6
20.

Which one of the following is NOT performed during compilation?
- A.
  
  Dynamic memory allocation
- B.
  
  Type checking
- C.
  
  Symbol table management
- D.
  
  Inline expansion
21.

Which one of the following is TRUE?
- A.
  
  The requirements document also describes how the requirements that are listed in the document are implemented efficiently.
- B.
  
  Consistency and completeness of functional requirements are always achieved in practice.
- C.
  
  Prototyping is a method of requirements validation.
- D.
  
  Requirements review is carried out to find the errors in system design.
22.

Which one of the following is FALSE?
- A.
  
  User level threads are not scheduled by the kernel.
- B.
  
  When a user level thread is blocked, all other threads of its process are blocked.
- C.
  
  Context switching between user level threads is faster than context switching between kernel level threads.
- D.
  
  Kernel level threads cannot share the code segment.
23.

Which one of the following are used to generate a message digest by the network security protocols?(P) RSA(Q) SHA-1(R) DES(S) MD5
- A.
  
  P and R only
- B.
  
  Q and R only
- C.
  
  Q and S only
- D.
  
  R and S only
24.

Identify the correct order in which the following actions take place in an interaction between a web browser and a web server.1. The web browser requests a webpage using HTTP.2. The web browser establishes a TCP connection with the web server.3. The web server sends the requested webpage using HTTP.4. The web browser resolves the domain name using DNS.
- A.
  
  4,2,1,3
- B.
  
  1,2,3,4
- C.
  
  4,1,2,3
- D.
  
  2,4,1,3
25.

A canonical set of items is given below s→ L. R Q →R. On input symbol < the set has
- A.
  
  A shift-reduce conflict and a reduce-reduce conflict.
- B.
  
  A shift-reduce conflict but not a reduce-reduce conflict.
- C.
  
  A reduce-reduce conflict but not a shift-reduce conflict.
- D.
  
  Neither a shift-reduce nor a reduce-reduce conflict.