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 HeadShot
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by HeadShot
5
answers
1
GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
commented
in
Operating System
Jan 24, 2020
13.9k
views
gateit-2005
operating-system
disk
normal
0
answers
2
Google foo-bar
Hi guys , I got Google's invitation for foo-bar challenge. I think i can go for one or two level but not further with current level of practice. So without requesting for the problem , does anyone know how long I can keep it logged in ?
asked
in
Others
May 30, 2019
245
views
0
answers
3
Allen Career Institute: Algorithm
Identify the algorithm which works on the principle that locally optimal solutions are globally optimal. $\left ( A \right )$ Divide and Conquer $\left ( B \right )$ Greedy $\left ( C \right )$ Dynamic Programming $\left ( D \right )$ All of the above
commented
in
Algorithms
Apr 5, 2019
1.3k
views
algorithms
0
answers
4
Kenneth Rosen Edition 7 Exercise 2.1 Question 17 (Page No. 126)
Suppose that $A, B,$ and $C$ are sets such that $A \subseteq B$ and $B \subseteq C.$ show that $A \subseteq C.$
commented
in
Set Theory & Algebra
Apr 5, 2019
211
views
kenneth-rosen
discrete-mathematics
set-theory&algebra
13
answers
5
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
commented
in
Databases
Jan 29, 2019
8.8k
views
er-diagram
databases
er-to-relational
relational
4
answers
6
GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.
commented
in
Theory of Computation
Jan 27, 2019
17.5k
views
gatecse-2014-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
normal
1
answer
7
Test by Bikram | Mock GATE | Test 2 | Question: 9
Consider these three grammars. ... by $G2$, then it can be generated by $G1$. If w can be generated by $G3$, then it can be generated by $G1$.
commented
in
GATE
Jan 17, 2019
871
views
tbb-mockgate-2
theory-of-computation
grammar
multiple-selects
4
answers
8
GATE CSE 2011 | Question: 52
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ N2: $(1, 0, 6, 7, 3)$ N3: $(7, 6, 0, 2, 6)$ ... $N3$? $(3, 2, 0, 2, 5)$ $(3, 2, 0, 2, 6)$ $(7, 2, 0, 2, 5)$ $(7, 2, 0, 2, 6)$
commented
in
Computer Networks
Jan 14, 2019
23.5k
views
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
4
answers
9
GATE CSE 2011 | Question: 33
Consider a finite sequence of random values $X=[x_1,x_2,\dots x_n]$. Let $\mu_x$ be the mean and $\sigma_x$ be the standard deviation of $X$. Let another finite sequence $Y$ of equal length be derived from this as $y_i=a*x_i+b$, where $a$ and $b$ are positive ... $Y$ in $Y$ $\mu_y=a \mu_x + b$ $\sigma_y=a \sigma_x + b$
commented
in
Probability
Jan 14, 2019
8.3k
views
gatecse-2011
probability
random-variable
normal
2
answers
10
Test by Bikram | Mock GATE | Test 2 | Question: 30
Which of the following statements are true? Every totally ordered set is a lattice Every lattice has a least element and a greatest element All totally ordered posets are also well ordered posets. i only ii and iiii only ii only i, ii and iii
commented
in
Set Theory & Algebra
Jan 13, 2019
802
views
tbb-mockgate-2
discrete-mathematics
set-theory&algebra
lattice
7
answers
11
GATE CSE 2009 | Question: 13
Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm? P: Always finds a negative weighted cycle, if one exists. Q: Finds whether any negative weighted cycle is reachable from the source. $P$ only $Q$ only Both $P$ and $Q$ Neither $P$ nor $Q$
commented
in
Algorithms
Jan 12, 2019
16.6k
views
gatecse-2009
algorithms
graph-algorithms
normal
4
answers
12
GATE IT 2007 | Question: 3, UGCNET-June2012-III: 34
Consider a weighted, undirected graph with positive edge weights and let $uv$ be an edge in the graph. It is known that the shortest path from the source vertex $s$ to $u$ has weight 53 and the shortest path from $s$ to $v$ has weight 65. Which one of the ... $(u,v) \leq 12$ Weight $(u,v) = 12$ Weight $(u,v) \geq 12$ Weight $(u,v) > 12$
commented
in
Algorithms
Jan 12, 2019
11.4k
views
gateit-2007
algorithms
graph-algorithms
normal
ugcnetcse-june2012-paper3
3
answers
13
GATE CSE 1991 | Question: 01,vii
The minimum number of comparisons required to sort $5$ elements is ______
commented
in
Algorithms
Jan 11, 2019
8.8k
views
gate1991
normal
algorithms
sorting
numerical-answers
1
answer
14
Graph
Also let me know the approach to find back edges, cross edges, forward edges, How to solve these questions
commented
in
Algorithms
Jan 11, 2019
2.5k
views
algorithms
graph-algorithm
depth-first-search
descriptive
test-series
0
answers
15
ME OTS : TCP timers
Assume in TCP client is sending segment to server. After successfully receiving segments from client, server is waiting for next segments and clients is also waiting for acknowledgment from the server and this lead to deadlock situation. Which timer is used and ... , client C. Persistenttimer, client D. Keep alive timer, client Answer given : C It should be B right ?
commented
in
Computer Networks
Jan 11, 2019
632
views
0
answers
16
Doubt : Indexing (Test By Bikram Sir )
I used multilevel indexing and got 5+1 i e 6 block transfers. answer given is 18+1 i.e 19 how to know which method to be used ? ( is that 19 bcoz of 'BST' ? )
commented
in
Databases
Jan 10, 2019
472
views
1
answer
17
Probability
Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________
commented
in
Probability
Jan 10, 2019
2.7k
views
probability
1
answer
18
Test by Bikram | Mock GATE | Test 1 | Question: 32
Fill in the blanks in the procedure: void Prod (Element Type X, Priority Queue H) { int i; if (IsFull(H)) { Error ("Priority queue is full"); return; } for (i=++H -> size; H -> Elements [i/2]>X; i/=2) _________________ } ... 2]=H$\rightarrow$ Elements $[i/2]$; $H$\rightarrow$ Elements $[i^2 ]=X;$ $H$\rightarrow$ Elements $[i]=X;$
commented
in
GATE
Jan 10, 2019
1.1k
views
tbb-mockgate-1
data-structures
priority-queue
3
answers
19
Test by Bikram | Mock GATE | Test 1 | Question: 18
Which of the following is not a Boolean algebra under the operation '\'? \: is a divisor, $D_{p}$: divisor of $p$ $\left \{ D18; \ \right \}$ $\left \{ D21; \ \right \}$ $\left \{ D110; \ \right \}$ $\left \{ D91; \ \right \}$
commented
in
Set Theory & Algebra
Jan 10, 2019
1.9k
views
tbb-mockgate-1
boolean-algebra
discrete-mathematics
lattice
2
answers
20
Test by Bikram | Mock GATE | Test 1 | Question: 9
Consider the following program fragment : int foo(int ,int ); int a; int ar[4] = { 1,0, 2,3}; main() { a = 0; foo(ar[a], ar[ar[a]]); printf("%d,%d ,%d,%d ", ar[0] , ar[1] ,ar[2] , ar[3]); } foo(int x, int y) { x= x+1; y ... be printed by the program if parameter passed by call by name? $1, 50, 2, 3$ $3, 50, 2, 3$ $3, 50, 3, 4$ $3, 2, 2, 3$
commented
in
GATE
Jan 10, 2019
1.7k
views
tbb-mockgate-1
parameter-passing
runtime-environment
compiler-design
2
answers
21
GATE CSE 2013 | Question: 42
What is the return value of $f(p,p)$, if the value of $p$ is initialized to $5$ before the call? Note that the first parameter is passed by reference, whereas the second parameter is passed by value. int f (int &x, int c) { c = c - 1; if (c==0) return 1; x = x + 1; return f(x,c) * x; }
commented
in
Programming in C
Jan 9, 2019
21.1k
views
gatecse-2013
compiler-design
normal
marks-to-all
numerical-answers
parameter-passing
runtime-environment
0
answers
22
Site Feedback
Just a small tweak. Probably on mobile browser ( i use chrome and found the same when I switched to desktop site on phone itself) when we use "$" with just a single space left and type further context, things get overlapped. Snapshot :
commented
in
Others
Jan 8, 2019
449
views
0
answers
23
Set Theory Doubt
Approach : 1. Select given number say 1, then find combination of rest of the elements. e.g select 1 , now remaining 4 elements, make subsets of 2 elements and add "1" in each subsets ie C(4,2) = 6. Suggest any another method please.
commented
in
Set Theory & Algebra
Jan 8, 2019
398
views
0
answers
24
Doubt : Recursion ( snippet by testbook )
Its always a confusion how Recursion works with for loop. Explain a brief.
commented
in
Programming in C
Jan 7, 2019
279
views
0
answers
25
Digital Logic made easy
Consider the circuit given below: MSB and LSB of mod 10 ripple counter act as clock to ripple down and up counter respectively. Initially all the counters were cleared and output of comparator was A=B. The clock pulse is applied. Find the minimum no of clock pulses required to make A=B again.
comment edited
in
Digital Logic
Jan 7, 2019
2.6k
views
digital-logic
ripple-counter-operation
sequential-circuit
flip-flop
0
answers
26
ME OTS : Pipelining
Consider the following statements (I) Execution time for single instruction on six stage pipelined CPU is less than or equal to identical non- pipelined CPU. (ii) In a uniform delay pipeline execution time for a single instruction is equal to the ... if stage delay exist then for single execution, pipeline time will not be equal. Hence 2nd statement wont be true always.
commented
in
CO and Architecture
Jan 6, 2019
1.2k
views
co-and-architecture
pipelining
0
answers
27
Doubt : GBN packet retransmission
Station A wants to send 10 packets to station B using Go Back N ARQ, where N = 4. Moreover consider every 3 rd packet lost while transmission (ACK's from B never get lost). Calculate the number of transmissions that A has to make in GBN respectively to ensure safe delivery to B. ( This has been already asked but need some clarification ) Approach :
commented
in
Computer Networks
Jan 5, 2019
581
views
2
answers
28
ME OTS 1 : Finite Automata
Doubt: ( Even if we take compliment , its wont satisfy it )
commented
in
Theory of Computation
Jan 5, 2019
628
views
1
answer
29
ME OTS : Memory Mapped I/O
Which of the following best characterizes about memory mapped I/O? A.Additional hardware for bus is required to control the 1/0 bus and memory bus. B.Some of the address space is separated from the memory space and assigned them to II/0 ... differentiate between memory and I/O different control signals is used for memory and I/0. Please explain the options in short.
asked
in
CO and Architecture
Jan 5, 2019
828
views
co-and-architecture
bus-configuration
0
answers
30
Group Theory : Lagrange's Theorem
Please explain me with simple 1-2 examples how order of a subgroup divide order of a group and why it is always true.
asked
in
Set Theory & Algebra
Jan 5, 2019
338
views
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:...