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
Answers by Hirak
0
votes
1
MadeEasy Test Series: Compiler Design - Syntax Directed Translation
Consider the following grammar and their Syntax Directed Translation (SDT) rules. (Here id represent a integer and id.val is value of that integer) S1: Given SDT is L-attributed and using L-attributed evaluation the value of ... doubt here: Is there any difference in the way of evaluation of L-attributed SDT and S-attributed SDT ?
Consider the following grammar and their Syntax Directed Translation (SDT) rules. (Here id represent a integer and id.val is value of that integer)S1: Given SDT is L-attr...
3.4k
views
answered
Jul 15, 2019
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
+
–
2
votes
2
Profit and loss Self doubt
The marked price of a table is Rs. 1200, which is 20% above the cost price. It is sold at a discount of 10% on the marked price. Find the profit percent. (a) 10% (b) 8% (c) 7.5% (d) 6% What approach can I use for these type of questions?
The marked price of a table is Rs. 1200, which is 20% above the cost price. It is sold at a discount of 10% on the marked price. Find the profit percent.(a) 10%(b) 8%(c) ...
3.8k
views
answered
Jun 4, 2019
Quantitative Aptitude
profit-loss
cost-market-price
quantitative-aptitude
general-aptitude
+
–
3
votes
3
Doubt on GATE Question
Read the statements: All women are entrepreneurs. Some women are doctors. Which of the following conclusions can be logically inferred from the above statements? All women are doctors All doctors are entrepreneurs All entrepreneurs are women Some entrepreneurs are doctors ... Is it because , if we make set of doctor as 0, then All doctors are entrepreneurs is meaningless.
Read the statements: All women are entrepreneurs. Some women are doctors. Which of the following conclusions can be logically inferred from the above statements? ...
562
views
answered
Jun 1, 2019
Mathematical Logic
discrete-mathematics
mathematical-logic
+
–
1
votes
4
Probability question of CLRS
In a restaurant each of $n$ customer gives a hat to the hat check person. The hat check person gives the hat back to the customer in a random order. What is expected number of customer who get back their own hat?
In a restaurant each of $n$ customer gives a hat to the hat check person. The hat check person gives the hat back to the customer in a random order. What is expected numb...
917
views
answered
May 31, 2019
Probability
algorithms
probability
+
–
1
votes
5
UGC NET CSE | Junet 2015 | Part 3 | Question: 30
The minimum payload of a TCP segment is 65,535 65,515 65,495 65,475
The minimum payload of a TCP segment is65,53565,51565,49565,475
4.1k
views
answered
May 31, 2019
Computer Networks
ugcnetcse-june2015-paper3
computer-networks
tcp
+
–
2
votes
6
Cache Average access time
So as we know there are 2 different approaches for cache.. Sequential and the Hierarchical. Exactly which formula should I use when only access times and hit ratio is mentioned in case of 2 level memory system..? It would be great if someone explains how to approach questions related to average access time.
So as we know there are 2 different approaches for cache..Sequential and the Hierarchical. Exactly which formula should I use when only access times and hit ratio is ment...
664
views
answered
May 19, 2019
CO and Architecture
cache-memory
co-and-architecture
+
–
3
votes
7
Made Easy Test Series:Discrete Mathematics-Poset
Consider the following Posets: $I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$ $II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$ $III)\left ( \left \{ 1,2,3,6,11,22,33,66 \right \},/ \right )$ Which of the above poset are isomorphic to $\left ( P\left ( S \right ),\subseteq \right )$ where $S=\left \{ a,b,c \right \}?$
Consider the following Posets:$I)\left ( \left \{ 1,2,5,7,10,14,35,70 \right \},\leq \right )$$II)\left ( \left \{ 1,2,3,6,14,21,42 \right \},/ \right )$$III)\left ( \lef...
1.1k
views
answered
May 18, 2019
Set Theory & Algebra
poset
made-easy-test-series
discrete-mathematics
+
–
3
votes
8
TEST BOOK QUESTION
CAN SOMEBODY EXPLAIN THIS ANSWER PLZ !!!
CAN SOMEBODY EXPLAIN THIS ANSWER PLZ !!!
480
views
answered
May 14, 2019
Digital Logic
digital-logic
+
–
0
votes
9
analysis of algorithm
870
views
answered
May 9, 2019
Algorithms
recurrence-relation
time-complexity
geeksforgeeks-test-series
+
–
2
votes
10
Combination doubt
A shipping clerk has to weigh 10 distinct packets. He weighs them four at a time, weighing all the possible combinations of the packets from the ten. The average weight of all the weighing combination is found to be 800 gm. What is the combined weight of all the size packets?
A shipping clerk has to weigh 10 distinct packets. He weighs them four at a time, weighing all the possible combinations of the packets from the ten. The average weight o...
1.9k
views
answered
May 7, 2019
Quantitative Aptitude
gate2016-ec-3
combinational-circuit
+
–
1
votes
11
Made Easy Test Series:Algo- Asymptotic Complexity
$1)n^{2019}=O\left (n^{2020} \right )$ $2)O(n^{2019})=O\left (n^{2020} \right )$ Which one is correct?? If $1)$ is correct, why $2)$ not correct?
$1)n^{2019}=O\left (n^{2020} \right )$$2)O(n^{2019})=O\left (n^{2020} \right )$Which one is correct??If $1)$ is correct, why $2)$ not correct?
1.3k
views
answered
May 6, 2019
Algorithms
made-easy-test-series
asymptotic-notation
+
–
0
votes
12
Resource Allocation
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in combined manner. Then the value of x is ___
Consider a scenario where 3 processes P1, P2 and P3 are sharing x resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that t...
5.3k
views
answered
May 4, 2019
Operating System
operating-system
+
–
1
votes
13
Made Easy Test Series:TOC-Turing Machine
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length} $P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on which $M$ halts } The number of problem which is $RE$ but not $REC$ _____________
$P_{1}:$ {$<M>|M $ is a TM that accepts atleast $2$ strings of different length}$P_{2}:$ {$<M>|M $ is a TM and there exists an input whose length less than $100,$ on whi...
1.1k
views
answered
May 3, 2019
Theory of Computation
theory-of-computation
turing-machine
test-series
+
–
0
votes
14
Made Easy Test Series: DS
A $d-$ary heap is a binary heap, but instead of $2$ children, nodes have $d$ children. A $d-ary$ heap can be represented by $1-D$ array as follows. The root is kept in $A[1]$, and it's $d$ children are kept in order in $A[2]$ through $A[d+1]$ ... $A\left [ d^{2}+d+2 \right ]$
A $d-$ary heap is a binary heap, but instead of $2$ children, nodes have $d$ children. A $d-ary$ heap can be represented by $1-D$ array as follows. The root is kept in $A...
502
views
answered
May 2, 2019
DS
made-easy-test-series
data-structures
+
–
1
votes
15
Allen Career Institute: Discrete Math
Let $f : A \rightarrow B$ be a bijection and let $E,F$ be subjects of $A$, Now, we consider the following statements about the function $f :$ $P : f(E \cup F) = f (E) \cup f(F)$ ... None of $P$ and $Q$ is correct I thought $Q$ is true, but answer is both true. Is both true because of bijective function or ans given incorrect?
Let $f : A \rightarrow B$ be a bijection and let $E,F$ be subjects of $A$, Now, we consider the following statements about the function $f :$$P : f(E \cup F) = f (E) \cup...
938
views
answered
May 1, 2019
Set Theory & Algebra
discrete-mathematics
+
–
1
votes
16
Made Easy Test Series:DS-Stack and Queue
Consider a single array $A\left [ 0...........(n-1) \right ]$ is used to implement two stacks. Two stacks grows from opposite end of the array. Variable $top_{1}$ and $top_{2}$ points to the location of the topmost elements in each of the stacks ... the number of elements are present in the array at any time? $A)n-top_{2}+top_{1}$ $B)n+1-top_{2}+top_{1}$
Consider a single array $A\left [ 0...........(n-1) \right ]$ is used to implement two stacks. Two stacks grows from opposite end of the array. Variable $top_{1}$ and $t...
2.2k
views
answered
May 1, 2019
DS
data-structures
made-easy-test-series
+
–
0
votes
17
Gate 2018: Probability
In a box, there are $2$ red, $3$ black and $4$ blue coloured balls. The probability of drawing $2$ blue balls in sequence without replacing, and then drawing $1$ black ball from this box is _________ %.
In a box, there are $2$ red, $3$ black and $4$ blue coloured balls. The probability of drawing $2$ blue balls in sequence without replacing, and then drawing $1$ black ba...
1.1k
views
answered
May 1, 2019
Probability
usergate2018
probability
normal
+
–
0
votes
18
Number of nodes in heap of height 'h'
The number of nodes of height $h$ in any $n$-element heap is ________. $h$ $2^{h}$ ceil $\left[\frac{n}{2^{h}}\right]$ ceil $\left[\frac{n}{2^{h+1}}\right]$ Answer is given as D, But I think it should be C. Because, even if you take height=1 then possible nodes are 3 and 2.
The number of nodes of height $h$ in any $n$-element heap is ________.$h$$2^{h}$ceil $\left[\frac{n}{2^{h}}\right]$ceil $\left[\frac{n}{2^{h+1}}\right]$Answer is given as...
14.1k
views
answered
Apr 26, 2019
DS
data-structures
binary-tree
binary-heap
+
–
1
votes
19
Resource allocation in packet switching and circuit switching
Resource Reservation is a feature of: A. Circuit Switching B. Packet Switching C. Both (A) and (B) D. None of these PS: In virtual packet switching resouce allocation is done during setup, while in datagram packet switching, there is no allocation. http://www.slideshare.net/mukeshnt/chap-8-switching
Resource Reservation is a feature of:A. Circuit SwitchingB. Packet SwitchingC. Both (A) and (B)D. None of thesePS: In virtual packet switching resouce allocation is done ...
5.2k
views
answered
Apr 11, 2019
Computer Networks
network-switching
resource-allocation
computer-networks
+
–
2
votes
20
GATE2014 EC-1: GA-4
The statistics of runs scored in a series by four batsmen are provided in the following table. Who is the most consistent batsman of these four? ... $K$ $L$ $M$ $N$
The statistics of runs scored in a series by four batsmen are provided in the following table. Who is the most consistent batsman of these four?$$\begin{array}{|c|c|c|} \...
5.5k
views
answered
Apr 9, 2019
Quantitative Aptitude
gate2014-ec-1
statistics
quantitative-aptitude
+
–
1
votes
21
Q:- why it is said that one of the key characteristic of distance vector routing is knowledge about the entire network while one of the key characteristic of link state routing is knowledge about the neighborhood ??
it's question of adaptive routing protocol of computer network.
921
views
answered
Apr 5, 2019
Computer Networks
computer-networks
+
–
2
votes
22
UGC NET CSE | July 2018 | Part 2 | Question: 46
Which of the following statements are true? Three broad categories of Networks are Circuit Switched Networks Packet Switched Networks Message Switched Networks Circuit Switched Network resources need not be reserved during the set up phase In packet switching there is no ... $\text{i and iii}$ only $\text{i, ii and iii}$ only
Which of the following statements are true?Three broad categories of Networks areCircuit Switched NetworksPacket Switched NetworksMessage Switched NetworksCircuit Switche...
3.1k
views
answered
Apr 3, 2019
Computer Networks
ugcnetcse-july2018-paper2
computer-networks
network-switching
+
–
1
votes
23
time complexity
int fun(int n) { int count = 0; for (int i = n; i > 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } what is the time complexity
int fun(int n) { int count = 0; for (int i = n; i 0; i /= 2) for (int j = 0; j < i; j++) count += 1; return count; } what is the time complexity
24.4k
views
answered
Mar 31, 2019
Algorithms
time-complexity
+
–
1
votes
24
Self Doubts:
Q. An SJF algorithm is simply a priority algorithm where the priority is : A) predicted next cpu burst B) The inverse of the predicted next cpu burst C) the current cpu burst D)anything the user want so in this what will be the ans it's a) or c) ? I confused with these two options.please gives proper explanation.
Q. An SJF algorithm is simply a priority algorithm where the priority is :A) predicted next cpu burst B) The inverse of the predicted next cpu burst C) the current cpu bu...
1.8k
views
answered
Mar 29, 2019
Operating System
operating-system
+
–
2
votes
25
when an inverter is placed in both inputs of SR flip flop
When an inverter is placed between both inputs of an SR flip-flop, the resulting flip-flop is [A]. JK flip-flop [B]. D flip-flop [C]. T flip-flop [D]. Master slave JK flip-flop ans given is B but how
When an inverter is placed between both inputs of an SR flip-flop, the resulting flip-flop is[A].JK flip-flop[B].D flip-flop [C].T flip-flop[D].Master slave JK flip-flopa...
10.4k
views
answered
Mar 23, 2019
1
votes
26
Is Fork ,System calls and Threads are there in syllabus?
1.0k
views
answered
Mar 21, 2019
0
votes
27
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...
42.6k
views
answered
Feb 4, 2019
Computer Networks
gatecse-2016-set1
computer-networks
token-bucket
normal
numerical-answers
+
–
1
votes
28
probability
Manish has to travel from A to D changing buses at stops B and C enroute.The maximum waiting time at either stop can be 8 minutes each,but any time of waiting upto 8 minutes is equally likely at both places.He can afford upto 13 minutes of waiting time if he is to arrive at D on time,What is probability Manish will arrive late at D?
Manish has to travel from A to D changing buses at stops B and C enroute.The maximum waiting time at either stop can be 8 minutes each,but any time of waiting upto 8 minu...
2.6k
views
answered
Jul 2, 2018
5
votes
29
GATE CSE 1996 | Question: 26
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below: ... of less than $100 nsec$? What is the average access time achieved using the chosen sizes of level $1$ and level $2$ memories?
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below:$$\overset{ \text {Level $1$ (Cache memory)} \\ \text{Access time = ...
15.1k
views
answered
Sep 1, 2017
CO and Architecture
gate1996
co-and-architecture
cache-memory
normal
+
–
1
votes
30
Number of moves of smallest disc in tower of Hanoi
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16) Answer given: $2^{16}$ = 65536 Please explain
______ is the number of moves of the smallest disc in Tower of Hanoi implementation where the tower consisting of 17 discs (numbered from 0 to 16)Answer given: $2^{16}$ ...
3.2k
views
answered
Jul 28, 2017
DS
algorithms
programming
recursion
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register