Register

Recent questions tagged ugcnetcse-nov2017-paper3

1 votes
0 answers
31
UGC NET CSE | November 2017 | Part 3 | Question: 45
A signal processor software is expected to operate for $91.25$ days after repair, and the mean software repair time is expected to be $5$ minutes. Then, the availability of the software is $96.9862 \%$ $97.9862 \%$ $98.9962 \%$ $99.9962 \%$
A signal processor software is expected to operate for $91.25$ days after repair, and the mean software repair time is expected to be $5$ minutes. Then, the availability ...
User Avatar
1 votes
0 answers
38
UGC NET CSE | November 2017 | Part 3 | Question: 39
Consider the following HTML table definition: <table border =1> <tr> <td colspan=2> Text A </td> </tr> <tr> <td> Text B </td> <td>zText C </td> </tr> <tr> < ... <tr> <td> Text F </td> </tr> </table> The above HTML code will render on screen as
Consider the following HTML table definition:<table border =1 <tr <td colspan=2 Text A </td </tr <tr <td Text B </td <td>zText C </td </tr <tr <td rowspan =2 Text D </td ...
User Avatar
1 votes
0 answers
39
UGC NET CSE | November 2017 | Part 3 | Question: 37
An XML document that adheres to syntax rules specified by XML $1.0$ specification in that it must satisfy both physical and logical structured, is called Well-formed Reasonable Valid Sophisticated
An XML document that adheres to syntax rules specified by XML $1.0$ specification in that it must satisfy both physical and logical structured, is calledWell-formedReason...
User Avatar
1 votes
1 answer
41
UGC NET CSE | November 2017 | Part 3 | Question: 35
A text is made up of the characters $a,b,c,d,e$ each occuring with the probability $0.11, 0.40, 0.16, 0.09$ and $0.24$ respectively. The optimal Huffman coding technique will have the average length of $2.40$ $2.16$ $2.26$ $2.15$
A text is made up of the characters $a,b,c,d,e$ each occuring with the probability $0.11, 0.40, 0.16, 0.09$ and $0.24$ respectively. The optimal Huffman coding technique ...
User Avatar
1 votes
1 answer
42
UGC NET CSE | November 2017 | Part 3 | Question: 34
Consider the following two sequences: $X=<B,C, D, C, A, B, C>$ and $Y=<C, A, D, B, C, B>$ The length of longest common subsequence of $X$ and $Y$ is $5$ $3$ $4$ $2$
Consider the following two sequences:$X=<B,C, D, C, A, B, C>$ and $Y=<C, A, D, B, C, B>$The length of longest common subsequence of $X$ and $Y$ is$5$$3$$4$$2$
User Avatar
1 votes
1 answer
48
UGC NET CSE | November 2017 | Part 3 | Question: 28
Match the following : ... $\text{(a)-(iv); (b)-(iii); (c)-(ii); (d)-(i)}$
Match the following :$\begin{array}{clcl} & \textbf{List-I} && \textbf{List-II} \\ \text{(a)} & \text{Data Link Layer} & \text{(i)} & \text{Encryption} \\ \text{(b)}...
User Avatar
1 votes
3 answers
49
UGC NET CSE | November 2017 | Part 3 | Question: 27
If a file consisting of $50,000$ characters takes $40$ seconds to send, then the data rate is _________ $1$ kbps $1.25$ kbps $2$ kbps $10$ kbps
If a file consisting of $50,000$ characters takes $40$ seconds to send, then the data rate is _________$1$ kbps$1.25$ kbps$2$ kbps$10$ kbps
User Avatar
1 votes
1 answer
50
UGC NET CSE | November 2017 | Part 3 | Question: 26
Quadrature Amplitude Modulation means changing both Frequency and phase of the carrier Frequency and Amplitude of the carrier Amplitude and phase of the carrier Amplitude and Wavelength of the carrier
Quadrature Amplitude Modulation means changing bothFrequency and phase of the carrierFrequency and Amplitude of the carrierAmplitude and phase of the carrierAmplitude and...
User Avatar
1 votes
1 answer
53
UGC NET CSE | November 2017 | Part 3 | Question: 20
Heap allocation is required for languages that Use dynamic scope rules Support dynamic data structures Support recursion Support recursion and dynamic data structures
Heap allocation is required for languages thatUse dynamic scope rulesSupport dynamic data structuresSupport recursionSupport recursion and dynamic data structures
User Avatar
2 votes
2 answers
54
UGC NET CSE | November 2017 | Part 3 | Question: 23
Finite state machine can recognize language generated by _________ Only context free grammar Only context sensitive grammar Only regular grammar Any unambiguous grammar
Finite state machine can recognize language generated by _________Only context free grammarOnly context sensitive grammarOnly regular grammarAny unambiguous grammar
User Avatar
1 votes
2 answers
56
UGC NET CSE | November 2017 | Part 3 | Question: 21
Pumping lemma for regular language is generally used for proving Whether two given regular expressions are equivalent A given grammar is ambiguous A given grammar is regular A given grammar is not regular
Pumping lemma for regular language is generally used for provingWhether two given regular expressions are equivalentA given grammar is ambiguousA given grammar is regular...
User Avatar
5 votes
1 answer
57
UGC NET CSE | November 2017 | Part 3 | Question: 19
The logic of pumping lemma is an example of _________ Iteration Recursion The divide and conquer principle The pigeon – hole principle
The logic of pumping lemma is an example of _________IterationRecursionThe divide and conquer principleThe pigeon – hole principle
User Avatar
1 votes
2 answers
59
UGC NET CSE | November 2017 | Part 3 | Question: 17
Find the normalization transformation that maps a window whose lower left corner is at $(1,1)$ and upper right corner is at $(3,5)$ ...
Find the normalization transformation that maps a window whose lower left corner is at $(1,1)$ and upper right corner is at $(3,5)$ onto a viewpoint that is the entire no...
User Avatar
Page: