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 abhishekmehta4u
User abhishekmehta4u
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User abhishekmehta4u
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
UGCNETJune2019II66
Consider double hashing of the form $h(k,i)=(h_1(k)+ih_2(k)) \text{mod m}$ where $h_{1}(k) = \text{k mod m} \ , \ \ h_{2}(k)=1+(\text{k mod n})$ where $n=m1$ and $m=701$. For $k=123456$, what is the difference between first and second probes in terms of slots? $255$ $256$ $257$ $258$
answered
Jul 17
in
Algorithms

177
views
ugcnetjune2019ii
doublehashing
+1
vote
2
UGCNETJune2019II45
Consider three CPU intensive processes, which require $10$, $20$ and $30$ units of time and arrive at times $0$, $2$ and $6$ respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $4$ $2$ $3$ $1$
answered
Jul 17
in
Operating System

142
views
ugcnetjune2019ii
cpuscheduling
0
votes
3
UGCNETJune2019II78
Consider the following grammar: $S \rightarrow XY$ $X \rightarrow YaY \mid a \text{ and } Y \rightarrow bbX$ Which of the following statements is/are true about the above grammar? Strings produced by the grammar can have consecutive three $a$'s. Every string ... Every string produced by the grammar have $b$'s in multiple of $2$. a only b and c only d only c and d only
answered
Jul 17
in
Theory of Computation

117
views
ugcnetjune2019ii
grammar
strings
+4
votes
4
UGCNETJune2019II84
You need $500$ subnets, each with about $100$ usable host address per subnet. What network mask will you assign using a class B network address? $255.255.255.252$ $255.255.255.128$ $255.255.255.0$ $255.255.254.0$
answered
Jul 17
in
Computer Networks

323
views
ugcnetjune2019ii
subnetting
0
votes
5
Cd me doubt static
answered
Jun 8
in
Compiler Design

49
views
+1
vote
6
Follow Set Self Doubt
X>aABe B>c  d A>a What will be the follow of A here? {c, d, $} or {c, d, e, dollar}
answered
Jun 8
in
Compiler Design

70
views
compilerdesign
follow
first
+3
votes
7
Conversion of regular grammar to FA
A>aB/bA/b B>aC/bB C>aA/bC/a If the above regular grammar is converted into DFA then how many final states will be there? According to me there should be 2 final states: A and C But the resource from where I am reading it says only one final state will be there which will be A. Kindly explain.
answered
Jun 7
in
Theory of Computation

190
views
theoryofcomputation
finiteautomata
regulargrammar
+1
vote
8
COMPILER DESIGN: Dragon Book self doubt
S→ A/a A→ a LL1 or not?
answered
Jun 4
in
Compiler Design

89
views
compilerdesign
ll1parser
syntaxdirectedtranslation
+2
votes
9
Ace academy booklet #graph theory
Which of the following is $\textbf{not}$ TRUE? (a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd. (b) In a complete bipartite graph $K_{m,n}$ (m $\geq$ 2 and n $\geq$2), Euler circuit exists ... Euler circuit exits for all $n$ (d) In a wheel graph $W_n$ ($n \geq 4$), Euler circuit exits $\Leftrightarrow$ $n$ is even.
answered
Jun 4
in
Graph Theory

72
views
0
votes
10
ISIPCB2015C1b
A $64000$byte message is to be transmitted over a $2$hop path in a storeandforward packetswitching network. The network limits packets toa maximum size of $2032$ bytes including a $32$byte header. The transmission lines in the network are error free and have a speed of $50$ ... answer as $1*3*(T_t+T_p) + \;31*T_t$ where $T_t=0.325\; ms$ and $T_p=3.333\; ms$. Please Confirm.
answered
Jun 4
in
Computer Networks

133
views
userisi2015
usermod
computernetworks
ippacket
networklayer
0
votes
11
Made Easy Test Series:Data StructureStack
There is given a infix expression: ${\color{Red} {1}}$ $A+B\times C/\left ( \left ( D+E \right )+F\times G \right )$ While converting infix expression to postfix expression number of symbols in the stack at indicated ... $5$, but is it correct? Can anyone give some explanation??
answered
May 31
in
DS

170
views
madeeasytestseries
datastructure
stack
0
votes
12
GATE2017 CE2: GA4
What is the value of $x$ when $81\times\left (\frac{16}{25} \right )^{x+2}\div\left (\frac{3}{5} \right )^{2x+4}=144?$ $1$ $1$ $2$ $\text{Can not be determined}$
answered
May 31
in
Numerical Ability

103
views
gate2017ce2
ratioproportion
numericalability
+2
votes
13
Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain
answered
May 31
in
Operating System

219
views
madeeasytestseries
operatingsystem
processsynchronization
+1
vote
14
MadeEasy Test Series: Theory Of Computation  Regular Languages
Consider the following statements: $S_1:\{(a^n)^mn\leq m\geq0\}$ $S_2:\{a^nb^nn\geq 1\} \cup \{a^nb^mn \geq1,m \geq 1\} $ Which of the following is regular? $S_1$ only $S_2$ only Both Neither of the above
answered
May 27
in
Theory of Computation

283
views
madeeasytestseries
theoryofcomputation
regularlanguages
0
votes
15
Engineering Maths
If A = $\begin{bmatrix} 1 & 1 & 0 \\ 0 & 2 &2 \\ 0& 0 & 3 \end{bmatrix}$ then trace of the matrix 3A2 + adj A is ____
answered
May 26
in
Linear Algebra

90
views
engineeringmathematics
linearalgebra
+4
votes
16
machine instructions and addressing modes
A digital computer has memory unit with $24$ bits word.The instruction set consists of $150$ different operations. All instructions have an operation code part and an address part. Each instruction is stored in one word of memory. $Q1$ How many bits are needed for the OPCODE and ... $2^{16}, 2^{24}$ $2^{16},2^{24}1$ $\textrm{None of these}$
answered
May 25
in
CO and Architecture

151
views
coandarchitecture
addressingmodes
+1
vote
17
made easy mock
minimum number of nodes (both leaf and non leaf) of B+ tree index required for storing 5500 keys and order of B+ tree is 8 _________ (order is maximum pointers a node can have) am getting 4681
answered
May 25
in
Databases

174
views
+1
vote
18
TIFR2019B8
Consider the following program fragment: var a,b : integer; procedure G(c,d: integer); begin c:=cd; d:=c+d; c:=dc end; a:=2; b:=3; G(a,b); If both parameters to $G$ are passed by reference, what are the values of $a$ and $b$ at the end of the above program fragment ? $a=0$ and $b=2$ $a=3$ and $b=2$ $a=2$ and $b=3$ $a=1$ and $b=5$ None of the above
answered
May 24
in
Programming

217
views
tifr2019
programming
parameterpassing
0
votes
19
Made Easy Test Series: DatabaseNormalization
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??
answered
May 24
in
Databases

189
views
databases
madeeasytestseries
databasenormalization
0
votes
20
Morris Mano Edition 3 Exercise 5 Question 10 (Page No. 198)
Design a combinational Circuit that generates the 9’s complement of a BCD digit.?
answered
Apr 3
in
Digital Logic

27
views
digitallogic
combinationalcircuits
0
votes
21
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.4 (Page No. 53)
Give DFA's accepting the following languages over the alpabet $\{0,1\}:$ $a)$ The set of all strings ending in $00.$ $b)$ The set of all strings with three consecutive $0's$ (not necessarily at the end)$.$ $c)$ The set of strings with $011$ as a substring.
answered
Apr 3
in
Theory of Computation

27
views
ullman
theoryofcomputation
descriptive
0
votes
22
Ullman (TOC) Edition 3 Exercise 2.2.6 Problem 2.2.10 (Page No. 54)
answered
Apr 3
in
Theory of Computation

17
views
ullman
theoryofcomputation
descriptive
0
votes
23
Ullman (TOC) Edition 3 Exercise 2.3 Question 1 (Page No. 65)
Convert to a DFA the following NFA$:$
answered
Apr 3
in
Theory of Computation

35
views
ullman
theoryofcomputation
finiteautomata
0
votes
24
Ullman (TOC) Edition 3 Exercise 2.3 Question 2 (Page No. 66)
Convert to a DFA the following NFA$:$
answered
Apr 3
in
Theory of Computation

31
views
ullman
theoryofcomputation
finiteautomata
0
votes
25
Ullman (TOC) Edition 3 Exercise 2.3 Question 3 (Page No. 66)
Convert the following NFA to a DFA and informally describe the language it accepts.
answered
Apr 3
in
Theory of Computation

31
views
ullman
theoryofcomputation
finiteautomata
+1
vote
26
Morris Mano Edition 3 Exercise 4 Question 27 (Page No. 151)
Show that if xy = 0, then $x\oplus y$ = x + y.
answered
Apr 3
in
Digital Logic

55
views
digitallogic
combinationalcircuits
booleanalgebra
0
votes
27
Morris Mano Edition 3 Exercise 4 Question 26 (Page No. 151)
Prove that $x \oplus 1$ = x’ and $x \oplus 0$ = x.
answered
Apr 3
in
Digital Logic

48
views
digitallogic
combinationalcircuits
booleanalgebra
0
votes
28
Morris Mano Edition 3 Exercise 4 Question 25 (Page No. 151)
prove that $ x’ \oplus y = x \oplus y’ = (x \oplus y)’ = xy+x’y’$
answered
Apr 3
in
Digital Logic

78
views
digitallogic
booleanalgebra
combinationalcircuits
0
votes
29
UGCNETJune2016III23
The regular expression for the complement of the language $L=\{a^nb^m \mid n \geq 4, m \leq 3\}$ is: $(\lambda +a+aa+aaa)b^*+a^*bbbb^*+(a+b)^*ba(a+b)^*$ $(\lambda +a+aa+aaa)b^*+a^*bbbbb^*+(a+b)^*ab(a+b)^*$ $(\lambda +a+aa+aaa)+a^*bbbbb^*+(a+b)^*ab(a+b)^*$ $(\lambda +a+aa+aaa)b^*+a^*bbbbb^*+(a+b)^*ba(a+b)^*$
answered
Apr 3
in
Theory of Computation

1.6k
views
ugcnetjune2016iii
theoryofcomputation
regularexpressions
+1
vote
30
Morris Mano Edition 3 Exercise 4 Question 21 (Page No. 151)
Determine the boolean function for the outputs F and G as a function of Four inputs A, B, C, And D.
answered
Apr 2
in
Digital Logic

28
views
digitallogic
combinationalcircuits
circuitoutput
0
votes
31
Morris Mano Edition 3 Exercise 4 Question 22 (Page No. 151)
Verify the Circuit generates the Exclusive NOR Functions.
answered
Apr 2
in
Digital Logic

47
views
digitallogic
combinationalcircuits
circuitoutput
0
votes
32
Morris Mano Edition 3 Exercise 3 Question 14 (Page No. 112)
Draw a logic diagram using only two input NAND gate to implement the following expression: (AB + A’B’)(CD’ + C’D)
answered
Apr 2
in
Digital Logic

33
views
digitallogic
booleanalgebra
digitalcircuits
logicdiagram
0
votes
33
Morris Mano Edition 3 Exercise 3 Question 11 (Page No. 112)
Draw the ANDOR gate implementation of the following function after simplifying it in (a) sum of products and (b) product of sums. F= (A,B,C,D) = $\sum (0,2,5,6,7,8,10)$
answered
Apr 2
in
Digital Logic

32
views
digitallogic
booleanalgebra
simplification
kmap
digitalcircuits
0
votes
34
Morris Mano Edition 3 Exercise 1 Question 29 (Page No. 34)
Show the bit configuration that represents the decimal number 295 in in binary in BCD in ASCII
answered
Apr 1
in
Digital Logic

56
views
digitallogic
numberrepresentation
0
votes
35
Memory Access Doubt
How many memory accesses are there in this code? LOAD R1, a(RO)
answered
Apr 1
in
CO and Architecture

90
views
effectivememoryaccess
coandarchitecture
+1
vote
36
Morris Mano Edition 3 Exercise 1 Question 31 (Page No. 34)
The State of the 12 bit Register is 010110010111. What is the Content if it represents. a three decimal digit in BCD. a three Decimal digit in Excess3 a three Decimal Digit in 2421
answered
Apr 1
in
Digital Logic

34
views
digitallogic
numberrepresentation
+1
vote
37
Morris Mano Edition 3 Exercise 1 Question 34 (Page No. 35)
Express the switching Circuit shown in the figure in binary Logic notation.
answered
Apr 1
in
Digital Logic

35
views
digitallogic
numberrepresentation
0
votes
38
Morris Mano Edition 3 Exercise 2 Question 9 (Page No. 70)
Obtain the truth tables of the following Boolean Functions. Express Each Function in Sum of minterm And Product of Maxterm. (xy + z)((y + xz) (A’ + B)(B’ + C) y’z + wxy’ +wxz’ + w’x’z
answered
Apr 1
in
Digital Logic

22
views
digitallogic
booleanalgebra
0
votes
39
Morris Mano Edition 3 Exercise 2 Question 10 (Page No. 70)
For the Boolean Function F Given in the Truth Table, Find the following. x y z F 0 0 0 0 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 0 1 1 0 1 1 1 1 1 List the Minterm of F’.and F Express F in the sum of Minterm in algebraic form. simplify the function to an Expression with the minimum number of the literals.
answered
Apr 1
in
Digital Logic

12
views
digitallogic
booleanalgebra
0
votes
40
Morris Mano Edition 3 Exercise 2 Question 11 (Page No. 70)
Given the Following Boolean Function: F = xy'z + x'y'z + w'xy + wx'y + wxy Obtain the truth table of the function. Draw the logic diagram using the original Boolean Expression. Simplify the function to the minimum ... Draw the logic diagram of the simplified function and Compare the total number of gates with the logic diagram in part 2.
answered
Apr 1
in
Digital Logic

46
views
digitallogic
booleanalgebra
Page:
1
2
3
4
5
6
...
25
next »
50,645
questions
56,597
answers
195,837
comments
102,132
users