Awesome q2a theme
Ask us anything
Toggle navigation
Email or Username
Password
Remember
Login
Register
|
I forgot my password
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Blogs
Previous Year
Exams
Recent questions tagged selfdoubt
0
votes
1
answer
Applied GATE test series
Que Consider a circular queue which is of capacity 100 elements and is implemented on an array a[0...99], at a particular instant the front pointer is pointing to index 20 and the rear is pointing at index 10 the number of elements present in the queue is. 10 90 91 None
asked
21 hours
ago
in
DS
by
_tourist_
(
5
points)
|
23
views
test-series
selfdoubt
0
votes
0
answers
Self doubt in instruction execution cycle /(CO) computer organization
asked
1 day
ago
in
CO & Architecture
by
Kavya sharma
(
11
points)
|
10
views
selfdoubt
+1
vote
0
answers
Self-doubt sum series and logaritms.
These are what i ended up with while solving a couple of recurrance relation can anyone help to solve further. $(n^2) log(n/2^{k-1}) + 2(n^2) log(n/2^{k-2}) + 3(n^2) log(n/2^{k-3}) + ...+ (n^2) log(n)$ $2. lg n + lg (n / 2) + lg (n / 4) + ... + lg (n / 2^{lg n})$ Note: Assume base 2 for log terms.
asked
2 days
ago
in
Mathematical Logic
by
donniedarko
(
21
points)
|
18
views
selfdoubt
0
votes
0
answers
Made easy booklet
Bag contains 5 black, 2 red and 3 white marbles. Three marbles are drawn simultaneously. Find probability that they're of different colour
asked
2 days
ago
in
Probability
by
farazbukhari0
(
5
points)
|
21
views
selfdoubt
0
votes
0
answers
Self Doubt Disks
when solving questions of disks 10KB is 1024*10B or 1000*10B? different sources are telling different things,even same sources are telling different things at different time.
asked
3 days
ago
in
Operating System
by
Nitinkumar.097
(
13
points)
|
13
views
selfdoubt
disks
0
votes
1
answer
Self doubt :Time Complexity -Iterative
Can Someone help me understand the time-complexity of dependent loops? for example, Q1> int i,j; for(i=1;i<n;i=i++) { for(j=1;j<=i;j=j*2) } Q2> int i,j; for(i=1;i<=n/2;i=i++) { for(j=1;j<=i;j++) }
asked
3 days
ago
in
Algorithms
by
donniedarko
(
21
points)
|
14
views
time-complexity
selfdoubt
+1
vote
1
answer
Tga test series
asked
4 days
ago
in
Digital Logic
by
Enolx.21
(
25
points)
|
12
views
selfdoubt
0
votes
0
answers
Tga mock test
MSQ Type question.
asked
5 days
ago
in
Digital Logic
by
Enolx.21
(
25
points)
|
16
views
selfdoubt
0
votes
0
answers
Database management systems
If a schedule is given and it is asked whether the given schedule is serializable or not, is it asking about conflict serializability or view serializability? And when it is asked about the precedence graph, is it about the precedence graph that we draw to check conflict serializability or the one for view serializability?
asked
6 days
ago
in
Databases
by
Abhilash Behera
(
5
points)
|
10
views
selfdoubt
0
votes
0
answers
Computer network (self doubt)
In datagrams fragmentation occurs at routers. What about in virtual circuits? As CPU bandwidth and buffers are reserved, is there a chance for fragmentation to occur in router?
asked
Jan 9
in
Computer Networks
by
Kishore7
(
5
points)
|
8
views
computernetwork
test-series
cidr
selfdoubt
0
votes
0
answers
General query on Gate preparation
How to start preparing for Gate 2022, I am second year engineeering Student ? i know this is a basic question , but whenever take those big books of dbms of sudharson,ds of kenneth rosen , i don’t thinks i cannot cover them,even when i start reading i cannot understand much , how ,where should i start preparing?
asked
Jan 9
in
Others
by
sheikh haji
(
5
points)
|
14
views
selfdoubt
0
votes
0
answers
AVL PREVIOUS YEAR DATA STRUCTURE SELF DOUBT
https://gateoverflow.in/86224/gate1990-13a for tym complexity ..is it like …..n times we need to search position so O(nlogn) n insertion so O(n) and only two rotation so O(logn)...because i m not rotating for each iteration just doing at last so overall O(nlogn)...please look...
asked
Jan 8
in
DS
by
eyeamgj
(
25
points)
|
8
views
selfdoubt
0
votes
0
answers
tifr previous year self doubt loop invariant
https://gateoverflow.in/19251/tifr2010-b-37 by counter example like for a= 2 and b =1 the loop does not terminate thus remaining options are A and D. But I'm having problem getting D as answer my answer is A as at any random example say a ... *b , so I go with Option A. considering this comment of the.brahmin.guy how it is not terminating using a=2 nd b
asked
Jan 8
in
Programming
by
eyeamgj
(
25
points)
|
16
views
selfdoubt
0
votes
0
answers
OS doubt:TestBook test
A virtual memory with 64 bit virtual address, a 43 bit physical address, a page size 32 KB. TLB with 32 entries. Each TLB entries has TLB tag, physical frame number +3 protection bits. Assume that TLB tag doesnot store any process id. How many bits required for the TLB if TLB is 4 way set associative? Ans given 2464 bits. Is it correct?
asked
Jan 6
in
Operating System
by
srestha
(
1k
points)
|
56
views
selfdoubt
operatingsystem
+1
vote
1
answer
Gate Academy
Q.Considerhe following program segment hypothetical CPU have three resistors r1 r2 and r3 | Instruction operation Instruction size (in word) Mov r1,5000 r1<- memory [5000] 2 Mov r2(r3) r2<- memory [r1] 1 Add r2 r3 r2<- r2+r3 1 Mov 6000 ... cycle per word Instruction fetch and decode: 2 clock cyxle per word The total number of clock cycle required to execute the program is?
asked
Jan 6
in
CO & Architecture
by
Enolx.21
(
25
points)
|
30
views
selfdoubt
0
votes
0
answers
Self doubt on decidability of turing machine and dfa
asked
Jan 5
in
Theory of Computation
by
meivinay
(
5
points)
|
41
views
decidability
turing-machine
selfdoubt
+2
votes
0
answers
https://gateoverflow.in/204076 gate 2008 question on structure
asked
Jan 4
in
Programming
by
jainanmol123
(
13
points)
|
19
views
selfdoubt
0
votes
1
answer
Gate previous year question
Q. Let Q denote a queue containing 16 numbers and S be an empty stack. Head(Q) returns the element at the head of queue Q without removing it from Q. similarly Top(S) returns the element at the top of S without removing it from S. consider ... else x:=Pop(S); Enqueue(Q,x); end end The maximum possible number of iteration of the while loop in the algorithm is_________
asked
Jan 1
in
DS
by
Enolx.21
(
25
points)
|
21
views
selfdoubt
0
votes
1
answer
The Gate Academy Material
Q. What does the following program do when the input is unsigned 16-bit integer? #include<stdio.h> main() { unsigned int num; int i; scanf("%u",&num); for(i=0;i<16;i++) { printf("%d.",(num << i&1 <<15 ... all even bits from num (B) it prints all odd bits from num (C) it prints binary equivalent of num (D) none of the above
asked
Dec 30, 2020
in
Programming
by
Enolx.21
(
25
points)
|
15
views
selfdoubt
0
votes
0
answers
Intermediate 3 address code generation doubt related to unary operators in an arithmetic expression
asked
Dec 30, 2020
in
Compiler Design
by
rish-18
(
9
points)
|
35
views
compiler-design
selfdoubt
3-address-code
madeeasytest
0
votes
0
answers
Made easy: IP data field can contain which of these?
asked
Dec 29, 2020
in
Computer Networks
by
ytheuyr
(
7
points)
|
16
views
selfdoubt
0
votes
1
answer
Number system,Gate-2021, previous year Gate questions
asked
Dec 29, 2020
in
Compiler Design
by
Km. Shweta Bhardwaj
(
5
points)
|
26
views
selfdoubt
0
votes
0
answers
PREVIOUS YEAR MATHS SELF DOUBT
https://gateoverflow.in/1925/gate2014-1-47 WHY THE B CANT BE ANSWER IF WE DO THE SAME WAY WE DID FOR A AND D? PLEASE SEE...
asked
Dec 29, 2020
in
Calculus
by
eyeamgj
(
25
points)
|
12
views
selfdoubt
0
votes
0
answers
Algorithm:Doubt
Which of the following sorting algorithm gives the same number of swaps as that of the total inversion count in the array? Quick sort Selection sort Merge Sort Bubble Sort
asked
Dec 28, 2020
in
Algorithms
by
val_pro20
(
2
points)
|
18
views
algorithms
selfdoubt
0
votes
1
answer
self doubt ambiguous to unambiguous
https://gateoverflow.in/141809/ambiguous-to-unambiguous what will be the unambiguous grammar …...
asked
Dec 28, 2020
in
Compiler Design
by
eyeamgj
(
25
points)
|
13
views
selfdoubt
0
votes
0
answers
Self doubt from graph coloring
A graph which not having even length cycle then 3 color are sufficient to color vertices of graph such that no two adjacent vertex having same color?
asked
Dec 27, 2020
in
Graph Theory
by
Vaishali Trivedi
(
5
points)
|
20
views
selfdoubt
0
votes
2
answers
TOC- closure properties of RL
let L1=a^n (which is a regular language) and L2=b^n (which is also a regular language) L1.L2 is also regular.. how?? as (a^nb^n) is not a regular language
asked
Dec 26, 2020
in
Theory of Computation
by
Updesh Singh
(
5
points)
|
44
views
selfdoubt
toc-languages
0
votes
0
answers
Pre increment and post increment
int main() { int x=8,y=1; while(x>=y) { x=--x-x--; y=--y-y++; } printf("%d %d",y,x); what is the output?? please give detail solution.
asked
Dec 26, 2020
in
Programming
by
Manasi_123
(
5
points)
|
10
views
selfdoubt
0
votes
0
answers
GATE YEAR 2013
A long thin walled cylindrical shell, closed at both the ends, is subjected to an internal pressure. The ratio of the hoop stress (circumferential stress) to longitudinal stress developed in the shell is
asked
Dec 24, 2020
in
GATE
by
phanendra kumar
(
5
points)
|
9
views
selfdoubt
0
votes
0
answers
Is one year enough to crack gate 2022 ?
asked
Dec 23, 2020
in
GATE
by
Akshay0798
(
5
points)
|
13
views
selfdoubt
0
votes
1
answer
#selfdoubt #regular_toc_languages
asked
Dec 21, 2020
in
Theory of Computation
by
gajendercse
(
41
points)
|
26
views
selfdoubt
toc-languages
0
votes
1
answer
Self doubt - digital logic
K-map 0 1 0 0 0 1 X 0 0 X X 0 0 0 0 0 X= don’t care Derive the minimum Sum-of-Product form for this.
asked
Dec 17, 2020
in
Digital Logic
by
Abhishek pratap Sing
(
5
points)
|
19
views
selfdoubt
digital-logic
0
votes
1
answer
PYQ Doubt. source: https://gateoverflow.in/863/gate2002-10
asked
Dec 16, 2020
in
CO & Architecture
by
Abhilash Behera
(
5
points)
|
23
views
selfdoubt
self-doubt
0
votes
1
answer
Is it possible to score 50+ in GATE CSE 2021 in less than 2 Months of preparations?
asked
Dec 16, 2020
in
Revision
by
Sayan Kumar Khan
(
5
points)
|
54
views
selfdoubt
+1
vote
1
answer
self doubt(first and follow/left recursion)
(1)S->AA/ab A->Bd/null B->SB/d (2) S->AB/a A->SA/null B->AB/d doubt 1--->i can’t able to remove indirect left recursion from both the questions,what is grammar after removing left recursion?? doubt 2--->what is the FIRST and FOLLOW ?
asked
Dec 15, 2020
in
Compiler Design
by
vrajdobariya
(
9
points)
|
24
views
selfdoubt
first-follow
0
votes
1
answer
theory of computation
Can some one identify what is the language&PDA for this CFG & is it DCFL / NCFL ? E->E+E E->E*E E->id
asked
Dec 14, 2020
in
Theory of Computation
by
vrajdobariya
(
9
points)
|
22
views
toc-languages
selfdoubt
0
votes
1
answer
#Self_Doubt #Turing_Machine
Let's Suppose we have L such that there exists a Turing Machine that enumerates the elements of L in proper order. If this is the case, can we say that it means L is recursive?
asked
Dec 13, 2020
in
Theory of Computation
by
Vishal_kumar98
(
37
points)
|
13
views
selfdoubt
0
votes
0
answers
Explain Cycle Stealing in DMA?
Can you give me any sources that explain what cycle stealing is? Or explain it?
asked
Dec 9, 2020
in
CO & Architecture
by
siddharths067
(
10
points)
|
11
views
selfdoubt
0
votes
0
answers
Regarding Direct PhD Admission IIT-Hyderabad CSE
I got the offer from IIT-Hyderabad Direct PhD after Btech in CSE Department (MHRD) in Systems area. I have a deadline to accept/Decline the offer on or before 10 Dec 2020. I also applied for Mtech (RA) program which is (Project ... I do know. if any one is doing PhD from CSE kindly suggest me what to do now? your suggestion is highly appreciated
asked
Dec 9, 2020
in
IIITs
by
Sgr007
(
21
points)
|
16
views
selfdoubt
0
votes
0
answers
https://www.gatevidyalay.com/go-back-n-practice-problems/
asked
Dec 9, 2020
in
Computer Networks
by
bj293
(
5
points)
|
10
views
computernetwork
selfdoubt
Page:
1
2
3
4
...
6
next »
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Recent Posts
New GATEOverflow PDFs
Guidelines to users
No Recent Blog Comments
8,957
questions
3,118
answers
14,337
comments
95,787
users