Dark Mode

Questions by santhoshdevulapally

0 votes

1 answer

21

asked in Operating System Dec 1, 2016

299 views

1 vote

1 answer

22

ME FLT-2
NEED=REQUEST-ALLOCATION. am i right?

asked in Operating System Dec 1, 2016

481 views

1 vote

2 answers

23

asked in Theory of Computation Nov 29, 2016

397 views

0 votes

0 answers

24

asked in CO and Architecture Nov 29, 2016

209 views

4 votes

1 answer

25

asked in Computer Networks Nov 29, 2016

1.4k views

3 votes

0 answers

26

ME FLT-2
i got 0.092ns but how it is 92MIPS?

asked in CO and Architecture Nov 29, 2016

225 views

2 votes

1 answer

27

MadeEasy Test Series: Digital Logic - Digital Counter

asked in Digital Logic Nov 29, 2016

742 views

3 votes

3 answers

28

asked in Programming in C Nov 28, 2016

571 views

3 votes

3 answers

29

thread execution
Consider the following code segment: pid_t pid; pid = fork(); if (pid == 0) { /* child process */ fork(); thread create( . . .); } fork(); a. How many unique processes are created? b. How many unique threads are created?

asked in Operating System Nov 25, 2016

6.7k views

–1 vote

0 answers

30

regressive scheduling algo
A variation of the round-robin scheduler is the regressive round-robin scheduler. This scheduler assigns each process a time quantum and a priority.Theinitialvalueofatimequantumis50milliseconds.However, everytime a process has been allocated the CPU and uses its ... What type of process (CPU-bound or I/O-bound) does the regressive round-robin schedulerfavor? Explain.

asked in Operating System Nov 25, 2016

1.1k views

–1 vote

0 answers

31

LOTTERY SCHEDULING
Onetechniqueforimplementinglotteryschedulingworksbyassigning processeslotterytickets,which are used for allocating CPU time.Whenever a scheduling decision has to be made, a lottery ticket is chosen at random, and the process holding that ticket ... -prioritythreadsreceivemoreattention from the CPU than lower-prioritythreads consider on example and explain this scheduling algo.

asked in Operating System Nov 25, 2016

502 views

0 votes

0 answers

32

asked in Computer Networks Nov 22, 2016

225 views

0 votes

0 answers

33

HOW MANY NONISOMORPHIC ROOTED TREES ARE THERE WITH 3 VERTICES(use isomporphism for directed graphs)

asked in Mathematical Logic Nov 12, 2016

500 views

0 votes

0 answers

34

HOW MANY NONISOMORPHIC UNROOTED TREES ARE THERE WITH 3 VERICES

asked in Mathematical Logic Nov 12, 2016

418 views

0 votes

0 answers

35

asked in Databases Nov 8, 2016

249 views

0 votes

1 answer

36

RECOVER SCHEDULES

asked in Databases Nov 8, 2016

231 views

5 votes

1 answer

37

B+ TREE INSERTION
The following key values are inserted into a B+ Tree in which order of the internal node is 5 and that of leaf node is 4, in the sequence given below . The order of internal node is the maximum number of tree pointers in each node and the order ... maximum number of times leaf nodes would get split up as a result if these insertions is _____ ( Assume key distribution is not used )

asked in Databases Nov 8, 2016

2.7k views

3 votes

0 answers

38

Which parser can parse following grammar ?
Which of the Parsers from LL(1), LR(0), SLR(1), LALR(1) and CLR(1) can Parse the following grammar ? $\tt E \rightarrow ET | a$ $\tt T \rightarrow TE | b$

asked in Compiler Design Nov 1, 2016

648 views

Page: