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 minal
67
votes
61
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.
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 ...
35.9k
views
answered
Aug 10, 2015
Computer Networks
gatecse-2007
computer-networks
subnetting
easy
isro2016
+
–
60
votes
62
GATE CSE 2008 | Question: 17
Which of the following system calls results in the sending of SYN packets? $\textsf{socket}$ $\textsf{bind}$ $\textsf{listen}$ $\textsf{connect}$
Which of the following system calls results in the sending of SYN packets?$\textsf{socket}$$\textsf{bind}$$\textsf{listen}$$\textsf{connect}$
15.2k
views
answered
Aug 8, 2015
Computer Networks
gatecse-2008
normal
computer-networks
sockets
+
–
2
votes
63
Given n points in the xy plane, what is the time complexity to find the closest pair?
what is the approach of this question , Is it that first we will traverse all the pairs then find the minimum distance between all the pairs
what is the approach of this question , Is it that first we will traverse all the pairs then find the minimum distance between all the pairs
1.1k
views
answered
Jul 31, 2015
Algorithms
algorithms
time-complexity
+
–
2
votes
64
minimum no. of states
953
views
answered
Jul 22, 2015
54
votes
65
GATE CSE 2002 | Question: 2.5
The finite state machine described by the following state diagram with $A$ as starting state, where an arc label is $x/y,$ and $x$ stands for $1$-bit input and $y$ stands for $2$-bit output outputs the sum of the present and the ... the input outputs $01$ whenever the input sequence contains $11$ outputs $00$ whenever the input sequence contains $10$ none of the above
The finite state machine described by the following state diagram with $A$ as starting state, where an arc label is $x/y,$ and $x$ stands for $1$-bit input and $y$ stands...
11.3k
views
answered
Jul 19, 2015
Theory of Computation
gatecse-2002
theory-of-computation
normal
finite-automata
+
–
5
votes
66
Viable Prefix
2.8k
views
answered
Jul 18, 2015
Compiler Design
compiler-design
parsing
viable-prefix
test-series
+
–
6
votes
67
Elimination of epsilon
Question : (Here e=epsilon) S->A|B, A->e, B->aBb, B->b My answer is : S->B, B->aBb , B->b or S->B|e , B->aBb , B->b Want to know which one is correct ? please explain...
Question : (Here e=epsilon) S->A|B, A->e, B->aBb, B->bMy answer is :S->B, B->aBb , B->b orS->B|e , B->aBb , B->bWant to know which one is correct ? please explain...
529
views
answered
Jul 16, 2015
Theory of Computation
theory-of-computation
+
–
0
votes
68
Why is left recursion not a problem for bottom up parsers?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(0)/LR(1) sets : Eg : S->Sa|a Then in LR(0) set : ... is in front of S , so shouldn't the S production be generated again and again and make it go to an inf. loop?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(...
10.6k
views
answered
Jul 16, 2015
Compiler Design
compiler-design
parsing
lr-parser
+
–
5
votes
69
set theory
difference between {} , ∅ , {∅} ???
difference between {} , ∅ , {∅} ???
842
views
answered
Jul 16, 2015
Set Theory & Algebra
set-theory&algebra
set-theory
+
–
54
votes
70
GATE CSE 2004 | Question: 45
Consider the grammar with the following translation rules and $E$ ... root of the parse tree for the expression:$2$ # $3$ & $5$ # $6$ & $4$ $200$ $180$ $160$ $40$
Consider the grammar with the following translation rules and $E$ as the start symbol$$\begin{array}{lll}E \rightarrow E_ 1\# \: T & \qquad\left\{E.value = E_1.value * ...
11.1k
views
answered
Jul 15, 2015
Compiler Design
gatecse-2004
compiler-design
grammar
normal
+
–
40
votes
71
GATE CSE 1996 | Question: 1.17
The pass numbers for each of the following activities object code generation literals added to literal table listing printed address resolution of local symbols that occur in a two pass assembler respectively are $1, 2, 1, 2$ $2, 1, 2, 1$ $2, 1, 1, 2$ $1, 2, 2, 2$
The pass numbers for each of the following activitiesobject code generationliterals added to literal tablelisting printedaddress resolution of local symbols that occur in...
12.9k
views
answered
Jul 14, 2015
Compiler Design
gate1996
compiler-design
normal
assembler
+
–
38
votes
72
GATE CSE 1998 | Question: 7-b
In a computer system where the best-fit' algorithm is used for allocating jobs' to memory partitions', the following situation was encountered:$\begin{array}{|l|l|} \hline \textbf{Partitions size in $KB$} & \textbf{$ ... $} \\\hline \end{array}$When will the $20K$ job complete?
In a computer system where the ‘best-fit’ algorithm is used for allocating ‘jobs’ to ‘memory partitions’, the following situation was encountered:$$\begin{arr...
12.9k
views
answered
Jul 10, 2015
Operating System
gate1998
operating-system
process-scheduling
normal
+
–
4
votes
73
What is the difference between ambiguous and inherently ambiguous for context free languages?
1.8k
views
answered
Jul 8, 2015
125
votes
74
GATE CSE 2014 Set 1 | Question: 37
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I pick $1, 2, 4, 8, 16$ coins respectively from bags $1$ to $5$ Their total weight comes out to $323$ gm. Then the product of the labels of the bags having $11$ gm coins is ___.
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I p...
9.6k
views
answered
Jul 7, 2015
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
algorithm-design
+
–
4
votes
75
expalin
if we use 3 key ,4 pointer nodes. how many different B tree are there when the data file has 6 records.
if we use 3 key ,4 pointer nodes. how many different B tree are there when the data file has 6 records.
550
views
answered
Jul 2, 2015
12
votes
76
GATE CSE 2007 | Question: 59
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{studId}},{\text{ courseId}})$ gives which student has enrolled for ... Courses in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}{\text{stu...
20.8k
views
answered
Jun 27, 2015
Databases
gatecse-2007
databases
relational-algebra
normal
+
–
19
votes
77
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An avera...
63.9k
views
answered
Jun 27, 2015
CO and Architecture
gatecse-2004
co-and-architecture
virtual-memory
normal
+
–
37
votes
78
GATE IT 2007 | Question: 58
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability of a page fault is $p$ ... that the average access time is $3$ time units. Then the value of $p$ is $0.194$ $0.233$ $0.514$ $0.981$
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability o...
22.9k
views
answered
Jun 23, 2015
Operating System
gateit-2007
operating-system
page-replacement
probability
normal
+
–
0
votes
79
Please give an example
Is deadlock possible in Test Set Lock?
Is deadlock possible in Test Set Lock?
644
views
answered
Jun 17, 2015
Operating System
operating-system
process-synchronization
+
–
1
votes
80
Please solve this
433
views
answered
Jun 17, 2015
Operating System
deadlock-prevention-avoidance-detection
+
–
7
votes
81
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive peri...
38.3k
views
answered
Jun 16, 2015
Operating System
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
+
–
2
votes
82
The process of assigning similar objects/entities to object/entity type known as
The process of assigning similar objects/entities to object/entity type known as a)Classification b)Instantiation c)Specialization d)Generalization
The process of assigning similar objects/entities to object/entity type known asa)Classification b)Instantiationc)Specializationd)Generalization
802
views
answered
Jun 4, 2015
10
votes
83
GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X...
30.1k
views
answered
Jun 1, 2015
Operating System
gatecse-2012
operating-system
process-synchronization
normal
+
–
1
votes
84
Scheduling Algorithm
782
views
answered
May 28, 2015
0
votes
85
Turnaround time
5 batch jobs A through E arrive at a computer center at almost same time. They have estimated running times of A:10, B:6, C:2, D:4 and E:8 minutes. Their priorities are A:3,B:5,C:2,D:1 and E:8 min. Their(externally determined) priorities are A:3,B: ... the mean process turnaround time under R-R scheduling algorithm(assuming time slice of 1 min)? a) 22 min b) 21 min c) 18 min d) none
5 batch jobs A through E arrive at a computer center at almost same time. They have estimated running times of A:10, B:6, C:2, D:4 and E:8 minutes. Their priorities are A...
948
views
answered
May 28, 2015
0
votes
86
networking
What setting of THT (token holding time) will be optimal for a network that had only one station active at a time? Response: 10 ms Depends on the size of the ring Infinity Can't say
What setting of THT (token holding time) will be optimal for a network that had only one station active at a time?Response: 10 ms Depends on the size of the ring Infinity...
440
views
answered
May 27, 2015
1
votes
87
network general
Which type of ACK is used in 802.5? Response: Cumulative ACK Independent ACK Piggybacking ACK None of these
Which type of ACK is used in 802.5?Response: Cumulative ACK Independent ACK Piggybacking ACK None of these
698
views
answered
May 27, 2015
1
votes
88
PROBLEM ON VIEW SERIALIZABILITY
check whether it is view serializable or not? schedule S:R1(X),W2(X),W1(X)
check whether it is view serializable or not?schedule S:R1(X),W2(X),W1(X)
5.6k
views
answered
May 20, 2015
Databases
view-serializable
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register