Foxoyo
Hey..!!
GATE CSE
Practice
MCQs
Quizzes
About
Leaderboard
Amazon Books
91
MCQs
0
Attempts
0 %
Accuracy
share
Filter by
Type here
Apply
The current erection cost of a structure is Rs. 13,200.
If the labour wages per day increase by 1/5 of the current wages and the working hours decrease by 1/24 of the current period, then the new cost of erection in Rs. is
11,000
10,120
15,180
16,500
Which one of the following options is the closest in meaning to the word given below? Nadir
Integration
Medium
Highest
Lowest
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
15, 10, 23, 25, 20, 35, 42, 39, 30
10, 20, 15, 23, 25, 35, 42, 39, 30
15, 20, 10, 23, 25, 42, 35, 39, 30
15, 10, 25, 23, 20, 42, 35, 39, 30
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)
1, 2 and 3 only
3 only
3 and 4 only
2 and 3 only
The following figure represents access graphs of two modules M1 and M2. The filled circles represent methods and the unfilled circles representattributes.
If method m is moved to module M2 keeping the attributes where they are, what can we say about the average cohesion and coupling between modules in the system of two modules
Average cohesion goes up but coupling is reduced.
There is no change.
Average cohesion goes down and coupling also reduces.
Average cohesion and coupling increase.
Determine the maximum length of the cable (in km) for transmitting data at a rate of 500 Mbps in an Ethernet LAN with frames of size 10,000bits.
Assume the signal speed in the cable to be 2,00,000 km/s
1
2.5
2
5
Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirected graph is in P. 2. The problem of determining whether there exists a cycle in an undirected graph is in NP. 3. If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A
1, 2 and 3
1 and 2 only
1 and 3 only
2 and 3 only
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D
Network layer – 4 times and Data link layer – 4 times
Network layer – 4 times and Data link layer – 6 times
Network layer – 2 times and Data link layer – 6 times
Network layer – 4 times and Data link layer – 3 times
The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
TCP, UDP, TCP and UDP
UDP, TCP, UDP and TCP
TCP, UDP, UDP and TCP
UDP, TCP, TCP and UDP
Consider the languages L1 = φ and L2 ={a}. Which one of the following represents L1L2* ᴜ L3*
φ
a*
{є, a}
{є}
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, Q
P, R
Q, R
A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32Bytes.
The processor sends 32 bit addresses to the cachecontroller.
Each cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacementbit.
The number of bits in the tag field of an address is
11
27
14
16
Consider the following C codesegment.
What output will be generated by the given code segment
4 2 6 2 2 0
3 1 4 1 4 2
3 1 5 2 5 2
4 2 6 1 6 1
The height of a tree is defined as the number of edges on the longest path in thetree.
The function shown in the pseudo code below is invoked as height(root) to compute the height of a binary tree rooted at the tree pointerroot.
The appropriate expressions for the two boxes B1 and B2 are
B1: (height(n → right)) B2: (1+max(h1,h2))
B1: height(n → right) B2: max(h1, h2)
B1: (1+ height(n → right)) B2: max(h1, h2)
B1: (1+height(n → right)) B2: (1+max(h1, h2))
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
OPTIMAL < FIFO < LRU
OPTIMAL < LRU < FIFO
Consider the directed graph shown in the figurebelow.
There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to v is discovered
SBDT
SACET
SACDT
SDT
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: (REAR+1) mod n == FRONT empty: (FRONT+1) mod n == REAR
full: REAR == FRONT empty: (REAR+1) mod n == FRONT
full: (REAR+1) mod n == FRONT empty: REAR == FRONT
full: (FRONT+1) mod n == REAR empty: REAR == FRONT
Given the language L = {ab, aa, baa}, which of the following strings are in L*? 1) abaabaaabaa 2) aaaabaaaa 3) baaaaabaaaab 4) baaaaabaa
1, 2 and 3
1, 2 and 4
2, 3 and 4
1, 3 and 4
Let G be a simple undirected planar graph on 10 vertices with 15edges.
If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to
3
6
5
4
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with n discs is
T(n) = 2T(n/2) + 1
T(n) = 2T(n − 1) + n
T(n) = 2T(n − 1) + 1
T(n) = 2T(n − 2) + 2
1
2
3
5
Next
take a quick Quiz
Practice mcqs on GATE CSE
Let's start
pick difficulty level
all
1
2
3
4
5
91
Mcqs
0
attempts
1
followers
Related Topics
GATE CSE
GATE ECE
GATE Chemical Engineering
GATE Civil Engineering
GATE Aeronautical Engineering
GATE Textile and Fiber Science
GATE Architecture and Planning
GATE Mechanical
GATE Agricultural Engineering
Free Online Practice mock 2 for GATE Textile and F
Suggested Books