Recent activity by minal - GATE Overflow

1 answer

1

static single assignment
# of temporary variable required to create 3 address code in static single assignment form for the expression P+Q*R-S/(Q*R).

commented Jan 29 in Compiler Design | 96 views

1 answer

2

GO2017-Programming-1-17
#include <stdio.h> int foo(int a[100]) { return sizeof(a); } int main() { int a[10]; printf("%d", foo(a)); } What will be the output of the above code ignoring any compiler warnings and assuming sizeof(int) as 4 when run on a 64 bit machine?

commented Jan 21 in Programming | 671 views

0 answers

3

synchronization
verify progress is satisfied or not ?

asked Jan 20 in Operating System | 20 views

1 answer

4

self doubt
if the flip flops are going in these states that is starts from 0 to 5 then 4 and then again 5 .Then what is the mod of the circuit??

commented Jan 18 in Digital Logic | 48 views

10 answers

5

GATE2015-2-40
The number of onto functions (surjective functions) from set $X = \{1, 2, 3, 4\}$ to set $Y=\{a,b,c\}$ is ______.

commented Jan 18 in Set Theory & Algebra | 7.7k views

3 answers

6

ISI2016
Let $A$ be a matrix such that: $A=\begin{pmatrix} -1 & 2\\ 0 & -1 \end{pmatrix}$ and $B=A+A^2+A^3+\ldots +A^{50}$. Then which of the following is true? $B^{2}=I$ $B^{2}=0$ $B^{2}=B$ None of the above

commented Jan 17 in Linear Algebra | 613 views

0 answers

7

MadeEasy Test Series 2019: Programming & DS - Programming In C
Please explain the solution, whats the actual logic in questions of Preprocessor codes?

commented Jan 17 in Programming | 90 views

7 answers

8

GATE2014-1-37
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I pick $1, 2, 4, 8, 16$ coins respectively from bags $1$ to $5$ Their total weight comes out to $323$ gm. Then the product of the labels of the bags having $11$ gm coins is ___.

commented Jan 9 in Algorithms | 2.5k views

3 answers

9

GATE1987-4a
Find out the width of the control memory of a horizontal microprogrammed control unit, given the following specifications: $16$ control lines for the processor consisting of ALU and $7$ registers. Conditional branching facility by checking $4$ status bits. Provision to hold $128$ words in the control memory.

commented Dec 29, 2018 in CO and Architecture | 752 views

0 answers

10

MadeEasy Test Series: Computer Networks - Token Bucket

commented Dec 27, 2018 in Computer Networks | 133 views

0 answers

11

made easy test series (network security)

commented Dec 26, 2018 in Computer Networks | 68 views

8 answers

12

GATE2015-2-52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... what will be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$

commented Dec 25, 2018 in Computer Networks | 7.8k views

5 answers

13

GATE2010-15. PGEE 2018
One of the header fields in an IP datagram is the Time-to-Live (TTL) field. Which of the following statements best explains the need for this field? It can be used to prioritize packets. It can be used to reduce delays. It can be used to optimize throughput. It can be used to prevent packet looping.

commented Dec 24, 2018 in Computer Networks | 1.6k views

8 answers

14

GATE2005-73
In a packet switching network, packets are routed from source to destination along a single path having two intermediate nodes. If the message size is $24$ bytes and each packet contains a header of $3$ bytes, then the optimum packet size is: $4$ $6$ $7$ $9$

answer edited Dec 24, 2018 in Computer Networks | 9.5k views

0 answers

15

Functional Dependency
Consider a relation R(ABCD) with functional dependency F:{ AD → B, AB → C }. Is AB → C partial or total dependency?

commented Dec 20, 2018 in Databases | 108 views

4 answers

16

GATE2006-IT-84
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in ... R.cid = C.cid and C.colour = 'green' ) Karthikeyan, Boris Sachin, Salman Karthikeyan, Boris, Sachin Schumacher, Senna

commented Dec 18, 2018 in Databases | 1.3k views

2 answers

17

A cascade of three identical modulo-5 counters has an overall modulus of ?
(A) 5 (B) 25 (C) 125 (D) 625

commented Dec 16, 2018 in Digital Logic | 1.8k views

1 answer

18

ME TEST SERIES
B does not satisfy Bounded wait. Ans should be None of these only. Please verify.

commented Dec 15, 2018 in Operating System | 381 views

0 answers

19

Threads
Which of the following is not a reason to create threads? A)To achieve true CPU concurrency B)Creating a new process is costly C)Communication between processes must go through operating system D)The process as a whole gets one time slice irrespective of the no of threads it has

asked Dec 7, 2018 in Operating System | 79 views

0 answers

20

derangement
consider 5 numbered balls and 5 numbered boxes , how many ways are possible such that exactly 2 balls is not on the ith spot ? [Ball i is in the ith box ]

comment edited Oct 27, 2018 in Combinatory | 80 views

0 answers

21

made easy
Mrs Neha worked for her project , designed two operations given below and asked her students to check whether language L is closed under below operations or not: operation1(L): {wϵ L| no proper prefix of w is a member of L} operation2(L): {wϵ L| w is ... regular, then it is closed under operation2 but not under operation1. (D) if L is regular, then it is not closed under any operation.

comment moved Oct 15, 2018 in Theory of Computation | 57 views

3 answers

22

GATE2001-2.18
Consider the following three C functions: $[P1]$ int *g(void) { int x = 10; return (&x); } $[P2]$ int *g(void) { int *px; *px = 10; return px; } $[P3]$ int *g(void) { int *px; px = (int*) malloc (sizeof(int)); *px = 10; return px; } Which of the above three functions are likely to cause problems with pointers? Only $P3$ Only $P1$ and $P3$ Only $P1$ and $P2$ $P1, P2$ and $P3$

answer selected Sep 28, 2018 in Programming | 5.5k views

0 answers

23

TOC(Grammar)
Ans will be

asked Sep 22, 2018 in Theory of Computation | 60 views

5 answers

24

GATE1987-10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.

answer selected Sep 22, 2018 in Theory of Computation | 1.3k views

1 answer

25

Made easy work book
Design a combination circuit that accepts a 2 bit number as input and generate binary number equal to square of the input number.

answer selected Sep 16, 2018 in Digital Logic | 44 views

1 answer

26

MadeEasy Test Series: Compiler Design - Register Allocation
The following program uses six different variables p, q, r, s, t and u. The code is: p=6 q=7 t=p*q s=t+p u=8 u=s*p s=p+u r=r*q t=t+p return t Assume that all operations take their operands from registers, the minimum ... is 5, but my answer is 4. I think that the step u=8 can be skipped since 'u' is being reinitialized in the next step.

comment edited Sep 6, 2018 in Compiler Design | 131 views

2 answers

27

Static single variable

answer selected Sep 6, 2018 in Compiler Design | 85 views

0 answers

28

Injective Function
The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pthelement of set B are _________.

closed Aug 28, 2018 in Combinatory | 46 views

1 answer

29

Kenneth Rosen Edition 6th Exercise 1.1 Question 10 (Page No. 17)
Let p, q, and r be the propositions p : You get an A on the final exam. q : You do every exercise in this book. r : You get an A in this class. Write these propositions using p, q, and r and logical connectives (including ... get an A in this class if and only if you either do every exercise in this book or you get an A on the final.

answer edited Aug 22, 2018 in Mathematical Logic | 211 views

3 answers

30

GATE1990-1-iv-b
A 32-bit floating-point number is represented by a 7-bit signed exponent, and a 24-bit fractional mantissa. The base of the scale factor is 16, The range of the exponent is ___________, if the scale factor is represented in excess-64 format.

answered Jun 28, 2018 in Digital Logic | 663 views

2 answers

31

ACE TEST SERIES QUESTION

closed Jun 11, 2018 in Programming | 212 views

2 answers

32

# P&C
A mixed doubles tennis game is to be played between two teams (each team consists of one male and one female). There are four married couples. No team is to consist of a husband and his wife. What is the maximum number of games that can be played? GIVEN ANS 42 , ... wife at their correct husband (dearrangement=n ) these are no of teams and total no of games will be nc2 . where am i missing ?

answer selected May 26, 2018 in Numerical Ability | 261 views

2 answers

33

#Permuatation
How many different sums can be formed with the following coins: 5 rupee, 1 rupee, 50 paisa, 25 paisa, 10 paisa, 3 paisa, 2 paisa and 1 paisa? is it $2^{8}-2$ ?

asked May 25, 2018 in Numerical Ability | 429 views

1 answer

34

Proper subset and subset
Please solve this question along with explanation.

answered May 1, 2018 in Mathematical Logic | 139 views

1 answer

35

ENGINEERING MATHEMATICS
The number of multi sets of size $4$ are possible with the elements of the set $S= \{1,2,3,4,5,6\}$ is ________ .

answer selected Apr 30, 2018 in Set Theory & Algebra | 76 views

0 answers

36

closed Apr 30, 2018 in Set Theory & Algebra | 106 views

1 answer

37

SET THEORY
If R=P(phi) and T=P({1,2}) where P is power set Then cardinality for S=R * T is ? What i know is phi *{Any set} = phi so above cardinality must be zero too.

answered Apr 30, 2018 in Set Theory & Algebra | 79 views

0 answers

38

comment edited Apr 30, 2018 in Mathematical Logic | 42 views

4 answers

39

GATE2016-2-14
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on Greedy paradigm. Divide-and-conquer paradigm. Dynamic Programming paradigm. Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.

comment edited Apr 15, 2018 in Algorithms | 2k views

1 answer

40

Kenneth Rosen Edition 6th Exercise 6.4 Question 33 (Page No. 442)
Use generating function to solve the recurrence relation $a_k=3{a_{k-1}} + 2$ with initial conditions $a_0=1 $.

comment edited Apr 12, 2018 in Combinatory | 266 views

50,647 questions

56,479 answers

195,421 comments

100,553 users