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 Hitesh
User Hitesh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Hitesh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
First Order Logic
Please explain the Question number 33 and 34. What is significance of word "only" ?
answered
Jul 13, 2018
in
Mathematical Logic

46
views
+4
votes
2
Quick Sort Time Complexity
Quick sort gives O(nlogn) worst case performance if the pivot is selected as: a) First element of the array b) Median of first, last and middle elements c) Arithmetic mean of the elements d) None of these Now, the answer is given as Option (b). But, ... order of elements and not on pivot element. So, answer should be option (d) i.e None of these Correct me if I am wrong
answered
Jul 1, 2018
in
Algorithms

579
views
quicksort
sorting
timecomplexity
+1
vote
3
Made easy operating system
Assume that 2 processes P0 and P1 share one global boolean array flag[] and integer variable 'turn'. Initially flag[0] and flag[1] are zero.Consider the following code executed by processes Pi where i=0 or 1: while(true) { flag[i]=true ... Mutual exclusion, progress and bounded waiting d None of these The answer key says c but please explain how is there bounded waiting.
answered
Jul 1, 2018
in
Operating System

128
views
+1
vote
4
GATE syllabus computer networks
Is ATM in GATE 2019 syllabus ?
answered
Jun 17, 2018
in
Computer Networks

176
views
syllabus
computernetworks
0
votes
5
self doubt
What is the English of both statement ∀x((x!=0)→∃y(xy=100)) ∀x∃y((x!=0)→(xy=100))
answered
Jun 16, 2018
in
Mathematical Logic

44
views
+1
vote
6
discrete mathematics
learning discrete mathematics from the youtube (sanchit jain) is covers the syllabus ?????
answered
Jun 16, 2018
in
Study Resources

178
views
discretemathematics
+2
votes
7
You want to check whether a given set of items is sorted or not
.You want to check whether a given set of items is sorted or not.Which of the following sorting methods will be the most efficient if it is already in sorted order? a. Bubble sort b. Selection sort c. Insertion sort d.Merge sort
answered
Jun 15, 2018
in
Algorithms

232
views
0
votes
8
doubt
Can anyone derive efficiency formula of CSMA/CD please?
answered
Jun 10, 2018
in
Computer Networks

69
views
computernetworks
0
votes
9
KLP MISHRA
Given {L: every 'a' is followed by "bb"} Design a DFA for LATE(L) and TRUNCATE(L) LATE(L) is obtained by removing the first symbol from L and TRUNCATE(L) is obtained by removing the last symbol from L Eg: If L is 00(0+1)*01 then LATE(L) will be 0(0+1)*01 and TRUNCATE(L) would be 00(0+1)*0
answered
Jun 9, 2018
in
Theory of Computation

111
views
theoryofcomputation
finiteautomata
+1
vote
10
SELF_DOUBT(MST)
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
answered
Apr 29, 2018
in
Algorithms

83
views
algorithms
mst
graphconnectivity
0
votes
11
BCNF_lossless and dependency preserving
Consider the relation $R(ABCDE)$ and functional dependency $F=\{AB \rightarrow C, C \rightarrow D,D \rightarrow E, E \rightarrow A \}.$ If we convert given relation in Boyce Codd Normal Form ( BCNF ) then In BCNF ... is not preserved In BCNF it is lossy decomposition but dependency is preserved In BCNF it is lossy decomposition but dependency not preserved
answered
Apr 29, 2018
in
Databases

103
views
databases
databasenormalization
+1
vote
12
TIFR2015B5
Suppose $\begin{pmatrix} 0&1 &0&0&0&1 \\ 1&0&1&0&0&0 \\ 0&1&0&1&0&1 \\ 0&0&1&0&1&0 \\ 0&0&0&1&0&1 \\ 1&0&1&0&1&0 \end{pmatrix}$ is the adjacency matrix of an ... below has the above adjacency matrix? Only $(i)$ Only $(ii)$ Only $(iii)$ Only $(iv)$ $(i)$ and $(ii)$
answered
Apr 15, 2018
in
Graph Theory

975
views
tifr2015
graphconnectivity
graphtheory
+1
vote
13
Show that the two graphs are isomorphic (Narsingh Deo)
Show that the two graphs are isomorphic
answered
Apr 15, 2018
in
Graph Theory

350
views
graphtheory
narsingh
deo
graphisomorphism
0
votes
14
Construct a DFA
Construct a DFA that accepts a language generated by a grammar S>abA A>baB B>aAbb Find tha DFA and regular expression
answered
Apr 14, 2018
in
Theory of Computation

347
views
0
votes
15
#COAP #IIT
I have registered on COAP and all IITs. Now how do i link coap to iits. Now whats the procedure. I dont know. Someone please help. Thank you.
answered
Apr 8, 2018
in
Written Exam

246
views
+1
vote
16
STANFORD CS103 ASSIGNMENT
For the alphabet Σ = {0, 1}, construct a DFA for the language L = { w ∈ Σ*  w contains the same number of instances of the substring 01 and the substring 10 }. Note that substrings are allowed to overlap, so 010 ∈ L and 10101 ∈ L.
answered
Apr 7, 2018
in
Theory of Computation

132
views
0
votes
17
Made easy booklet  Memory management
Given following data, find average access time. Please explain the solution.
answered
Apr 7, 2018
in
Operating System

270
views
operatingsystem
memorymanagement
0
votes
18
Kenneth Rosen Edition 6th Exercise 8.7 Question 25 (Page No. 610)
How to Find Whether Given Graph is NonPlanar using Kuratwoski's Theorem ?
answered
Apr 6, 2018
in
Graph Theory

104
views
kennethrosen
discretemathematics
graphtheory
+4
votes
19
ISI 2004 MIII
In how many ways can three person, each throwing a single die once, make a score of $11$ $22$ $27$ $24$ $38$
answered
Apr 1, 2018
in
Combinatory

1.1k
views
permutationandcombination
isi2004
+16
votes
20
GATE201121
Consider a hypothetical processor with an instruction of type $\text{LW R1, 20(R2)}$, which during execution reads a $32bit$ word from memory and stores it in a $32bit$ register $\text{R1}$. The effective ... addressing mode implemented by this instruction for the operand in memory? Immediate addressing Register addressing Register Indirect Scaled Addressing Base Indexed Addressing
answered
Mar 22, 2018
in
CO and Architecture

5.9k
views
gate2011
coandarchitecture
addressingmodes
easy
0
votes
21
Probability puzzles
A grasshopper is sitting on a little stone, which we'll call stone zero. Ahead of him, arranged in a line, are stones one, two, three, et cetera, all the way up to nine. The grasshopper would like to reach that ninth stone, for reasons unknown ... two: he could take one big jump, or two little ones. How many different paths can the grasshopper take to reach his destination?
answered
May 23, 2017
in
Probability

344
views
probability
engineeringmathematics
conditionalprobability
50,833
questions
57,709
answers
199,417
comments
107,623
users