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 Mk Utkarsh
User Mk Utkarsh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Mk Utkarsh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+1
vote
1
Gate 2014 CE set 2
A fair(unbiased) coin was tossed 4 times in succession and resulted in the following outcomes : I) head ii) head iii) head iv) head. The probability of obtaining a "tail" when the coin is tossed again is A) 0 B) 1/2 C) 4/5 D) 1/5
answered
Aug 22, 2018
in
Probability

61
views
probability
+4
votes
2
#mano
A digital circuit accepts a 3 bit number and generates an output equal to the cube of the input number. If the circuit is to be designed using a ROM with minimum hardware, the size of ROM is. A) 8x6 B) 8x7 C) 8x8 D) 8x9
answered
Aug 22, 2018
in
Digital Logic

58
views
0
votes
3
minimal compatibility classes
answered
Aug 21, 2018
in
Digital Logic

120
views
digitallogic
+3
votes
4
Cache memory  Find Cache size ( given K, line size, tag memory, physical address space )
answered
Aug 16, 2018
in
CO and Architecture

483
views
coandarchitecture
cachememory
0
votes
5
why comparator is used in Direct mapping technique,why can't we use simple And gate here?
answered
Aug 15, 2018
in
CO and Architecture

128
views
cachememory
directmapping
+1
vote
6
Multilevel Cache Access time
Ans. A
answered
Aug 14, 2018
in
CO and Architecture

218
views
coandarchitecture
cachememory
memorymanagement
0
votes
7
Cache Capacity
if in a question it ask for cache capacity the is it calculated by follwing... cache capacity=cache size+ tag memory size+dirty bit cache capacity=tag bits * no. of cache lines which one is correct?
answered
Aug 14, 2018
in
CO and Architecture

55
views
cachecapacity
cachememory
0
votes
8
probability
A deck of 52 playing cards is shuffled, and the cards are turned up one at a time until the first ace appears. Is the next card—that is, the card following the first ace—more likely to be the ace of spades or the two of clubs?
answered
Aug 13, 2018
in
Numerical Ability

110
views
+1
vote
9
DMA Controller
answered
Aug 12, 2018
in
CO and Architecture

155
views
dma
computerarchitecture
0
votes
10
Carl Hamcher
Assume that 20 percent of the dynamic count of the instructions executed for a program are branch instructions. Assume further that 75 percent of branches are actually taken. The program is executed in two different processors that have the same clock rate. ... ? (b) If the dynamic prediction accuracy is actually 90 percent, what is the speedup relative to using static prediction?
answered
Aug 10, 2018
in
CO and Architecture

326
views
coandarchitecture
instructionhazard
pipelining
0
votes
11
Delayed Branching
Which of the following is not TRUE about "Delayed Branching" ? S1 : Delayed branding changes the semantic meaning of the original program. S2 : Delayed branching is the problem arrived because of jump instruction. (1) S1 only (2) S2 only (3) Both (1) & (2) (4) None of these Answer:3
answered
Aug 10, 2018
in
Programming

107
views
0
votes
12
mock1 ace
How to solve this?
answered
Aug 5, 2018
in
Mathematical Logic

166
views
acetestseries
testseries
engineeringmathematics
mathematicallogic
firstorderlogic
0
votes
13
GENERAL
answered
Aug 4, 2018
in
Digital Logic

57
views
general
0
votes
14
GATE199204b
A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a twobit output $(X_1, X_0 )$ corresponding to the highest priority active input signal. Assume $A$ has the highest priority followed by $B$ and $C$ has the lowest ... none of the inputs are active the output should be $00$, design the priority encoder using $4:1$ multiplexers as the main components.
answered
Aug 4, 2018
in
Digital Logic

1.2k
views
gate1994
digitallogic
multiplexer
descriptive
0
votes
15
#Combinational circuit
Consider a combinational block which takes 4bits input (say ABCD) and results two times circular right shifted version of input as output. The minimum number of gates required to implement this logic is___________ (Fill in the blanks)
answered
Aug 2, 2018
in
Digital Logic

34
views
0
votes
16
Databases Multiple granularity
answered
Jul 23, 2018
in
Databases

131
views
databases
multiplegranularity
+5
votes
17
GATE2016152
Consider that $B$ wants to send a message $m$ that is digitally signed to $A$. Let the pair of private and public keys for $A$ and $B$ be denoted by ${K_{x}}^$ and ${K_{x}}^+$ for $x=A, B$, respectively. Let $K_{x}(m)$ represent the operation of encrypting $m$ with a key $K_{x}$ and ... $\left\{m, {K_{A}}^(H(m))\right\}$ $\left\{m, {K_{A}}^+(m)\right\}$
answered
Jul 15, 2018
in
Computer Networks

3.2k
views
gate20161
computernetworks
networksecurity
easy
+1
vote
18
UGCNETJuly2018II25
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding will have the average length of 2.4 1.87 3.0 2.15
answered
Jul 13, 2018
in
Probability

588
views
ugcnetjuly2018ii
probability
binarytree
datastructure
0
votes
19
UGCNETJuly2018II92
In RS flipflop, the output of the flipflop at time (t+1) same as the output at time t, after the occurance of a clock pulse if S=R=1 S=0, R=1 S=2, R=0 S=R=0
answered
Jul 13, 2018
in
Others

269
views
ugcnetjuly2018ii
digitallogic
flipflop
0
votes
20
UGCNETJuly2018II95
The hexadecimal equivalent of the binary integer number 110101101 is D24 1 B D 1 A E 1 A D
answered
Jul 13, 2018
in
Others

308
views
ugcnetjuly2018ii
digitallogic
numberrepresentation
+4
votes
21
GATE2012 AR: GA9
A smuggler has $10$ capsules in which five are filled with narcotic drugs and the rest contain the original medicine. All the $10$ capsules are mixed in a single box, from which the customs officials picked two capsules at random and tested for the presence of narcotic drugs. The probability that the smuggler will be caught is $0.50$ $0.67$ $0.78$ $0.82$
answered
Jun 8, 2018
in
Numerical Ability

889
views
gate2012ar
numericalability
probability
0
votes
22
Toc dfa
answered
Jun 6, 2018
in
Theory of Computation

73
views
finiteautomata
+1
vote
23
ISRODEC201710
If vectors $\vec{a}=2\hat{i}+\lambda \hat{j}+\hat{k}$ and $\vec{b}=\hat{i}2\hat{j}+3\hat{k}$ are perpendicular to each other, then value of $\lambda$ is $\dfrac{2}{5}$ $2$ $3$ $\dfrac{5}{2}$
answered
May 19, 2018
in
Linear Algebra

863
views
isrodec2017
vectorspace
+1
vote
24
ISI 2018 C1
Consider an array of length n consisting only of positive and negative integers.Design an algorithm to rearrange the array so that all the negative integers appear before all the positive integers,using O(n) time and only constant amount of extra space.
answered
May 14, 2018
in
Algorithms

72
views
0
votes
25
CMI2014A03
In the code fragment on the right, start and end are integer values and $\text{prime}(x)$ is a function that returns true if $x$ is a prime number and $\text{false}$ otherwise. At the end of the loop: i := 0; j := 0; k := 0; for (m := start; m <= end; m := m+1){ k := k + m ... + m; }else{ j := j + m; } } $k < i+j$ $k = i+j$ $k > i+j$ Depends on $\text{start}$ and $\text{end}$
answered
May 9, 2018
in
Algorithms

67
views
cmi2014
algorithms
identifyfunction
0
votes
26
CMI2016B2a
A $\textit{simple path}$ (respectively cycle) in a graph is a path (respectively cycle) in which no edge or vertex is repeated. The $\textit{length}$ of such a path (respectively cycle) is the number of edges in the path (respectively cycle). Let $G$ be an undirected graph with minimum degree $k \geq 2$. Show that $G$ contains a simple path of length at least $k$.
answered
May 7, 2018
in
Graph Theory

44
views
cmi2016
graphtheory
undirectedgraph
simplepath
descriptive
+1
vote
27
combinatorics
There were 4 blue french horns, 5 yellow Umbrellas and 6 Suits in a shop. Ted, Barney, Lily, Marshal and Robin came to the shop to buy the items. How many different results could have been recorded if all of the items were sold?
answered
May 6, 2018
in
Combinatory

91
views
permutationandcombination
engineeringmathematics
0
votes
28
CMI2011A06
A valuable sword belonging to the Grand King was stolen, and the three suspects were Ibn, Hasan, and Abu. Ibn claimed that Hasan stole it, and Hasan claimed that Abu stole it. It was not clear that one of them stole it, but it was later learnt that no innocent ... had lied. It was also learnt that the sword was stolen by only one person. Who stole the sword? Ibn Hasan Abu None of them
answered
May 5, 2018
in
Numerical Ability

124
views
cmi2011
logicalreasoning
+3
votes
29
CMI2011A05
A $\text{3ary}$ boolean function is a function that takes three boolean arguments and produces a boolean output. Let $f$ and $g$ be $\text{3ary}$ boolean functions. We say that $f$ and $g$ are neighbours if $f$ and $g$ agree on at least one input and disagree on at ... $\text{3ary}$ boolean function $h$. How many neighbours does $h$ have? $128$ $132$ $254$ $256$
answered
May 5, 2018
in
Set Theory & Algebra

163
views
cmi2011
functions
+1
vote
30
Induction
Prove that the number of edges in a graph with exactly one triangle is at most \begin{align*} \frac{\left( n  1 \right )^2}{4} + 2 \end{align*}
answered
Apr 28, 2018
in
Graph Theory

68
views
induction
graphtheory
combinatoricsiitb
+1
vote
31
Number system digital
The r ’s complement of an ndigit decimal number N in base r is defined for all values of N except for N = 0. If the given number is (247)9, then its 9’s complement will be equal to ( _____ )9.
answered
Apr 22, 2018
in
Digital Logic

383
views
digitallogic
number
system
+1
vote
32
PGEE 2018
Which of the statement is sufficient to determine children of x 1) Q and U are brothers of T 2) P is the sister of U and S 3) P and T are daughters of X A) 1 and 2 B) 1,2 and 3 C) 2 and 3 D) data insufficient
answered
Apr 21, 2018
in
Mathematical Logic

293
views
iiithpgee
mathematicallogic
+7
votes
33
PGEE 2018
One one evening sita and gita were sitting in a park with there back facing each other sita was able to see her shadow on left at what direction was gita sitting ? A) NorthEast B) North C) West D) South
answered
Apr 21, 2018
in
Mathematical Logic

254
views
iiithpgee
mathematicallogic
+2
votes
34
PGEE 2018
Maximal Independence Number is the cardinality of maximal independence set ( Independence set V of graph G is set in which no vertex of the set have a direct edge between them). 1) Maximal Independence Number of a complete graph is n1 2) Maximal Independence ... Maximal Independence Number of a complete graph is 1 4) Maximal Independence Number of complete graph is $\geq \frac{n}{2}$
answered
Apr 21, 2018
in
Graph Theory

142
views
graphtheory
iiithpgee
+1
vote
35
number representation
decimal number are represented in sign magnitude form +9286 and +801 convert them to signed 10s complement and perform following operations( 1 digit required for sign) 1)9286+ (+801) 2)9286+(801)
answered
Apr 20, 2018
in
Digital Logic

572
views
easy
number
system
+2
votes
36
IIT Kanpur Sample Test Paper
Given an undirected graph with vertices as your friends and edges between people who do not talk to each other. Your task is to invite as many guests to your party such that there are no two friends at the party who have problem talking to each ... instance of: A. Maximum vertex cover. B. Maximum cut. C. Maximum eigenvalue of adjacency matrix. D. None of the above.
answered
Apr 17, 2018
in
Graph Theory

233
views
iitkanpur
writtentest
+3
votes
37
Sheldon Ross A first course in Probability
An urn contains 6 white and 9 black balls. If 4 balls are to be randomly selected without replacement, what is the probability that the first 2 selected are white and the last 2 black. I solved it in this manner : (6C2 * 9C2)/ (15C4)  getting 36 ... (6*5*9*8)/(15*14*13*12)  6/91 I cannot understand exactly why my approach is not working over here.
answered
Apr 17, 2018
in
Probability

173
views
probability
sheldonross
0
votes
38
CMI2017B5
An undirected graph is $\text{connected}$ if, for any two vertices $\{u, v\}$ of the graph, there is a path in the graph starting at $u$ and ending at $v$. A tree is a connected, undirected graph that contains no cycle. A $\text{leaf}$ in a tree is a vertex that ... $ \in V_2$ or vice versa. Prove that if $G$ is a tree with at least two vertices, then $G$ is bipartite.
answered
Apr 16, 2018
in
Graph Theory

168
views
cmi2017
engineeringmathematics
discretemathematics
graphtheory
descriptive
+1
vote
39
What are the relevant chapters for GATE from the Graph Theory book by Narsingh Deo?
answered
Apr 15, 2018
in
Graph Theory

587
views
graphtheory
engineeringmathematics
narsingh
deo
0
votes
40
Regular expression
Write the regular expression for the language containing the string over{0,1} in which there are atleast two occurence of 1's between any two occurence of 0's.
answered
Apr 15, 2018
in
Theory of Computation

27
views
Page:
« prev
1
2
3
4
5
6
7
next »
50,666
questions
56,167
answers
193,836
comments
93,998
users