Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by VS
5
votes
1
ISRO2018-77
What is one advantage of setting up a $\text{DMZ}$ (Demilitarized Zone) with two firewalls? You can control where traffic goes in the three networks You can do statefull packet filtering You can do load balancing Improve network performance
What is one advantage of setting up a $\text{DMZ}$ (Demilitarized Zone) with two firewalls?You can control where traffic goes in the three networksYou can do statefull pa...
4.1k
views
answered
May 1, 2018
Computer Networks
isro2018
computer-networks
network-security
firewall
+
–
6
votes
2
ISRO2018-67
In multi-programmed systems, it is advantageous if some programs such as editors anf compilers can be shared by several users. Which of the following must be true of multi-programmed systems in order that a single copy of a program can be shared by several users? The program is a macro The program is recursive The program is reentrant I only II only III only I, II and III
In multi-programmed systems, it is advantageous if some programs such as editors anf compilers can be shared by several users.Which of the following must be true of multi...
3.3k
views
answered
Apr 30, 2018
Operating System
isro2018
operating-system
macros
+
–
29
votes
3
ISRO2018-49
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used? $5$ $4$ $3$ $10$
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used?$5$$4$...
10.1k
views
answered
Apr 26, 2018
Databases
isro2018
databases
b-tree
+
–
15
votes
4
ISRO2018-46
In cryptography, the following uses transposition ciphers and the keyword is LAYER. Encrypt the following message. (Spaces are omitted during encrypton) $\text{WELCOME TO NETWORK SECURITY!}$ $\text{WMEKREETSILTWETCOOCYONRU!}$ $\text{EETSICOOCYWMEKRONRU!LTWET}$ $\text{LTWETONRU!WMEKRCOOCYEETSI}$ $\text{ONRU!COOCYLTWETEETSIWMEKR}$
In cryptography, the following uses transposition ciphers and the keyword is LAYER. Encrypt the following message. (Spaces are omitted during encrypton)$\text{WELCOME TO ...
7.7k
views
answered
Apr 26, 2018
Computer Networks
isro2018
computer-networks
network-security
+
–
11
votes
5
ISRO2018-32
A computer uses ternary system instead of the traditional systen, An $n$ bit string in the binary system will occupy $3+n$ ternary digits $2n/3$ ternary digits $n$\log_{2}3$ ternary digits $n$\log_{3}2$ ternary digits
A computer uses ternary system instead of the traditional systen, An $n$ bit string in the binary system will occupy$3+n$ ternary digits$2n/3$ ternary digits$n$$\log_{2}3...
4.2k
views
answered
Apr 24, 2018
Digital Logic
isro2018
digital-logic
number-representation
+
–
1
votes
6
ISRO2018-30
Which of the following comment about peep-hole optimization is true? It is applied to small part of the code and applied repeatedly It can be used to optimize intermediate code It can be applied to a portion of the code that is not contiguous It is applied in symbol table to optimize the memory requirements.
Which of the following comment about peep-hole optimization is true?It is applied to small part of the code and applied repeatedlyIt can be used to optimize intermediate ...
4.3k
views
answered
Apr 24, 2018
Compiler Design
isro2018
compiler-design
code-optimization
+
–
10
votes
7
ISRO2018-26
The $FSM$ (Finite State Machine) machine pictured in the figure above Complements a given bit pattern Finds $2's$ complement of a given bit pattern Increments a given bit pattern by $1$ Changes the sign bit
The $FSM$ (Finite State Machine) machine pictured in the figure aboveComplements a given bit patternFinds $2's$ complement of a given bit patternIncrements a given bit pa...
7.1k
views
answered
Apr 23, 2018
Theory of Computation
isro2018
finite-automata
theory-of-computation
+
–
6
votes
8
ISRO2018-24
Choose the correct statement - $A=\{a^nb^n \mid n= 1, 2, 3, \ldots\}$ is a regular language The set $B$, consisting of all strings made up of only $a's$ and $b's$ having equal number of $a's$ and $bs$ defines a regular language $L(A^*B)\cap B$ gives the set $A$ None of the above
Choose the correct statement -$A=\{a^nb^n \mid n= 1, 2, 3, \ldots\}$ is a regular languageThe set $B$, consisting of all strings made up of only $a's$ and $b's$ having eq...
8.1k
views
answered
Apr 23, 2018
Theory of Computation
isro2018
theory-of-computation
regular-language
+
–
13
votes
9
ISRO2018-15
The domain of the function $\log (\log \sin(x))$ is: $0<x<$\pi$ $2n$\pi$<$x$<$(2n+1)$\pi$, for $n$ in $N$ Empty set None of the above
The domain of the function $\log (\log \sin(x))$ is:$0<x<$$\pi$$2n$$\pi$$<$$x$$<$$(2n+1)$$\pi$, for $n$ in $N$Empty setNone of the above
5.4k
views
answered
Apr 23, 2018
Calculus
isro2018
calculus
functions
+
–
4
votes
10
ISRO2018-13
The difference between a named pipe and a regular file in Unix is that Unlike a regular file, named pipe is a special file The data in a pipe is transient, unlike the content of a regular file Pipes forbid random accessing, while regular files do allow this. All of the above
The difference between a named pipe and a regular file in Unix is thatUnlike a regular file, named pipe is a special fileThe data in a pipe is transient, unlike the conte...
3.8k
views
answered
Apr 23, 2018
Operating System
isro2018
operating-system
pipes
non-gate
+
–
18
votes
11
ISRO2018-1
Consider the following program { int x=1; printf("%d",(*char(char*)&x)); } Assuming required header files are included and if the machine in which this program is executed is little endian, then the output will be 0 99999999 1 unpredictable
Consider the following program{ int x=1; printf("%d",(*char(char*)&x)); }Assuming required header files are included and if the machine in which this program is executed ...
8.6k
views
answered
Apr 23, 2018
Programming in C
isro2018
programming
output
+
–
1
votes
12
Peterlinz question
Please write grammar for it and explain with example. $L=\{w \: : n_a(w) > n_b(w) \}$
Please write grammar for it and explain with example.$L=\{w \: : n_a(w) n_b(w) \}$
428
views
answered
Mar 4, 2018
Theory of Computation
grammar
theory-of-computation
+
–
3
votes
13
Test by Bikram | Mock GATE | Test 4 | Question: 15
What is the worst case time complexity to calculate the depth of a directed acyclic graph (DAG) with ‘$V$’ vertices and ‘$E$’ edges? $O\left ( V+E \right )$ $O\left ( V \right )$ $O\left ( V^{2} +E \right )$ $O\left ( E\log V \right )$
What is the worst case time complexity to calculate the depth of a directed acyclic graph (DAG) with ‘$V$’ vertices and ‘$E$’ edges?$O\left ( V+E \right )$$O\left...
306
views
answered
Jan 31, 2018
Algorithms
tbb-mockgate-4
algorithms
graph-algorithms
+
–
0
votes
14
Test by Bikram | Mock GATE | Test 4 | Question: 62
A student reaches school 15 minutes early by running at a speed of 5 km/h from his house. By walking at 3 km/h, he is late by 9 minutes. The distance between the school and his house is ______ km.
A student reaches school 15 minutes early by running at a speed of 5 km/h from his house. By walking at 3 km/h, he is late by 9 minutes. The distance between the school a...
470
views
answered
Jan 31, 2018
GATE
tbb-mockgate-4
numerical-answers
quantitative-aptitude
speed-time-distance
+
–
4
votes
15
Test by Bikram | Mock GATE | Test 4 | Question: 60
5 9 15 16 29 ? 49 89 147 $\begin{array}{|c|c|c|} \hline 5 & 9 & 15 \\ \hline 16 & 29 & ? \\ \hline 49 & 89 & 147 \\ \hline \end{array}$ The missing number is ________.
59 151629 ?4989 147 $$\begin{array}{|c|c|c|} \hline 5 & 9 & 15 \\ \hline 16 & 29 & ? \\ \hline 49 & 89 & 147 \\ \hline \end{array}$$The missing number is ________.
419
views
answered
Jan 31, 2018
GATE
tbb-mockgate-4
numerical-answers
analytical-aptitude
logical-reasoning
+
–
29
votes
16
MadeEasy Test Series: Combinatory - Permutations And Combinations
MY SOLUTION : Fix the root then next level 2 elements ( 2! possibilities) next level 4 elements( 4! possibilities) last level 2 elements ( 2! possibilities) total possibility = 2! * 4! * 2! = 2 * 24 * 2 = 96 what ... that if node of above graph is filled with these elements it satisfies max heap property a)96 b)896 c)2688 d) none
MY SOLUTION :Fix the rootthen next level 2 elements ( 2! possibilities)next level 4 elements( 4! possibilities)last level 2 elements ( 2! possibilities)total possibility ...
3.8k
views
answered
Jan 24, 2018
Combinatory
combinatory
made-easy-test-series
+
–
3
votes
17
#Conflict Misses
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main memory addresses (in hexadecimal). The conflict miss if 2-way set associative LRU cache is used is ________. 100, 108, 114, 1C7, 128, 1B5, 100, 108, 1C7
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main ...
1.1k
views
answered
Jan 21, 2018
CO and Architecture
cache-memory
co-and-architecture
+
–
2
votes
18
Test by Bikram | Mock GATE | Test 2 | Question: 38
$S\rightarrow A0 B$ $A\rightarrow BB \mid 0$ $B\rightarrow AA \mid 1$ The number of terminal strings of length $5$ generated by the context-free grammar shown above is _______.
$S\rightarrow A0 B$$A\rightarrow BB \mid 0$$B\rightarrow AA \mid 1$ The number of terminal strings of length $5$ generated by the context-free grammar shown above is ____...
780
views
answered
Jan 13, 2018
Compiler Design
tbb-mockgate-2
numerical-answers
compiler-design
theory-of-computation
context-free-grammar
+
–
2
votes
19
#of variables in SSA
Consider the following code segment: c=b+a e=c-a f=c*e h=c+a i=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert the above code segment to static single assignment form are ________
Consider the following code segment:c=b+ae=c-af=c*eh=c+ai=h+f The minimum number of $\color{blue} {total}$ and $\color{blue} {temporary }$ variable required to convert t...
1.8k
views
answered
Jan 11, 2018
Compiler Design
compiler-design
static-single-assignment
+
–
10
votes
20
Hashing (Test Series)
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing. 0 1 91 2 2 3 13 4 24 5 12 6 62 7 77 8 82 9 The number of different insertion sequence of the key values using the given hash function and linear probing will result in the hash table shown in above __________.
Consider an initially empty hash table of length 10. Following set of keys are inserted using open addressing with hash function h(k) = k mod 10 and linear probing.0 1912...
3.4k
views
answered
Jan 3, 2018
DS
data-structures
hashing
+
–
4
votes
21
ME test series
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of ‘N’ is _______.
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 reso...
4.4k
views
answered
Dec 16, 2017
6
votes
22
[TOC] Identify class of language
L={$a^m$b^n$ | m <= n <= 3m }
L={$a^m$$b^n$ | m <= n <= 3m }
970
views
answered
Nov 26, 2017
Theory of Computation
theory-of-computation
identify-class-language
+
–
2
votes
23
MADE EASY TEST SERIES
Consider a linked list of length n is implemented using a circular array P[0, n - 1], two variables first and last are used to point the first and last element of the list present in array respectively i.e., first = P and last = (P + x) mod n, where x is the size of ... the time complexity of above two operations respectively? O(n), O(n) O(n), O(1) O(1), O(1) O(1), O(n)
Consider a linked list of length n is implemented using a circular array P[0, n – 1], two variables first and last are used to point the first and last element of the l...
1.2k
views
answered
Nov 24, 2017
2
votes
24
In-place Merge Sort via Doubly linked list in place of Array
In general merge sort is not considered in-place sorting technique. Because an auxiliary array is used. If we will try to do it in-place in array data structure then our merge procedure will take O($n^2$) time. so overall ... list in place of Array (for storing and merging data) ? Please share your valuable opinion. It will be great help.
In general merge sort is not considered in-place sorting technique. Because an auxiliary array is used. If we will try to do it in-place in array data structure then our ...
1.4k
views
answered
Nov 2, 2017
Algorithms
algorithms
sorting
space-complexity
linked-list
time-complexity
+
–
0
votes
25
algorithms Asymptotic Notations
584
views
answered
Aug 12, 2017
Algorithms
asymptotic-notation
algorithms
time-complexity
test-series
+
–
3
votes
26
CN Boot P Protocol
In bootp protocol client puts all 0 in source IP and broadcast the packet.Then relay agent encapsulate that in a unicast packet and send to boot p server. How does boot p server know the Mac address of the client to which it is assigning the address ?
In bootp protocol client puts all 0 in source IP and broadcast the packet.Then relay agent encapsulate that in a unicast packet and send to boot p server.How does boot p ...
396
views
answered
Aug 12, 2017
Computer Networks
computer-networks
+
–
3
votes
27
CN Data link layer
True/False:- 1. The communication between Network layer and Mac sublayer is contention less. 2. The communication between Network layer and LLC sublayer is contention less.
True/False:-1. The communication between Network layer and Mac sublayer is contention less.2. The communication between Network layer and LLC sublayer is contention less....
984
views
answered
Aug 11, 2017
Computer Networks
computer-networks
link
layer
data
+
–
0
votes
28
half adder
If only half adder used for addition then the number of half adders required to add two 'm' bit numbers is; A) 2m-1 B) 2m-1 C) 2m+1 D)2m
If only half adder used for addition then the number of half adders required to add two 'm' bit numbers is;A) 2m-1B) 2m-1C) 2m+1D)2m
8.4k
views
answered
Aug 11, 2017
30
votes
29
GATE CSE 1997 | Question: 70
Following is a state table for time finite state machine. ... . For example if states $X$ and $Y$ are equivalent then use $XY$ as the name for the equivalent state in the minimal machine).
Following is a state table for time finite state machine.$$\begin{array}{|l|ll|}\hline \textbf{Present State} & \textbf{Next State Output} \\ & \textbf{Input- 0} & \t...
7.8k
views
answered
Aug 9, 2017
Theory of Computation
gate1997
theory-of-computation
minimal-state-automata
descriptive
+
–
9
votes
30
TOC DCFL vs CFL
1. L ={ a^n b^m c^x d^y | n=m or x=y} 2. L ={ a^n b^x c^m d^y | n=m or x=y} Classify above in CFL/DCFL?
1. L ={ a^n b^m c^x d^y | n=m or x=y}2. L ={ a^n b^x c^m d^y | n=m or x=y}Classify above in CFL/DCFL?
3.4k
views
answered
Aug 8, 2017
Theory of Computation
theory-of-computation
context-free-language
dcfl
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register