search
Log In

Recent activity by chauhansunil20th

1 answer
1
2 answers
2
Tell me the difference : &(arr+1) and &arr+1
commented Feb 18, 2019 in Programming 535 views
1 answer
3
If a student can get following which should he pursue according to your perception-: 1-: IIT MADRAS MS 2-:IIIT BANGALORE Mtech 3-:IIT DHANBAD Mtech 4-:IIT Hyderabad RA please mention your perception and in addition if possible add Placement,Research opportunity and Package ?
commented Feb 18, 2019 in IISc/IITs 403 views
6 answers
4
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
commented Feb 8, 2019 in Graph Theory 8.9k views
9 answers
5
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ is between two nodes ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II
commented Feb 1, 2019 in Algorithms 12.4k views
3 answers
6
Q. Suppose you have a computer system with a 48-bit logical address, page size of 16KB and 4 bytes per page table entry. If we have a 48MB program such that the entire program and all necessary page tables are in memory. Assume that each page table at diff level fits in a single page.How much memory is used by program, including its page tables?
commented Jan 31, 2019 in Operating System 3.5k views
1 answer
8
The postorder traversal of a binary search tree is $25, 33, 30, 35, 42, 48, 40, 60, 58, 50$. The inorder traversal of the same tree is $25, 30, 33, 35, 40, 42, 48, 50, 58, 60$. What is the length of the longest path from one leaf to another leaf. (Note: Length of longest path means total number of nodes present in that path).
commented Jan 24, 2019 in Unknown Category 182 views
1 answer
9
All bookstores sell stationary items. All convenience stores sell stationary items. Which of the following conclusions might be TRUE? All bookstores are convenience stores. All convenience stores are bookstores. I II Both I and II Neither I nor II
commented Jan 24, 2019 in Mathematical Logic 227 views
2 answers
10
Consider the following program code, where pow() is the exponentiation function. f (int n) { if (n <= 1) return 1; return f(n-1) + g(n) + g(pow(2, n-1)); } g (int n) { if (n <= 1) return 1; return 1 + g(n/2); } What is the worst-case time complexity of $f(n)$? $O(2^n)$ $O(n^2)$ $O(2^n \log (n))$ $O( \log ^n (n))$
commented Jan 24, 2019 in Unknown Category 183 views
1 answer
11
A number $5k89k2$ can be divided by $18$ if $k$ is $8$ $6$ $1$ More than one value possible
commented Jan 24, 2019 in Unknown Category 218 views
1 answer
12
The last sentence has been deleted from the following paragraph. From the given options, choose that one that completes the paragraph in the most appropriate way. For decades, psychologists believed that men experienced depression at only a fraction of the rate of ... usually seen as a characteristic attribute of depression. Men's irritability is usually seen as a telling sign of medical problems.
commented Jan 24, 2019 in Unknown Category 154 views
6 answers
13
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.
commented Jan 24, 2019 in CO and Architecture 10.3k views
1 answer
15
0 answers
16
Consider the following probability mass function of a random variable X $p(X,q)=\{q\,\,if\,X=0 \\\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,\,1-q\,\,\,if\,X=1\\ 0\,\,otherwise$ If q=0.4, the variance of X is.?
commented Jan 16, 2019 in Probability 592 views
1 answer
17
A system uses Selective-Repeat protocol with a window size of 4.If each packet carries 5000 bits of data, then the time taken to transfer 5 million bits of data, if the distance between sender and receiver is 2500 Km, the propagation speed is 2*108m/s and data rate is 1Mbps. We assume no ... C. 11.25s D. 16.25s I think answer should be around 7.5 to 7.8.. Can any one explain what the answer is ??
commented Jan 16, 2019 in Computer Networks 666 views
3 answers
18
Consider the relational schema given below, where eId of the relation dependent is a foreign key referring to empId of the relation employee. Assume that every employee has at least one associated dependent in the dependent relation. employee (empId, empName, empAge) ... whose age is greater than that of some dependent. all dependents. some of his/her dependents. all of his/her dependents.
commented Jan 11, 2019 in Databases 5.9k views
0 answers
19
L1 = { <M> | M halts on $\epsilon$ } L2 = { <M> | $\epsilon$ $\in$ L(M) } Which one is RE or not RE
comment edited Jan 9, 2019 in Theory of Computation 298 views
1 answer
20
0 answers
21
Ginmans Stack are a kind of special data structure in which if there are odd number of elements then the middle most element is popped out and printed on the screen. In case of even number of elements the recently popped out element is again pushed back either on the top or bottom of the stack randomly. Assume ... i, ii ii, iii iii, iv ii, iv
comment edited Jan 4, 2019 in DS 413 views
2 answers
22
For two data sets, each of size $5$, the variances are given to be $4$ and $5$ and the corresponding means are given to be $2$ and $4$ respectively. The variance of the combined data is? $11/2$ $6$ $13/2$ $5/2$
answered Jan 4, 2019 in Probability 360 views
2 answers
23
Consider the following modified Heapify and Build_heap procedure. void Heapify(int* A, int i, int n) { int left=2*i+1; int right=2*i+2; int mid=i; if (left<=n && right <=n) { if ((A[left] > A[right] && A[left]< A[i]) || A[left]<A[right] && A[left] >A[i]) mid=left; else if((A[left<A[right] && A[right]<A[i]) ... $6 \: 8 \: 1 \: 9 \: 4$ $9 \: 6 \: 1 \: 8 \: 4$ $6 \: 9 \: 1 \: 8 \: 4$
answered Jan 4, 2019 in Algorithms 394 views
2 answers
24
Consider a parent process $P$ that has forked a child process $C$. $C$ has again forked another child process $D$. Now $P$ terminates while $C$ and $D$ are still running. In this case, which of the following statements is true? $P$ immediately becomes a ... $P$ $P$ immediately becomes an orphan process, until adopted by its parent
answered Jan 4, 2019 in Operating System 713 views
1 answer
25
A single query in DBMS can be executed through different algorithms or re-written in different forms and structures. The most optimal pathway of getting the correct output among all these algorithms can be obtained by the process of query optimization. Consider the ... from Employee where columnB >3000 and columnC<3000; select columnA from Employee; The given query is already in optimized form.
answered Jan 4, 2019 in Databases 237 views
2 answers
26
Consider the following two relational schemas: MovieExec(name, address, cert, netWorth) Studio(name, address, presC) Suppose we wish to require that one must have a net worth of at least $1000000$ Rupees to be president of a movie studio. The join operation if required can be performed on the ... P, Q and S P, Q and R Q and R P and S
answered Jan 4, 2019 in Databases 306 views
1 answer
27
A class of first year B.tech students is composed of four batches A, B, C and D, each consisting of $30$ students. It is found that the sessional marks of students in Engineering Drawing in batch C have a mean of $6.6$ and standard deviation of $2.3$. The mean and the standard deviation of ... class. Due to this, the marks of a student in batch C are changed from $8.5$ to $6.0$ $7.0$ $8.0$ $9.0$
comment edited Jan 4, 2019 in Probability 314 views
1 answer
28
Consider the following language $L$: $L=\{<M,x,k> \mid M \text{ is a Turing Machine and M does not halt on x within k steps} \}$ The language family to which $L$ belongs is not closed under? Intersection Homomorphism Set Difference Complementation
answered Jan 4, 2019 in Theory of Computation 405 views
1 answer
29
Which of the following statements on Viable Prefixes is incorrect? A viable prefix does not extend past the right end of the handle For any context-free grammar, the set of viable prefixes is a regular language A viable prefix by default is a suffix of the handle As long as a parser has viable prefixes on the stack no parsing error has been detected
answered Jan 4, 2019 in Compiler Design 370 views
1 answer
30
Let $f(A, B, C, D)=\Pi (2, 3, 5, 9, 11, 12, 13)$ The total number of prime implicants and essential prime implicants are denoted by $P$ and $Q$ respectively. What is the value $Q \% P$ where $'\%'$ denotes the modulo operator?
answered Jan 4, 2019 in Digital Logic 663 views
...