Dark Mode

Questions by mohitbawankar

0 votes

4 answers

41

NIELIT-DEC 2017 -SET C-65
When we use slow start algorithm ,the size of CW increases ...............until it reaches threshold. A)Additively B)Multiplicatively C)Exponentially D) NONE

asked in Computer Networks Dec 24, 2017

740 views

1 vote

2 answers

42

NIELIT DEC 2017 SET-C 62
If a random coin is tossed 11 times then what is the probability that for 7th toss head appears exactly 4 times? 5/32 15/128 35/128 None of the options

asked in Probability Dec 24, 2017

2.1k views

1 vote

1 answer

43

NIELIT2017-SET C-117
How many times the " PROCESS " will be printed when executing the following program? main() { printf(" PROCESS"); fflush(); fork(); fork(); } a) 8 b)4 c)6 d)7

asked in Programming in C Dec 24, 2017

2.0k views

1 vote

1 answer

44

NIELIT2017 -SET-C-109
What is Compaction? a) a technique for overcoming internal fragmentation b)a paging technique c)a technique for overcoming external fragmentation d)a technique for overcoming fetal error

asked in Operating System Dec 24, 2017

1.4k views

3 votes

1 answer

45

NIELIT 2017 -SET C-108
The automaton which allows transformation to a new state without consuming any input symbol: a) NFA b) DFA c) NFA-l d) All of the mentioned.

asked in Theory of Computation Dec 24, 2017

4.0k views

1 vote

1 answer

46

NIELIT -SET C-107
Page fault Frequency in an OS is reduced when the: (A) processes tend to the I/O-bound (B) size of pages is reduced (C) processes tend to be CPU-bound (D) locality of reference is applicable to the process

asked in CO and Architecture Dec 24, 2017

474 views

3 votes

1 answer

47

NIELIT SET-C-106
The average search time of hashing, with linear probing will be less if the load factor A. is far less than one B. equals one C. is far greater than one D. none of the above

asked in Programming in C Dec 24, 2017

3.2k views

0 votes

0 answers

48

NIELITDEC 2017 set -c 115
In boolean algebra 1+1+1+1+..........800 times ones A) 0 B)1 C)11 D)800

asked in Combinatory Dec 24, 2017

1.5k views

0 votes

0 answers

49

DLDA Q please explain how to solve
In figure, initially Q = A = B = 0. After three clock triggers, the states of Q, A and B will be respectively is ________.

asked in Digital Logic Dec 23, 2017

748 views

0 votes

1 answer

50

doubt DLDA
y=? please explain ANS?

asked in Digital Logic Dec 23, 2017

562 views

0 votes

0 answers

51

digital logic
how many 2*4 decoder are needed to construct 64K*16 RAM using 1K*8 chips ?

asked in Digital Logic Dec 22, 2017

348 views

0 votes

1 answer

52

c programming
What is the value returned by the function if sum(1001) is called?

asked in Programming in C Dec 21, 2017

285 views

0 votes

0 answers

53

doubt M.E.
please explain me first look a heads of first T--->.T*F i got only$ Let G be a grammar with the following productions: If LR(1) parser is used to construct the DFA using the above productions, then how many look-a-heads are present for an item T → .T * F in the initial state ________. SOLUTION:

asked in Compiler Design Dec 21, 2017

190 views

0 votes

0 answers

54

doubt
no.of operation and no. of comparison both are different , right? please correct me .give your opinion

asked in Algorithms Dec 21, 2017

158 views

0 votes

1 answer

55

digital logic
Consider the waveforms given below: The output can be obtained from the circuit a) b) c)

asked in Digital Logic Dec 20, 2017

499 views

0 votes

0 answers

56

huffman coding
Assume that letters p, q, r, s, t and q have probabilities 1/2, 1/4, 1/8, 1/16, 1/32 and 1/32 respectively. The difference in the average length of the message without and with using Huffman’s coding is ______ . (upto 2 decimal places)

asked in Programming in C Dec 20, 2017

693 views

0 votes

0 answers

57

DBMS Q
Which of the following represents the total number of attributes in the minimized relation of above ER diagram ? A. 12 B. 15 C.16 D.17

asked in Databases Dec 20, 2017

371 views

1 vote

2 answers

58

C PROGRAMMING
Assuming no syntax error:

asked in Programming in C Dec 20, 2017

1.3k views

0 votes

0 answers

59

algorithm
Professor Arjun develops an algorithm to multiply two square matrix that is asymptotically faster than strasssen’s algorithm using divide and conquer method. Arjun’s algorithm divide matrix into pieces of n/4 × n/4 create ‘P’ subproblems, and divide and conquer method together will take Θ(n2) time. The recurrence for running time becomes: Then the largest value of ‘P’ is _______.

asked in Algorithms Dec 19, 2017

293 views

1 vote

1 answer

60

please explain me
Consider the following pseudo-code to perform push and pop operation on a stack using enqueue(EQ) and dequeue(DQ) operations on 2 queues q1 and q2. Let x be an element to be pushed in the stack. Answer the following questions. push(q1,q2,x) { if(q1 is ... will be the total dequeue operations on queue q2, if we perform 6 push and 2 pop operations on the above algorithm? 10 8 12 5

asked in Programming in C Dec 18, 2017

468 views

Page:

« prev
1
2
3
4
5
6
next »