Register
Filter

Recent activity by manikgupta123

0 answers
1
Bits HD 2019
In a microprocessor, size of register is generally: Lesser than the size of the data it operates on Greater than the size of the data it operates on Equal to the size of the data it operates on
In a microprocessor, size of register is generally:Lesser than the size of the data it operates onGreater than the size of the data it operates onEqual to the size of th...
4 answers
2
IIIT PGEE 2019
What is the time complexity to delete an arbitrary node from binary heap? O(n) O(log n) O(1) O(n log n)
What is the time complexity to delete an arbitrary node from binary heap?O(n)O(log n)O(1)O(n log n)
4 answers
3
IIIT PGEE 2019
Which of the following gives O(1) complexity if we want to check whether an edge exists between two given nodes in a graph? Adjacency List Adjacency Matrix Incidence Matrix None of these
Which of the following gives O(1) complexity if we want to check whether an edge exists between two given nodes in a graph?Adjacency ListAdjacency MatrixIncidence MatrixN...
1 answer
4
IIIT PGEE 2019
Which part in 8086 microprocessor is responsible for fetching instructions into the queue? BIU EU Stack Registers
Which part in 8086 microprocessor is responsible for fetching instructions into the queue?BIUEUStackRegisters
3 answers
5
PGEE 2019
for(int i=0; i<=100;i++) { if (i % 3 == 0) printf("Great); if(i%5 == 0) printf("India"); } Count the number of times GreatIndia is printed. 6 20 33 none of these
for(int i=0; i<=100;i++) { if (i % 3 == 0) printf("Great); if(i%5 == 0) printf("India"); }Count the number of times GreatIndia is printed.62033none of these
2 answers
6
IIIT PGEE 2019
How many pairs of positive integers do $m$ and $n$ satisfy in $\frac{1}{m}+\frac{4}{n}=\frac{1}{12}, $ where $n$ is odd and less than $60?$ 3 5 7 9
How many pairs of positive integers do $m$ and $n$ satisfy in $\frac{1}{m}+\frac{4}{n}=\frac{1}{12}, $ where $n$ is odd and less than $60?$3579
4 answers
7
IIIT PGEE 2019
What is the time complexity for insertion in binary tree in worst case? O(1) O(log n) O(n) O(n log n)
What is the time complexity for insertion in binary tree in worst case?O(1)O(log n)O(n)O(n log n)