Recent questions without answers

774
views
0 answers
0 votes
Consider the following relational schema:Suppliers(sid:integer, sname:string, city:string, street:string)Suppliers(sid:integer_, sname:string, city:string, street:string ... " each supplier and each street within a city has unique name"
3.6k
views
0 answers
4 votes
If $13x + 17y = 643$, where $x$ and $y$ are the natural numbers, what is the value of two times the product of $x$ and $y$?Is there any good solution other than brute force??
290
views
0 answers
0 votes
802
views
0 answers
0 votes
Suppose we have a network with one source, 2 routers in between and destination. If we want to calculate the efficiency of this network, then the formula is (useful ... or do we add Tt of source and all routers in between in useful time ?
441
views
0 answers
0 votes
Given a J-K flip-flop in the 0 state what is the sequence of states for the following sequence of inputs:00, 01, 10, 11, 11, 00, 00, 11, 01, 10.
402
views
0 answers
0 votes
Given an S-R flip-flop in the 0 state, what is the sequence of inputs necessary to cause the following sequence of states:0, 0, 1, 1, 0, 0, 1, 0, 1.
285
views
0 answers
0 votes
If variable can take any integral values from $0$ to $n$, where $n$ is a constant integer, then the variable can be represented as a bits field whose width is the integral parts of ( ... $\log_{2}(n-1)+1$(d) None of these
360
views
0 answers
0 votes
I have known that in CRL there is no shift reduce conflict, but while solving the following grammar I encountered the following conflict.So help me to solve this problem.A->AaT/T/aT->TbK/KK->aAa
273
views
0 answers
0 votes
A={5,{6},{7}} 2A = p = { ϕ, 5, {{6}}, {{7}}, {5, {6}}, {5, {7}}, {{6}, {7}}, {5, {6}, {7}} }I want to know is it right . If yes then why at element 6 ,7 there are two curly braces ?
620
views
0 answers
4 votes
What is the output of the following code snippetchar ptr[]="Gateoverflow.in"; char qtr[]="GATE"; int i=0; for(;ptr[i++]=qtr[i++];); printf("%s\n",ptr);
382
views
0 answers
0 votes
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be probed if a collision occurs at position 5? A). 4 B). 5 C). 8 D). 6
320
views
0 answers
0 votes
Channel utilization and throughput are same or different please specify the reason?
192
views
0 answers
0 votes
438
views
0 answers
1 votes
which is correct method for QP :1) 2) H(k) = (H+ i^2)mod m
414
views
0 answers
0 votes
Value of following function when x=3 and y=5int f(int x, int y) { if(x==0 && y>=0) return y+1; else if(x>0 && y==0) return(x-1,1); else if(x>0 && y>0) return(f(x-1),f(x,y-1)); }value return will be _________________
522
views
0 answers
1 votes
What is the number of states in a minimal DFA accepting the language which contains all strings that either begin or end (or both) with 01 ? Assume ... drawing its intuitive NFA ? as then conversion would be easier from NFA to DFA.
330
views
0 answers
1 votes
1.1k
views
0 answers
1 votes
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols S1 to S7 initially entered using a hashing function with ... item that is not present is ?What does it means respect to this diagram ?
449
views
0 answers
0 votes
Is there any difference between the execution of a+=2 and a=a+2 making the difference between various calls ?
735
views
0 answers
1 votes
https://gateoverflow.in/?qa=blob&qa_blobid=11318007552752576944Answer given is : 40/121
872
views
0 answers
1 votes
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm.Justify this statement.
1.5k
views
0 answers
1 votes
Difference between (log^2) (n) ,log^2 n, log (log(n)) and (log(n)) ^2?
1.6k
views
0 answers
1 votes
What is the output of below code considering the size of short int is 2, char is 1 and int is 4 bytes.#include<stdio.h>main(){short int i = 20;char c = 97;printf("%d, %d, %d \n", sizeof(i) ... 0;}(a) 2, 1, 2(b) 2, 1, 1(c) 2, 1, 4(d) 2, 2, 8
245
views
0 answers
0 votes
A slight modification to binary search algorithm where it is split into sets of size one thirds and two thirds instead of equal sizes. What will be the recurence relation in worst case
398
views
0 answers
0 votes
1. Only if there is a commit on any schedule there is chances of cascading? for example R1(d) W2(d) commit2This is cascading because if commit of T2 ... R1(d) W2(d) rollbaack2now this is cascading or cascadeless schedule?
258
views
0 answers
0 votes
175
views
0 answers
0 votes
In dbms recovery from failure is in gate syllabus, i checked it is not mentioned but just want to be sure?
244
views
0 answers
0 votes
if we have given 64 bit processor.is that means 2^64 physical memory space is available or 2^64 logical address space is available?
439
views
0 answers
0 votes
Assume x,y and z are floating point variables and they have been assigned the values x = 8.8, y = 3.5 and z = - 5.2. The value of arithmetic expression 2*x / (3*y) is A. 2 B. 1.6 C. 1.67619 D. 0.67619