Recent activity

0 votes

1 answer

1

Made Easy Test Series: Programming-Recursive and Iterative Program
$I=$Iterative Program $R=$ Recursive Program $(A)$ For every program belonging to class $I$, there is an equivalent program to class $R.$ $(B)$ Every program in $R$ uses strictly more stack space compared to equivalent program in $I.$ Among $(A)$ and $(B)$ which one is correct?

answered May 22 in Programming by Kaluti Loyal (6.1k points) | 10 views

0 votes

1 answer

2

Made Easy Test Series:Binary Tree
Consider the following function with a binary tree with atleast one node: int path(struct node *x, int len){ if(x==NULL) return B; else return A; } Assume the above function is used to check the given binary tree has any path with specified length from root to ... $B$ is $(len== -1)$ which of these two option correct? Please Explain.

commented May 22 in DS by Kaluti Loyal (6.1k points) | 69 views

+1 vote

2 answers

3

GATE_2011_MN_65
Nimbus clouds are dark and ragged, stratus clouds appear dull in colour and cover the entire sky. Cirrus clouds are thin and delicate, whereas cumulus clouds look like cotton balls. It can be inferred from the passage that A cumulus cloud on the ... Clouds are generally of very different shapes, sizes and mass There are four basic cloud types: stratus, nimbus, cumulus and cirrus

answer selected May 22 in Numerical Ability by Arjun Veteran (400k points) | 252 views

0 votes

1 answer

4

Made Easy Test Series: Data Structure
$A)$ Rotation operation of AVL tree always preserves the inorder numbering. $B)$ If every node of BST has either $0$ or $2$ children , then searching time is $O(log n)$ Which statement is correct? Given $A)$ is correct but $B)$ is not. Plz explain how?

commented May 22 in DS by Kaluti Loyal (6.1k points) | 25 views

0 votes

1 answer

5

Made Easy Test Series:Programming in C
Consider the following $C$ implementation which when given $3$ numbers a,b,c as input, find the maximum of $3$ numbers $a,b,c.$ int kickstart(int a,int b,int c) { if(B1) return a; if(a>=b) return B2; return kickstart(c,a,b); } How the boxes filled up ... $a\geq c, B2:kickstart\left ( b,c,a \right );$ Is it $I) and II)$ or $I) and IV)$

comment edited May 22 in Programming by Satbir Loyal (7.5k points) | 54 views

+1 vote

0 answers

6

Vani Qs Bank Algorithms
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i. Ans should be O(log n) right by doing binary search ??

commented May 21 in Algorithms by srestha Veteran (114k points) | 26 views

0 votes

2 answers

7

Made Easy Test Series: DS-Hash Table
Consider a hash table with $N$ slots. It is given that the collision resolution technique used in chaining. Assume simple uniform hashing, what is the probability that the last $k$ slots are unfilled after the first $'r'$ insertions? $A)\left ( 1-\frac{N}{k} \right )^{r}$ ... $C)\left ( 1+\frac{N}{k} \right )^{r-1}$ $D)\left ( 1-\frac{k}{N} \right )^{r-1}$

commented May 21 in DS by Kaluti Loyal (6.1k points) | 42 views

0 votes

2 answers

8

Carl hamacher
A program consists of two nested loops-a small inner loop and a much larger outer loop.The decimal memory addresses shown delineate the location of the two loops and the beginning and end of the total program. All memory locations in the various sections of ... the cycle time of the cache is 1τ s. Compute the total time needed for instruction fetching during execution of the program.

answered May 21 in CO & Architecture by isilia (11 points) | 201 views

0 votes

1 answer

9

Self Doubt on Linked List
Can somebody write the code or algorithm, how merge sort works efficiently in linked list? Is Heap sort most inefficient in Linked List Sorting? Elaborate plz

commented May 21 in DS by Kaluti Loyal (6.1k points) | 27 views

0 votes

0 answers

10

PIPELINING.
How to find number of stall cycles and branch penalty & CPI in a branched instruction pipelining?

commented May 21 in CO & Architecture by Satbir Loyal (7.5k points) | 3 views

0 votes

2 answers

11

Uttrakhand Asst. Professor Exam-72
Context diagram explains The internal view of the system The overview of the system The entities of the system None of the above.

answer selected May 21 in Others by Sayan Bose Loyal (6.9k points) | 75 views

+3 votes

3 answers

12

GATE2019-44
Consider the following matrix: $R = \begin{bmatrix} 1 & 2 & 4 & 8 \\ 1 & 3 & 9 & 27 \\ 1 & 4 & 16 & 64 \\ 1 & 5 & 25 & 125 \end{bmatrix}$ The absolute value of the product of Eigen values of $R$ is _______

answer edited May 21 in Linear Algebra by Arjun Veteran (400k points) | 2.2k views

+1 vote

1 answer

13

IIIT PGEE 2019
What is the time complexity to delete an arbitrary node from binary heap? O(n) O(log n) O(1) O(n log n)

commented May 21 in Programming by Kaluti Loyal (6.1k points) | 108 views

0 votes

1 answer

14

oops doubt
A default catch block catches, [A]. all thrown objects [B]. no thrown objects [C]. any thrown object that has not been caught by an earlier catch block [D]. all thrown objects that have been caught by an earlier catch block

answered May 21 in Programming by Kaluti Loyal (6.1k points) | 9 views

+32 votes

7 answers

15

GATE2010-37
The program below uses six temporary variables $a, b, c, d, e, f$. a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f Assuming that all operations take their operands from registers, what is the minimum number of registers needed to execute this program without spilling? $2$ $3$ $4$ $6$

commented May 21 in Compiler Design by Sambhrant Maurya Active (1.7k points) | 4.7k views

+2 votes

2 answers

16

UGCNET-June2012-III-30
While unit testing a module, it is found that for a set of test data, maximum 90% of the code alone were tested with a probability of success 0.9. The reliability of the module is at least greater than 0.9 equal to 0.9 at most 0.81 at least 1/0.81

commented May 21 in IS&Software Engineering by Sayan Bose Loyal (6.9k points) | 1.8k views

0 votes

0 answers

17

Made Easy Test Series:Algorithm
Given a sorted array of distinct integer $A\left [ 1,2,....n \right ]$, the tightest upper bound to check the existence of any index $i$, for which $A[i]=i$ ... index and then checking if $A[i]=i$, but answer given as $O(log n).$Please help me out, which will be correct answer?

commented May 21 in Algorithms by Satbir Loyal (7.5k points) | 76 views

0 votes

1 answer

18

Made Easy Test Series:Programming(FLT4)
#include<stdio.h> #include<iostream> int bar(int m, int n){ if(m==0)return n; if(n==0)return m; return bar(n%m,m); } int foo(int m,int n){ return(m*n/bar(m,n)); } int main(){ int x=foo(1000,1500); printf("%d",x); return 0; } Output of the program is ___________

commented May 21 in Programming by Kaluti Loyal (6.1k points) | 25 views

+5 votes

2 answers

19

TIFR2019-A-3
$A$ is $n\times n$ square matrix for which the entries in every row sum to $1$. Consider the following statements: The column vector $[1,1,\ldots,1]^T$ is an eigenvector of $A.$ $ \text{det}(A-I) = 0.$ $\text{det}(A) = 0.$ Which of the above statements must be TRUE? Only $(i)$ Only $(ii)$ Only $(i)$ and $(ii)$ Only $(i)$ and $(iii)$ $(i),(ii) \text{ and }(iii)$

answer selected May 21 in Linear Algebra by Arjun Veteran (400k points) | 402 views

+4 votes

2 answers

20

TIFR2010-A-5
$A$ is symmetric positive definite matrix ( i.e., $x^{T} Ax > 0$ for all non zero $x$). Which of the following statements is false? At least one element is positive. All eigen values are positive real. Sum of the diagonal elements is positive. det (A) is positive. None of the above.

commented May 21 in Linear Algebra by Satbir Loyal (7.5k points) | 373 views

0 votes

1 answer

21

Gatebook-Sequential circuit
Which of the following flip flops is used as a 1-bit memory element? (A) T flip flop (B) SR flip flop (C) D flip flop (D) JK flip flop

commented May 21 in Digital Logic by Satbir Loyal (7.5k points) | 10 views

+36 votes

6 answers

22

GATE2014-1-47
A function $f(x)$ is continuous in the interval $[0,2]$. It is known that $f(0) = f(2) = -1$ and $f(1) = 1$. Which one of the following statements must be true? There exists a $y$ in the interval $(0,1)$ such that $f(y) = f(y+1)$ For every $y$ in the interval ... of the function in the interval $(0,2)$ is $1$ There exists a $y$ in the interval $(0,1)$ such that $f(y)$ = $-f(2-y)$

answer edited May 21 in Calculus by Arjun Veteran (400k points) | 5.2k views

0 votes

0 answers

23

Made Easy Test Series: Database-Normalization
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??

commented May 21 in Databases by aditi19 Active (3.5k points) | 23 views

0 votes

1 answer

24

jnu mtech 2016- 47
Which of the following is not true about Turing machine? (a) It can accept any palindrome (b) It can accept any context free language (c) It can accept {a^m b^n c^mn:m,n>=0 (d) One tape Turing machine can be converted into C++ programs

commented May 21 in Theory of Computation by Satbir Loyal (7.5k points) | 18 views

0 votes

1 answer

25

Made Easy Test Series:General Aptitude-Circle
In a right angle triangle $ABC$ with vertex $B$ being the right angle, the mutually perpendicular sides $AB$ and $BC$ are $p$ cm. and $q$ cm. long respectively. If the length of hypotenuse is $\left ( p+q-6 \right )$ cm., then the radius of the largest possible circle that can be inscribe in the triangle is ____________

commented May 21 in Numerical Ability by Satbir Loyal (7.5k points) | 18 views

+25 votes

5 answers

26

GATE2000-2.12
The following arrangement of master-slave flip flops has the initial state of $P, Q$ as $0, 1$ (respectively). After three clock cycles the output state $P, Q$ is (respectively), $1, 0$ $1, 1$ $0, 0$ $0, 1$

answer edited May 21 in Digital Logic by Arjun Veteran (400k points) | 3.2k views

+43 votes

3 answers

27

GATE2004-63
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ \begin{array}{|l|l|c|} \hline \text {Instruction} & \text{Operation }& \text{Instruction size} \\&& \text{(in words)} \\\ ... halted after executing the HALT instruction, the return address (in decimal) saved in the stack will be $1007$ $1020$ $1024$ $1028$

answered May 21 in CO & Architecture by Apoorv Singh (11 points) | 8.1k views

0 votes

2 answers

28

Made Easy Test Series:Database-SQL
Find the name of Sailors with a higher rating than all sailors with age $<22?$ $Query1: $ Select S.name from sailor S where not exists (Select * from sailor $S_{2} $where $S_{2}.age<22$ and $S.rating<=S_{2}.rating$ ... above query?? I think Query2 and Query3 itself differentiate with ANY and ALL keyword. But what about Query1? Will it return ALL tuples?

answer selected May 21 in Databases by srestha Veteran (114k points) | 72 views

0 votes

1 answer

29

Andrew S. Tanenbaum Edition 5 Exercise 4 Question 6 (Page No. 351)
What is the length of a contention slot in CSMA/CD for (a) a 2-km twin-lead cable (signal propagation speed is 82% of the signal propagation speed in vacuum)?, and (b) a 40-km multimode fiber optic cable (signal propagation speed is 65% of the signal propagation speed in vacuum)?

answered May 21 in Computer Networks by pradeepchaudhary Active (1.2k points) | 29 views

0 votes

1 answer

30

Andrew S. Tanenbaum Edition 5th Exercise 4 Question 20 (Page No. 352)
How many frames per second can gigabit Ethernet handle? Think carefully and take into account all the relevant cases. Hint: the fact that it is gigabit Ethernet matters.

answered May 21 in Computer Networks by pradeepchaudhary Active (1.2k points) | 11 views

+1 vote

2 answers

31

Virtual Gate Test Series: Databases - Sql Query
Consider the following instances $R.$ A 1 2 3 4 B Null 1 2 2 The number of tuples returned by the following $\text{SQL query}$ is$?$ $>$select $*$ from $R$ as $R_{1}$ where not exists$($select $*$ from $R$ where $B = R_{1}.A)$

answered May 21 in Databases by aditi19 Active (3.5k points) | 103 views

+1 vote

2 answers

32

GO2019-FLT1-8
What is the value of $\{ ( 1/ \log_3 60)+ (1/ \log_4 60 ) + (1/ \log_5 60) \}$? $0$ $1$ $5$ $60$

answer edited May 21 in Others by pranay562 Active (1.2k points) | 125 views

0 votes

0 answers

33

SQL practice questions
From where practice SQL query questions of GATE level , apart from previous year questions.

commented May 21 in Databases by aditi19 Active (3.5k points) | 25 views

0 votes

1 answer

34

Andrew S. Tanenbaum Edition 5 Exercise 4 Question 3 (Page No. 351)
Consider the delay of pure ALOHA versus slotted ALOHA at low load. Which one is less? Explain your answer.

answered May 21 in Computer Networks by noob_coder (251 points) | 12 views

0 votes

0 answers

35

Andrew S. Tanenbaum Edition 5th Exercise 6 Question 32 (Page No. 609)
If the TCP round-trip time, RTT, is currently 30 msec and the following acknowledgements come in after 26, 32, and 24 msec, respectively, what is the new RTT estimate using the Jacobson algorithm? Use α = 0.9.

commented May 21 in Computer Networks by Ashutosh_k (47 points) | 17 views

+9 votes

3 answers

36

GATE2018-39
In a system, there are three types of resources: $E, F$ and $G$. Four processes $P_0$, $P_1$, $P_2$ and $P_3$ execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. For example, ... of $F$ were available The system is not in $safe$ state, but would be $safe$ if one more instance of $G$ were available

answer edited May 21 in Operating System by Naveen Kumar 3 Boss (11.9k points) | 2.1k views

+18 votes

6 answers

37

GATE1999-1.10
Which of the following disk scheduling strategies is likely to give the best throughput? Farthest cylinder next Nearest cylinder next First come first served Elevator algorithm

answer edited May 21 in Operating System by Naveen Kumar 3 Boss (11.9k points) | 2.5k views

+33 votes

1 answer

38

GATE2004-12
Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is First Come First Served (FCFS). If FCFS is replaced by Shortest Seek Time First (SSTF), claimed by the vendor to give $50 \%$ better ... , what is the expected improvement in the I/O performance of user programs? $50 \%$ $40\%$ $25\%$ $0\%$

answer edited May 21 in Operating System by Naveen Kumar 3 Boss (11.9k points) | 3.9k views

+45 votes

7 answers

39

GATE2007-IT-83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. The head is initially positioned at track number $180$. What is the maximum cardinality of the request set, so that the head changes its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$

answer edited May 21 in Operating System by Naveen Kumar 3 Boss (11.9k points) | 5.1k views

+30 votes

4 answers

40

GATE2006-38
Consider a Boolean function $ f(w,x,y,z)$. Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors $ i_{1}=\left \langle w_{1}, x_{1}, y_{1},z_{1}\right \rangle $ ... $ wx\overline{y} \overline{z}, xz, w\overline{x}yz$ $ wx\overline{y}, wyz, wxz, \overline{w}xz, x\overline{y}z, xyz$

answer edited May 21 in Digital Logic by Naveen Kumar 3 Boss (11.9k points) | 6.1k views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent activity

Recent Posts

Recent Blog Comments