Dark Mode

Recent activity by habedo007

8 answers

1

GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$

commented in Computer Networks Jun 16, 2022

18.7k views

2 answers

2

T(n) = T(n/2) + n recurrence equation solution? T(1) = 1.
suppose you are given n bit integers asuming for common sense n as power of 2 .it is required to multiply them using divide and conquer method .what is the divide and conquer recurrence that would arise for the problem a) T(n)=4T(n/2)+c b) a) T(n)=2T(n/2)+n c) a) T(n)=4T(n/2)+n2 d) a) T(n)=4T(n)+n

answered in Algorithms Nov 20, 2020

4.9k views

2 answers

3

NIELIT 2017 DEC Scientific Assistant A - Section B: 18
In a full binary tree number of nodes is $63$ then the height of the tree is : $2$ $4$ $3$ $6$

commented in DS Oct 14, 2020

2.0k views

2 answers

4

NIELIT 2017 DEC Scientific Assistant A - Section B: 37
How many times the word "PROCESS" will be printed when executing the following program ? main(){ printf("PROCESS"); fflush(); fork(); fork(); } $8$ $4$ $6$ $7$

answered in Operating System Oct 13, 2020

738 views

2 answers

5

NIELIT 2017 DEC Scientific Assistant A - Section B: 59
The expression $5-2-3*5 – 2$ will evaluate to $18$, if : $‘ – ‘$ is left associative and $‘*‘$ has precedence over $‘ – ‘$ $‘ – ‘$ is right associative and $‘*‘$ has precedence over $‘ – ‘$ $‘ – ‘$ is right associative and $‘ – ‘$ has precedence over $‘*‘$ $‘ – ‘$ is left associative and $‘ – ‘$ has precedence over $‘*‘$

commented in DS Oct 12, 2020

710 views

1 answer

6

NIELIT 2017 DEC Scientific Assistant A - Section B: 50
How many DFA's exits with two states over input alphabet $\left \{ 0,1 \right \}$ $16$ $26$ $32$ $64$

commented in Theory of Computation Oct 12, 2020

611 views

4 answers

7

NIELIT 2017 DEC Scientific Assistant A - Section B: 7
If file size is large and if it is to be accessed randomly then which of the following allocation strategy should be best to use in a system? Linked allocation Indexed allocation Contiguous allocation None of the options

commented in Operating System Oct 12, 2020

1.2k views

3 answers

8

NIELIT 2017 DEC Scientific Assistant A - Section B: 57
Starvation can be avoided by which of the following statements: By using shortest job first resource allocation policy . By using first come first serve resources allocation policy. (i) only (i) and (ii) only (ii) only None of the options

commented in Operating System Oct 12, 2020

1.1k views

2 answers

9

NIELIT 2017 DEC Scientific Assistant A - Section B: 42
Which of the following is illegal declaration in $C$ language? char*str ="Raj is a Research scholar"; char str[25] ="Raj is a Research scholar"; char str[40] ="Raj is a Research scholar"; char[]str ="Raj is a Research scholar";

commented in Programming Oct 12, 2020

1.1k views

1 answer

10

NIELIT 2017 DEC Scientific Assistant A - Section B: 28
There is a need to create a network that has $5$ subnets, each with at least $16$ hosts. Which one is used as classful subnet mask ? $255.255.255.192$ $255.255.255.248$ $255.255.255.240$ $255.255.255.224$

commented in Computer Networks Oct 11, 2020

1.1k views

2 answers

11

NIELIT 2017 July Scientist B (CS) - Section B: 47
What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit production (i.e.,of type $A\to\epsilon$ and $A \to a)$ to parse a string with $n$ tokens? $n/2$ $n-1$ $2n-1$ $2^n$

answered in Compiler Design Oct 9, 2020

623 views

1 answer

12

NIELIT 2017 July Scientist B (CS) - Section B: 29
In comparison with static RAM memory, the dynamic RAM memory has Lower bit density and higher power consumption Higher bit density and lower power consumption Lower bit density and lower power consumption None of the option

commented in CO and Architecture Oct 9, 2020

464 views

2 answers

13

NIELIT 2017 July Scientist B (CS) - Section B: 26
The process of converting the analog sample into discrete form is called Modulation Multiplexing Quantization Sampling

commented in Computer Networks Oct 9, 2020

8.3k views

2 answers

14

BCD adder to add 2 decimal digits needs
The BCD adder to add two decimal digits needs minimum of 6 full adders, 2 half adders 5 full adders, 3 half adders 4 full adders, 3 half adders 5 full adders, 2 half adders

commented in Digital Logic Oct 8, 2020

13.8k views

1 answer

15

NIELIT 2017 July Scientist B (CS) - Section B: 35
A disk has $200$ tracks (numbered $0$ through $199$). At a given time, it was servicing the request of reading data from track $120$, and at the previous request, service was for track $90$. The pending requests (in order of their arrival) are for track numbers. ... ) and FCFS (First Come First Serve)? $2$ and $3$ $3$ and $3$ $3$ and $4$ $4$ and $4$

commented in Operating System Oct 8, 2020

519 views

2 answers

16

NIELIT 2017 July Scientist B (CS) - Section B: 18
If $A\oplus B=C$, then which one of the following is true? $A\oplus C=B$ $B\oplus C=A$ $A\oplus B\oplus C=0$ Both (A) and (B)

commented in Digital Logic Oct 7, 2020

744 views

1 answer

17

NIELIT 2017 July Scientist B (CS) - Section B: 57
A system program that combines the separately complied modules of a program into a form suitable for execution assembler linking loader cross compiler load and go

answered in Compiler Design Oct 6, 2020

507 views

3 answers

18

NIELIT 2017 DEC Scientist B - Section B: 56
Which of the following statement is true? Deterministic context free language are closed under complement. Deterministic context free language are not closed under Union. Deterministic context free language are closed under intersection with regular set. All of the options

commented in Theory of Computation Oct 5, 2020

1.0k views

6 answers

19

NIELIT 2017 DEC Scientist B - Section B: 39
Which of the following is true? Mealy and Moore machine are language acceptors. Finite State automata is language translator. NPDA is more powerful than DPDA. Melay machine is more powerful than Moore machine.

commented in Theory of Computation Oct 5, 2020

4.9k views

1 answer

20

NIELIT 2017 DEC Scientist B - Section B: 33
Which of the following statements is/are false? $S1$: $LR(0)$ grammar and $SLR(1)$ grammar are equivalent $S2$: $LR(1)$ grammar are subset of $LALR(1)$ grammars $S1$ only $S1$ and $S2$ both $S2$ only None of the options

comment edited in Compiler Design Oct 4, 2020

2.1k views

3 answers

21

RAM Chip
A RAM chip has 7 address line , 8 data lines and 2 chips select lines. Then the number of memory locations is ... a. 2^12 b.2^10 c.2^19 d.2^13 Plz describe with a proper diagram and significance of each lines.

commented in CO and Architecture Oct 4, 2020

4.1k views

3 answers

22

NIELIT 2017 DEC Scientist B - Section B: 28
A RAM chip has $7$ address lines, $8$ data lines and $2$ chips select lines. Then the number of memory locations is __________ $2^{12}$ $2^{10}$ $2^{19}$ $2^{13}$

answered in CO and Architecture Oct 4, 2020

1.3k views

2 answers

23

NIELIT 2017 DEC Scientist B - Section B: 27
If any string of a language $L$ can be effectively enumerated by an enumerator in a lexicographic order then language $L$ is _______. Regular Context free but not necessarily regular Recursive but not necessarily context free Recursively enumerable but not necessarily recursive

commented in Theory of Computation Oct 4, 2020

680 views

1 answer

24

NIELIT 2017 DEC Scientist B - Section B: 23
Let $G$ be a complete undirected graph on $8$ vertices. If vertices of $G$ are labelled, then the number of distinct cycles of length $5$ in $G$ is equal to: $15$ $30$ $56$ $60$

commented in Graph Theory Oct 4, 2020

1.7k views

1 answer

25

NIELIT 2017 DEC Scientist B - Section B: 7
Let $G$ be a grammar in CFG and let $W_1,W_2\in L(G)$ such that $\mid W_1\mid=\mid W_2\mid$ then which of the following statements is true? Any derivation of $W_1$ has exactly the same number of steps as any derivation ... $W_1$ may be shorter than the derivation of $W_2$ None of the options

commented in Theory of Computation Oct 3, 2020

646 views

1 answer

26

NIELIT 2017 DEC Scientist B - Section B: 49
Which of the following is false? Interrupts which are initiated by an instruction are software interrupts When a subroutine is called, the address of the instruction following the CALL instruction is stored in the stack pointer A micro program which is written as $0$’s and $1$’s is a binary micro program None of the options

commented in CO and Architecture Apr 11, 2020

1.1k views

4 answers

27

NIELIT 2017 DEC Scientist B - Section B: 25
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$. $2$NF BCNF $3$NF $1$NF

commented in Databases Apr 10, 2020

3.5k views

13 answers

28

GATE CSE 2007 | Question: 67, ISRO2016-72
The address of a class $\text{B}$ host is to be split into subnets with a $6\;\text{-bit}$ subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? $62$ subnets and $262142$ hosts. $64$ subnets and $262142$ hosts. $62$ subnets and $1022$ hosts. $64$ subnets and $1024$ hosts.

commented in Computer Networks Apr 9, 2020

28.6k views

3 answers

29

time complexity
The running time of an algorithm T(n), where ‘n’ is the input size, is given by— T(n)=8⌈(n/2)+qn,if n>1⌉=p,if n=1 where p, q are constants. The order of this algorithm is— (a) n2 (b) nn (c) n3 (d) n

answered in Algorithms Apr 8, 2020

9.9k views

7 answers

30

GATE CSE 1997 | Question: 4.5
A binary search tree contains the value $1, 2, 3, 4, 5, 6, 7, 8$. The tree is traversed in pre-order and the values are printed out. Which of the following sequences is a valid output? $5 \ 3 \ 1 \ 2 \ 4 \ 7 \ 8 \ 6$ $5 \ 3 \ 1 \ 2 \ 6 \ 4 \ 8 \ 7$ $5 \ 3 \ 2 \ 4 \ 1 \ 6 \ 7 \ 8$ $5 \ 3 \ 1 \ 2 \ 4 \ 7 \ 6 \ 8$

commented in DS Apr 6, 2020

32.9k views