Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User VS
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
answered
in
Computer Networks
May 1, 2018
4.0k
views
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
answered
in
Operating System
Apr 30, 2018
3.2k
views
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$
answered
in
Databases
Apr 26, 2018
10.0k
views
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}$
answered
in
Computer Networks
Apr 26, 2018
7.6k
views
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
answered
in
Digital Logic
Apr 24, 2018
4.2k
views
isro2018
digital-logic
number-representation
1
vote
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.
answered
in
Compiler Design
Apr 24, 2018
4.2k
views
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
answered
in
Theory of Computation
Apr 23, 2018
7.0k
views
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
answered
in
Theory of Computation
Apr 23, 2018
8.0k
views
isro2018
theory-of-computation
regular-language
12
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
answered
in
Calculus
Apr 23, 2018
5.4k
views
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
answered
in
Operating System
Apr 23, 2018
3.7k
views
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
answered
in
Programming in C
Apr 23, 2018
8.4k
views
isro2018
programming
output
1
vote
12
Peterlinz question
Please write grammar for it and explain with example. $L=\{w \: : n_a(w) > n_b(w) \}$
answered
in
Theory of Computation
Mar 4, 2018
415
views
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 )$
answered
in
Algorithms
Jan 31, 2018
294
views
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.
answered
in
GATE
Jan 31, 2018
442
views
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 ________.
answered
in
GATE
Jan 31, 2018
391
views
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
answered
in
Combinatory
Jan 24, 2018
3.7k
views
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
answered
in
CO and Architecture
Jan 21, 2018
1.1k
views
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 _______.
answered
in
Compiler Design
Jan 13, 2018
710
views
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 ________
answered
in
Compiler Design
Jan 11, 2018
1.7k
views
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 __________.
answered
in
DS
Jan 3, 2018
3.3k
views
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 _______.
answered
in
Operating System
Dec 16, 2017
4.3k
views
6
votes
22
[TOC] Identify class of language
L={$a^m$b^n$ | m <= n <= 3m }
answered
in
Theory of Computation
Nov 26, 2017
919
views
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)
answered
in
DS
Nov 24, 2017
1.2k
views
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.
answered
in
Algorithms
Nov 2, 2017
1.3k
views
algorithms
sorting
space-complexity
linked-list
time-complexity
0
votes
25
algorithms Asymptotic Notations
answered
in
Algorithms
Aug 12, 2017
567
views
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 ?
answered
in
Computer Networks
Aug 12, 2017
376
views
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.
answered
in
Computer Networks
Aug 11, 2017
957
views
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
answered
in
Digital Logic
Aug 11, 2017
8.4k
views
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).
answered
in
Theory of Computation
Aug 9, 2017
7.7k
views
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?
answered
in
Theory of Computation
Aug 8, 2017
3.4k
views
theory-of-computation
context-free-language
dcfl
Page:
1
2
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...