Time Left - 09:00 mins
UPPCL AE 2019: Technical Quiz 15
Attempt now to get your rank among 217 students!
Question 1
Consider the equation (43)x = (y3)8 where X and Y are unknown. The number of possible solutions is___________
Question 2
Which of the following problem is not decidable
Question 3
If L and 
are recursively enumerable then L is
are recursively enumerable then L isQuestion 4
The maximum number of processes that can be in Ready state for a computer system with n CPUs is
Question 5
Consider the following page replacement algorithms:
1) LRU
2) FIFO
3) Optimal
4) Second-chance.
Belady’s anomaly can occur in:
1) LRU
2) FIFO
3) Optimal
4) Second-chance.
Belady’s anomaly can occur in:
Question 6
The output Y in the circuit below is always ‘1’ when
Question 7
Consider the following Query:
SELECT A
FROM R
GROUP BY A
HAVING Avg (C) >= 60
It is executed over the given relational instance R.
How many tuples are there in the output?
SELECT A
FROM R
GROUP BY A
HAVING Avg (C) >= 60
It is executed over the given relational instance R.
How many tuples are there in the output?
Question 8
Consider the following schedule:
r1(a),r2(a),r3(b),w2(a),r4(c),r3(b),r1(b),
r2(b), w1(c), w4(a)
The above schedule is serialized as
r1(a),r2(a),r3(b),w2(a),r4(c),r3(b),r1(b),
r2(b), w1(c), w4(a)
The above schedule is serialized as
Question 9
What will be the output of the following code.
Question 10
Match the following :
A) Power of an element
B) Strassen's Matrix Multiplication
C) Merge Sort
D) Worst case of Job sequencing
1) O(n2.8)
2) O(logn)
3) O(nlogn)
4) O(n2)
A) Power of an element
B) Strassen's Matrix Multiplication
C) Merge Sort
D) Worst case of Job sequencing
1) O(n2.8)
2) O(logn)
3) O(nlogn)
4) O(n2)
- 217 attempts
- 1 upvote
- 1 comment
Tags :
GATE & PSU CSGeneralJun 25GATE & PSU CS
