The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Answers by Abhisek Tiwari 4
User Abhisek Tiwari 4
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Abhisek Tiwari 4
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
UGCNETJune2019II89
The ability to inject packets into the Internet with a false source address is known as Maninthemiddle attack IP phishing IP sniffing IP spoofing
answered
Jul 3, 2019
in
Computer Networks

174
views
ugcnetjune2019ii
networksecurity
+2
votes
2
UGCNETJune2019II88
What percentage $(\%)$ of the IPv4, IP address space do all class C addresses consume? $12.5 \%$ $25 \%$ $37.5 \%$ $50 \%$
answered
Jul 3, 2019
in
Computer Networks

255
views
ugcnetjune2019ii
ipv4classfuladdressing
+1
vote
3
UGCNETJune2019II82
What is the name of the protocol that allows a client to send a broadcast message with its MAC address and receive an IP address in reply? ARP DNS RARP ICMP
answered
Jul 3, 2019
in
Computer Networks

294
views
ugcnetjune2019ii
rarpprotocol
+1
vote
4
UGCNETJune2019II65
Which of the following is application of depthfirst search? Only topological sort Only strongly connected components Both topological sort and strongly connected components Neither topological sort nor strongly connected components
answered
Jul 3, 2019
in
Algorithms

121
views
ugcnetjune2019ii
dfsapplication
+2
votes
5
UGCNETJune2019II49
A processor can support a maximum memory of $4$ GB where memory is word addressable and a word is $2$ bytes. What will be the size of the address bus of the processor? At least $28$ bits At least $2$ bytes At least $31$ bits Minimum $4$ bytes
answered
Jul 3, 2019
in
CO and Architecture

145
views
ugcnetjune2019ii
processoraddressbus
+2
votes
6
UGCNETJune2019II48
A computer has six tape drives with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $5$ $4$ $3$ $6$
answered
Jul 3, 2019
in
Operating System

138
views
ugcnetjune2019ii
deadlockpreventionavoidancedetection
+1
vote
7
UGCNETJune2019II46
At a particular time of computation, the value of a counting semaphore is $7$. Then $20 \ P$ (wait) operations and $15 \ V$ (signal) operations are completed on this semaphore. What is the resulting value of the semaphore? $28$ $12$ $2$ $42$
answered
Jul 3, 2019
in
Operating System

122
views
ugcnetjune2019ii
countingsemaphores
0
votes
8
UGCNETJune2019II41
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in the following sequences: $4, 34, 10, 7, 19, 73, 2, 15, 6, 20$ Assuming that the head is currently at cylinder $50$, what is the time taken to satisfy all requests ... from the cylinder to adjacent one and the shortest seek time first policy is used? $357$ ms $238$ ms $276$ ms $119$ ms
answered
Jul 3, 2019
in
Operating System

185
views
ugcnetjune2019ii
diskscheduling
sstf
0
votes
9
UGCNETJune2019II43
Consider that a process has been allocated $3$ frames and has a sequence of page referencing as $1, 2, 1, 3, 7, 4, 5, 6, 3, 1$. What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string? $2$ $0$ $1$ $3$
answered
Jul 3, 2019
in
Operating System

202
views
ugcnetjune2019ii
pagereplacement
lru
+1
vote
10
UGCNETJune2019II37
Which of the following statements are DML statements? Update [tablename] Set [columnname]=VALUE Delete [tablename] Select * from [tablename] a and b a and d a, b and c b and c
answered
Jul 3, 2019
in
Databases

179
views
ugcnetjune2019ii
sql
+1
vote
11
UGCNETJune2019II34
In relational databases, if relation R is in BCNF, then which of the following is true about relation R? R is in 4NF R is not in 1NF R is in 2NF and not in 3NF R is in 2NF and 3NF
answered
Jul 3, 2019
in
Databases

325
views
ugcnetjune2019ii
databasenormalization
+2
votes
12
GATE2010 MN: GA8
Consider the set of integers $\{1,2,3,\ldots,5000\}.$ The number of integers that is divisible by neither $3$ nor $4$ is $:$ $1668$ $2084$ $2500$ $2916$
answered
May 14, 2019
in
Numerical Ability

128
views
generalaptitude
numericalability
gate2010mn
factors
+1
vote
13
UPPCL AE 2018:68
answered
May 3, 2019
in
Digital Logic

66
views
uppcl2018
0
votes
14
UPPCL AE 2018:66
answered
May 3, 2019
in
Combinatory

42
views
uppcl2018
0
votes
15
UPPCL AE 2018:63
answered
May 3, 2019
in
Databases

39
views
uppcl2018
0
votes
16
UPPCL AE 2018:53
answered
May 3, 2019
in
DS

40
views
uppcl2018
0
votes
17
UPPCL AE 2018:40
answered
May 3, 2019
in
Computer Networks

36
views
uppcl2018
0
votes
18
UPPCL AE 2018:38
answered
May 3, 2019
in
Algorithms

34
views
uppcl2018
+1
vote
19
UPPCL AE 2018:24
answered
May 3, 2019
in
Compiler Design

47
views
uppcl2018
0
votes
20
UPPCL AE 2018:23
answered
May 3, 2019
in
Algorithms

32
views
uppcl2018
0
votes
21
UPPCL AE 2018:20
answered
May 3, 2019
in
Algorithms

41
views
uppcl2018
0
votes
22
UPPCL AE 2018:17
answered
May 3, 2019
in
Compiler Design

47
views
uppcl2018
0
votes
23
UPPCL AE 2018:8
answered
May 3, 2019
in
Digital Logic

40
views
uppcl2018
0
votes
24
UPPCL AE 2018:6
answered
May 3, 2019
in
Databases

28
views
uppcl2018
+1
vote
25
UPPCL AE 2018:1
answered
May 3, 2019
in
Programming

67
views
uppcl2018
+4
votes
26
IIT Madras MS written test 2019  TOC  1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false
answered
May 2, 2019
in
Theory of Computation

112
views
iitmadras
ms
writtentest
2019
+3
votes
27
Boolean algebra expression Floyd Digital Logic
Simplify the following expression AB’C + A’BC + A’B’C Solution given is A’C + B’C can someone show me how?
answered
May 2, 2019
in
Digital Logic

201
views
digitallogic
booleanalgebra
0
votes
28
ME TEST1
Match the following List 1 Link time load time compile time Run time List 2 A. Resolving references B. Relocation C. Token Recognition D. Activation record
answered
Mar 10, 2019
in
Compiler Design

61
views
+9
votes
29
ISRODEC201717
If $C$ is a skewsymmetric matrix of order $n$ and $X$ is $n\times 1$ column matrix, then $X{^T} CX$ is a scalar matrix null matrix unit matrix matrix will all elements $1$
answered
Feb 12, 2019
in
Linear Algebra

1.7k
views
isrodec2017
matrices
+2
votes
30
MadeEasy Test Series: Operating System  Memory Management
answered
Dec 26, 2018
in
Operating System

187
views
madeeasytestseries
operatingsystem
memorymanagement
paging
+1
vote
31
MadeEasy Test Series: Programming & DS  Binary Tree
answered
Dec 26, 2018
in
DS

138
views
madeeasytestseries
datastructures
binarytree
0
votes
32
In a 3array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
answered
Dec 25, 2018
in
DS

426
views
binarytree
trees
graphtheory
algorithms
datastructures
+2
votes
33
functions
The number of ways possible to form injective function from set A set B where A = 3 and B = 5 such that $p^{th}$ element of set A cannot match with $p^{th}$ element of set B are________.
answered
Dec 25, 2018
in
Set Theory & Algebra

79
views
+2
votes
34
Stack
If two stack is growing two opposite end of array. Then which logic works and how?
answered
Dec 24, 2018
in
DS

210
views
stack
datastructures
0
votes
35
Subset Problem
$L1 \subseteq L2$ decidable ? (for any of languages) i read No language is closed under subset operation Not even Regular Langauge ? I it TRUE ??
answered
Dec 21, 2018
in
Theory of Computation

87
views
+1
vote
36
Self Doubt
If L is CFL then $\bar{L}$ is Recursive. ( True/False) If L is CFL then $\bar{L}$ is RE. (True/Flase).
answered
Dec 13, 2018
in
Theory of Computation

42
views
theoryofcomputation
decidability
+1
vote
37
Complementation of a Language of a L
If L is any Language and L' be its complement. L is CFL. Which of these two statements is true: 1. For any value of L, L' is not in CFL 2. There exists atleast one value of L for which L' is not in CFL
answered
Oct 31, 2018
in
Theory of Computation

52
views
theoryofcomputation
contextfreelanguages
0
votes
38
made EASY
answered
Oct 31, 2018
in
Set Theory & Algebra

60
views
Page:
1
2
next »
50,741
questions
57,234
answers
197,994
comments
104,580
users