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 Aboveallplayer
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Aboveallplayer
0
votes
0
answers
1
IIIT Allahabad Query
if i opt for a integrated Phd in IIIT-A 1.will i also get a Mtech after completion of the degree?or only phd? 2.what will i miss ?(apart from the fact that i will miss a chance of phd from IIT)) given:Placement is not my concern
asked
in
Written Exam
Mar 27, 2017
432
views
0
votes
3
answers
2
gate 2017 cs just doubt
does Random page replacement algorithm suffers from belady's anomaly?
asked
in
Operating System
Feb 11, 2017
3.1k
views
0
votes
1
answer
3
Throughput of memory system---urgent
How to calulate the Throughput of memory system when average access time is given
asked
in
CO and Architecture
Feb 10, 2017
362
views
memory-management
computer-networks
0
votes
1
answer
4
YACC-
in case of shift-reduce and R-R conflict, which is favored by YACC?
asked
in
Compiler Design
Feb 3, 2017
465
views
compiler-design
parsing
lr-parser
descriptive
1
vote
1
answer
5
Time Complexity
main() { int (b=1;b<=n;b*=2) { for(i=0;i<b;i++) { for(j=0;j<n;j+=2) { sum+=j; } for(j=0;j<n;j*=2) { sum*=j; } } } what is the complexity? }
asked
in
Algorithms
Jan 30, 2017
1.5k
views
time-complexity
algorithms
asymptotic-notation
0
votes
1
answer
6
TOC grammar
we know that for every RE language,there exist an unrestricted grammar...can we claim the opposite also?? (i.e for every Unrestcd grammar,there exist a RE)?
asked
in
Theory of Computation
Jan 27, 2017
380
views
theory-of-computation
0
votes
1
answer
7
TOC Language Property Discussion
Here are some fundamental questions that i am a bit doubtful 1.Regular languages are closed under a)infinite Union b)infinite intersection or not? 2.what is the intersection of CFL and a Regular Language
asked
in
Theory of Computation
Jan 27, 2017
303
views
1
vote
1
answer
8
Binary search tree construction Doubt
What is the worst case time complexity to construct a binary search tree.??? Now i know ,that if a BST is left or right-skewed, searching an element takes O(n) time.so suppose i want to insert 10,25,30,35,40 in a bst.. it will be completely right skewed.. So when ... so overall work =0+1+2+...+(n-1)=N(n-1)/2= O(n2) Am i correct here?? or it is O(nlogn)
asked
in
DS
Jan 25, 2017
2.1k
views
binary-search-tree
data-structures
0
votes
0
answers
9
Toc decidability
which of the following is decidable? a)the set of TM whose language contains 0* b) the set of all TM who accept same string after visiting atmost 100 distinct Tape cell c)set of Tm that generate same language answer given A; now my question is why B is not decidable???(i dont think it is same as equivalence of TM)
asked
in
Theory of Computation
Jan 22, 2017
220
views
theory-of-computation
decidability
bad-question
0
votes
1
answer
10
MadeEasy Subject Test: Operating System - Process Schedule
I.waiting time gets longer if short process,falls behind long process II.it is always not good for time sharing system,where each process gets equal time share write true/false my question is 2nd one may not be true,if arrival time ... does not matter everyone is getting a share in slice so my answer is TF, is it correct answer given TT
asked
in
Operating System
Jan 21, 2017
280
views
made-easy-test-series
operating-system
process-scheduling
12
votes
1
answer
11
C programming
#include <stdio.h> int f(int *a,int b) { b = b-1; if(b == 0) return 1; else { *a = *a+1; return *a + f(a,b) ; } } int main() { int X = 5; printf("%d\n",f(&X,X)); } Predict the output If the return statement was return f(a,b)+ *a ; What would have been the output here ? Explain why there is change in output (if any)
asked
in
Programming in C
Jan 20, 2017
3.4k
views
programming-in-c
1
vote
1
answer
12
MadeEasy Subject Test: Algorithms - Time Complexity
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtree-max height of right subtree what is the time complexity?
asked
in
DS
Jan 20, 2017
892
views
data-structures
binary-tree
time-complexity
made-easy-test-series
1
vote
1
answer
13
Floating point number
what is the hexadecimal representation of the floating point number (-48.625) in single precision, after rounding off and normalisation
asked
in
CO and Architecture
Jan 18, 2017
1.8k
views
floating-point-representation
co-and-architecture
ieee-representation
number-representation
5
votes
2
answers
14
Testbook
int x=0; int A(n) { statement //takes O(1) time if(n==1) return 1; else { $X+=8.A\left ( \frac{n}{2}\right )+n^3$; } return X; } What is the time complexity f the above code?
asked
in
Algorithms
Jan 15, 2017
1.5k
views
time-complexity
algorithms
testbook-test-series
3
votes
6
answers
15
Testbook Test Series: Computer Networks - Sliding Window
packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets? my answr 18 given :20
asked
in
Computer Networks
Jan 15, 2017
2.2k
views
computer-networks
testbook-test-series
sliding-window
3
votes
1
answer
16
Time Complexity
what is the tightest upper bound of T(n)=T(n-1)+2n
asked
in
Algorithms
Jan 8, 2017
1.6k
views
algorithms
recurrence-relation
2
votes
2
answers
17
Combinatorics Doubt
A box contain 10 screws out of which 3 are defective.If two screws are drawn at random WITH REPLACEMENT.What is the probability that no screw is defective? Answer given as 7c2/10C2 my question is ,as its given With Replacement. So why not it is (7/10)*(7/10)
asked
in
Combinatory
Jan 4, 2017
1.0k
views
1
vote
1
answer
18
Time Complexity
What is the time complexity of this? for(i=1;i<=n;i=i*2) { for(j=0;j<i;j++) {temp=temp+i;} }
asked
in
Algorithms
Jan 4, 2017
215
views
time-complexity
1
vote
0
answers
19
Recurrence Relation-Counting technique
How to solve this equation an+2-5an+1+6an=2 where a0=1 and a1=2 i know how to solve if it is 0 in RHS, but how to take care of this 2?
asked
in
Combinatory
Jan 1, 2017
299
views
2
votes
1
answer
20
UNIX i-node3
consider a unix file system impleneted with i-node,that resides on a disk of size 512GB.Each i-node has atotal of 15 block addresses,consisting of direct and indirect block adresses. suppose we configure a file system to use a block size of 32KB.How many bytes are needed to store all 15 block addresses in an i-node? a)15byte b)29byte c)45byte d)75byte
asked
in
Operating System
Dec 31, 2016
966
views
inode
unix
operating-system
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
(24)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(682)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
243k
comments
79.6k
users
Recent Blog Comments
Hlo I'm Rupesh I got AIR 3485 in gate CS and AIR...
@Ajay Sasank here is the direct link...
Thank you for the post didi My GATE 2023 & 2024...
I Hope it helps 😊
Today's best post I seen thank you for motivation