Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by arvin
6
answers
1
ISRO2020-18
Consider a $2$-dimensional array $x$ with $10$ rows and $4$ columns, with each element storing a value equivalent to the product of row number and column number. The array is stored in row-major format. If the first element $x[0][0]$ occupies the memory location ... , which all locations (in decimal) will be holding a value of $10$? $1018,1019$ $1022,1041$ $1013,1014$ $1000,1399$
Consider a $2$-dimensional array $x$ with $10$ rows and $4$ columns, with each element storing a value equivalent to the product of row number and column number. The arra...
9.7k
views
answered
Jan 15, 2020
Programming in C
isro-2020
programming
array
normal
+
–
2
answers
2
ISI2014-DCG-71
Five letters $A, B, C, D$ and $E$ are arranged so that $A$ and $C$ are always adjacent to each other and $B$ and $E$ are never adjacent to each other. The total number of such arrangements is $24$ $16$ $12$ $32$
Five letters $A, B, C, D$ and $E$ are arranged so that $A$ and $C$ are always adjacent to each other and $B$ and $E$ are never adjacent to each other. The total number of...
665
views
commented
Sep 28, 2019
Combinatory
isi2014-dcg
combinatory
arrangements
circular-permutation
+
–
3
answers
3
ISI2015-MMA-4
Suppose in a competition $11$ matches are to be played, each having one of $3$ distinct outcomes as possibilities. The number of ways one can predict the outcomes of all $11$ matches such that exactly $6$ of the predictions turn out to be correct is $\begin{pmatrix}11 \\ 6 \end{pmatrix} \times 2^5$ $\begin{pmatrix}11 \\ 6 \end{pmatrix} $ $3^6$ none of the above
Suppose in a competition $11$ matches are to be played, each having one of $3$ distinct outcomes as possibilities. The number of ways one can predict the outcomes of all ...
1.9k
views
answered
Sep 25, 2019
Combinatory
isi2015-mma
combinatory
+
–
3
answers
4
compiler phase error
int main(){ int a = 10; fun(a); } void fun(int a){ printf(“%d”,a); } Which phase of the compiler will raise an error? Lexical syntax semantics none of the above
int main(){int a = 10;fun(a);}void fun(int a){printf(“%d”,a);}Which phase of the compiler will raise an error?Lexical syntaxsemanticsnone of the above
987
views
commented
Jan 21, 2019
Compiler Design
compiler-design
programming-in-c
+
–
2
answers
5
made easy test series
Consider the following language:? L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’} Is L regular? If so, please provide a DFA for L.
Consider the following language:?L= {w | w $\epsilon$ {0,1}* , w has equal number of occurrences of ‘001’ and ‘010’}Is L regular? If so, please provide a DFA for ...
3.3k
views
commented
Jan 20, 2019
Theory of Computation
made-easy-test-series
theory-of-computation
regular-language
+
–
0
answers
6
Dbms general doubt
Is repetition allow in foreign key ? Give some reference
Is repetition allow in foreign key ?Give some reference
349
views
commented
Jan 18, 2019
Databases
databases
+
–
0
answers
7
Test series
In how many ways 20 two rupees coins can be distributed among 4 children? Answer – 1771
In how many ways 20 two rupees coins can be distributed among 4 children?Answer – 1771
399
views
commented
Jan 16, 2019
0
answers
8
Variance
A family has 5 children. If the random variable (X) represents the number of boys , then the variance of X is Answer – 1.25
A family has 5 children. If the random variable (X) represents the number of boys , then the variance of X isAnswer – 1.25
499
views
commented
Jan 16, 2019
0
answers
9
MadeEasy Test Series 2019: Computer Networks - Congestion Control
Consider a TCP connection using the multiplicative additive congestion control algorithm where the window size is 1 MSS and the threshold is 32 MSS. At the $8^{th}$ transmission timeout occurs and enters in the congestion detection ... transmission. So we have to take the window size after the 12 RTTs right and not at 12th RTT?
Consider a TCP connection using the multiplicative additive congestion control algorithm where the window size is 1 MSS and the threshold is 32 MSS. At the $8^{th}$ trans...
1.9k
views
commented
Jan 15, 2019
Computer Networks
computer-networks
congestion-control
made-easy-test-series
+
–
0
answers
10
MadeEasy Full Length Test 2018: Digital Logic - Number Representations
2’s complement representation of the number $(-89)_{10}$ is 7 5 4 3 I don’t understand their solution. Please help.
2’s complement representation of the number $(-89)_{10}$ is7543I don’t understand their solution. Please help.
582
views
commented
Jan 15, 2019
Digital Logic
digital-logic
number-representation
made-easy-test-series
+
–
2
answers
11
mad easy cbt 1
Let A be ternary tree with each node having 0 or 3 children . Let T have 25 node .The number of leaf nodes in ternary tree are
Let A be ternary tree with each node having 0 or 3 children . Let T have 25 node .The number of leaf nodes in ternary tree are
673
views
commented
Jan 13, 2019
0
answers
12
Mock test
How was your Made easy CBT mock test??
How was your Made easy CBT mock test??
233
views
commented
Jan 13, 2019
0
answers
13
#digital
.binary number 1.11111…………. are give find decimal number
.binary number 1.11111…………. are give find decimal number
646
views
commented
Jan 13, 2019
Digital Logic
floating-point-representation
+
–
1
answer
14
Decidability
Let L be a DCFL and R is a regular language. Consider the below given problems. P : Is L ≠ R? Q : is R ⊂ L? Choose the correct option. Both problems P and Q are decidable. Both problems P and Q are undecidable. Problem Q is decidable and P is ... DCFL's, i.e when both languages are DCFL's. How do I analyze decidablity for different languages? In this case, for a RL and DCFL.
Let L be a DCFL and R is a regular language. Consider the below given problems.P : Is L ≠ R?Q : is R ⊂ L?Choose the correct option.Both problems P and Q are decidable...
1.6k
views
commented
Jan 12, 2019
Theory of Computation
decidability
theory-of-computation
+
–
3
answers
15
MadeEasy Full Length Test 2019: Combinatory - Permutations And Combinations
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
The number of ways 5 letter be put in 3 letter boxes A,B,C. If letter box A must contain at least 2 letters.
1.5k
views
commented
Jan 12, 2019
Combinatory
discrete-mathematics
combinatory
made-easy-test-series
+
–
0
answers
16
self doubt booth algorithm
https://gateoverflow.in/3352/gate2008-it-42 somewhere i saw 1 ->0 as 0 and somewhere as -1. which is actual process?
https://gateoverflow.in/3352/gate2008-it-42somewhere i saw 1 ->0 as 0 and somewhere as -1. which is actual process?
410
views
comment moved
Jan 12, 2019
2
answers
17
ACE test series
i’m getting answer “14” but given answer is 10
i’m getting answer “14” but given answer is 10
488
views
commented
Jan 12, 2019
Databases
databases
+
–
1
answer
18
C Programming
main() { unsigned int i= 255; char *p= &i; int j= *p; printf("%d\n", j); unsigned int k= *p; printf("%d", k); } Both the outputs are -1. I have even tried with - int i = 255(3rd line). Still the output is -1. I don't understand how it is -1.
main(){unsigned int i= 255;char *p= &i;int j= *p;printf("%d\n", j);unsigned int k= *p;printf("%d", k);} Both the outputs are -1. I have even tried with - int i = 255(3rd ...
1.2k
views
commented
Jan 12, 2019
Programming in C
programming-in-c
output
programming
pointers
+
–
1
answer
19
Algorithms Time complexity
956
views
commented
Jan 12, 2019
Programming in C
time-complexity
algorithms
asymptotic-notation
+
–
0
answers
20
made easy 2019 full test 2
consider a system with 48 bit virtual address and page size is 16KB.Operating system uses multilevel paging.page table entry size is 4B.What is the number of entries in the last level page table such that last level page table will fit into exactly one page. I am getting 4096.
consider a system with 48 bit virtual address and page size is 16KB.Operating system uses multilevel paging.page table entry size is 4B.What is the number of entries in t...
694
views
commented
Jan 12, 2019
0
answers
21
made easy
let an be the recurrenence relation which satisfies $a_{n}=4(a_{n-1}-a_{n-2})$ with $a_{1}$=2 and $a_{2}=8$. let X corresponds to the value of $a_{17}$.then values of $log_{2}(\left | x \right |)$ will be _____? am getting 18.
let an be the recurrenence relation which satisfies $a_{n}=4(a_{n-1}-a_{n-2})$ with $a_{1}$=2 and $a_{2}=8$.let X corresponds to the value of $a_{17}$.then values of $log...
355
views
commented
Jan 11, 2019
9
answers
22
GATE CSE 1996 | Question: 2.1
Let $R$ denote the set of real numbers. Let $f:R\times R \rightarrow R \times R$ be a bijective function defined by $f(x,y) = (x+y, x-y)$. The inverse function of $f$ is given by $f^{-1} (x,y) = \left( \frac {1}{x+y}, \frac{1}{x-y}\right)$ ... $f^{-1}(x,y)=\left [ 2\left(x-y\right),2\left(x+y\right) \right ]$
Let $R$ denote the set of real numbers. Let $f:R\times R \rightarrow R \times R$ be a bijective function defined by $f(x,y) = (x+y, x-y)$. The inverse function of $f$ is ...
9.8k
views
commented
Jan 11, 2019
Set Theory & Algebra
gate1996
set-theory&algebra
functions
normal
+
–
0
answers
23
SELF DOUBT
Two CSMA/CD stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential back-off algorithm. The probability that the contention ends in round 3 is _____ (up to 3 decimal points)
Two CSMA/CD stations are each trying to transmit large files of multiple frames. After each frame is sent, they contend for the channel using the binary exponential back-...
678
views
commented
Jan 11, 2019
0
answers
24
TRUE/FALSE
State TRUE/FALSE Squaring all edges will NOT change the maximum spanning tree Squaring all edges will NOT change the minimum spanning tree Squaring all edges will NOT change the second maximum spanning tree Squaring all edges will NOT change the second ... tree Cubing all edges will change the second maximum spanning tree Cubing all edges will change the second minimum spanning tree
State TRUE/FALSESquaring all edges will NOT change the maximum spanning treeSquaring all edges will NOT change the minimum spanning treeSquaring all edges will NOT change...
570
views
commented
Jan 11, 2019
1
answer
25
Algebra
If p(n+1)+p(n-1)=p(n) for every natural number ‘n’then for what values of natural number ‘a’ will p(n+a)=-p(n) a)3 b)2 c)4 d)6
If p(n+1)+p(n-1)=p(n) for every natural number ‘n’then for what values of natural number ‘a’ will p(n+a)=-p(n)a)3 b)2 c)4 d)6
453
views
commented
Jan 11, 2019
Quantitative Aptitude
algebra
+
–
1
answer
26
Gateforum Test Series: Compiler Design - Parsing
Which of the following is FALSE? (A) LL(k) grammars are context free grammar (B) LL(k) grammars are unambiguous (C) There are LL(k) grammars which are not context free (D) LL(k) grammars cannot have left recursion i marked a answer is given c)
Which of the following is FALSE?(A) LL(k) grammars are context free grammar(B) LL(k) grammars are unambiguous(C) There are LL(k) grammars which are not context free(D) LL...
741
views
commented
Jan 11, 2019
Compiler Design
gateforum-test-series
compiler-design
parsing
+
–
1
answer
27
Gateforum Test Series: Algorithms - Time Complexity
588
views
comment edited
Jan 9, 2019
Algorithms
gateforum-test-series
algorithms
time-complexity
+
–
1
answer
28
Probability
Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________
Suppose we want to pick two numbers from {1,2……,100} randomly . The probability that sum of the two numbers is divisible by 5 is _________________
2.7k
views
answered
Jan 8, 2019
Probability
probability
+
–
0
answers
29
Zeal Test Series 2019: Algorithms - Minimum Spanning Trees
How many of following are correct statements ? (i) A graph where all edge weights are distinct can have more than one shortest path between two vertices u and v (ii)adding a number w on weight of every edge of graph ... number might change the shortest path between two vertices u and v (Assume that all edge weights of graph are distinct)
How many of following are correct statements ?(i) A graph where all edge weights are distinct can have more than one shortest path between two vertices u and v(ii)adding...
877
views
comment edited
Dec 21, 2018
Algorithms
algorithms
minimum-spanning-tree
zeal
zeal2019
+
–
0
answers
30
Gate zeal test
i am getting 12 please check it
i am getting 12 please check it
961
views
comment edited
Dec 21, 2018
Programming in C
programming-in-c
output
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register