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 once_2019
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by once_2019
0
votes
0
answers
1
exam query-UPPCL
There is no option for choice of exam city in uppcl form.On what basis they will allocate centers.Any idea ?
asked
in
Job Queries
Nov 28, 2018
229
views
0
votes
0
answers
2
how long does it take for a bit to travel from the beginning to the end of the network?
Suppose the length of a 10Base5 cable is 2500 m. If the speed of propagation in a thick coaxial cable is 200,000,000 m/s, how long does it take for a bit to travel from the beginning to the end of the network? ... 500 meters? A. 26.5 micro seconds B. 52.5 microseconds C. 47.5 micro seconds D. 37.5 micro seconds
asked
in
Computer Networks
Oct 7, 2018
3.4k
views
computer-networks
0
votes
1
answer
3
data link layer
An upper-layer packet is split into 5 frames, each of which has an 90% chance of arriving undamaged. If no error control is done by the data link protocol, how many times must the message be sent on average to get the entire thing through? A. 2.1 B. 1.9 C. 1.7 D. 2.4
asked
in
Computer Networks
Oct 7, 2018
525
views
computer-networks
data-link-layer
0
votes
1
answer
4
data structure
asked
in
Programming
Aug 4, 2018
129
views
data-structures
0
votes
1
answer
5
logic and predicate
asked
in
Mathematical Logic
Jul 14, 2018
239
views
0
votes
1
answer
6
regular expressions
asked
in
Theory of Computation
Jul 8, 2018
283
views
theory-of-computation
regular-expression
0
votes
2
answers
7
Time complexity
To construct binary search tree either from preorder or postorder what is the efficient time complexity ? can we construct unique BST along with post and preorder ?Then what is the significance of using PRE+INORDER or POST+INORDER
asked
in
Programming
Jul 8, 2018
372
views
time-complexity
0
votes
1
answer
8
trees data structure
Is the root node an internal node?
asked
in
Programming
Jun 24, 2018
344
views
data-structures
tree
programming-in-c
1
vote
1
answer
9
Time complexity
show how to sort n number in the range [0,n^2-1] in O(n)time?
asked
in
Algorithms
May 8, 2018
197
views
time-complexity
algorithms
1
vote
1
answer
10
hashing
A hash table is used when number of keys actually stored it any point of time is small as compared to the number of possible keys. please explain this line with suitable example.
asked
in
Programming
May 5, 2018
234
views
hashing
data-structures
0
votes
1
answer
11
Asymtotic notation
Big Omega question : 5n+3>=C2n for which value of c and n condition satisfies?
asked
in
Algorithms
Apr 17, 2018
154
views
asymptotic-notations
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
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
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
+1
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...