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 Utkarsh Joshi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Utkarsh Joshi
5
answers
1
GATE CSE 2014 Set 2 | Question: 35
Let $\langle M \rangle$ be the encoding of a Turing machine as a string over $\Sigma=\left\{0,1\right\}$ ... $L$ is: decidable and recursively enumerable undecidable but recursively enumerable undecidable and not recursively enumerable decidable but not recursively enumerable
commented
in
Theory of Computation
May 27, 2019
24.1k
views
gatecse-2014-set2
theory-of-computation
turing-machine
normal
3
answers
2
ISI2019-MMA-20
Suppose that the number plate of a vehicle contains two vowels followed by four digits. However, to avoid confusion, the letter $‘O’$ and the digit $‘0’$ are not used in the same number plate. How many such number plates can be formed? $164025$ $190951$ $194976$ $219049$
commented
in
Combinatory
May 9, 2019
2.0k
views
isi2019-mma
engineering-mathematics
discrete-mathematics
combinatory
3
answers
3
ISI2019-MMA-11
How many triplets of real numbers $(x,y,z)$ are simultaneous solutions of the equations $x+y=2$ and $xy-z^2=1$? $0$ $1$ $2$ infinitely many
commented
in
Quantitative Aptitude
May 7, 2019
1.3k
views
isi2019-mma
general-aptitude
quantitative-aptitude
1
answer
4
Michael Sipser Edition 3 Exercise 0 Question 12 (Page No. 27)
Find the error in the following proof that all horses are the same color. CLAIM: In any set of h horses, all horses are the same color. PROOF: By induction on $h.$ Basis: For $h = 1.$ In any set containing just one horse, ... $H$ must be the same color, and the proof is complete.
answer edited
in
Theory of Computation
Apr 23, 2019
834
views
michael-sipser
theory-of-computation
descriptive
proof
1
answer
5
CMI2010-B-03
The Income-Tax Department had prepared a list D of names of defaulters on March $31$. However, the government extended the deadline to pay taxes till April $15$. The IT department has now received two additional lists of names: a list B of names of people who ... m and k respectively and that $n > m > k$. Describe the running time of your algorithm in terms of these parameters.
commented
in
Algorithms
Mar 22, 2019
456
views
cmi2010
descriptive
algorithms
sorting
0
answers
6
JEST 2019
Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ${(0,1)}^n$ that differ from C in at most r of n position, S(C,r) for n=2k+1 For C,C’ $\epsilon$ ${(0,1)}^n$ S(C,k) and S(C’,k) are disjoint couldn't remember rest of the options.
commented
in
Set Theory & Algebra
Feb 18, 2019
321
views
jest
2019
discrete-mathematics
4
answers
7
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}$
commented
in
Computer Networks
Jan 27, 2019
12.1k
views
gatecse-2008
normal
computer-networks
sockets
6
answers
8
GATE IT 2006 | Question: 56
For each of the four processes $P_1, P_2, P_3,$ and $P_4$. The total size in kilobytes $(KB)$ ... $\text{S < P < T}$ $\text{S < T < P}$ $\text{T < S < P}$
commented
in
Operating System
Jan 25, 2019
22.7k
views
gateit-2006
operating-system
memory-management
difficult
2
answers
9
Applied Course | Mock GATE | Test 1 | Question: 36
Naveen invited seven of his friends to a party. At the party, several pairs of people shook hands, although no one shook hands with themselves or shook hands with the same person more than once. After the party, Naveen asked each of his ... positive integers. Given that his friends were truthful, how many hands did Naveen shake? $4$ $5$ $6$ $7$
answered
in
Graph Theory
Jan 25, 2019
522
views
applied-course-2019-mock1
graph-theory
graph-connectivity
1
answer
10
Applied Course | Mock GATE | Test 1 | Question: 52
Which of the following languages are not CFLs $L=\{ 0^n 1^n0^n 1^n \mid n \geq 0\}$ $L=\{0 \# 0^{2n} \# 0^{3n} \mid n \geq 0\}$ $L=\{a^n b^m c^m d^n \mid m,n \geq 0\}$ $L=\{ x \# y \mid x,y \in \{0, 1\}^* \text{ and } x \neq y\}$ II and III only III and IV only I and II only I, II and IV only
commented
in
Theory of Computation
Jan 24, 2019
438
views
applied-course-2019-mock1
theory-of-computation
context-free-language
1
answer
11
Applied Course | Mock GATE | Test 1 | Question: 37
The project of building $20$ roads connecting $9$ cities is under way, as outlined above. So far, only some of the $20$ roads are constructed, and the digit on each city indicates the number of constructed roads to other cities. How many complete roads are there among these cities ________
commented
in
Graph Theory
Jan 24, 2019
536
views
applied-course-2019-mock1
graph-theory
graph-connectivity
numerical-answers
1
answer
12
Applied Course | Mock GATE | Test 1 | Question: 43
The postorder traversal of a binary search tree is $25, 33, 30, 35, 42, 48, 40, 60, 58, 50$. The inorder traversal of the same tree is $25, 30, 33, 35, 40, 42, 48, 50, 58, 60$. What is the length of the longest path from one leaf to another leaf. (Note: Length of longest path means total number of nodes present in that path).
commented
in
DS
Jan 24, 2019
426
views
applied-course-2019-mock1
numerical-answers
data-structures
binary-search-tree
1
answer
13
Applied Course | Mock GATE | Test 1 | Question: 59
Consider the following interleaved schedule with two transactions T1 and T2. The Two-Phase Locking Protocol is followed for achieving concurrency control. Which of the following statements is true with respect to the given schedule? The ... ; T2 The schedule results in a deadlock The schedule is not permitted as per Two Phase Locking Protocol
commented
in
Databases
Jan 24, 2019
598
views
applied-course-2019-mock1
databases
transaction-and-concurrency
two-phase-locking-protocol
1
answer
14
Applied Course | Mock GATE | Test 1 | Question: 64
Let us consider a scenario of sending real-time voice from Host A to Host B over a packet-switched network. Host A converts analog voice to a digital $32$ kbps bit stream on the fly. Host A then groups the bits into $44$-byte packets. There is one link ... bit is decoded (as part of the analog signal at Host B)? $11$ ms $88$ ms $30$ ms $30.088$ ms
commented
in
Computer Networks
Jan 24, 2019
438
views
applied-course-2019-mock1
network-switching
computer-networks
0
answers
15
NPTEL assignment
A DMA controller transfers 32-bit words from an input device to memory in one clock cycle using cycle stealing. The input device transmits data at a rate of 9600 bytes per second. The CPU is fetching and executing instructions at an average rate of 2,000,000 instructions ... the DMA transfer by .. percent. I am getting 0.12 as the answer but they have given 0.24 please check
commented
in
CO and Architecture
Jan 24, 2019
601
views
co-and-architecture
dma
1
answer
16
Test by Bikram | Mock GATE | Test 4 | Question: 19
An $Euler$ circuit of an undirected graph is a circuit in which each edge of the graph appears exactly once. Which of the following undirected graphs must have an $Euler$ circuit ? A complete graph with $12$ vertices A complete graph with $13$ vertices A tree with $13$ vertices I and II II only III only I and III
commented
in
GATE
Jan 11, 2019
200
views
tbb-mockgate-4
discrete-mathematics
graph-theory
graph-connectivity
euler-graph
0
answers
17
self dout
are serial schedules counted or not in the concurrent schedules. The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________. what is ans $\frac{(3+2+1)!)}{3!* 2!*1!}$ =60 or 60-3!=60-6=54 (non serial schedules )
commented
in
Databases
Jan 9, 2019
195
views
3
answers
18
Test by Bikram | Mock GATE | Test 4 | Question: 5
The time complexity of the best known algorithm to find $p^{th}$ ${\left ( p<n \right )}$ smallest element from a $minheap$ of $n$ elements is _______. $\Theta\left ( p\log p \right )$ $\Theta\left ( p\log n \right )$ $\Theta\left ( pn \right )$ $\Theta\left ( n\log p \right )$
commented
in
DS
Jan 9, 2019
493
views
tbb-mockgate-4
time-complexity
heap
1
answer
19
Test by Bikram | Mock GATE | Test 4 | Question: 8
Consider an unweighted undirected graph connected with $n$' vertices and $m$' edges. What is the worst case time complexity to check if two particular vertices $x$' and $y$' are present in graph; and, if present, how is the minimum distance between them calculated? ... $O\left ( n \right )$ $O\left ( n\log n \right )$ $O\left ( n+m \right )$
commented
in
Algorithms
Jan 9, 2019
877
views
tbb-mockgate-4
algorithms
time-complexity
graph-algorithms
0
answers
20
Number system
If all the natural numbers starting from $1$ are written side by side $ (123456789\dots), $ then find the $100^{th}$ digit of this series. $2$ $3$ $0$ $5$
commented
in
Quantitative Aptitude
Jan 5, 2019
748
views
general-aptitude
quantitative-aptitude
number-system
0
answers
21
Ace Test series
Consider the following cfg S → aSa | bSb | a | b find the number of conflicts in LR(0) state diagram? 2 4 8 10
commented
in
Compiler Design
Jan 4, 2019
201
views
ace-test-series
compiler-design
0
answers
22
#integration
$I=\int sin(2x) cos(3x) dx$ 1.(5cosx-cos5x)/10 2.(5sinx-sin5x)/10 3.both 4.none
commented
in
Calculus
Jan 4, 2019
268
views
integration
0
answers
23
#integration
I=$\int_{1}^{\infty }a^{-ceil (log _{b} x ) } dx$
commented
in
Calculus
Jan 3, 2019
181
views
integration
7
answers
24
GATE CSE 2014 Set 1 | Question: 55
Consider two processors $P_1$ and $P_2$ executing the same instruction set. Assume that under identical conditions, for the same input, a program running on $P_2$ takes $\text{25%}$ less time but incurs $\text{20%}$ more CPI (clock cycles per instruction) ... If the clock frequency of $P_1$ is $\text{1GHZ}$, then the clock frequency of $P_2$ (in GHz) is ______.
answer edited
in
CO and Architecture
Jan 3, 2019
15.1k
views
gatecse-2014-set1
co-and-architecture
numerical-answers
normal
speedup
0
answers
25
ME Test Series
Consider a window size over a TCP connection is initially 1. The system uses slow start algorithm to transfer the segment . A user has total 2000 segments to transfer . The minimum number of RTTs required to accomplish the user task is ____________. (Assume there is no duplicate acknowledgement or time out)
comment edited
in
Computer Networks
Dec 29, 2018
538
views
1
answer
26
MadeEasy Test Series 2019: Algorithms - Time complexity
cant we write the recurrance relation for bar() as T(n) = 5T(n-1) + c, like cant we take both the recurrance call as combined as both have same parameter? and if not, then how to solve such?
comment edited
in
Algorithms
Dec 29, 2018
615
views
time-complexity
algorithms
made-easy-test-series
asymptotic-notations
0
answers
27
Testbook Test Series: Computer Networks - Tcp
TCP opens a connection using an initial sequence number of 3500 and sends data at 5 MBps. The other party opens the connection with a sequence number of 1200. Wrap around time for both the sequence numbers differ by 12562.77 sec. Calculate the data rate(in KB) for the second party.
comment edited
in
Computer Networks
Dec 23, 2018
395
views
testbook-test-series
tcp
computer-networks
1
answer
28
GO test doubt
https://gateoverflow.in/117681/mock-3-28 Question asked in this link is: Two CSMA/CD stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential back-off algorithm. The probability that the ... in round 3 is _____ (up to 3 decimal points). why 2/4 * 4/16 * 56/64 = 0.109 is incorrect?
asked
in
Computer Networks
Dec 19, 2018
570
views
computer-networks
4
answers
29
ME test series DFA states
The number of states in minimal DFA for strings starting with $ab^{2}$ and ending with $b$ over the alphabet $\left \{ a,b \right \}$ is__________. // doubt: minimal string should be $ abb $ right?
comment edited
in
Theory of Computation
Dec 19, 2018
814
views
theory-of-computation
number-of-states
minimal-state-automata
1
answer
30
TIFR CSE 2019 | Part B | Question: 7
A formula is said to be a $3$-CF-formula if it is a conjunction (i.e., an AND) of clauses, and each clause has at most $3$ literals. Analogously, a formula is said to be a $3$ ... $\text{3-DF-SAT}$ is NP-complete Neither $\text{3-CF-SAT}$ nor $\text{3-DF-SAT}$ are in P
answered
in
Theory of Computation
Dec 19, 2018
815
views
tifr2019
theory-of-computation
p-np-npc-nph
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
Sorry to break the news, but: I see a few flaws...
bhai mujhe bhi bula lo australia......mai bhi...
I see no inspiration here. Not everyone is...
Yaa toa intentionally bohot jyada sahi time kiya...
Man, I feel you! I left my job to do gate this...