Register
Filter

Recent questions

#19741
1.1k
views
1 answers
0 votes
Doubt Counting Semaphore
Assume Counting Semaphore N=8.On performing 10 down() operations by 10 different processes , first 8 will be successful and last two processes will be ... counting semaphore can let multiple processes access the CS at the same time?
User Avatar
#19742
998
views
0 answers
1 votes
Self Doubt
Suppose we are using 4-bit carry lookahead adder modules to build a 64- bit adder with two-level carry lookahead, with ripple carry between the modules. If the delay ... , the worst-case delay of the 64-bit adder will be .. nanoseconds.
User Avatar
#19743
1.1k
views
0 answers
1 votes
Rosen
How many positive integers less than 1,000,000 have thesum of their digits equal to 19?Doubt 1: I understood till C(24,5). Now while subtracting ... repetition allowed. Then how it is unfavorable according to solution given?plz correct me.
User Avatar
#19744
998
views
0 answers
0 votes
Kenneth Rosen Edition 6th Exercise 2.3 Question 18 (Page No. 147)
Consider all below functions are from $R \rightarrow R$Determine whether these functions are one-to-one, and onto.(a)$f(x)=-3x+4$ -->Bijection(b)$f(x)=-3x^2+7$- ... one-to-one but not onto(d)$f(x)=x^5+1$--->BijectionAre my answers correct.?
User Avatar
#19745
429
views
0 answers
0 votes
Digital Self Doubt
https://gateoverflow.in/1413/gate2013-4In the first question if due to the range of 2's complement number the answer is -128https://gateoverflow.in/39649/gate2016-1- ... also the number is -ve and answer should be -12 due to the range..
User Avatar
#19746
192
views
0 answers
0 votes
strategy
I have completed the syllabus now I have two ways to go forward1 Give all subject tests and give 2 to 3 full-length tests2 Revise and Every 5 days give one full testI am in a dilemma which strategy should I follow?
User Avatar
#19747
1.3k
views
0 answers
0 votes
Regular graph coloring
If G is a connected k-regular graph with chromatic number k+1, then find the number of edges in G?
User Avatar
#19748
2.5k
views
2 answers
2 votes
Graph Connectivity
Consider the given statementsS1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G.S2:In a simple graph G, ... vertex is 3 then the graph G is connected.Which of the following is/are true?
User Avatar
#19749
988
views
0 answers
0 votes
Regular Graph
If a 2-regular graph G has a perfect matching then which of the following is/are true? S1: G is a cycle of even length S2: Chromatic number of G is 2 ... S4: Every component of G is an even cycleOptions-A) S1,S2B)S2,S4C)S3,S4D)S1,S4
User Avatar
#19750
1.5k
views
0 answers
1 votes
Graph connectivity
Let G be a connected graph with 7 connected components and each component is a tree. If G has 26 edge then number of vertices in G is?
User Avatar
#19751
612
views
0 answers
0 votes
Discrete Maths
The non-negative integral solutions to the equation$x_1+x_2+x_3+x_4 \leq10$ I got 209 as answer.Is it correct?
User Avatar
#19752
725
views
0 answers
0 votes
made easy co tt1
I THINK ANSWER SHOULD BE 462,THEY HAVE GIVEN ANSWER 554, WHICH I FEEL IS WRONG!
User Avatar
#19753
516
views
1 answers
0 votes
regular expressions
are these equal?R1=(bc*a)*bc*dR2=b(c+ab)*dare r1 and r2 equal? Also can we obtain different regular expressions from a finite automata? if yes, how do we check if they're equal or not?
User Avatar
#19754
1.6k
views
2 answers
0 votes
#OS #FCFS
Is FCFS always non-preemptive?If an I/O bound process comes, then? It will be preempted or not?
User Avatar
#19755
402
views
1 answers
0 votes
Binary Search Tree
Consider the following routinebool do(struct node *root) { if(!root) return true; else if(( root ---> left != NULL && root ---> data < root ---> left--- ... $B)$ Min Heap $C)$BST $D)$ Binary Tree
User Avatar
#19756
305
views
0 answers
0 votes
self doubt
TRUE/FALSE1.Binary exponential backoff mechanism improves the fairness of througput achieved by different nodes compared to not using the mechanism over a short period of ... compared to not using the mechanism over a long period of time.
User Avatar
#19757
738
views
1 answers
1 votes
AVL Tree
The minimum number of node in an AVL Tree of height $10$ is ____________
User Avatar
#19758
676
views
0 answers
0 votes
algo graph questions
AB min value 10 is answer wrong here??
User Avatar
#19759
580
views
1 answers
0 votes
algo questions
in case of comparision sort max possible is n(n-1)/2
User Avatar
#19760
346
views
0 answers
0 votes
operating system question
I think answer given is wrong ,please have a look
User Avatar
Page: