Register
GATE 1988 Computer Science Questions

Recent questions tagged gate1988

0 votes
0 answers
62
GATE CSE 1988 | Question: 1v
If a crystal of 4MHz frequency has been connected to an 8085, the instruction-fetch duration of a 10-states instruction is ______
If a crystal of 4MHz frequency has been connected to an 8085, the instruction-fetch duration of a 10-states instruction is ______
User Avatar
2 votes
1 answer
63
GATE CSE 1988 | Question: 1iv
If the total number of states in the fetching and execution phases of an $8085$ instruction is known to be $7,$ number of states in these machine cycles is divided as ________
If the total number of states in the fetching and execution phases of an $8085$ instruction is known to be $7,$ number of states in these machine cycles is divided as ___...
User Avatar
14 votes
4 answers
64
GATE CSE 1988 | Question: 1iii
Quicksort is ________ efficient than heapsort in the worst case.
Quicksort is ________ efficient than heapsort in the worst case.
User Avatar
0 votes
0 answers
65
GATE CSE 1988 | Question: 1ii
Assuming ideal diodes, the voltage at $V_0$ for circuit in the below figure is _______ (Express the voltage in terms of x, y and z)
Assuming ideal diodes, the voltage at $V_0$ for circuit in the below figure is _______ (Express the voltage in terms of x, y and z)
User Avatar
2 votes
1 answer
66
GATE CSE 1988 | Question: 1i
Loosely speaking, we can say that a numerical method is unstable if errors introduced into the computation grow at _________ rate as the computation proceeds.
Loosely speaking, we can say that a numerical method is unstable if errors introduced into the computation grow at _________ rate as the computation proceeds.
User Avatar
Page: