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 sunita24
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by sunita24
14
answers
1
GATE CSE 2015 Set 1 | Question: 46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3, 7$ and $20$ ... $T_{3}$ completes its execution at the end of_____________________milliseconds.
commented
in
Operating System
Jan 30, 2018
28.9k
views
gatecse-2015-set1
operating-system
process-scheduling
normal
numerical-answers
1
answer
2
# computer-networks # test-series
Consider Host A sends a UDP datagram containing 1100 bytes of user data to host B over an ethernet LAN. Maximum transmission unit (MTU) of the network is 206 bytes (including the network layer overhead). Size of UDP header is 10 bytes and size of IP header is ... will be 69. S3 : The MF flag of 6th fragment is set i.e. 1. Which of the following options is correct?
commented
in
Computer Networks
Jan 17, 2018
830
views
computer-networks
fragmentation
tcp
ip
8
answers
3
GATE CSE 2012 | Question: 44
Consider a source computer $(S)$ transmitting a file of size $10^{6}$ bits to a destination computer $(D)$ over a network of two routers $(R_{1}\text{ and }R_{2})$ and three links $(L_{1},L_{2},\text{ and } L_{3})$. $L_{1}$ connects $S$ to ... propagation delays in transmitting the file from $S$ to $D$? $\text{1005 ms}$ $\text{1010 ms}$ $\text{3000 ms}$ $\text{3003 ms}$
commented
in
Computer Networks
Jan 15, 2018
18.6k
views
gatecse-2012
computer-networks
communication
normal
8
answers
4
GATE CSE 2006 | Question: 46
Station $A$ needs to send a message consisting of $9$ packets to Station $B$ using a sliding window (window size $3$) and go-back-$n$ error control strategy. All packets are ready and immediately available for transmission. If every $5$th packet that $A$ ... what is the number of packets that $A$ will transmit for sending the message to $B$? $12$ $14$ $16$ $18$
commented
in
Computer Networks
Jan 14, 2018
31.0k
views
gatecse-2006
computer-networks
sliding-window
normal
2
answers
5
GATE CSE 2007 | Question: 2
Let $S$ be a set of $n$ elements. The number of ordered pairs in the largest and the smallest equivalence relations on $S$ are: $n$ and $n$ $n^2$ and $n$ $n^2$ and $0$ $n$ and $1$
commented
in
Set Theory & Algebra
Jan 12, 2018
6.8k
views
gatecse-2007
set-theory&algebra
normal
relations
4
answers
6
GATE CSE 2000 | Question: 2.4
A polynomial $p(x)$ satisfies the following: $p(1) = p(3) = p(5) = 1$ $p(2) = p(4) = -1$ The minimum degree of such a polynomial is $1$ $2$ $3$ $4$
commented
in
Set Theory & Algebra
Jan 12, 2018
5.5k
views
gatecse-2000
set-theory&algebra
normal
polynomials
8
answers
7
GATE CSE 2016 Set 1 | Question: 28
A function $f: \Bbb{N^+} \rightarrow \Bbb{N^+}$ , defined on the set of positive integers $\Bbb{N^+}$, satisfies the following properties: $f(n)=f(n/2)$ if $n$ is even $f(n)=f(n+5)$ if $n$ is odd Let $R=\{ i \mid \exists{j} : f(j)=i \}$ be the set of distinct values that $f$ takes. The maximum possible size of $R$ is ___________.
commented
in
Set Theory & Algebra
Jan 11, 2018
16.6k
views
gatecse-2016-set1
set-theory&algebra
functions
normal
numerical-answers
8
answers
8
GATE CSE 2005 | Question: 44
What is the minimum number of ordered pairs of non-negative numbers that should be chosen to ensure that there are two pairs $(a,b)$ and $(c,d)$ in the chosen set such that, $a \equiv c\mod 3$ and $b \equiv d \mod 5$ $4$ $6$ $16$ $24$
commented
in
Combinatory
Jan 11, 2018
10.5k
views
gatecse-2005
set-theory&algebra
normal
pigeonhole-principle
6
answers
9
GATE CSE 2007 | Question: 23
Which of the following graphs has an Eulerian circuit? Any $k$-regular graph where $k$ is an even number. A complete graph on $90$ vertices. The complement of a cycle on $25$ vertices. None of the above
commented
in
Graph Theory
Jan 11, 2018
19.9k
views
gatecse-2007
graph-theory
normal
graph-connectivity
5
answers
10
GATE IT 2007 | Question: 85
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Now the key $K50$ is deleted from the $B^+$ tree resulting after the two ... (i) and (ii) are true Statements (ii) and (iii) are true Statements (iii) and (i) are true All the statements are false
commented
in
Databases
Jan 5, 2018
10.6k
views
gateit-2007
databases
b-tree
normal
1
answer
11
GATE CSE 1994 | Question: 14a
Consider $B^+$ - tree of order $d$ shown in figure. (A $B^+$ - tree of order $d$ contains between $d$ and $2d$ keys in each node) Draw the resulting $B^+$ - tree after $100$ is inserted in the figure below.
commented
in
Databases
Jan 5, 2018
6.3k
views
gate1994
databases
b-tree
normal
descriptive
1
answer
12
MadeEasy Test Series: Computer Networks - Congestion Control
. 63 Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 MSS and the threshold at the start is 1st transmission is 16 MSS. Assume ... after transmission of 7th packet . The congestion window size at the end of 14 RTT is _________ (in MSS).
commented
in
Computer Networks
Dec 31, 2017
254
views
computer-networks
made-easy-test-series
congestion-control
1
answer
13
MadeEasy Test Series: Operating System - Resource Allocation
A system has 10 identical resources and N processes competing for them. Each process can request atmost 3 resources but by grouping of first 3 processes needs only 6 resources. Then, the maximum value of āNā is _______.
commented
in
Operating System
Dec 30, 2017
728
views
made-easy-test-series
operating-system
resource-allocation
0
answers
14
MadeEasy Test Series: Digital Logic - Digital Counter
Q. 53 Identify the mod value of the given ripple counter.
commented
in
Digital Logic
Dec 29, 2017
544
views
made-easy-test-series
digital-logic
digital-counter
1
answer
15
MadeEasy Test Series: Digital Logic - Multiplexer
please explain how to start solving such circuital questions..I always get confused..plzz help someone asap. What will be the final output?
commented
in
Digital Logic
Dec 29, 2017
692
views
made-easy-test-series
digital-logic
decoder
multiplexer
2
answers
16
GATE CSE 1991 | Question: 10a
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar ... what is the relative precedence between $-$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $-$.
commented
in
Compiler Design
Dec 8, 2017
3.5k
views
gate1991
grammar
compiler-design
normal
descriptive
3
answers
17
GATE CSE 2014 Set 2 | Question: 8
Consider the equation $(123)_5=(x8)_y$ with $x$ and $y$ as unknown. The number of possible solutions is _____ .
commented
in
Digital Logic
Dec 6, 2017
7.3k
views
gatecse-2014-set2
digital-logic
number-representation
numerical-answers
normal
4
answers
18
GATE CSE 2002 | Question: 9
Consider the following $32\text{-bit}$ floating-point representation scheme as shown in the format below. A value is specified by $3$ fields, a one bit sign field (with $0$ for positive and $1$ ... the hexadecimal. What is the largest value that can be represented using this format? Express your answer as the nearest power of $10$.
commented
in
Digital Logic
Dec 5, 2017
9.1k
views
gatecse-2002
digital-logic
number-representation
normal
descriptive
6
answers
19
GATE CSE 1999 | Question: 2.16
The number of full and half-adders required to add $16$-bit numbers is $8$ half-adders, $8$ full-adders $1$ half-adder, $15$ full-adders $16$ half-adders, $0$ full-adders $4$ half-adders, $12$ full-adders
commented
in
Digital Logic
Dec 4, 2017
18.0k
views
gate1999
digital-logic
normal
adder
8
answers
20
GATE CSE 2014 Set 2 | Question: 41
Suppose a stack implementation supports an instruction $\text{REVERSE}$, which reverses the order of elements on the stack, in addition to the $\text{PUSH}$ and $\text{POP}$ ... instruction. A queue can be implemented where both $\text{ENQUEUE}$ and $\text{DEQUEUE}$ take a single instruction each.
commented
in
DS
Dec 3, 2017
19.7k
views
gatecse-2014-set2
data-structures
stack
easy
3
answers
21
GATE CSE 1999 | Question: 12
In binary tree, a full node is defined to be a node with $2$ children. Use induction on the height of the binary tree to prove that the number of full nodes plus one is equal to the number of leaves. Draw the min-heap that results from insertion of the following ... empty min-heap: $7, 6, 5, 4, 3, 2, 1$. Show the result after the deletion of the root of this heap.
commented
in
DS
Dec 3, 2017
3.4k
views
gate1999
data-structures
heap
normal
descriptive
2
answers
22
TIFR CSE 2013 | Part B | Question: 13
Given a binary tree of the following form and having $n$ nodes, the height of the tree is $\Theta \left(\log n\right)$ $\Theta \left(n\right)$ $\Theta \left(\sqrt{n}\right)$ $\Theta \left(n / \log n\right)$ None of the above.
commented
in
DS
Nov 30, 2017
2.7k
views
tifr2013
binary-tree
data-structures
11
answers
23
GATE CSE 1994 | Question: 1.11
In a compact single dimensional array representation for lower triangular matrices (i.e all the elements above the diagonal are zero) of size $n \times n$, non-zero elements, (i.e elements of lower triangle) of each row are stored one after another, starting from the first row, the index of the ... is: $i+j$ $i+j-1$ $(j-1)+\frac{i(i-1)}{2}$ $i+\frac{j(j-1)}{2}$
commented
in
DS
Nov 28, 2017
22.1k
views
gate1994
data-structures
array
normal
3
answers
24
GATE CSE 2014 Set 3 | Question: 10
Let $A$ be the square matrix of size $n \times n$. Consider the following pseudocode. What is the expected output? C=100; for i=1 to n do for j=1 to n do { Temp = A[i][j]+C; A[i][j] = A[j][i]; A[j][i] = ... $A$ Adding $100$ to the upper diagonal elements and subtracting $100$ from lower diagonal elements of $A$ None of the above
commented
in
Algorithms
Nov 21, 2017
9.9k
views
gatecse-2014-set3
algorithms
identify-function
easy
2
answers
25
GATE CSE 2010 | Question: 34
The weight of a sequence $a_0,a_1, \dots, a_{n-1}$ of real numbers is defined as $a_0+a_1/2+ \dots + a_{n-1}/2^{n-1}$. A subsequence of a sequence is obtained by deleting some elements from the sequence, keeping the order of the remaining elements the same. Let $X$ denote the ... $X$ is equal to $max(Y, a_0+Y)$ $max(Y, a_0+Y/2)$ $max(Y, a_0 +2Y)$ $a_0+Y/2$
commented
in
Algorithms
Nov 20, 2017
14.6k
views
gatecse-2010
algorithms
dynamic-programming
normal
7
answers
26
GATE CSE 1996 | Question: 17
Let $G$ be the directed, weighted graph shown in below figure We are interested in the shortest paths from $A$. Output the sequence of vertices identified by the Dijkstra's algorithm for single source shortest path when the algorithm is started at node $A$ Write down ... vertices in the shortest path from $A$ to $E$ What is the cost of the shortest path from $A$ to $E$?
commented
in
Algorithms
Nov 19, 2017
5.7k
views
gate1996
algorithms
graph-algorithms
normal
descriptive
2
answers
27
GATE IT 2006 | Question: 48
The characters $a$ to $h$ have the set of frequencies based on the first $8$ Fibonacci numbers as follows $a : 1$, $b : 1$, $c : 2$, $d : 3$, $e : 5$, $f : 8$, $g : 13$, $h : 21$ A Huffman code is used to represent the characters. What is the sequence of characters corresponding to the following code? $110111100111010$ $fdheg$ $ecgdf$ $dchfg$ $fehdg$
commented
in
Algorithms
Nov 18, 2017
10.4k
views
gateit-2006
algorithms
greedy-algorithm
normal
5
answers
28
GATE CSE 2015 Set 3 | Question: 39
Consider the following recursive C function. void get(int n) { if (n<1) return; get (n-1); get (n-3); printf("%d", n); } If $get(6)$ function is being called in $main()$ then how many times will the $get()$ function be invoked before returning to the $main()$? $15$ $25$ $35$ $45$
answered
in
Algorithms
Nov 17, 2017
13.7k
views
gatecse-2015-set3
algorithms
recurrence-relation
normal
8
answers
29
GATE CSE 2016 Set 2 | Question: 11
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n^{\text{th}}$ vertex in this BFS traversal, then the maximum possible value of $n$ is __________
commented
in
Algorithms
Nov 17, 2017
9.8k
views
gatecse-2016-set2
algorithms
graph-algorithms
normal
numerical-answers
graph-search
8
answers
30
GATE CSE 2016 Set 1 | Question: 49
Consider a computer system with ten physical page frames. The system is provided with an access sequence $(a_{1}, a_{2},....,a_{20}, a_{1}, a_{2},...a_{20})$, where each $a_{i}$ is a distinct virtual page number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is_________.
commented
in
Operating System
Nov 10, 2017
13.8k
views
gatecse-2016-set1
operating-system
page-replacement
normal
numerical-answers
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 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
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
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
Eligibility Criteria: Discipline of...
4-year B.Tech./B.E. degree or a MSc./MCA degree...
I am not sure about others but I would pay 2X...
@DebRC Yes. This, time stamp and comparing...
Small feedback for next year. It would be great...