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 I_am_winner
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by I_am_winner
0
votes
1
Ace Test Series: Algorithms - Graph Algorithms
Answer is given as (B). But, shouldn't it relax point 'c' via 'a' .. So, i guess answer should be D. Is it?
answered
in
Algorithms
Nov 12, 2018
699
views
ace-test-series
algorithms
graph-algorithms
dijkstras-algorithm
0
votes
2
query
from where we can practice different variety of programming questions related to output except previous year
answered
in
Programming in C
Nov 11, 2018
326
views
0
votes
3
GATE CSE 2018 | Question: 25
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $1234$. The minimum time (in seconds, rounded to the closet integer) before this sequence number can be used again is _________.
answered
in
Computer Networks
Nov 10, 2018
21.3k
views
gatecse-2018
computer-networks
tcp
normal
numerical-answers
1-mark
1
vote
4
GATE CSE 2018 | Question: 7
The set of all recursively enumerable languages is: closed under complementation closed under intersection a subset of the set of all recursive languages an uncountable set
answered
in
Theory of Computation
Nov 10, 2018
11.4k
views
gatecse-2018
theory-of-computation
closure-property
easy
1-mark
1
vote
5
ACE test series
(00)*+0(00)*+00(000)* regular expression represents
answered
in
Theory of Computation
Oct 23, 2018
319
views
1
vote
6
Test by Bikram | Mock GATE | Test 1 | Question: 6
What is the output of the following program? main( ) { int i=4, z=12; if( i=5 || z > 50) printf(“ Gate2017”); else printf(“ Gateoverflow”); } Gate2017 Gateoverflow syntax error Gate2017Gateoverflow
answered
in
GATE
Aug 17, 2018
1.0k
views
tbb-mockgate-1
programming
programming-in-c
0
votes
7
Test by Bikram | Algorithms | Test 2 | Question: 14
Match the following: ... S 1 - S, 2 - R, 3 - Q, 4- R, 5 - S 1 - S, 2 - P, 3 - Q, 4- R, 5 - S
answered
in
Algorithms
Aug 10, 2018
386
views
tbb-algorithms-2
1
vote
8
Test by Bikram | Algorithms | Test 2 | Question: 28
Assume Dijkstra's Algorithm is used to find the shortest paths from node G in the above graph. The total number of edges which are not included in any of the shortest paths from node G are _________.
answered
in
Algorithms
Aug 10, 2018
354
views
tbb-algorithms-2
numerical-answers
0
votes
9
GATE Overflow | Data Structures | Test 1 | Question: 27
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
answered
in
DS
Jul 16, 2018
643
views
go-ds-1
data-structures
graph-theory
numerical-answers
0
votes
10
GATE Overflow | Data Structures | Test 1 | Question: 21
A vertex having no incident edge is called --------- pendent vertex end vertex isolated vertex none of these
answered
in
DS
Jul 16, 2018
574
views
go-ds-1
data-structures
graph-theory
2
votes
11
GATE Overflow | Data Structures | Test 1 | Question: 20
Consider a complete graph on 10 vertices. Minimum no. of edge removals required to make a tree out of it will be ____
answered
in
DS
Jul 16, 2018
613
views
go-ds-1
data-structures
tree
numerical-answers
0
votes
12
GATE Overflow | Data Structures | Test 1 | Question: 16
A program takes as input a binary tree (not necessarily balanced) with $n$ nodes and computes for each node, the no. of leaf nodes in the sub-tree rooted at that node. The worst case time complexity of the program is $\Theta(n)$ $\Theta(n \log n)$ $\Theta\left(n^2 \right)$ $\Theta\left(n^2 \log n \right)$
answered
in
DS
Jul 16, 2018
1.1k
views
go-ds-1
data-structures
binary-tree
0
votes
13
GATE Overflow | Data Structures | Test 1 | Question: 17
In a class examination marks was out of 100 and there were only 1 or 2 mark questions with total 70 questions and pass mark being 36. In order to find the most repeating total mark among passed students, the appropriate data ... An array of 100 numbers An array of 70 numbers An array of 65 numbers A dynamically allocated array of 100 numbers
answered
in
DS
Jul 16, 2018
517
views
go-ds-1
data-structures
array
0
votes
14
Test by Bikram | Digital Logic | Test 2 | Question: 18
How many flip flops are required to construct a decade counter? $10$ $3$ $4$ $2$
answered
in
Digital Logic
Jul 6, 2018
337
views
tbb-digital-logic-2
0
votes
15
Test by Bikram | Digital Logic | Test 2 | Question: 16
Karnaugh map is used for the purpose of: Reducing the electronic circuits used. Mapping the given Boolean logic function. Minimizing the terms in a Boolean expression. Maximizing the terms of a given a Boolean expression.
answered
in
Digital Logic
Jul 6, 2018
428
views
tbb-digital-logic-2
0
votes
16
Test by Bikram | Digital Logic | Test 2 | Question: 10
How many minimum number of two input AND gates and two input OR gates are required to realize $Y = BD+CE+AB$ ? $2, 2$ $4, 2$ $3, 2$ $2, 3$
answered
in
Digital Logic
Jul 6, 2018
1.2k
views
tbb-digital-logic-2
0
votes
17
MadeEasy Workbook: CO & Architecture - Pipelining
We need to calculate average instruction execution time here. Actually I don't get the meaning of branch need not be taken, branch is taken. Kindly help me to solve this please! Thank You
answered
in
CO and Architecture
Jul 3, 2018
2.2k
views
made-easy-booklet
co-and-architecture
pipelining
2
votes
18
MadeEasy Test Series: CO & Architecture - Pipelining
The instruction pipeline of RISC processor has 200 instructions in which 100 are performing addition, 25 performing division and 75 performing multiplications, where Execution state for addition take 1 clock cycle,multiplication take 3 and division ... +5-1)*3 Am i doing wrong? Solution with explanation of formulae being used will be welcomed.
answered
in
CO and Architecture
Jul 3, 2018
1.9k
views
made-easy-test-series
co-and-architecture
pipelining
0
votes
19
MadeEasy Subject Test: Operating System - Process Schedule
I encountered 1 question on context switching in Made Easy test series where it is mentioned: Scheduling policy is preemptive priority. Context switch time is 1 unit. So while preempting one process and loading another should there be a 1-time unit gap or they can be done simultaneously in the gantt chart?
answered
in
Operating System
Jul 1, 2018
598
views
operating-system
made-easy-test-series
context-switch
process-scheduling
0
votes
20
Self doubt
In gate syllabus which model is in course tcp/Ip or osi model to understand concept of layering.
answered
in
Computer Networks
Jun 28, 2018
297
views
0
votes
21
P and NP
P and NP concepts are there in gate syllabus?????????????????????????????????????????????
answered
in
Algorithms
Jun 28, 2018
2.0k
views
algorithms
p-np-npc-nph
1
vote
22
Made Easy Operating System
a) X=40, Y=20 b)X=50, Y=10 c)X=30, Y=20 d)X=20, Y=30
answered
in
Operating System
Jun 27, 2018
321
views
0
votes
23
Grammar in toc
What language does the grammar with these productions generate? S->Aa A->B B->Aa
answered
in
Theory of Computation
Jun 27, 2018
326
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:...