Register
Filter

Recent questions without answers

0 votes
0 answers
7861
#geeks_quiz_datastructure
Consider the following list of the integer: 19, 23, 40, 32, 91, 25, 100, 36 Sort this list in increasing order using insertion sort and determine the number of passes, comparisons, and swaps ? A 7, 14, 8 respectively. B 7, 7, 14 respectively. C 8, 7, 12 respectively. D 8, 14, 7 respectively.
Consider the following list of the integer:19, 23, 40, 32, 91, 25, 100, 36Sort this list in increasing order using insertion sort and determine the number of passes, comp...
User Avatar
0 votes
0 answers
7863
Kenneth Rosen
Is the set of rational numbers between 0 and 1 (inclusive) well ordered over the relation $\leq$?
Is the set of rational numbers between 0 and 1 (inclusive) well ordered over the relation $\leq$?
User Avatar
0 votes
0 answers
7864
self doubts
1)An attribute of an entity is equivalent to relation name in relational model. 2)An attribute of an entity can be calculated from other attributes. given above which is true or false. plz explain why????
1)An attribute of an entity is equivalent to relation name in relational model.2)An attribute of an entity can be calculated from other attributes.given above which is tr...
User Avatar
0 votes
0 answers
7865
made easy
ans is 9.99 how??
ans is 9.99 how??
User Avatar
0 votes
0 answers
7866
Self doubts
Does context switch time depends on scheduling algorithms??
Does context switch time depends on scheduling algorithms??
User Avatar
0 votes
0 answers
7868
myself
what is the difference between union and cross product of dfa
what is the difference between union and cross product of dfa
User Avatar
0 votes
0 answers
7869
Time Complexity
How to solve the following recurrence relation? T(n) = T(n-6) + n2 , n>7 T(n) = 1 , n<= 7
How to solve the following recurrence relation?T(n) = T(n-6) + n2 , n>7T(n) = 1 , n<= 7
User Avatar
0 votes
0 answers
7870
TIME COMPLEXITY
n is prime ,find value of x and find time complexity. main() { x=0; for(i=1;i<=n;i++) { if(n%i) { for(j=1;j<=n;j=j*10) { x=x+1; } } } } what i am getting is x=(n-2)logn tym complexity =n+(n-2)log n. is correct ?
n is prime ,find value of x and find time complexity.main(){x=0;for(i=1;i<=n;i++){if(n%i){for(j=1;j<=n;j=j*10){x=x+1;}}}}what i am getting is x=(n-2)logntym complexity =n...
User Avatar
0 votes
0 answers
7871
#Self-doubt
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is: a) O(logn) b)O(n) c)O(1) d)O(log*n)
The minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is:a) O(logn)b)O(n)c)O(1)d)O(log*n)
User Avatar
0 votes
0 answers
7872
Test series
User Avatar
0 votes
0 answers
7873
Rsa algorithm
Rsa algorithm is used by choosing two prime numbers say p=3 and q=11.If the public key is e=3 then what is the cipher value to transmit the character 'u'???
Rsa algorithm is used by choosing two prime numbers say p=3 and q=11.If the public key is e=3 then what is the cipher value to transmit the character 'u'???
User Avatar
0 votes
0 answers
7874
self doubt
https://gateoverflow.in/2443/gate1994-1-6-isro2008-29 i am doing using 2nCn /(n+1) for n=1 to 3 but total is coming as 8 is it correct?
https://gateoverflow.in/2443/gate1994-1-6-isro2008-29i am doing using 2nCn /(n+1) for n=1 to 3 but total is coming as 8 is it correct?
User Avatar
0 votes
0 answers
7876
Doubt
can someone explain the formula n^k when k distinguishable items are to be placed in n distinguishable boxes without any restrictions?
can someone explain the formula n^k when k distinguishable items are to be placed in n distinguishable boxes without any restrictions?
User Avatar
1 votes
0 answers
7877
classless subnetting forouzan ex
An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets. Find the first and last addresses in subnet 3.
An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets. Find the first and last addresses in subnet 3.
User Avatar
0 votes
0 answers
7878
ibps2015
the scope of a variable is 1. the range of values that can be assigned to a variable 2. the program area is which the variable is accessible 3. the maximum number of characters that can be allowed in the name of variable 4. both 1 and 2
the scope of a variable is1. the range of values that can be assigned to a variable2. the program area is which the variable is accessible3. the maximum number of charact...
User Avatar
0 votes
0 answers
7879
Self Doubt COA
https://gateoverflow.in/63585/pipelining Can anyone Explain the meaning of the line- "Assume that no instruction starts at first stage time the branch condition is evaluated"
https://gateoverflow.in/63585/pipeliningCan anyone Explain the meaning of the line-"Assume that no instruction starts at first stage time the branch condition is evaluate...
User Avatar
0 votes
0 answers
7880
Gatebook Test series ques
Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadline , so it should take O(n^2) in worst case .
Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadli...
User Avatar
0 votes
0 answers
7881
#CN Error Detection - How many bit errors can simple parity bit error detection or 1-D parity bit can detect?
How many bit errors can simple parity bit error detection or 1-D parity bit can detect?I'm pretty confused about it - that can I detect only one bit errors or all odd bit...
User Avatar
1 votes
0 answers
7883
IIT Bombay Phd question
The number of distinct rearrangement of the 6 letters in the name RAJAJI is .....
The number of distinct rearrangement of the 6 letters in the name RAJAJI is .....
User Avatar
0 votes
0 answers
7884
GATEBOOK_DSA5_7
Which of the following provides a lower bound on the number of comparisons needed to find the kth largest element in an array of n integer elements? (A) n ∗ k (B) n + k − log n (C) min (n + k − 1, 2(n − k + 1)) (D) n − 1 + min (k − 1, n − k)
Which of the following provides a lower bound on the number of comparisons needed to find the kth largest element in an array of n integer elements?(A) n ∗ k (B) n + k ...
User Avatar
0 votes
0 answers
7885
B+ Tree Doubt
Why internal node split isn't counted in this question? Only leaf node split is counted. https://gateoverflow.in/1330/gate2009-44
Why internal node split isn't counted in this question? Only leaf node split is counted.https://gateoverflow.in/1330/gate2009-44
User Avatar
0 votes
0 answers
7887
#Self doubt
https://gateoverflow.in/193583/computer-network please explain how the answer is option c?
https://gateoverflow.in/193583/computer-networkplease explain how the answer is option c?
User Avatar
0 votes
0 answers
7888
Self doubt
Show that no grammar that has cycles can be LL(1). Is it true ?? It is saying if the grammar has cycle it can't be LL(1) But what if the cycle in grammar is due to RIGHT RECURSiON which is allowed in LL(1) ???
Show that no grammar that has cycles can be LL(1).Is it true ??It is saying if the grammar has cycle it can't be LL(1)But what if the cycle in grammar is due to RIGHT REC...
User Avatar
0 votes
0 answers
7889
programming
#include<stdio.h> int(*foo())[3] { static int a[3]={1,2,3}; printf("%d",*a); return &a; } int main() { static int (*p)[3]; p=foo(); printf("%d",*(*p+2)); return 0; } i try to make picture representation i think this is wrong please make correct
#include<stdio.h int(*foo())[3] { static int a[3]={1,2,3}; printf("%d",*a); return &a; } int main() { static int (*p)[3]; p=foo(); printf("%d",*(*p+2)); r...
User Avatar
0 votes
0 answers
7890
made easy test series
answer given is 11. I am Getting 3
answer given is 11. I am Getting 3
User Avatar
Page: