Time Left - 08:00 mins
ISRO Quiz 2023 34
Attempt now to get your rank among 53 students!
Question 1
What is the time complexity of the following recurrence relation using the master theorem?
T(n)=9T(n/3)+n
Question 2
When transaction Ti requests a data item currently held by Tj, Ti is allowed to wait only if it has a timestamp smaller than that of Tj (that is, Ti is older than Tj). Otherwise, Ti is rolled back (dies). This is
Question 3
The BFS algorithm uses…….and DFS algorithm uses……...data structure for its processing.
Question 4
When (–89)10 is represented in sign 2’s complement form, the sum of bits will be (Example: 11010000, here sum of the bits is 3) __________.
Question 5
In a certain code language, ‘REFORM’ is written as ‘SDGNSL’ and ‘SECTOR’ is written as ‘TDDSPQ’. How will ‘SHOULD’ be written in that language?
- 53 attempts
- 0 upvotes
- 0 comments
Dec 5GATE & PSU CS
