Foxoyo
Hey..!!
Practice
Select topics and difficulty and just practice mcqs.
Topics
GATE CSE
Topics
User (name or email)
Users
pick difficulty level
all
1
2
3
4
5
number of questions
10
30
50
70
100
Start
Let's practice 30 mcqs on
GATE CSE
mcqs by everyone
Which of the following is/are undecidable?1. G is aCFG.
Is L(G) = Φ?2. G is aCFG.
Is L(G) = Σ*?3. M is a Turingmachine.
Is L(M) regular?4. A is a DFA and N is anNFA.
Is L
(A) = L(N)
3 and 4 only
3 only
2 and 3 only
1, 2 and 3 only
The truth table represents the Boolean function
X Y
X + Y
x
Y
Relation R has eight attributesABCDEFGH.
Fields of R contain only atomicvalues.
F={CH→G, A→BC, B→CFH, E→A, F→EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R.How many candidate keys does the relation R have
3
4
6
5
Function f is known at the following points:The value of computed using the trapezoidal rule is
9.017
9.003
8.983
9.045
What is the correct translation of the following statement into mathematical logic? “Some real numbers are rational”
Ǝx (real(x) → rational(x))
Ǝx (real(x) ᴧ rational(x))
Ǝx (real(x) ᴠ rational(x))
Which of the following transport layer protocols is used to support electronic mail
IP
UDP
SMTP
TCP
Consider the following transactions with data items P and Q initialized to zero:Any non-serial interleaving of T1 and T2 for concurrent execution leads to
a conflict serializable schedule
a schedule for which a precedence graph cannot be drawn
a serializable schedule
a schedule that is not conflict serializable
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 clause Q: An SQL query can contain a HAVING clause only if it has a GROUP BY clause R : All attributes used in the GROUP BY clause must appear in the SELECT clause S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause
Q and S
P and R
P and S
Q and R
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
2n-1
2n
n - 1
n/2
Register renaming is done in pipelined processors
as an alternative to register allocation at compile time
as part of address translation
for efficient access to function parameters and local variables
to handle certain kinds of hazards
What is the complement of the language accepted by the NFA shown below? Assume Σ = {a} and ε is the empty string
φ
{ε}
{a, ε}
a*
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices
Θ(n2log n)
Θ(n3log n)
Θ(n2)
Θ(n3)
Consider the following logicalinferences.
I1: If it rains then the cricket match will not beplayed.
The cricket match wasplayed.
Inference: There was norain.
I2: If it rains then the cricket match will not beplayed.
It did notrain.
Inference: The cricket match wasplayed.
Which of the following is TRUE
I1 is not correct but I2 is a correct inference
Both I1 and I1 are not correct inferences
I1 is correct but I2 is not a correct inference
Both I1 and I2 are correct inferences
Suppose a circular queue of capacity (n −1) elements is implemented with an array of nelements.
Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables,respectively.
Initially, REAR = FRONT = 0. The conditions to detect queue full and queue empty are
full: (FRONT+1) mod n == REAR empty: REAR == FRONT
full: (REAR+1) mod n == FRONT empty: REAR == FRONT
full: (REAR+1) mod n == FRONT empty: (FRONT+1) mod n == REAR
full: REAR == FRONT empty: (REAR+1) mod n == FRONT
Consider the virtual page reference string 1, 2, 3, 2, 4, 1, 3, 2, 4, 1 on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initiallyempty.
Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacementpolicy.
Then
OPTIMAL = LRU
OPTIMAL < FIFO < LRU
OPTIMAL = FIFO
OPTIMAL < LRU < FIFO
Which of the following assertions are CORRECT?P: Adding 7 to each entry in a list adds 7 to the mean of the listQ: Adding 7 to each entry in a list adds 7 to the standard deviation of the listR: Doubling each entry in a list doubles the mean of the listS: Doubling each entry in a list leaves the standard deviation of the list unchanged
R, S
P, R
Q, R
P, Q
In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is300.
The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are
Last fragment, 2400 and 2789
Last fragment, 2400 and 2759
Middle fragment, 300 and 689
First fragment, 2400 and 2759
Consider the languages L1 = φ and L2 ={a}. Which one of the following represents L1L2* ᴜ L3*
a*
{є}
{є, a}
φ
Consider the 3 processes, P1, P2 and P3 shown in thetable.
The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2 time units) are
FCFS: P1, P3, P2 RR2: P1, P3, P2
FCFS: P1, P2, P3 RR2: P1, P3, P2
FCFS: P1, P3, P2 RR2: P1, P2, P3
FCFS: P1, P2, P3 RR2: P1, P2, P3
Consider the following relations A, B and C: How many tuples does the result of the following SQL query contain?SELECT
A.IdFROM AWHERE
A.Age > ALL (SELECT
B.Age FROM B WHERE
B.Name = ‘Arun’)
1
4
3
An index is clustered, if
it is on a set of fields that form a candidate key.
it is on a set of fields that include the primary key.
the data records of the file are organized in the same order as the data entries of the index.
the data records of the file are organized not in the same order as the data entries of the index.
A RAM chip has a capacity of 1024 words of 8 bits each
(1K ×
8). The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is
7
4
5
6
The amount of ROM needed to implement a 4 bit multiplier is
2 Kbits
1 Kbits
128 bits
64 bits
The protocol data unit (PDU) for the application layer in the Internet stack is
Segment
Datagram
Frame
Message
An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it:245.
248.
128.
0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the remaining withitself.
Which of the following is a valid allocation of addresses to A and B
245.248.136.0/24 and 245.248.132.0/21
245.248.128.0/21 and 245.248.128.0/22
245.248.136.0/21 and 245.248.128.0/22
245.248.132.0/22 and 245.248.132.0/21
Consider the following relations A, B and C: How many tuples does the result of the following relational algebra expression contain? Assume that the schema of A∪B is the same as that of
A.
(A∪B) ⋈A.Id > 40 ᴠ
C.Id < 15 C
9
4
7
5
In the following truth table, V = 1 if and only if the input isvalid.
What function does the truth table represent
Demultiplexer
Decoder
Multiplexer
Priority encoder
Consider a random variable X that takes values +1 and −1 with probability 0.5each.
The values of the cumulative distribution function F(x) at x = −1 and +1 are
0 and 1
0 and 0.5
0.5 and 1
0.25 and 0.75
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(n) = Θ (W(n))
A(n) = Ω (W(n))
A(n) = O (W(n))
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
T(n) = 2T(n − 1) + 1
T(n) = 2T(n/2) + 1
T(n) = 2T(n − 2) + 2
T(n) = 2T(n − 1) + n
Learn
Correct Attempts
Score
00/00
in
00:00