Register
Filter

Recent activity by s9k96

1 answer
2
Graph Colouring
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is
The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same color, is
0 answers
3
MADEASY TESTSERIES DS
IN THE VIA HEAP LIST WHY IT IS O(LOGN) FOR SEARCHING??
IN THE VIA HEAP LIST WHY IT IS O(LOGN) FOR SEARCHING??
4 answers
6
doubt in databases
2 answers
7
GATE Overflow | Algorithms | Test 1 | Question: 1
For the following program fragment, the running time is given by Procedure A(n) { if(n <= 2) return 1; else return A(log (n)); } $\Theta(\log \log n)$ $\Theta(\log \sqrt n)$ $\Theta(\log^* n)$ $\Theta(\sqrt n)$
For the following program fragment, the running time is given byProcedure A(n) { if(n <= 2) return 1; else return A(log (n)); }$\Theta(\log \log n)$$\Theta(\log \sqrt n)$...
3 answers
8
ME TEST SERIES
HOW TO SOLVE THOSE TYPE OF QUESTION?
HOW TO SOLVE THOSE TYPE OF QUESTION?
2 answers
9
Dbms transaction
Is in conservative 2pl we release the locks after it commit $\mathbf{or}$ locks can be released at any point of time and need not after commit operation ? Please Explain with example.
Is in conservative 2pl we release the locks after it commit $\mathbf{or}$locks can be released at any point of time and need not after commit operation ?Please Explain wi...
2 answers
10
Self Doubt
In the switch statement, if we write default case above all then will it be executed? a = 2; switch(a){ default : print("abc"); case 2 : print("xyz"); } what will be the o/p ?
In the switch statement, if we write default case above all then will it be executed?a = 2;switch(a){default : print("abc");case 2 : print("xyz");}what will be the o/p ?
1 answer
11
SELF DOUBT
https://gateoverflow.in/1036/gate2004-39 WHAT IS DIFFERENCE BETWEEN TYM COMPLEXITY AND PROGRAM EXECUTION TIME??
https://gateoverflow.in/1036/gate2004-39WHAT IS DIFFERENCE BETWEEN TYM COMPLEXITY AND PROGRAM EXECUTION TIME??
0 answers
12
Theory of computation
Is the following language regular?
Is the following language regular?
1 answer
13
Doubt
Are NULL productions in the form of S->ɛ allowed in CFG and regular grammar?
Are NULL productions in the form of S->ɛ allowed in CFG and regular grammar?
1 answer
14
draw dfa on w such that number of a in w mod 3 less than number of b in w mod 3
draw dfa on w number of a in w mod 3 less than number of b in w mod 3
draw dfa on w number of a in w mod 3 less than number of b in w mod 3
3 answers
15
doubt toc
wxw ;w,x belongs to {a,b}* this regular or dcfl or cfl??? somewhere it is written as regular but dontknow why??
wxw ;w,x belongs to {a,b}*this regular or dcfl or cfl??? somewhere it is written as regular but dontknow why??
1 answer
18
foreign key
2 answers
19
Linked list in c program
Can we take image as an input in linked list using c programming? If 'yes' then how to implement that?
Can we take image as an input in linked list using c programming?If 'yes' then how to implement that?
1 answer
22
Test by Bikram | Databases | Test 2 | Question: 6
Decompose the following table into BCNF: $R(ABCD)$ $A \rightarrow C$ $C \rightarrow A$ $AB \rightarrow D$ The result is: (AC) (ABD) (AC) (CBD) (AB)(BAD) Both (A) & (B)
Decompose the following table into BCNF:$R(ABCD)$$A \rightarrow C$$C \rightarrow A$$AB \rightarrow D$The result is:(AC) (ABD)(AC) (CBD)(AB)(BAD)Both (A) & (B)
0 answers
25
Generate TAC :
Generate TAC for: int c; int p ; int n int i =1; n=100; c=i; p=n; while(c<p) { for(i=2;i=n;i++) { c=c+p; p=c-p; } } b) Also Construct basic block for above TAC and perform Optimization for it.
Generate TAC for: int c; int p ; int n int i =1; n=100; c=i; p=n; while(c<p) { for(i=2;i=n;i++) { c=c+p; p=c-p; } }b) Also Construct basic block for above TAC and perform...
2 answers
27
c question
#include <stdio.h> void reverse(int i); int main() { reverse(1); } void reverse(int i) { if (i > 5) return ; printf("%d ", i); return reverse((i++, i)); } I am not able to understand how to solve this "return reverse((i++, i));" statement.
#include <stdio.h>void reverse(int i);int main(){reverse(1);}void reverse(int i){if (i 5)return ;printf("%d ", i);return reverse((i++, i));}I am not able to understand h...
1 answer
28
Kenneth Rosen Edition 6th Exercise 5.5 Question 46 (Page No. 381)
46) A shelf holds 12 books in a row. How many ways are there to choose five books so that no two adjacent books are chosen?
46) A shelf holds 12 books in a row. How many ways are there to choose five books so that no two adjacent books are chosen?