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 saurav04
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by saurav04
1
vote
1
Area of triangles
Triangles ABC and CDE have a common vertex C with side AB of triangle ABC being parallel to side DE of triangle CDE. If length of side AB = 2 cm and length of side DE = 7 cm and perpendicular distance between sides AB and DE is 7.2 cm, then find the sum of areas of triangle ABC and triangle CDE.
answered
in
Quantitative Aptitude
Jan 29, 2016
1.1k
views
0
votes
2
Given that α ≥ 0 and value of integral at α = 0 is 0. The value of
Given that α ≥ 0 and value of integral at α = 0 is 0. The value of $\int_{0}^{1}\frac{x^{\alpha }-1}{log x}dx$
answered
in
Calculus
Jan 29, 2016
445
views
calculus
1
vote
3
cache mem with TLB ans ??
Common Data Questions 50 and 51 A four-way associative writeback cache has a $2^{11} * \text{89-bit}$ tag store. The cache uses a custom replacement policy that requires $9$ $\text{bits}$ per set. The cache block size is $64$ bytes. The cache is virtually -indexed and ... is the size of the cache data store? (a). $512 KB$ (b). $256 KB$ (c). $128 KB$ (d). $1024KB$
answered
in
CO and Architecture
Dec 14, 2015
400
views
4
votes
4
exponential backoff
Nodes A and B are connected with 100 Mbps ethernet segment with 6 microsec pop.delay between them.Suppose A,B send frames at t=0 and frames get collided.after first collision A draws k=0 and bdraws k=1.if jam signal is ignored and timeout ... what time A's packet gets completely delivered to B...assume packet size 1000 bits. 28 microsec 16 microsec 22 microsec 38 microsec
answered
in
Computer Networks
Dec 8, 2015
3.0k
views
0
votes
5
Delay - Computer Networks
We wish to send a message of size $150,000$ bytes over the network. There are four hops, each of length $20km$ and running at $100 Mb/s$. Before sending we split the message into $1500$ byte packets. What is the end-to-end delay of the message? ... . # The delay over each of the links is identical. # Net queueing delay is zero. # Net nodal processing delay is zero.
answered
in
Computer Networks
Nov 20, 2015
2.3k
views
computer-networks
delay
3
votes
6
TIFR CSE 2014 | Part B | Question: 8
Which of these functions grows fastest with $n$? $e^{n}/n$. $e^{n-0.9 \log n}$. $2^{n}$. $\left(\log n\right)^{n-1}$. None of the above.
answered
in
Algorithms
Nov 19, 2015
4.6k
views
tifr2014
algorithms
asymptotic-notation
1
vote
7
TIFR CSE 2012 | Part A | Question: 5
What is the maximum number of points of intersection between the diagonals of a convex octagon (8-vertex planar polygon)? Note that a polygon is said to be convex if the line segment joining any two points in its interior lies wholly in the ... between diagonals that lie in the interior of the octagon are to be considered for this problem. 55 60 65 70 75
answered
in
Quantitative Aptitude
Nov 18, 2015
1.2k
views
tifr2012
quantitative-aptitude
geometry
5
votes
8
TIFR CSE 2011 | Part B | Question: 36
Consider malware programs. Which of the following is true? A worm is a parasite. A virus cannot affect a linux operating system. A trojan can be in the payload of only a worm. A worm and virus are self replicating programs. There is no difference between a virus and a worm.
answered
in
Computer Networks
Nov 15, 2015
1.8k
views
tifr2011
computer-networks
network-security
0
votes
9
Disjoint sets
No of unordered disjoint sets of a set with n elements?
answered
in
Set Theory & Algebra
Nov 14, 2015
915
views
14
votes
10
TIFR CSE 2010 | Part B | Question: 37
Consider the program where $a, b$ are integers with $b > 0$. x:=a; y:=b; z:=0; while y > 0 do if odd (x) then z:= z + x; y:= y - 1; else y:= y % 2; x:= 2 * x; fi Invariant of the loop is a condition which is ... terminate for some values of $a, b$ but when it does terminate, the condition $z = a * b$ will hold. The program will terminate with $z=a^{b}$
answered
in
Programming in C
Nov 14, 2015
3.4k
views
tifr2010
programming
loop-invariants
2
votes
11
GATE CSE 1991 | Question: 11,a
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] ... j; flag [i] := false non-critical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.
answered
in
Operating System
Nov 7, 2015
4.1k
views
gate1991
process-synchronization
normal
operating-system
descriptive
4
votes
12
TIFR CSE 2013 | Part A | Question: 17
A stick of unit length is broken into two at a point chosen at random. Then, the larger part of the stick is further divided into two parts in the ratio $4:3$. What is the probability that the three sticks that are left CANNOT form a triangle? $1/4$ $1/3$ $5/6$ $1/2$ $\log_{e}(2)/2$
answered
in
Probability
Nov 6, 2015
1.9k
views
tifr2013
probability
32
votes
13
TIFR CSE 2013 | Part A | Question: 3
Three candidates, Amar, Birendra and Chanchal stand for the local election. Opinion polls are conducted and show that fraction $a$ of the voters prefer Amar to Birendra, fraction $b$ prefer Birendra to Chanchal and fraction $c$ ... $(a, b, c) = (0.49, 0.49, 0.49);$ None of the above.
answered
in
Mathematical Logic
Nov 6, 2015
2.5k
views
tifr2013
set-theory&algebra
set-theory
0
votes
14
integration 10[IN]
http://gateforum.com/wp-content/uploads/2013/01/IN-2010.pdf Question 21 The integral $\int _{-\infty} ^{\infty}\delta (t-\frac{\pi}{6})6\sin(t)dt$ evaluates to (A).6 (B).3 (c).1.5 (D).0
answered
in
Calculus
Nov 6, 2015
1.3k
views
calculus
18
votes
15
GATE CSE 2000 | Question: 8
A push down automation (pda) is given in the following extended notation of finite state diagram: The nodes denote the states while the edges denote the moves of the pda. The edge labels are of the form $d$, $s/s'$ where $d$ ... the above notation that accept the language $\left\{0^{n}1^{m} \mid n \leq m \leq 2n\right\}$ by empty stack
answered
in
Theory of Computation
Nov 6, 2015
5.1k
views
gatecse-2000
theory-of-computation
descriptive
pushdown-automata
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:...