Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
Recent questions without answers
No answer
No selected answer
No upvoted answer
Featured
Previous GATE
No answer
No selected answer
No upvoted answer
Featured
Previous GATE
0
votes
0
answers
Gateoverflow question on B+ tree  Self Doubt
https://gateoverflow.in/258022/dbmsbasictest1 Int the above question, as per the diagram, the leaves are supposed to be in level 4 and so the number of children in level 3 which equals to 27 as per calculation means the number of child pointers to level 4 that is the leaf node level is actually 27. Am I correct ?
asked
7 hours
ago
in
Databases
by
user2525
(
1.6k
points)

6
views
database
btree
0
votes
0
answers
B tree and B+ tree  Made Easy / Gateoverflow
For the below question, https://gateoverflow.in/285557/madeeasytestseriesdatabasesbtree Can anyone explain option B and option D ? I mean what they actually mean to say ?
asked
8 hours
ago
in
Databases
by
user2525
(
1.6k
points)

4
views
database
btree
indexing
0
votes
0
answers
Virtual Gate: Programming (Array)
Consider the following declaration in two dimensional array in C. char arr[100][100]; Assuming the main memory is byte addressable and the array is stored starting from memory address $0.$ ... $4050$ Why they have not calculated it in rowmajor order?? Why they put it in direct multiplication??
asked
11 hours
ago
in
Programming
by
srestha
(
247
points)

18
views
programming
0
votes
0
answers
Binary String with 5 0's and 6 1's possible, where all 0's are together.
asked
12 hours
ago
in
Combinatory
by
Abhinav993
(
173
points)

6
views
discrete_maths
permutationandcombination
+1
vote
0
answers
Virtual Gate Test Series:Programming test 2015
int main(){ int *ptr; ptr=(int*)malloc(100); printf("%d",sizeof(ptr)); return 0; } Consider the memory allocated by integer pointer $4B$. What will be output of the program?
asked
14 hours
ago
in
Programming
by
srestha
(
247
points)

9
views
programming
0
votes
0
answers
Virtual Gate Test Series:Programming
union u1{ int x; struct s1{ char ch1; union u2{ char ch2; short int var; }u3; }s2; }u4; Assume that object of type char , short int and int takes $1B,2B,4B$ respectively. The memory required for variable $u4$ is ________ Bytes. See here memory ... (2B) So total memory created will be 4+1+2=7B, isnot it?? But answer given 4B , Plz tell me where am I missing??
asked
14 hours
ago
in
Programming
by
srestha
(
247
points)

7
views
programming
0
votes
0
answers
ACE TEST SERIES: DBMS
The number of serial schedules which are view equal to schedule(s) but not conflict equal to schedule(s) are ________.
asked
16 hours
ago
in
Databases
by
Abhinav999
(
106
points)

5
views
database
0
votes
0
answers
iGate Bhillai Test: DBMS
asked
16 hours
ago
in
Databases
by
Abhinav999
(
106
points)

3
views
#testseries
0
votes
0
answers
iGate Bhilai Test 2020:dbms
asked
16 hours
ago
in
Databases
by
Abhinav999
(
106
points)

4
views
#testseries
0
votes
0
answers
Express it using logic. "There are exactly two systems that monitor every re mote server"
asked
22 hours
ago
in
Mathematical Logic
by
Bhunesh_Singh
(
102
points)

6
views
#discrete_maths
#logic
0
votes
0
answers
Which chapters should I study from the standard textbooks?
asked
1 day
ago
in
Puzzles
by
akshay7797
(
102
points)

17
views
#exam
#preperation
#books
#gate
0
votes
0
answers
Do process and threads (belong to that process) share same address space ? If yes, How?
asked
1 day
ago
in
Operating System
by
Neelam_$ingh_222
(
102
points)

2
views
operating
system
0
votes
0
answers
A draws 2 cards at random from a pack of 52 cards.
asked
1 day
ago
in
Probability
by
Shubhm
(
132
points)

14
views
probability
0
votes
0
answers
Algorithms  Time Complexity analysis
1 .Let P be the problem. Suppose that the worst case asymptotic running time complexity of P is in O($n^2$lgn) and is also in Ω(n). Now let A be an algorithm that solves P. Which of the following is correct about A: A has worstcase time ... time case complexity of an algorithm is θ(n). The Algorithm executes in time T(n) = Ω($n^2$) for every input data.
asked
1 day
ago
in
Algorithms
by
sagar2405
(
192
points)

10
views
algorithms
timecomplexity
#algorithms
0
votes
0
answers
Algorithms  Time complexity
1 .Solve the recurrence: $T(n) = 2T(\sqrt n) + log\ n$ $T(n) = T(\frac{n}{2}) + 2T(\frac{n}{4}) +n$ 2 .$f(n) = n^{1.01}$ and $g(n) = n(log\ n)^2$ then which one is true $f(n) = O(g(n))$ $f(n) = \Omega(g(n))$ $f(n) = \Theta(g(n))$ 3 . $f(n) = n^{\frac{1}{2}}, g(n) = 1$, then is it correct $g(n) = o(fn)$ {$o$ = small o Not big $O$} Please solve the above questions.
asked
1 day
ago
in
Algorithms
by
sagar2405
(
192
points)

11
views
algorithms
#algorithms
timecomplexity
0
votes
0
answers
Self Doubt: BST and Heap
What is the time required to Deletion of the smallest element from a balanced binary search tree Insertion an element in heap Will it be O(log n) or O(1) for 1st one and O(n) or O(logn) for 2nd one??
asked
1 day
ago
in
DS
by
srestha
(
247
points)

30
views
data_structure
0
votes
0
answers
Self doubt regarding error control
Is 2D parity scheme for error control techniques in GATE CSE 2020 Syllabus? Because in 2008 IT paper it was asked? Do i need to practice the questions related to the concept of 2D parity??
asked
1 day
ago
in
Computer Networks
by
vg653
(
104
points)

6
views
0
votes
0
answers
Sorting algorithm
An unsorted array of n elements is given to you and you have to print largest 10% of them. This can be done on time O(1) O(n) O(logn) O(nlogn)
asked
2 days
ago
in
Algorithms
by
sagar2405
(
192
points)

20
views
algorithms
programming
#algorithms
algorithum
0
votes
0
answers
Why T=2*tpd In the answer and total no: of gate is not odd also!
asked
2 days
ago
in
Digital Logic
by
kalra05
(
112
points)

11
views
#gatepreparation
#dlc
0
votes
0
answers
It is CFL or not
It is CFL or not $\{wa^n w^r \ w\ \in (a+b)^*, n>=0 \}$
asked
2 days
ago
in
Theory of Computation
by
Sandeep Verma
(
102
points)

17
views
theoryofcomputation
contextfreelanguages
0
votes
0
answers
Should I cover HDL for gate exam?
asked
2 days
ago
in
Digital Logic
by
Hyp209
(
102
points)

6
views
0
votes
0
answers
What is the difference between Computer organization and Computer Architecture?
asked
2 days
ago
in
CO & Architecture
by
commenter commenter
(
126
points)

4
views
0
votes
0
answers
f(m,n) { ans = 1; count = 0; while (ans <= m) { count = count + 1; ans = ans * n; } return(count) }
asked
2 days
ago
in
Algorithms
by
Karlasravani
(
102
points)

10
views
0
votes
0
answers
How many 5 digit positive integers possible with 2,3,and5
asked
2 days
ago
in
Mathematical Logic
by
Ammulucky
(
102
points)

8
views
permutation&combination
0
votes
0
answers
View Serializability
Can someone write the entire steps and rules of polygraph test to check view serializability. P.S. : Kindly, dont give me links. Please write the rules in a stepwise manner if known.
asked
2 days
ago
in
Databases
by
user2525
(
1.6k
points)

5
views
database
transactions
0
votes
0
answers
on which interface will an IP packet with destination address 144.25.64.120 be forwarded
asked
2 days
ago
in
Computer Networks
by
Jayasoorya
(
103
points)

7
views
#selfdoubt
0
votes
0
answers
ACE Test Series  Normalization
Regarding statement Q, I don’t think it will violate 3NF because whatever be the R.H.S. if L.H.S. is superkey, then it is in BCNF and ultimately in 3NF. Therefore, it is allowed in 3NF and so the statement is supposed to be right. Is my approach correct ?
asked
2 days
ago
in
Databases
by
user2525
(
1.6k
points)

12
views
database
normalization
0
votes
0
answers
Made easy Test series!!
asked
3 days
ago
in
Digital Logic
by
kalra05
(
112
points)

6
views
0
votes
0
answers
Programming : Self doubt
1)void main(int n){ if(n==0) return; main(n); printf("%d",n); //return n; this line maynot exists } 2)void main(int n){ if(n==0) return; main(n); printf("%d",n); //return n; this line maynot exists } Suppose when $n=4$ Here, 2nd program will print infinite loop. right?? What 1st program will print 1,2,3 or 1,1,1. ??
asked
3 days
ago
in
Programming
by
srestha
(
247
points)

26
views
programming
0
votes
0
answers
self doubtrelative addressing mode
Can anyone tell me what is the format of relative addressing mode instructions in 8086 microprocessor?
asked
3 days
ago
in
CO & Architecture
by
Doraemon
(
139
points)

4
views
coandarchitecture
0
votes
0
answers
array self doubts
{ char str1[] = "altamashs"; char str2[] = {'a', 'l', 't', 'a', 'm', 'a', 's', 'h', 's'}; int n1 = sizeof(str1)/sizeof(str1[0]); int n2 = sizeof(str2)/sizeof(str2[0]); printf("n1 = %d, n2 = %d", n1, n2); return 0; } IN str1 we should consider null so its length=10 and in str2 only given so length=9
asked
3 days
ago
in
Programming
by
altamash
(
139
points)

4
views
0
votes
0
answers
C PROGRAMMING QS
What will be the output of the following program? #include<stdio.h> int print 1(void) { static int x=10; x+=5; return x; } int print 2(void) { static int x X=10; x+=5; return x; } int main() { int x; x=print 1(); x+=print 1(); x+=print 2(); x+=print 2(); printf(“%d”,x); return 0; }
asked
3 days
ago
in
Programming
by
Ritabrata Dey
(
242
points)

9
views
cprogrammingforgate
0
votes
0
answers
Virtual Gate :Programming question
Assume that there are two lower triangular matrices $A$ and $B$ of size $n*n$. If matrix $A$ and transpose of $B$ are fit into a rectangular matrix $C$ of size $n*(n+1)$, then $B[i,j]=C[i,j+1]$ $B[i,j]=C[j+1,i]$ ... $1$ position in new matrix. right?? So, Ans $2)$ right??
asked
3 days
ago
in
Programming
by
srestha
(
247
points)

8
views
programming
0
votes
0
answers
Lossless Decomposition  Self Doubt
https://gateoverflow.in/208190/lossyorlossless In the above question : FDs are AB→C,AC→B,AD→E,B→D,BC→A,E→G. R1 ( ABC ) : AB → C AC → B BC → A R2 ( ACDE ) : AD → E R3 ( ADG ) has empty FDs. So, the above decomposition is not ... a key order to check lossless decomposition ? Do we have 2 consider the closure of original fds to prove AD as key for R3 ( ADG ) ?
asked
3 days
ago
in
Databases
by
user2525
(
1.6k
points)

9
views
database
normalization
0
votes
0
answers
Self Doubt  3NF Decomposition
I know that BCNF may not satisfy dependency preserving but it should be lossless. So, when we are decomposing a relation for satisfying BCNF, we don’t care about the dependency preservation condition. But what about 3NF ? Is it compulsory to check for dependency preservation condition after a table has been decomposed to satisfy 3NF ?
asked
3 days
ago
in
Databases
by
user2525
(
1.6k
points)

14
views
database
normalization
0
votes
0
answers
Made easy test series  Algorithm
How to do find 0/1 knapsack in minimum time?
asked
4 days
ago
in
Algorithms
by
sagar2405
(
192
points)

13
views
programming
#testseries
#algorithms
0
votes
0
answers
If first sorted list has m element,second sorted list has n element,then what is the total maximum mergable sequence?
asked
4 days
ago
in
Programming
by
Specledace
(
102
points)

10
views
0
votes
0
answers
proof n= O(nlogn) ....can any one explain the proof?
asked
4 days
ago
in
Algorithms
by
subhadip997
(
105
points)

7
views
algorithms
0
votes
0
answers
Which data strucure will overflow even if the number of element is less than its size?
asked
4 days
ago
in
Programming
by
him0000
(
107
points)

15
views
0
votes
0
answers
differentiate between stack and accumulator based cpu organization
asked
4 days
ago
in
CO & Architecture
by
yajas
(
102
points)

1
view
Page:
1
2
3
4
...
11
next »
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
All categories
General Aptitude
Engineering Mathematics
Digital Logic
Programming & DS
Algorithms
Theory of Computation
Compiler Design
Operating System
Databases
CO & Architecture
Computer Networks
Non GATE
Others
Admissions
Exam Queries
Tier 1 Placement Questions
Job Queries
Projects
Recent questions without answers
932
questions
596
answers
1,885
comments
81,474
users