Register
Filter

Answers by Aghori

2 votes
1
Gate 2018
What is the ans of last question if no is divided then reminder is 7
What is the ans of last question if no is divided then reminder is 7
2 votes
3
Generalized permutation and combination
How many positive integers less than 1,000,000 have the sum of their digits equal to 19? (using generating function)
How many positive integers less than 1,000,000 have the sum of their digits equal to 19? (using generating function)
0 votes
7
Synchronous transmission
In synchronous transmission, 5 eight bit characters are included in 30 eight bit information characters. If bit rate of sender is 4200 bps, what is the bit rate of receiver ?
In synchronous transmission, 5 eight bit characters are included in 30 eight bit information characters. If bit rate of sender is 4200 bps, what is the bit rate of receiv...
6 votes
9
Self-doubt
Which of the following is exact recurrence relation for binary search (in terms of number of comparisons) ? 1. T(n) = 2T(n/2) + 1 2. T(n) = 2T(n/2) + 2 Please specify relevant reasons.
Which of the following is exact recurrence relation for binary search (in terms of number of comparisons) ?1. T(n) = 2T(n/2) + 12. T(n) = 2T(n/2) + 2Please specify releva...
10 votes
12
GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
1 votes
14
Time Complexity
Is the answer D ?
Is the answer D ?
1 votes
15
Find Regular Expression of this DFA
Whenever there are 2 final states, I don't get how to solve it, kindly explain once and for all in a detailed manner! I'll owe you a lot.
Whenever there are 2 final states, I don't get how to solve it, kindly explain once and for all in a detailed manner! I'll owe you a lot.
0 votes
16
doubt in time complexity
Given a 2-D array A with n rows and k columns initialized to -1 . what is the Time complexity of f(A,m,m)? int f(int **a, int n, int k) { if((n<=k)|| (k<=1)) return 1; if(a[n][k]==-1) a[n][k]=f(a,n-1,k)+f(a,n-1,k-1); return a[n][k]; } how to write recurrence relation for this
Given a 2-D array A with n rows and k columns initialized to -1 . what is the Time complexity of f(A,m,m)?int f(int a, int n, int k){if((n<=k)|| (k<=1)) return 1;if(a[n]...
0 votes
17
master theorem
explain complexity for this
explain complexity for this
2 votes
18
Doubt: Coreman: Relative Asymptotic growths: Que 01
f(n) = $n*2^{n}$ g(n) = $e^n$ What is the relation b/w the asymptotic time complexities of f(n) and g(n)?
f(n) = $n*2^{n}$g(n) = $e^n$What is the relation b/w the asymptotic time complexities of f(n) and g(n)?
0 votes
19
parsing
what is the difference between Handle and Viable prefix??
what is the difference between Handle and Viable prefix??
0 votes
20
Time complexity
Find the time complexity of the below function: function(int n){ for(int i=0;i<n;i++) for(int j=1; j<i*i; j++) if(j%i==0){ for(int k=0;k<j;k++) printf("*"); } }
Find the time complexity of the below function:function(int n){for(int i=0;i<n;i++) for(int j=1; j<i*i; j++) if(j%i==0){ for(int k=0;k<j;k++) ...
5 votes
21
Minimum number of tables to represent ER-Diagram
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
1 votes
22
Stack
In a stack,(size of 1 to n) the command to access ith element from top of the stack S will be known as peep(S,i).what is the condition to check for underflow on peep?? A.S[top-i]<=0 B.S[top+i]<=0 C.S[top-i+1]<=0 D.none
In a stack,(size of 1 to n) the command to access ith element from top of the stack S will be known as peep(S,i).what is the condition to check for underflow on peep??A.S...
1 votes
23
Pipeline hazards
If, a multicycle,pipelined processor has ‘N’ pipeline stages, then structural hazards can be avoided completely if at least ‘N’ registers are available. Is this true or false?
If, a multicycle,pipelined processor has ‘N’ pipeline stages, then structural hazards can be avoided completely if atleast ‘N’ registers are available. Is this tr...
0 votes
24
virtual memory
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by instruction set architecture .How? pls explain this concept.
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by instruction set architecture .How? pls expl...
0 votes
25
Probability
A fair (unbiased) coin was tosssed four times in succession and resulted in the following outcomes: i)Head , ii) Head, iii) Head iv)Head. The probability of obtaining a "Tail" when a coin is tossed again is A) 0 B) 1/2 C) 4/5 D) 1/5
A fair (unbiased) coin was tosssed four times in succession and resulted in the following outcomes:i)Head , ii) Head, iii) Head iv)Head. The probability of obtaining...
0 votes
29
Syllabus Related
Are 'Longest Common Palindromic Subsequence' and 'Longest monotonically Increasing Subsequence' in Gate syllabus??
Are 'Longest Common Palindromic Subsequence' and 'Longest monotonically Increasing Subsequence' in Gate syllabus??
Page: