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 Gupta731
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Gupta731
0
votes
2
answers
1
Gateforum Test Series: Algorithms - Dynamic Programming
Given a text array $T[1…..n]$ and a pattern array $P[1….m]$ such that T and P are character taken from alphabet $\sum$, $\sum={a,b,c,…..z}$. String matching problem is to find all the occurence of P in T. A pattern occur with shift s in T if $P[1…..m]=T[s+1,…...s+m]$. Consider $T=bacacbaacacac$ $P=cac$ The sum of the value of all s is ________
asked
in
Algorithms
Jan 14, 2019
756
views
gateforum-test-series
algorithms
dynamic-programming
1
vote
0
answers
2
Gateforum Test Series: Databases - Transactions
Which of the following time stamp ordering protocol(s) allow the following schedules? $T:W_1(A)\ W_2(A)\ W_3(A)\ R_2(A)\ R_4(A)$ Time stamps: $T_1=5,T_2=10,T_3=15,T_4=20$ Thomas write rule Multiversion time stamp protocol Basic Time stamp All of these
asked
in
Databases
Jan 13, 2019
512
views
gateforum-test-series
databases
transaction-and-concurrency
1
vote
1
answer
3
Gateforum Test Series: Computer Networks - Lan Technologies
Consider a scnario of CSMA/CD network. Suppose A & B attempt to transmit a frame simultaneously and collide. Using exponential backoff algorithm A chooses K=0 and B chooses K=1. Again they collide and after the 2nd collision both A & B will choose K with equal ... {0,1} and for B {0,1,2,3} For A {0,1,2,3} and for B {0,1,2,3}
asked
in
Computer Networks
Jan 13, 2019
618
views
gateforum-test-series
computer-networks
lan-technologies
0
votes
0
answers
4
Self Doubt
GATE2018-50 https://gateoverflow.in/204125/gate2018-50 Why can't I do this question with $(k+(n-1))*t_p$ For PO stage: $0.40*3 + 0.35*2 + 0.25*1 = 2.15$ cycles. This is larger than all the 5 stages of the given pipeline. So applying the above formula it gives $(5+99)*2.15 =224$ cycles. why we use the expanded form of the same formula $k*t_p+(n-1)t_p$ and get answer as $219$ cycles
asked
in
CO and Architecture
Jan 13, 2019
395
views
co-and-architecture
0
votes
1
answer
5
Made Easy Test Series 2019: General Aptitude - Numerical Ability
If $N=1!+3!+5!+7!…...199!$ then remainder obtained when N is divided by $120$ is 7 9 11 13
asked
in
Quantitative Aptitude
Jan 11, 2019
2.0k
views
general-aptitude
quantitative-aptitude
made-easy-test-series
1
vote
1
answer
6
Gateforum Test Series: Set Theory & Algebra - Sets
asked
in
Set Theory & Algebra
Jan 9, 2019
425
views
gateforum-test-series
set-theory&algebra
set-theory
2
votes
1
answer
7
Gateforum Test Series: Algorithms - Time Complexity
asked
in
Algorithms
Jan 9, 2019
586
views
gateforum-test-series
algorithms
time-complexity
1
vote
1
answer
8
MadeEasy Test Series: Programming & DS - Binary Search Tree
AVL tree is created by inserting the keys 2, 6, 1, 5, 3, 4, 7 in the given order (Assume the tree is initially empty). Then the level order traversals of the tree would be. 2, 1, 3, 5, 4, 6, 7 3, 2, 5, 1 ... . After 2 or 3 rotations I get stuck trying to figure out which way to rotate. Please help me with the proper steps in this question.
asked
in
DS
Jan 6, 2019
1.4k
views
made-easy-test-series
data-structures
binary-search-tree
0
votes
0
answers
9
Gateforum Test Series
$a=a+100$ in function foo, does it increases the value of a by 100 or just increments the address.
asked
in
Programming in C
Jan 2, 2019
365
views
gateforum-test-series
programming-in-c
0
votes
2
answers
10
Gateforum Test Series: Graph Theory - Graph Matching
asked
in
Graph Theory
Jan 2, 2019
845
views
gateforum-test-series
discrete-mathematics
graph-theory
graph-matching
0
votes
1
answer
11
Gateforum Test Series
asked
in
Algorithms
Jan 2, 2019
539
views
algorithms
time-complexity
gateforum-test-series
0
votes
0
answers
12
Gateforum Test Series
asked
in
Set Theory & Algebra
Jan 2, 2019
430
views
gateforum-test-series
discrete-mathematics
0
votes
0
answers
13
Self Doubt
{$a^nb^{n+k}|n\geq0, k\geq1$} $\cup$ {$a^{n+k}b^n|n\geq0, k\geq3$} It is DCFL or not?
asked
in
Theory of Computation
Dec 31, 2018
283
views
theory-of-computation
1
vote
0
answers
14
Made Easy Test Series: Digital Logic - Flip Flop
Consider a pulse triggered master slave JK flip-flop with inputs J and K as shown below: The input to the LED is connected to the output $\overline Q$ of the master slave flip-flop. The duration for which the LED will be ON in the time duration of T is ________ sec.
asked
in
Digital Logic
Dec 27, 2018
998
views
made-easy-test-series
digital-logic
flip-flop
1
vote
0
answers
15
Virtual Gate Test Series: Theory Of Computation - Finite Automata
For a binary string, $x = a_0,a_1, · · · ,a_n−1$ define $val(x)$ to be the value of x interpreted as a binary number, where $a_0$ is the most significant bit. More formally, $val(x)$ ... a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either $4$ or $ 5?$
asked
in
Theory of Computation
Dec 26, 2018
535
views
theory-of-computation
finite-automata
virtual-gate-test-series
3
votes
1
answer
16
Gateforum Test Series: Computer Networks - Sliding Window
Suppose you are designing a sliding window protocol for a $1Mbps$ point to point link which has one way latency of $1.25s$. Assuming that each frame carries $1kB$ of data, determine the minimum number of bits required for the sequence number. Answer provided - $9$ bits.
asked
in
Computer Networks
Dec 24, 2018
530
views
gateforum-test-series
computer-networks
sliding-window
2
votes
0
answers
17
Gateforum Test Series: Programming & DS - Linked Lists
asked
in
DS
Dec 24, 2018
663
views
gateforum-test-series
data-structures
linked-list
2
votes
1
answer
18
Gateforum Test Series: Digital Logic - Floating Point Representation
What is the largest mantissa we can store in floating-point format if the size of the mantissa field is m-bit and exponent field is e-bit? The mantissa is normalized and has an implied $1$ in the left of the point. Normalized form of mantissa is 1.M
asked
in
Digital Logic
Dec 24, 2018
899
views
gateforum-test-series
digital-logic
floating-point-representation
0
votes
0
answers
19
Gateforum Class Notes
The array implementation of Queue throws an error when the array limit has been reached. So we consider the following alternative. Create a larger array using redefine function. The cost of the redefine that makes the array larger is proportional to the new size. Suppose we expand the array ... $N$ insertions will take. $O(N^2)$ $O(N^3)$ $O(N)$ $O(log_2N)$ Answer provided: $A$
asked
in
DS
Dec 23, 2018
509
views
data-structures
queue
1
vote
1
answer
20
Gateforum Test Series: Algorithms - Minimum Spanning Trees
asked
in
Algorithms
Dec 23, 2018
864
views
gateforum-test-series
algorithms
minimum-spanning-tree
Page:
1
2
3
4
5
next »
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:...