Register
Filter

Answers by Prashant.

910
views
3 votes
UGC NET CSE | December 2014 | Part 3 | Question: 62
Match the following $:$ $\begin{array} {clcl} & \textbf{List – I} && \textbf{List – II} \\ \text{a.}& \text{Context free grammar} & \text{i.} & \text{Linear bounded a...
2.3k
views
2 votes
UGC NET CSE | December 2014 | Part 3 | Question: 61
Given the recursively enumerable language $(L_{RE})$, the context sensitive language $(L_{CS})$, the recursive language $(L_{REC})$, the context free language $(L_{CF})$ ...
1.3k
views
4 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 57
In propositional language $P \leftrightarrow Q$ is equivalent to (where $\sim$ denotes NOT)$\sim (P \vee Q) \wedge \sim (Q \vee P)$$(\sim P \vee Q) \wedge (\sim Q \vee P)...
280
views
2 votes
Algorithms
If f(n)=O(g(n)) then 2f(n)=O(2g(n)). Is this statement true ?
3.4k
views
2 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 31
An all-pairs shortest-paths problem is efficiently solved using:Dijkstra's algorithmBellman-Ford algorithmKruskal algorithmFloyd-Warshall algorithm
4.2k
views
3 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 30
The minimum payload of a TCP segment is65,53565,51565,49565,475
1.9k
views
2 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 25
Which transmission technique guarantees that data packets will be received by the receiver in the same order in which they were sent by the sender?BroadcastingUnicastingP...
4.5k
views
2 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 26
Which one of the following control fields in TCP header is used to specify whether the sender has no more data to transmit?FINRSTSYNPSH
4.1k
views
1 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 22
The casual form of the disjunctive normal form $\neg A \vee \neg B \vee \neg C \vee D$ is:$A \wedge B \wedge C \Rightarrow D$$A \vee B \vee C \vee D \Rightarrow true$$A \...
2.7k
views
1 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 21
The transition function for the language $L=\{w \mid n_a (w) \text{ and } n_b(w) \text{ are both odd} \}$ is given by:$\delta (q_0, a)=q_1$;$\delta (q_0, b)=q_2$$\delta (...
6.7k
views
1 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 20
The regular expression corresponding to the language L where $L=\{ x \in \{0,1\}^* \mid x \text{ ends with 1 and does not contain substring 00} $ is(1+01)* (10+01)(1+01)*...
6.2k
views
2 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 19
Minimal deterministic finite automaton for the language $L=\{0^n \mid n \geq 0, n \neq 4 \}$ will have:1 final state among 5 states4 final states among 5 states1 final st...
3.2k
views
3 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 8
The STUDENT information in a university stored in the relation STUDENT (Name, SEX, Marks, DEPT_Name). COnsider the following SQL Query:SELECT DEPT_Name from STUDENT where...
2.6k
views
1 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 4
The equivalent hexadecimal notation for octal number 2550276 isFADEDAEOBEADOBEACABE
3.8k
views
1 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 3
The RST 7 instruction in 8085 microprocessor is equal toCALL 0010 HCALL 0034 HCALL 0038 HCALL 003C H
9.1k
views
3 votes
UGC NET CSE | Junet 2015 | Part 3 | Question: 2
Consider a 32-bit microprocessor, with a 16-bit external data bus, driven by an 8 MHz input clock. Assume that this microprocessor has a bus cycle whose minimum duration ...
1.2k
views
2 votes
operating system-paging
"In a 32-bit machine we subdivide the virtual address into 4 segments as follows:[10-bit 8-bit 6-bit 8 bit]We use a 3-level page table, such that the first 10-bit are for...
3.9k
views
1 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 46
In the case of parallelization, Amdahl's law states that if $P$ is the proportion of a program that can be made parallel and $(1-P)$ is the proportion that cannot be para...
4.2k
views
0 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 48
Which of the following algorithms sort $n$ integers, having the range $0$ to $(n^2 -1)$, in ascending order in $O(n)$ time?Selection sortBubble sortRadix sortInsertion so...
3.1k
views
0 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 37
Let $P-i$ and $P_j$ two processes, R be the set of variables read from memory, and W be the set of variables written to memory. For the concurrent execution of two proces...
2.7k
views
3 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 28
Which of the following is not associated with the session layer?Dialog controlToken managementSemantics of the information transmittedsynchronization
4.8k
views
2 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 26
Which of the following protocols is an application layer protocol that establishes, manages and terminates multimedia sessions?Session Maintenance ProtocolReal-time Strea...
2.0k
views
2 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 27
Match the following port numbers with their uses:$\begin{array}{|ll|ll|} \hline & \textbf{List – I} & & \textbf{List – II} \\ \hline \text{a.} & 23 & i. & \text{World...
1.6k
views
3 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 29
What is the size of the 'total length' field in $IPv4$ diagram?$4$ bits$8$ bits$16$ bits$32$ bits
2.4k
views
2 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 30
Which of the following is/are restriction(s) in classless addressing?The number of addresses needs to be a power of $2$The mask needs to be included in the address to def...
2.6k
views
3 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 32
The translator which performs macro calls expansion is calledMacro processorMicro pre-processorMacro pre-processorDynamic linker
2.9k
views
2 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 33
If all the production rules have single non-terminal symbol on the left side, the grammar defined is:Context free grammarContext sensitive grammarUnrestricted grammarPhas...
2.2k
views
4 votes
made easy
how many minimum relations required to decompose the following relation R (ABCD) with fd ( A⇒B , C⇒D) with lossless join and dependency preserving BCNF decompos...
2.0k
views
3 votes
UGC NET CSE | December 2014 | Part 3 | Question: 55
Equivalent logical expression for the Well Formed Formula $(WFF)$,$\sim(\forall x) F\left[x\right]$is$\forall x (\sim F\left[x\right])$$\sim (\exists x) F\left[x\right]$$...
3.1k
views
2 votes
UGC NET CSE | Junet 2015 | Part 2 | Question: 13
Given that $x=7.5, j=-1.0, n=1.0, m=2.0$ the value of $ x+j==x>n>=m$ is:$0$$1$$2$$3$
Page: