GATE CSE & IT Practice Paper 2 Questions And Answers
Here you can find GATE CSE & IT Practice Paper 2 Questions and Answers.
Why GATE CSE & IT Practice Paper 2 Questions and Answers Required?
In this GATE CSE & IT Practice Paper 2 Questions and Answers section you can learn and practice GATE CSE & IT Practice Paper 2 Questions and Answers to improve your skills in order to face
technical inerview conducted by Organisations. By Practicing these interview questions, you can easily crack any Competitive Exams interview.
Where can I get GATE CSE & IT Practice Paper 2 Questions and Answers?
AllIndiaExams provides you lots GATE CSE & IT Practice Paper 2 Questions and Answers with proper explanation. Fully solved examples with detailed answer description. All students, freshers can
download GATE CSE & IT Practice Paper 2 Questions and Answers as PDF files and eBooks.
How to solve these GATE CSE & IT Practice Paper 2 Questions and Answers?
You no need to worry, we have given lots of GATE CSE & IT Practice Paper 2 Questions and Answers and also we have provided lots of FAQ's to quickly answer the questions in the Competitive Exams
interview.
CSE & IT Practice Paper 2 Questions & Answers
1. A binary operation ⊕ on a set of integers is defined as x⊕y = x2 + y2 . Which one of the following statements is TRUE about ⊕?
CSE & IT Practice Paper 2 Questions & Answers
2. Suppose p is the number of cars per minute passing through a certain road junction between 5 PM and 6 PM, and p has a Poisson distribution with mean 3. What is the probability of observing fewer than
3 cars during any given minute in this interval?
CSE & IT Practice Paper 2 Questions & Answers
4. The smallest integer that can be represented by an 8-bit number in 2’s complement form is
CSE & IT Practice Paper 2 Questions & Answers
6. Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
CSE & IT Practice Paper 2 Questions & Answers
7. Consider the languages L1 = φ and L2 ={a}. Which one of the following represents L1L2* ᴜ L3* ?
CSE & IT Practice Paper 2 Questions & Answers
8. 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 parse a string with n
tokens?
CSE & IT Practice Paper 2 Questions & Answers
9. 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 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?
CSE & IT Practice Paper 2 Questions & Answers
10. Match the problem domains in GROUP I with the solution technologies in GROUP II.
GROUP I GROUP II
(P) Service oriented computing (1) Interoperability
(Q) Heterogeneous communicating
systems (2) BPMN
(R) Information representation (3) Publish-find-bind
(S) Process description (4) XML
CSE & IT Practice Paper 2 Questions & Answers
11. The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
CSE & IT Practice Paper 2 Questions & Answers
12. Using public key cryptography, X adds a digital signature σ to message M, encrypts , and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
?
.
.
.
.