Recent questions tagged ugcnetjune2014iii

Assume that a program will experience 200 failures in infinite time. It has now experienced 100 failures. The initial failure intensity was 20 failures/CPU hr. Then the c...

Let $L$ be any language. Define $\text{Even} (W)$ as the strings obtained by extracting from $W$ the letters in the even-numbered positions and $\text{Even}(L) = \{ \text...

Which one of the following describes the syntax of prolog program?Rules and facts are terminated by full stop(.)Rules and facts are terminated by semi colon(;)Variables n...

Given$U=\{1, 2, 3, 4, 5, 6, 7 \} \\ A =\{(3, 0.7), (5, 1), (6, 0.8) \}$then $\tilde{A}$ will be: (where $\sim \rightarrow$ complement)$\{(4, 0.7), (2, 1), (1, 0.8)\}$$\{(...

Match the following $:$$\begin{array}{clcl} & \textbf{List – I} & & \textbf{List – II} \\ \text{a.} & \text{Chomsky Normal form} & \text{i.} & S \rightarrow b S S \mi...

A network on the Internet has a subnet mask of $255.255.240.0$. What is the maximum number of hosts it can handle ? $1024$$2048$$4096$ $8192$

Which layers of the OSI reference model are host-to-host layers ? Transport, Session, Presentation, ApplicationNetwork, Transport, Session, PresentationData-link, Network...

A terminal multiplexer has six $1200$ bps terminals and $'n'$ $300$ bps terminals connected to it. If the outgoing line is $9600$ bps, what is the value of $n$?$4$$8$$16$...

Ten signals, each requiring $3000$ Hz, are multiplexed on to a single channel using FDM. How much minimum bandwidth is required for the multiplexed channel ? Assume that ...

Suppose that the splits at every level of quicksort are in the proportion $(1 – \alpha)$ to $\alpha$, where $0<\alpha\leq\frac{1}{2}$ is a constant. The minimum depth of ...

Given the following statements :$S_{1}$ : The subgraph-isomorphism problem takes two graphs $G_{1}$ and $G_{2}$ and asks whether $G_{1}$ is a subgraph of $G_{2}$ . $S_{2}...

If $h$ is chosen from a universal collection of hash functions and is used to hash $n$ keys into a table of size $m$, where $n \leq m$, the expected number of collisions ...

The solution of the recurrence relation of $ T(n)=3T\left(floor \left(\frac{n}{4}\right)\right)+n$ is$O(n^{2})$$O(n/g n)$$O(n)$ $O(l g n)$

Consider the fractional knapsack instance$n = 4, (p_{1} , p_{2} , p_{3} , p_{4} ) = (10, 10, 12, 18), (w_{1} , w_{2} , w_{3} , w_{4} ) = (2, 4, 6, 9)$ and $M = 15$.The ma...

The initial basic feasible solution of the following transportion problem:is given as5 8 7 2210then the minimum cost is767880 82

The given maximization assignment problem can be converted into a minimization problem bySubtracting each entry in a column from the maximum value in that column.Subtract...

Which of the following special cases does not require reformulation of the problem in order to obtain a solution ?Alternate optimalityInfeasibility UnboundednessAll of th...

Given an image of size $1024 \times 1024$ pixels in which intensity of each pixel is an $8$-bit quality. It requires _______ of storage space if the image is not compress...

Linking to another place in the same or another webpage require two A (Anchor) tags, the first with the _______ attribute and the second with the _______ attribute. NAME ...

The syntax of capturing events method for document object isCaptureEvents() CaptureEvents(Orgs eventType)CaptureEvents(eventType)CaptureEvents(eventVal)

Match the following interfaces of Java. Servlet package $:$$\begin{array}{clcl} & \textbf{List – I} && \textbf{List – II}\\ \text{a.}& \text{Servlet config} & \text{i} & ...

The pure object oriented programming language with extensive metadata available and modifiable at run time isSmall talkC++ JavaEiffel