Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Hitesh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Hitesh
0
votes
1
First Order Logic
Please explain the Question number 33 and 34. What is significance of word "only" ?
answered
in
Mathematical Logic
Jul 13, 2018
492
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
in
Algorithms
Jul 1, 2018
3.4k
views
quick-sort
sorting
time-complexity
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 ... exclusion, progress and bounded waiting d None of these The answer key says c but please explain how is there bounded waiting.
answered
in
Operating System
Jul 1, 2018
1.1k
views
1
vote
4
GATE syllabus computer networks
Is ATM in GATE 2019 syllabus ?
answered
in
Computer Networks
Jun 17, 2018
538
views
syllabus
computer-networks
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
in
Mathematical Logic
Jun 16, 2018
221
views
1
vote
6
discrete mathematics
learning discrete mathematics from the youtube (sanchit jain) is covers the syllabus ?????
answered
in
Study Resources
Jun 16, 2018
917
views
discrete-mathematics
3
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
in
Algorithms
Jun 15, 2018
3.7k
views
sorting
0
votes
8
doubt
Can anyone derive efficiency formula of CSMA/CD please?
answered
in
Computer Networks
Jun 9, 2018
401
views
computer-networks
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
in
Theory of Computation
Jun 9, 2018
809
views
theory-of-computation
finite-automata
2
votes
10
SELF_DOUBT(MST)
What important point we keep in mind while finding the #(number) of spanning tree ?? from the given graph
answered
in
Algorithms
Apr 29, 2018
485
views
algorithms
minimum-spanning-tree
graph-connectivity
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
in
Databases
Apr 29, 2018
1.2k
views
databases
database-normalization
1
vote
12
TIFR CSE 2015 | Part B | Question: 5
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 ... the above adjacency matrix? Only $(i)$ Only $(ii)$ Only $(iii)$ Only $(iv)$ $(i)$ and $(ii)$
answered
in
Graph Theory
Apr 15, 2018
4.2k
views
tifr2015
graph-connectivity
graph-theory
1
vote
13
Show that the two graphs are isomorphic (Narsingh Deo)
Show that the two graphs are isomorphic
answered
in
Graph Theory
Apr 15, 2018
5.5k
views
graph-theory
narsingh
deo
graph-isomorphism
1
vote
14
Construct a DFA
Construct a DFA that accepts a language generated by a grammar S->abA A->baB B->aA|bb Find tha DFA and regular expression
answered
in
Theory of Computation
Apr 14, 2018
4.9k
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
in
Written Exam
Apr 8, 2018
545
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
in
Theory of Computation
Apr 7, 2018
671
views
0
votes
17
Made easy booklet - Memory management
Given following data, find average access time. Please explain the solution.
answered
in
Operating System
Apr 7, 2018
514
views
operating-system
memory-management
1
vote
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
in
Graph Theory
Apr 6, 2018
721
views
kenneth-rosen
discrete-mathematics
graph-theory
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
in
Combinatory
Apr 1, 2018
2.8k
views
combinatory
isi2004
37
votes
20
GATE CSE 2011 | Question: 21
Consider a hypothetical processor with an instruction of type $\text{LW R1, 20(R2)}$, which during execution reads a $32\text{-bit}$ word from memory and stores it in a $32\text{-bit}$ ... mode implemented by this instruction for the operand in memory? Immediate addressing Register addressing Register Indirect Scaled Addressing Base Indexed Addressing
answered
in
CO and Architecture
Mar 22, 2018
17.5k
views
gatecse-2011
co-and-architecture
addressing-modes
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 ... two: he could take one big jump, or two little ones. How many different paths can the grasshopper take to reach his destination?
answered
in
Probability
May 23, 2017
1.3k
views
probability
engineering-mathematics
conditional-probability
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...