Register
Filter

Answers by gaurav1.yuva

1 votes
1
NIELIT Scientist B 2020 November: 48
The __________ command will show you the translation table containing all the active $NAT$ entries. show ip nat translations show ip nat tl show ip nat states none of the options
The __________ command will show you the translation table containing all the active $NAT$ entries.show ip nat translationsshow ip nat tlshow ip nat statesnone of the opt...
0 votes
2
NIELIT Scientist B 2020 November: 64
In an $\text{IPv6}$ header, the traffic class field is similar to the ________ field in the $\text{IPv4}$ header. $TOS$ field Fragmentation field Fast Switching Option field
In an $\text{IPv6}$ header, the traffic class field is similar to the ________ field in the $\text{IPv4}$ header.$TOS$ fieldFragmentation fieldFast SwitchingOption field...
0 votes
3
UGC NET CSE | October 2020 | Part 2 | Question: 10
In HTML, $<\text{map}>$ tag is used for defining a path between two nodes in an image defining clickable region in an image highlighting an area in an image defining the site-map of a web-site
In HTML, $<\text{map}>$ tag is used fordefining a path between two nodes in an imagedefining clickable region in an imagehighlighting an area in an imagedefining the site...
2 votes
4
NIELIT 2016 MAR Scientist C - Section B: 8
The eigenvalues of the matrix $\begin{bmatrix}1 & 2\\ 4 & 3 \end{bmatrix}$ are $\text{5 and -5}$ $\text{5 and -1}$ $\text{1 and -5}$ $\text{2 and 3}$
The eigenvalues of the matrix $\begin{bmatrix}1 & 2\\ 4 & 3 \end{bmatrix}$ are$\text{5 and -5}$$\text{5 and -1}$$\text{1 and -5}$$\text{2 and 3}$
1 votes
6
NIELIT 2016 MAR Scientist C - Section C: 63
The range of the numbers which can be stored in an eight bit register is $-128$ to $+127$ $-128$ to $+128$ $-999999+ \: +999999$ none of these
The range of the numbers which can be stored in an eight bit register is$-128$ to $+127$$-128$ to $+128$$-999999+ \: +999999$none of these
2 votes
7
NIELIT 2016 MAR Scientist C - Section C: 62
The excess $3$ code is also called cyclic redundancy code weighted code self complimenting code algebraic code
The excess $3$ code is also called cyclic redundancy codeweighted codeself complimenting codealgebraic code
0 votes
9
NIELIT 2016 MAR Scientist C - Section C: 65
In propositional logic, which of the following is equivalent to $p \rightarrow q$? $\sim p\rightarrow q$ $ \sim p \vee q$ $ \sim p \vee \sim q$ $p\rightarrow \sim q$
In propositional logic, which of the following is equivalent to $p \rightarrow q$?$\sim p\rightarrow q$$ \sim p \vee q$$ \sim p \vee \sim q$$p\rightarrow \sim q$
0 votes
10
NIELIT 2016 MAR Scientist C - Section C: 28
Serial access memories are useful in applications where data consists of numbers short access time is required each stored word is processed differently data naturally needs to flow in and out in serial form
Serial access memories are useful in applications wheredata consists of numbersshort access time is requiredeach stored word is processed differentlydata naturally needs ...
0 votes
11
NIELIT 2017 Scientist B (CS) - Section A: 5
The present ages of three persons in proportions $4:7:9$. Eight years ago, the sum of their ages was $56$. Find their present ages (in years). $8,20,28$ $16,28,36$ $20,35,45$ None of the above options
The present ages of three persons in proportions $4:7:9$. Eight years ago, the sum of their ages was $56$. Find their present ages (in years).$8,20,28$$16,28,36$$20,35,45...
0 votes
13
NIELIT 2017 Scientist B (CS) - Section A: 1
What is the maximum number of distinct handshakes that can happen in the room with $5$ people in it? $15$ $10$ $6$ $5$
What is the maximum number of distinct handshakes that can happen in the room with $5$ people in it?$15$$10$$6$$5$
3 votes
14
NIELIT 2017 July Scientist B (IT) - Section B: 3
A path in graph $G$, which contains every vertex of $G$ and only once? Euler circuit Hamiltonian path Euler Path Hamiltonian Circuit
A path in graph $G$, which contains every vertex of $G$ and only once?Euler circuitHamiltonian pathEuler PathHamiltonian Circuit
5 votes
16
Made Easy Test Series:TOC
The number of distinct 1 letter subword present in “NAMITA” is equal to_______________ Answer given subwords are N,A,M,I,T But last ‘A’ is not a subword. Is it correct??
The number of distinct 1 letter subword present in “NAMITA” is equal to_______________Answer given subwords are N,A,M,I,TBut last ‘A’ is not a subword. Is it cor...
0 votes
18
Gate 2018: Probability
In a box, there are $2$ red, $3$ black and $4$ blue coloured balls. The probability of drawing $2$ blue balls in sequence without replacing, and then drawing $1$ black ball from this box is _________ %.
In a box, there are $2$ red, $3$ black and $4$ blue coloured balls. The probability of drawing $2$ blue balls in sequence without replacing, and then drawing $1$ black ba...
0 votes
22
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
2 votes
23
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)
5 votes
24
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)
0 votes
26
self doubt about maths practice
Where can i find only maths PYQ all branches . for practice ?
Where can i find only maths PYQ all branches . for practice ?
1 votes
27
#Algorithms Quicksort VS Mergesort? Which is a faster sorting algorithm
I did Google and found out that Quicksort is better then Mergesort, but my question is which is faster among both?
I did Google and found out that Quicksort is better then Mergesort, but my question is which is faster among both?
7 votes
28
GATE CSE 2019 | Question: 8
Consider $Z=X-Y$ where $X, Y$ and Z are all in sign-magnitude form. X and Y are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a minimum of: $n$ bits $n-1$ bits $n+1$ bits $n+2$ bits
Consider $Z=X-Y$ where $X, Y$ and Z are all in sign-magnitude form. X and Y are each represented in $n$ bits. To avoid overflow, the representation of $Z$ would require a...
0 votes
30
GATE CSE 2019 | Question: 12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$
Let $G$ be an undirected complete graph on $n$ vertices, where $n 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to$n!$$(n-1)!$$1$$\frac{(n-1)!}{2}...
Page: