Dark Mode

Answers by Ravi Raja

1 vote

1

Os TLB question
How they calculated time for number of levels?

answered in Operating System Dec 16, 2018

1.2k views

2 votes

2

Find total number of comparisons needed
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?

answered in Algorithms Oct 10, 2018

979 views

3 votes

3

GALVIN(NINTH INDIAN EDITION)-CHAPTER 1(SECTION 1.5.1)
The hardware allows privileged instruction to be executed only in kernel mode. if an attempt to execute a privileged instruction in user mode, the hardware does not execute the instruction but rather treat it as illegal and traps it to ... privileged instruction. how can it be then executed if the system is not in kernel mode? please clarify...

answered in Operating System Oct 10, 2018

1.6k views

0 votes

4

Big oh
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??

answered in Algorithms Aug 28, 2018

379 views

1 vote

5

array long with pointers
give the complete solution with explanation int main() { int arr [2] [2] [2] = {10,2,3,4,5,6,7,8}; int *p, *q; p = &arr[1] [1] [1]; q = (int*) arr; printf("%d ,%d \n",*p ,*q); return 0; }

answered in Programming Aug 28, 2018

410 views

3 votes

6

Number of Binary tree
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ?

answered in Programming Jan 14, 2018

822 views

0 votes

7

made easy
Q9-Consider the following grammar: S → aPbSQ | a Q → t | ε P → r The number of states will reduce when a LALR(1) parse is computed out of CLR(1) parser for the above grammar _____. made easy solution my solution please correct me if i wrong no of state is reduce =6?

answered in Compiler Design Jan 2, 2018

564 views