Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
gari
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by gari
1
votes
1
Data Structures
Arrange the following Data-structures in the non-decreasing order of worst case time complexities on the operation $Search$ Binary Search Trees, Linked List, Array, Hash Table
Arrange the following Data-structures in the non-decreasing order of worst case time complexities on the operation $Search$Binary Search Trees, Linked List, Array, Hash T...
714
views
answered
Apr 10, 2018
2
votes
2
What would be the message sent by the sender in RSA Algo ?
RSA public key cryptography used with public key pair (e,n) is given as (5 ,35) and the primitive key pair (d,n) as (29,35) . If receiver receives message as 22 , what would be the message sent by the sender : 1) 22 2) 29 3) 35 4) 31
RSA public key cryptography used with public key pair (e,n) is given as (5 ,35) and the primitive key pair (d,n) as (29,35) .If receiver receives message as 22 , what wou...
689
views
answered
Apr 10, 2018
Computer Networks
computer-networks
+
–
3
votes
3
what is the DH Key ?
Suppose 2 parties A and B wish to setup a common secret key among themselves using DH key exchange technique . They agree on 619 as the modulus and 3 as primitive root . Party A chooses 16 and party B chooses 15 as their respective secrets . what is DH key ? A) 21 B) 24 C) 242 D) 223
Suppose 2 parties A and B wish to setup a common secret key among themselves using DH key exchange technique .They agree on 619 as the modulus and 3 as primitive root . P...
802
views
answered
Apr 10, 2018
Computer Networks
computer-networks
+
–
5
votes
4
Programming - pointer
Assume sizeof an integer and a pointer is 4 byte. Output? #include<stdio.h> #define R 10 #define C 20 int main() { int *p[R][C]; printf("%d",sizeof(*p)); printf("%d",sizeof(p)); return 0; }
Assume sizeof an integer and a pointer is 4 byte. Output?#include<stdio.h #define R 10 #define C 20 int main() { int *p[R][C]; printf("%d",sizeof(*p)); printf("%d",sizeof...
4.3k
views
answered
Apr 9, 2018
Programming in C
programming-in-c
output
programming
+
–
2
votes
5
Gate 2004 Question on Linear Algebra
Can Somebody Please explain me in detail description how to calculate the number of upper triangular and lower triangular of a square matrix I read somewhere that it turns out to be ((n^2)+n) /2,Can someone please provide me with a proof
Can Somebody Please explain me in detail description how to calculate the number of upper triangular and lower triangular of a square matrix I read somewhere that it turn...
692
views
answered
Apr 2, 2018
1
votes
6
C programming
376
views
answered
Mar 26, 2018
Programming in C
programming-in-c
pointers
bad-question
+
–
2
votes
7
UGC NET CSE | June 2008 | Part 2 | Question: 12
Consider the following declaration in $\mathrm{C}$ : char a[]; char * p; Which of the following statement is not a valid statement? $\mathrm{p}=\mathrm{a}$; $\mathrm{p}=\mathrm{a}+2$; $\mathrm{a}=\mathrm{p}$; $\mathrm{p}=\& \mathrm{a}[2]$
Consider the following declaration in $\mathrm{C}$ :char a[]; char * p;Which of the following statement is not a valid statement?$\mathrm{p}=\mathrm{a}$;$\mathrm{p}=\math...
105
views
answered
Mar 26, 2018
Others
ugcnetcse-june2008-paper2
+
–
3
votes
8
test_series
can somebody please explain solution to this question?
can somebody please explain solution to this question?
408
views
answered
Mar 26, 2018
6
votes
9
Avg stall cycles per instruction
Suppose that in $500$ memory references there are $50$ misses in the first level cache and $20$ misses in second level cache. Assume miss penalty from the $L_{2}$ cache to memory is $100$ cycles. The hit time of $L_{2}$ cache is $20$ ... $L_{1}$ cache is $10$ cycles. If there are $2.5$ memory references per instruction. How many average stall cycle per instruction?
Suppose that in $500$ memory references there are $50$ misses in the first level cache and $20$ misses in second level cache. Assume miss penalty from the $L_{2}$ cache t...
4.6k
views
answered
Feb 26, 2018
CO and Architecture
co-and-architecture
stall
cache-memory
cycle
+
–
0
votes
10
Comparisons for merging four arrays
Suppose there are 4 sorted lists of 8 elements each. If we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in the worst case using an efficient algorithm are ____.
Suppose there are 4 sorted lists of 8 elements each. If we merge these lists into a single sorted list of 32 elements. The key comparisons that are needed in the worst ca...
3.5k
views
answered
Feb 26, 2018
Algorithms
algorithms
merging
array
+
–
1
votes
11
trees
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not obtain a tree at all?
Given a preorder, postorder and inorder traversal of a tree, is it always possible to obtain a tree that satisfies each of the three conditions? Or is it possible to not ...
1.2k
views
answered
Feb 25, 2018
DS
binary-tree
algorithms
spanning-tree
binary-search-tree
+
–
1
votes
12
Self doubt generating function
Equation: $x+y=10$ and we are asked to find out the number of a non-negative integral solution of this equation.
Equation: $x+y=10$ and we are asked to find out the number of a non-negative integral solution of this equation.
1.2k
views
answered
Feb 25, 2018
Combinatory
generating-functions
+
–
0
votes
13
Simple Grammar
Consider Grammar G with the following characteristic- $A → ax$, where $A ∈ V$, $a ∈ T$, $x ∈ V^*$, and any pair $( A, a )$ occurs at most once in $P$. For example, $S → aA \mid aB...,$ is not a grammar of type $G$ because the pair $(S,a)$ occur in two productions. ... string w belonging to $L(G)$ ? $\mid w \mid^3$ $\mid w \mid$ $2^{\mid w \mid}$ Not a function of $\mid w \mid$ alone.
Consider Grammar G with the following characteristic-$A → ax$, where $A ∈ V$, $a ∈ T$, $x ∈ V^*$, and any pair $( A, a )$ occurs at most once in $P$. For example,...
2.0k
views
answered
Feb 25, 2018
Theory of Computation
theory-of-computation
context-free-language
peter-linz
grammar
context-free-grammar
+
–
3
votes
14
CO Question
How many total bits are required for a direct-mapped cache with 16 KB of data and 4-word blocks, assuming a 32-bit address?
How many total bits are required for a direct-mapped cache with 16 KB of dataand 4-word blocks, assuming a 32-bit address?
528
views
answered
Nov 28, 2017
Digital Logic
cache-memory
+
–
0
votes
15
Ff regarding question .
If there is sequential synchronous circuit and it is producing following distinct stages 0->2->1->4 Then how many ff is needed to draw it ?
If there is sequential synchronous circuit and it is producing following distinct stages 0->2->1->4Then how many ff is needed to draw it ?
371
views
answered
Nov 28, 2017
Digital Logic
digital-logic
+
–
1
votes
16
Parsing
I think that the given grammar is LL(1) . please explain me if I'm wrong.
I think that the given grammar is LL(1) . please explain me if I'm wrong.
618
views
answered
Nov 28, 2017
Compiler Design
compiler-design
parsing
lr-parser
ll-parser
ace-test-series
+
–
46
votes
17
GATE CSE 2017 Set 1 | Question: 43
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational ... program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.
Consider the following grammar:stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$expr $\rightarrow$ term relop term | termterm $\rightarrow$ id | numberid $\righ...
20.2k
views
answered
Nov 12, 2017
Compiler Design
gatecse-2017-set1
compiler-design
parsing
normal
numerical-answers
+
–
0
votes
18
UGC NET CSE | November 2017 | Part 2 | Question: 11
$\text{prtdata}$ is a pointer to a data type. The expression $^*\text{prtdata}++$ is evaluated as (in C++) $^*(\text{prtdata++})$ $(^*\text{prtdata})++$ $^*(\text{prtdata})++$ Depends on compiler
$\text{prtdata}$ is a pointer to a data type. The expression $^*\text{prtdata}++$ is evaluated as (in C++)$^*(\text{prtdata++})$$(^*\text{prtdata})++$$^*(\text{prtdata})+...
781
views
answered
Nov 11, 2017
Unknown Category
ugcnetcse-nov2017-paper2
+
–
1
votes
19
Problem on TOH
We solve TOH problem recursively breaking the task in three sections, which of the following recurrence will accord well with the approach , that is shows correct order of work done on each recursive step A) T(n)=T(n-1)+1+T(n-1) B) T(n)=T(n-1)+T(n-1)+1 C) T(n)=1+T(n-1)+T(n-1) D) T(n)=T(n-1)+T(n-1)+2
We solve TOH problem recursively breaking the task in three sections, which of the following recurrence will accord well with the approach , that is shows correct order o...
735
views
answered
Nov 11, 2017
DS
data-structures
stack
recurrence-relation
+
–
1
votes
20
evaluating postfix expression
when evaluating postfix expression if var a nd b are in stack and b is top of stack now divide(/) symbol comes then it will be a/b or b/a? it should always be (b/a) right? depending on bigger number solutions choose either a/b or b/a according to their wish ......is it like that?
when evaluating postfix expressionif var a nd b are in stack and b is top of stacknow divide(/) symbol comesthen it will be a/b or b/a?it should always be (b/a) right?dep...
798
views
answered
Nov 11, 2017
14
votes
21
GATE CSE 1994 | Question: 1.14
Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $\text{1, 2, 3, 4, 5}$ in that order? $\text{3, 4, 5, 1, 2}$ $\text{3, 4, 5, 2, 1}$ $\text{1, 5, 2, 3, 4}$ $\text{5, 4, 3, 1, 2}$
Which of the following permutations can be obtained in the output (in the same order) using a stack assuming that the input is the sequence $\text{1, 2, 3, 4, 5}$ in that...
33.1k
views
answered
Nov 6, 2017
DS
gate1994
data-structures
stack
normal
+
–
1
votes
22
GATE ECE 2016
For the circuit shown in the figure, the delay of the bubbled NAND gate is 2ns and that of the counter is assumed to be zero. If the clock (Clk) frequency is 1GHz, then the counter behaves as a: (A) mod-5 counter (B) mod-6 counter (C) mod-7 counter (D) mod-8 counter What is approach applied for such type of question????
For the circuit shown in the figure, the delay of the bubbled NAND gate is 2ns and that of thecounter is assumed to be zero.If the clock (Clk) frequency is 1GHz, then the...
1.9k
views
answered
Sep 2, 2017
Digital Logic
digital-counter
digital-logic
+
–
0
votes
23
Degital logic
identify how many 2 i/p NOR gate require to realize 1.2 input EX-OR GATE 2. 2 input EX-NOR GATE
identify how many 2 i/p NOR gate require to realize1.2 input EX-OR GATE2. 2 input EX-NOR GATE
368
views
answered
Aug 15, 2017
Digital Logic
digital-logic
+
–
38
votes
24
GATE CSE 2008 | Question: 58
A computer on a $10\text{Mbps}$ network is regulated by a token bucket. The token bucket is filled at a rate of $2\text{Mbps}$. It is initially filled to capacity with $16\text{Megabits}$. What is the maximum duration for which the computer can transmit at the full $10\text{Mbps}$? $1.6$ seconds $2$ seconds $5$ seconds $8$ seconds
A computer on a $10\text{Mbps}$ network is regulated by a token bucket. The token bucket is filled at a rate of $2\text{Mbps}$. It is initially filled to capacity with $1...
24.7k
views
answered
Aug 1, 2017
Computer Networks
gatecse-2008
computer-networks
token-bucket
+
–
0
votes
25
GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $2...
41.7k
views
answered
Aug 1, 2017
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
0
votes
26
self doubt
What is the solution of this? I guess 0 or 1.
What is the solution of this?I guess 0 or 1.
437
views
answered
Sep 24, 2016
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register