Time Left - 12:00 mins
GATE 2022 Toppers Quiz 5
Attempt now to get your rank among 158 students!
Question 1
Which of the following problems cannot be solved using Dynamic Programming?
Question 2
Consider the following C code :
Find number of tokens produced if the lexical analyzer scans the above code.
Question 3
A pipelined CPU is designed with single ALU and it is designed with operand forwarding technique and multiport memory modules. In this type of pipelined processor,
Question 4
A system of two linear equations in 
Has a unique solution if:
Question 5Multiple Correct Options
Under which conditions will a complete bipartite graph Km,n have a hamiltonian path?
Question 6
Which of the following statements is correct?
Question 7
Suppose sender A wants to send 12 frames to receiver B, using Go Back 4 ARQ protocol. What is total number of transmissions by sender if every 6th transmission from sender gets lost (but not any ACK from receiver ever get lost)?
Question 8
The time complexity of Kruskal’s algorithm for finding MST on the complete graph with 'n' vertices is ____.
- 158 attempts
- 0 upvotes
- 0 comments
Tags :
GATE & PSU CSGeneralJul 5GATE & PSU CS
