menu
search
Log In
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 questions tagged self-doubt

0 votes
0 answers 4 views
[SELF DOUBT] DSA BUBBLE SORT
is bubble sort an online algorithm? cause whenever new element is fed, it can be take to its place by swapping the adjacent numbers. is my thinking right?
is bubble sort an online algorithm? cause whenever new element is fed, it can be take to its place by swapping the adjacent numbers. is my thinking right?
asked 1 day ago in Algorithms rythmrana 5 points 4 views
0 votes
0 answers 4 views
Book name:- computer networking top down approach
I am reading packet switching vs circuit switching from computer networking a top down approach(pg no. 57) . I came across an example: Suppose there are 10 users and that one user suddenly generates one thousand 1000-bit packets, while other ... . Now I don,t know how author got 10s as answer while i am getting 100s as answer. Kindly help.
I am reading packet switching vs circuit switching from computer networking a top down approach(pg no. 57) . I came across an example: Suppose there are 10 users and that one user suddenly generates one thousand 1000-bit packets, while other users remain quiescent and don't ... data has been transmitted. Now I don,t know how author got 10s as answer while i am getting 100s as answer. Kindly help.
asked 1 day ago in Computer Networks saurabh0709 5 points 4 views
0 votes
0 answers 4 views
[SELF DOUBT] DSA INSERTION SORT
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?
asked 2 days ago in Algorithms rythmrana 5 points 4 views
0 votes
0 answers 3 views
self doubght
what is difference between preemption and inturrupts on process state diagram
what is difference between preemption and inturrupts on process state diagram
asked 2 days ago in Operating System Sachin85 5 points 3 views
0 votes
0 answers 4 views
[SELF DOUBT] DSA , IN PLACE SORTING
if we require a large(more than size of array or 1000000mb) but constant( irrespective of size of input array) extra space for an algorithm, will the algorithm be in place or not? the extra space is not required to manipulate the elements of array but may be required for some other purpose.
if we require a large(more than size of array or 1000000mb) but constant( irrespective of size of input array) extra space for an algorithm, will the algorithm be in place or not? the extra space is not required to manipulate the elements of array but may be required for some other purpose.
asked 2 days ago in Algorithms rythmrana 5 points 4 views
0 votes
0 answers 4 views
Probability books name :- Sheldon m. Ross
"Normal distribution" :- probability density function f(x) =1/√2π σ e^-(x- μ )^2/( σ ) ^2. My question is, why are use √2π as constant. Please explain in details.
"Normal distribution" :- probability density function f(x) =1/√2π σ e^-(x- μ )^2/( σ ) ^2. My question is, why are use √2π as constant. Please explain in details.
asked 5 days ago in Probability Ajitgate21 5 points 4 views
0 votes
0 answers 5 views
Process management
In state transition diagram of scheduling if there is transition from running to ready then it will be preemptive scheduling otherwise not?? My doubt is if process request for io then it will move to blocked state and after completion then it will be pushed to ready state and again can go to running the. It also should be preemptive scheduling na !! Plz clear this doubt.
In state transition diagram of scheduling if there is transition from running to ready then it will be preemptive scheduling otherwise not?? My doubt is if process request for io then it will move to blocked state and after completion then it will be pushed to ready state and again can go to running the. It also should be preemptive scheduling na !! Plz clear this doubt.
asked Jun 12 in Operating System Vink7389 9 points 5 views
0 votes
0 answers 3 views
Go Back N flow control
I had a doubt regarding one scenario in Go Back N flow control algorithm. Consider the following scenario shown in the image The left hand side is the sender and the right hand side is the reciever. I referred to Kurose Ross Extended FSM Description of GBN sender ... window(packets 1, 2 and 3). Is this correct? Can such a scenario even occur in real life? Thanks in advance.
I had a doubt regarding one scenario in Go Back N flow control algorithm. Consider the following scenario shown in the image The left hand side is the sender and the right hand side is the reciever. I referred to Kurose Ross Extended FSM Description of GBN sender and reciever ... the entire window(packets 1, 2 and 3). Is this correct? Can such a scenario even occur in real life? Thanks in advance.
asked Jun 12 in Computer Networks punter147 5 points 3 views
0 votes
0 answers 3 views
GATE previous year question
consider a direct mapped cache of 8 blocks used to implement the following program segment float a[10][10]; int i; for(i=0;i<10;i++) for(j=0;j<10;j++) a[i][j]=8.0; float element occupies 4 bytes, the block size is 12 bytes and ... in row-major form. Find the number of hits. also, if the array was stored in coloumn-major, What the number of hits would've been?
consider a direct mapped cache of 8 blocks used to implement the following program segment float a[10][10]; int i; for(i=0;i<10;i++) for(j=0;j<10;j++) a[i][j]=8.0; float element occupies 4 bytes, the block size is 12 bytes and array is stored in row-major form. Find the number of hits. also, if the array was stored in coloumn-major, What the number of hits would’ve been?
asked Jun 12 in CO & Architecture donniedarko 39 points 3 views
0 votes
0 answers 9 views
Self Doubt(Digital Logic)
Maximum how many number of functions are possible so that F(x,y,z) = F(x,y’,z) ?
Maximum how many number of functions are possible so that F(x,y,z) = F(x,y’,z) ?
asked Jun 5 in Digital Logic Kartik Goyal 5 points 9 views
0 votes
1 answer 13 views
self doubt regarding the full binary tree
This is in regards to Binary tree. The question is The image given below is full binary tree or not?
This is in regards to Binary tree. The question is The image given below is full binary tree or not?
asked Jun 5 in Algorithms rish1602 9 points 13 views
0 votes
0 answers 8 views
DBMS Serializability
Consider the following (incomplete) schedule S: T1:R(X), T1:R(Y), T1:W(X), T2:R(Y), T3:W(Y), T1:W(X), T2:R(Y) If all three transactions eventually commit, show the serializability graph.
Consider the following (incomplete) schedule S: T1:R(X), T1:R(Y), T1:W(X), T2:R(Y), T3:W(Y), T1:W(X), T2:R(Y) If all three transactions eventually commit, show the serializability graph.
asked Jun 3 in Databases Lekhraj 9 points 8 views
1 vote
0 answers 11 views
#self_doubt #graph_theory
If a Graph G is Eulerian then all nodes will have Even degree But is the reverse True i.e. for any graph G’ if nodes of G’ have even degrees then G’ is Eulerian?
If a Graph G is Eulerian then all nodes will have Even degree But is the reverse True i.e. for any graph G’ if nodes of G’ have even degrees then G’ is Eulerian?
asked Jun 3 in Mathematical Logic Palash Nandi 1 13 points 11 views
1 vote
1 answer 16 views
Tga test series
It is 2NF or not ? Just explain this portion.
It is 2NF or not ? Just explain this portion.
asked Jun 2 in Databases Enolx.21 53 points 16 views
0 votes
0 answers 8 views
Indexing (DBMS)
Lets suppose, we define a schema with no primary key but there is an attribute(s) with unique and not null constraints. Now default indexing i.e primary indexing is not possible here because of no primary key. Now, at the time of Database design, ... necessary to input records in sorted order? or is there any other way possible to apply clustering index over a given database file?
Lets suppose, we define a schema with no primary key but there is an attribute(s) with unique and not null constraints. Now default indexing i.e primary indexing is not possible here because of no primary key. Now, at the time of Database design, If i write ... is it necessary to input records in sorted order? or is there any other way possible to apply clustering index over a given database file?
asked May 30 in Databases bhardwaj.aakash_420 5 points 8 views
0 votes
0 answers 8 views
#Ullman #RegularLanguage
It is clear than alt(L,M) is L = {(ab)+}. So dfa is possible but How to prove it formally?
It is clear than alt(L,M) is L = {(ab)+}. So dfa is possible but How to prove it formally?
asked May 29 in Theory of Computation Palash Nandi 1 13 points 8 views
1 vote
1 answer 10 views
Graph algorithms
Every graph having minimum one spanning tree 1. True 2.False Which is correct? My doubt is spanning tree is possible for any type of graph??
Every graph having minimum one spanning tree 1. True 2.False Which is correct? My doubt is spanning tree is possible for any type of graph??
asked May 29 in Algorithms Vink7389 9 points 10 views
0 votes
0 answers 8 views
b)List all students taking at least one course that their mentor teaches.
Given the relational schemas: ENROLL(SID,C_No,Section) - SID and C_No represent student id number, course number respectively TEACH(TID,C_No,Section) - TID represents teacher id number ADVISE(TID,SID) TID is the mentor of SID PRE_REQ(C_No,PRE_C_No) - PRE_C_No is ... List the courses that student Anindya can enroll in, i.e., has passed the necessary prerequisite courses but not the course itself.
asked May 29 in Databases nasima0058 5 points 8 views
0 votes
0 answers 6 views
#Ullman #TOC #RegularLanguage
Check if max(L) is closed or not for max(L) : { w| w is in L but no x other than EmptyString, wx is in L }. Correct if Logic is wrong., If wx is not in L ( except x is empty ) i.e. x forces the flow to stop at a non-Final state. So unless x is ... on a final state, so is w alone. A dfa is possible for all w' in L => dfa is possible for w' for max(L) => Closed.
Check if max(L) is closed or not for max(L) : { w| w is in L but no x other than EmptyString, wx is in L }. Correct if Logic is wrong., If wx is not in L ( except x is empty ) i.e. x forces the flow to stop at a non-Final state. So unless x is Empty, constructing a ... wx lands on a final state, so is w alone. A dfa is possible for all w' in L => dfa is possible for w' for max(L) => Closed.
asked May 29 in Theory of Computation Palash Nandi 1 13 points 6 views
0 votes
0 answers 5 views
#Ullman #RegularLanguage
check if init(L) is closed or not where init(L) = { w | for some x, wx is in L } => Correct if Logic is wrong. Let there are n differnt state in dfa of L. Case_1: if len( wx ) >= n and wx is in L then x is either EmptyString or ... is EmptyString else whether single w' reach the final state is undecidable. So., x is Empty for sure, for all w in init(L) => Closed.
check if init(L) is closed or not where init(L) = { w | for some x, wx is in L } => Correct if Logic is wrong. Let there are n differnt state in dfa of L. Case_1: if len( wx ) >= n and wx is in L then x is either EmptyString or a loop. So deleting ... then either x is EmptyString else whether single w' reach the final state is undecidable. So., x is Empty for sure, for all w in init(L) => Closed.
asked May 29 in Theory of Computation Palash Nandi 1 13 points 5 views
0 votes
0 answers 5 views
Selfdoubt(Relational Algebra and SQL)
Is the JOIN operations(natural , left , right) in relational algebra and SQL same or is there any difference based on the condition? Please provide reference.
Is the JOIN operations(natural , left , right) in relational algebra and SQL same or is there any difference based on the condition? Please provide reference.
asked May 27 in Databases samir757 29 points 5 views
0 votes
0 answers 7 views
System calls are onto or one to one?
asked May 27 in Operating System afroze 5 points 7 views
0 votes
0 answers 6 views
Self-doubt(DBMS)
How to find the number of relations required for a self-referential relationship with all the cardinalities mapped with total and partial participation? Please provide links to the same.
How to find the number of relations required for a self-referential relationship with all the cardinalities mapped with total and partial participation? Please provide links to the same.
asked May 27 in Databases samir757 29 points 6 views
0 votes
1 answer 16 views
Self Doubt (Digital Logic Design)
A ⊕ B can be represented using 4 NAND gates as well as 5 NAND gates. Is there any predefined procedure to find the minimum number of NAND gate required by an expression?
A ⊕ B can be represented using 4 NAND gates as well as 5 NAND gates. Is there any predefined procedure to find the minimum number of NAND gate required by an expression?
asked May 25 in Digital Logic samir757 29 points 16 views
1 vote
1 answer 98 views
Self dout (Digital Logic Design)
Is the number of min terms always equal to the number of max terms , for a boolean function? Can we say that for a boolean function to be self dual, should satisfy the above condition as well as no mutual exclusive terms should be present?
Is the number of min terms always equal to the number of max terms , for a boolean function? Can we say that for a boolean function to be self dual, should satisfy the above condition as well as no mutual exclusive terms should be present?
asked May 23 in Digital Logic samir757 29 points 98 views
0 votes
1 answer 14 views
#Self_Doubt #NFA
For any given NFA with ip_set = {a,b} if any transaction is Missing then can we assume a Self Loop ? For example, [T1] a b [T2] a b S S,P Q S S,P Q is P _ Q same as P P Q Q* _ _ Q* Q Q Notice in T1 for transaction(P,a) = undefined. So can we assume transaction(P,a) = P ?
For any given NFA with ip_set = {a,b} if any transaction is Missing then can we assume a Self Loop ? For example, [T1] a b [T2] a b S S,P Q S S,P Q is P _ Q same as P P Q Q* _ _ Q* Q Q Notice in T1 for transaction(P,a) = undefined. So can we assume transaction(P,a) = P ?
asked May 18 in Theory of Computation Palash_292 5 points 14 views
0 votes
1 answer 20 views
MAC address and router working
I have some conceptual doubts about MAC address why we need them when we have an IP address and routers know the IP address
I have some conceptual doubts about MAC address why we need them when we have an IP address and routers know the IP address
asked May 12 in Computer Networks jainanmol123 13 points 20 views
0 votes
0 answers 11 views
Madeeasypostal ACE
"GATE CSE 2000 | Question: 1.6 - GATE Overflow" https://gateoverflow.in/629/gate-cse-2000-question-1-6 In question above we understood that positive number and unsigned is represented same as in 2's complement. here in question below the hex number is ... be same as number given is positive(bcoz msb is not 7). Determine 8's compliment of an octal number 2670? Right??
"GATE CSE 2000 | Question: 1.6 - GATE Overflow" https://gateoverflow.in/629/gate-cse-2000-question-1-6 In question above we understood that positive number and unsigned is represented same as in 2's complement. here in question below the hex number is unsigned because sign ... will be same as number given is positive(bcoz msb is not 7). Determine 8's compliment of an octal number 2670? Right??
asked May 11 in Digital Logic BhaktiDhorajiya 5 points 11 views
1 vote
1 answer 49 views
i am preparing for gate 2022 cse.
i need to study COA . can somebody tell me good resources and how to progress with subject
i need to study COA . can somebody tell me good resources and how to progress with subject
asked May 3 in CO & Architecture rishabh16 9 points 49 views
0 votes
0 answers 11 views
gate 2001 DBMS(normalization)
R(A,B,C,D) is a relation. FD given is:{ AB->C , C->AD } is it in 2NF? is it in 3NF?
R(A,B,C,D) is a relation. FD given is:{ AB->C , C->AD } is it in 2NF? is it in 3NF?
asked May 2 in Databases rishabh8797 5 points 11 views
0 votes
0 answers 7 views
Functional Dependency
A relation R(A,B,C) has FD A $\rightarrow$ B and other relation M(A, B) has FD A $\rightarrow$ B. Does relation R and M have equivalent FD ?
A relation R(A,B,C) has FD A $\rightarrow$ B and other relation M(A, B) has FD A $\rightarrow$ B. Does relation R and M have equivalent FD ?
asked May 2 in Databases ascend 11 points 7 views
0 votes
1 answer 13 views
Exam operating system
When switching the CPU between two processes.. which of the following applies A. The PCB is both, saved and reloaded, only for the interrupted process that is existing the CPU B. The PCB is saved for the process that is scheduled for the CPU C. The PCB is reloaded for the process that is scheduled for the CPU D. No PCB is saved or reloaded E. None of the above
When switching the CPU between two processes.. which of the following applies A. The PCB is both, saved and reloaded, only for the interrupted process that is existing the CPU B. The PCB is saved for the process that is scheduled for the CPU C. The PCB is reloaded for the process that is scheduled for the CPU D. No PCB is saved or reloaded E. None of the above
asked May 2 in Operating System Malak 5 points 13 views
0 votes
2 answers 25 views
Principle of Duality (Digital Logic)
What will be the dual of the following expression? A + B’.[C’+D(E+F’)]
What will be the dual of the following expression? A + B’.[C’+D(E+F’)]
asked May 2 in Digital Logic gargi24 7 points 25 views
0 votes
0 answers 5 views
Asymptotic notation
n^3 + n^2logn = bigoh(n^3) For satisfying above equation what should be the value of c??
n^3 + n^2logn = bigoh(n^3) For satisfying above equation what should be the value of c??
asked May 2 in Algorithms Vink7389 9 points 5 views
0 votes
0 answers 11 views
PhD Admissions Written Test (Basic)
Consider the matrix A = ( 1 1 7 2 −4 14 3 1 21 ) and let vA ={x y z } be vector not containing all 0s. The product A vA is 0 (all 0s) if we set x, y, z as how to solve such question
Consider the matrix A = ( 1 1 7 2 −4 14 3 1 21 ) and let vA ={x y z } be vector not containing all 0s. The product A vA is 0 (all 0s) if we set x, y, z as how to solve such question
asked May 2 in Mathematical Logic Rashimdixit 9 points 11 views
0 votes
0 answers 10 views
Reference from GATE IT-2005 (2 marks)
"In Binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2." How is this statement valid in case of Left or Right Skewed Binary tree?
"In Binary tree, for every node the difference between the number of nodes in the left and right subtrees is at most 2." How is this statement valid in case of Left or Right Skewed Binary tree?
asked May 2 in Programming Anupreet13 5 points 10 views
0 votes
0 answers 4 views
Graphs in algorithms
If a graph contains n vertices then in minimum spanning tree(MST) will contain Minimum(n-1) edges Exact (n-1) edges. What will be the answer for this?? Plz explain with example for better understanding.
If a graph contains n vertices then in minimum spanning tree(MST) will contain Minimum(n-1) edges Exact (n-1) edges. What will be the answer for this?? Plz explain with example for better understanding.
asked May 2 in Algorithms Vink7389 9 points 4 views
0 votes
0 answers 4 views
Ambiguity of grammar
Show that the following grammar is ambiguous. S → aB|ab, A → aAB|a, B → ABb|b.
Show that the following grammar is ambiguous. S → aB|ab, A → aAB|a, B → ABb|b.
asked May 2 in Theory of Computation Sravanth0989 5 points 4 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...