Recent activity

+29 votes

5 answers

1

GATE2014-3-11
The minimum number of arithmetic operations required to evaluate the polynomial $P(X) = X^5+4X^3+6X+5$ for a given value of $X$, using only one temporary variable is ______.

commented 4 minutes ago in Compiler Design by srestha Veteran (111k points) | 5.4k views

+2 votes

1 answer

2

GATE1999-4
Let $G$ be a finite group and $H$ be a subgroup of $G$. For $a \in G$, define $aH=\left\{ah \mid h \in H\right\}$. Show that $|aH| = |bH|.$ Show that for every pair of elements $a, b \in G$, either $aH = bH$ or $aH$ and $bH$ are disjoint. Use the above to argue that the order of $H$ must divide the order of $G.$

commented 29 minutes ago in Set Theory & Algebra by Satbir Boss (12.9k points) | 450 views

+1 vote

1 answer

3

GATE1998-9
Derive the expressions for the number of operations required to solve a system of linear equations in $n$ unknowns using the Gaussian Elimination Method. Assume that one operation refers to a multiplication followed by an addition.

answered 31 minutes ago in Linear Algebra by Arjun Veteran (406k points) | 258 views

0 votes

0 answers

4

ISI2018-PCB-B5
Consider a max-heap of $n$ distinct integers, $n ≥ 4$, stored in an array $\mathcal{A}[1 . . . n]$. The second minimum of $\mathcal{A}$ is the integer that is less than all integers in $\mathcal{A}$ except the minimum of $\mathcal{A}$. Find all possible array indices of $\mathcal{A}$ in which the second minimum can occur. Justify your answer.

commented 43 minutes ago in Algorithms by Meet2698 (195 points) | 16 views

+1 vote

2 answers

5

TIFR2014-A-18
We are given a collection of real numbers where a real number $a_{i}\neq 0$ occurs $n_{i}$ times. Let the collection be enumerated as $\left\{x_{1}, x_{2},...x_{n}\right\}$ so that $x_{1}=x_{2}=...=x_{n_{1}}=a_{1}$ and so on, and $n=\sum _{i}n_{i}$ is finite. What is ... $\min_{i} |a_{i}|$ $\min_{i} \left(n_{i}|a_{i}|\right)$ $\max_{i} |a_{i}|$ None of the above.

answered 1 hour ago in Calculus by Arjun Veteran (406k points) | 161 views

0 votes

2 answers

6

UGCNET-July-2018-II-36
Consider the following two Grammars: $G_1 \: : \: S \rightarrow SbS \mid a$ $G_2 : S \rightarrow aB \mid ab, \: A \rightarrow GAB \mid a, \: B \rightarrow ABb \mid b$ Which one of the folloeing options is correct? Only $G_1$ is ambiguous Only $G_2$ is ambiguous Both $G_1$ and $G_2$ are ambiguous Both $G_1$ and $G_2$ are not ambiguous

commented 1 hour ago in Theory of Computation by Prajna (133 points) | 456 views

+2 votes

1 answer

7

MADE EASY TEST SERIES
A simple network consist of two nodes X and Y. Each node has a single frame of F = 1500 bits (including all header and preambles) to send to each other. Both nodes attempt to transmit at t = 0'. In case that a node executes the exponential Back-off algorithm. In ... 1 and Y draws k = 2. The time taken by X's packet (from t = 0) to be completely delivered toY is ________ μs.

edited 2 hours ago in Computer Networks by Cristine Active (1.7k points) | 524 views

+2 votes

0 answers

8

To find the total no of substring why we are not counting null substring
To find the total no of substring why we are not counting null substring https://stackoverflow.com/questions/12418590/finding-substrings-of-a-string https://gateoverflow.in/2458/gate1994-1-15

edited 2 hours ago in Numerical Ability by Cristine Active (1.7k points) | 56 views

0 votes

1 answer

9

DOUBTS
Plz solve Question 6.what will be it's output

retagged 2 hours ago in Compiler Design by Cristine Active (1.7k points) | 56 views

+1 vote

0 answers

10

virtual gate 2016 Disk size
A disk has 16 equidistant tracks. The diameters of the outermost and innermost tracks are 16 cm and 1 cm respectively. The innermost track has got the capacity of 20 MB. The total amount of data which can be stored on the disk if the ... MB (integer value only). {capacity of each track is equal or outermost track has capacity greater than innermost track?? }

retagged 2 hours ago in CO & Architecture by Cristine Active (1.7k points) | 155 views

+2 votes

1 answer

11

Gate_other_branch_question

retagged 2 hours ago in Probability by Cristine Active (1.7k points) | 70 views

0 votes

0 answers

12

Simple Doubt in counting semaphore
Consider a non-negative counting semaphore S. During an execution, 16P (wait) operations, and 4V (signal) operations are issued in some order. The largest initial value of S for which at least three up operations will remain blocked is ___________ Can someone explain me the solution

retagged 2 hours ago in Operating System by Cristine Active (1.7k points) | 101 views

0 votes

0 answers

13

Self Doubt:Infinite loop
#include<iostream> using namespace std; int i=0; void a() { i+=1; cout<<i<< ".hello"<<endl; a(); } int main() { a(); } For this above code the output is only upto → 64891.Hello Does this mean that that the stack can hold only 64891 recursive calls? (I am using dev c++)

retagged 2 hours ago in Programming by Cristine Active (1.7k points) | 39 views

0 votes

1 answer

14

Self Doubt about ME Test Series
Are comparison charts of Made easy genuine? And say now if my rank is 3 in a test and after sometime if someone scores more than me will my rank get shifted to 4?

retagged 2 hours ago in GATE by Cristine Active (1.7k points) | 42 views

0 votes

0 answers

15

#algorithm
Write the Big-O notation for the following functions. Mention if they are exponential, polynomial, logarithmic or neither of those. Proof is not required, but write one or two sentences about how you arrived at the answer. (a) n log n + .01n$^{3/2}$ + 10n (b) $\frac{log n!}{n}$ (c) 1.01$^{n}$ + n3 (d) .99$^{n}$ + n (e) log(n + n – 1 + ……..+ 1) (f) n.$^{.01}$ + log n2

retagged 2 hours ago in Algorithms by Cristine Active (1.7k points) | 26 views

0 votes

0 answers

16

sliding window protocol question on earth and lunar
A colony is set up on moon. The 10 Mbps link from the earth to the lunar colony measures about 242,000 miles. Assume that the signal propagation speed is 186,000 miles per second. Calculate the minimum round trip time for ... . SRP with window size 8 and negligible processing delay. Go Back-n with window size 64 and negligible processing delay.

retagged 2 hours ago in Computer Networks by Cristine Active (1.7k points) | 85 views

+2 votes

2 answers

17

TIFR2013-A-5
The late painter Maqbool Fida Husain once coloured the surface of a huge hollow steel sphere, of radius $1$ metre, using just two colours, Red and Blue. As was his style however, both the red and blue areas were a bunch of highly irregular disconnected regions. The late ... $11 sq. metres$; None of the above.

commented 2 hours ago in Numerical Ability by srestha Veteran (111k points) | 445 views

0 votes

1 answer

18

TIFR2019-B-15
Consider directed graphs on $n$ labelled vertices $\{1,2, \dots ,n\}$, where each vertex has exactly one edge coming in and exactly coming in and exactly one edge going out. We allow self-loops. How many graphs have exactly two cycles ? $\sum_{k=1}^{n-1} k!(n-k)!$ ... $n!\bigg[\sum_{k=1}^{n-1} \frac{1}{k}\bigg]$ $\frac{n!(n-1)}{2}$ None of the above

answer selected 2 hours ago in Graph Theory by Arjun Veteran (406k points) | 222 views

0 votes

1 answer

19

storage classes in arguments
why we can not have storage classes identifier in arguments and what is actual arguments/formal arguments/paramater etc

edited 2 hours ago in Programming by Cristine Active (1.7k points) | 70 views

+3 votes

1 answer

20

UGCNET-Dec2014-III-44
To compute function points $(FP)$, the following relationship is used $FP$ = Count - total $\times (0.65 + 0.01 \times \sum(F_{i}))$ where $F_{i} (i = 1$ to $n$) are value adjustment factors $(VAF)$ based on $n$ questions. The value of $n$ is $12$ $14$ $16$ $18$

retagged 2 hours ago in IS&Software Engineering by Cristine Active (1.7k points) | 1.1k views

0 votes

4 answers

21

time complexity
time complexity for merging m sorted lists, each with n/m elements

retagged 2 hours ago in Algorithms by Cristine Active (1.7k points) | 112 views

+2 votes

1 answer

22

general conceptual question
Can split horizon alone prevent count to infinity problem or we must use poison reverse with split horizon ?

retagged 2 hours ago in Computer Networks by Cristine Active (1.7k points) | 141 views

0 votes

1 answer

23

galvin
is there any limitations of peterson's method/solution fo critical section problem? if yes then how can they be resolved?

retagged 2 hours ago in Operating System by Cristine Active (1.7k points) | 39 views

0 votes

0 answers

24

ME adv mock
A hypothetical processor on cache read miss requires one clock to send an address to Main Memory (MM) and eight clock cycles to access a 64-bit word from MM to processor cache. Miss rate of read is decreased from 14.8% to 2.6% when line size ... words. The speed up of processor is achieved in dealing with average read miss after increasing the line size is_____ (Upto 2 decimal places)

retagged 2 hours ago in CO & Architecture by Cristine Active (1.7k points) | 63 views

0 votes

0 answers

25

RS aggarwal
In how many different ways can the letters of the word 'MACHINE' be arranged so that the vowels may occupy only the odd places? [closed]

retagged 3 hours ago in Numerical Ability by Cristine Active (1.7k points) | 305 views

0 votes

1 answer

26

Finite Automate and Regular Sets
I have a doubt in this that according to me the answer should be 6 as 5 states for modulo 5 + 1 dead state in starting as according to ques the string is starting from 1 so 0 production will go to a dead state that's my assumption but behind the answer written is 7 states i m really confused how ?? Please help me what is its real answer

edited 3 hours ago in Theory of Computation by Cristine Active (1.7k points) | 169 views

+1 vote

2 answers

27

Routers
wat is minimum no of interface in router?

retagged 3 hours ago in Computer Networks by Cristine Active (1.7k points) | 553 views

0 votes

0 answers

28

Admission
How to write a SOP?What to include in SOP when you are not sure of your interests and don't have a specific purpose of selecting that specialization?

retagged 3 hours ago in Written Exam by Cristine Active (1.7k points) | 37 views

0 votes

1 answer

29

UGCNET-Dec2010-II-43
The system specification is the first deliverable in the computer system engineering process which does not include Functional Description Cost Schedule Technical Analysis

edited 3 hours ago in IS&Software Engineering by Cristine Active (1.7k points) | 316 views

0 votes

1 answer

30

Placing rooks in nXn chess board
Write a recursive backtracking solution for placing $3$ rooks in $6^*6$ chess board. Naive backtracking. Try using bitmask to speed it up.

edited 3 hours ago in Algorithms by Cristine Active (1.7k points) | 254 views

0 votes

0 answers

31

Morris Mano Edition 3 Exercise 3 Question 20 (Page No. 112)
Implement the function F with the Following two level Forms: NAND-AND, AND-NOR, OR-NAND, AND NOR-OR. F(A,B,C,D) = $\sum(0,1,2,3,4,8,9,12)$

retagged 3 hours ago in Digital Logic by Cristine Active (1.7k points) | 21 views

+1 vote

1 answer

32

Self Doubt :Bit Stuffing
End delimeter is → 0111 data to be sent 0111111111. What is the data we should send to the reciever?

retagged 3 hours ago in Computer Networks by Cristine Active (1.7k points) | 107 views

0 votes

1 answer

33

UGCNET-DEC2018-II-56
Consider the following method: int f(int m, int n, boolean x, boolean y) { int res=0; if (m<0) {res=n-m;} else if (x || y) { res=-1; if(n==m){res=1;} } else {res=n;} return res; } /*end of f */ IF P is the minimum number of tests to achieve full statement ... and Q is the number of tests to achieve full branch coverage for f(), then (P,Q) = $(3, 4)$ $(4,3)$ $(2,3)$ $(3,2)$

commented 3 hours ago in Others by Jeewanjot Kaur (127 points) | 156 views

0 votes

0 answers

34

what is java
I want some information about the programming language java.What is java?what are the features of java?And what are the structure of java program and compare java with c++.explain about java in simple example.How this best essay writing service is helping to get the genuine essay? Is this service is beneficial? [closed]

retagged 3 hours ago in Programming by Cristine Active (1.7k points) | 33 views

0 votes

0 answers

35

doubt
How to Calculate Propagation Delay In Carry Look Ahead Adder.

retagged 3 hours ago in Digital Logic by Cristine Active (1.7k points) | 48 views

0 votes

0 answers

36

Nileit
[closed]

retagged 3 hours ago in Computer Networks by Cristine Active (1.7k points) | 37 views

+1 vote

0 answers

37

MadeEasy Test Series 2018: Theory Of Computation - Countable Set

retagged 3 hours ago in Theory of Computation by Cristine Active (1.7k points) | 56 views

+2 votes

1 answer

38

UGCNET-June2015-II-42, S/w engg , Testing
Which of the testing strategy requirements established during requirements analysis are validated against developed software? validation testing integration testing regression testing system testing

retagged 3 hours ago in IS&Software Engineering by Cristine Active (1.7k points) | 637 views

+1 vote

1 answer

39

what is the relation between bounded waiting ,Progress and starvation ?
If any synchronization mechanism does not gurantee any of the conditions either progress or bounded waiting then will it always lead to starvation ,and if both are satisfied then can deadlock occur still ?

commented 4 hours ago in Operating System by Ram Swaroop Active (2.9k points) | 1.2k views

+4 votes

8 answers

40

GATE2019-12
Let $G$ be an undirected complete graph on $n$ vertices, where $n > 2$. Then, the number of different Hamiltonian cycles in $G$ is equal to $n!$ $(n-1)!$ $1$ $\frac{(n-1)!}{2}$

answer selected 4 hours ago in Graph Theory by Arjun Veteran (406k points) | 2.8k 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 Posts

Recent Blog Comments