# Recent questions tagged self-doubt

0 answers 4 views
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?
0 answers 4 views
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.
0 answers 4 views
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?
0 answers 3 views
what is difference between preemption and inturrupts on process state diagram
0 answers 4 views
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.
0 answers 4 views
"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.
0 answers 5 views
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.
0 answers 3 views
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.
0 answers 3 views
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?
0 answers 9 views
Maximum how many number of functions are possible so that F(x,y,z) = F(x,y’,z) ?
1 answer 13 views
This is in regards to Binary tree. The question is The image given below is full binary tree or not?
0 answers 8 views
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.
1 vote
0 answers 11 views
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?
1 vote
1 answer 16 views
It is 2NF or not ? Just explain this portion.
0 answers 8 views
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?
0 answers 8 views
It is clear than alt(L,M) is L = {(ab)+}. So dfa is possible but How to prove it formally?
1 vote
1 answer 10 views
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??
0 answers 8 views
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.
0 answers 6 views
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.
0 answers 5 views
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.
0 answers 5 views
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.
0 answers 7 views
0 answers 7 views
0 answers 6 views
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.
1 answer 16 views
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?
1 vote
1 answer 98 views
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?
1 answer 14 views
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 ?
1 answer 20 views
I have some conceptual doubts about MAC address why we need them when we have an IP address and routers know the IP address
0 answers 11 views
"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??
0 answers 8 views
1 vote
1 answer 49 views
i need to study COA . can somebody tell me good resources and how to progress with subject
0 answers 11 views
R(A,B,C,D) is a relation. FD given is:{ AB->C , C->AD } is it in 2NF? is it in 3NF?
0 answers 7 views
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 ?
1 answer 13 views
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
2 answers 25 views
What will be the dual of the following expression? A + B’.[C’+D(E+F’)]
0 answers 5 views
n^3 + n^2logn = bigoh(n^3) For satisfying above equation what should be the value of c??