Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetsep2013ii
1
votes
1
answer
31
UGC NET CSE | September 2013 | Part 2 | Question: 16
LL grammar for the language $L = \{a^n b^m c^{n+m} \mid m \geq 0, n \geq 0\}$ is $ S \rightarrow aSc \mid S_1 ; S_1 \rightarrow bS_1c \mid \lambda$ ... $ S \rightarrow aSc \mid S_1 \lambda ; S_1 \rightarrow bS_1c \mid \lambda$
LL grammar for the language $L = \{a^n b^m c^{n+m} \mid m \geq 0, n \geq 0\}$ is$ S \rightarrow aSc \mid S_1 ; S_1 \rightarrow bS_1c \mid \lambda$$ S \rightarrow aSc \mid...
go_editor
1.5k
views
go_editor
asked
Jul 20, 2016
Theory of Computation
ugcnetsep2013ii
theory-of-computation
grammar
+
–
0
votes
1
answer
32
UGC NET CSE | September 2013 | Part 2 | Question: 15
Consider the following two languages: $L_1 =\{a^n b^l a^k \mid n+l+k > 5\}$ $L_2 =\{a^n b^l a^k \mid n> 5, l>3, k \leq l \}$ Which one of the following is true? $L_1$ ... $L_1$ and $L_2$ are regular language Both $L_1$ and $L_2$ are not regular language $L_1$ is not regular language and $L_2$ is regular language
Consider the following two languages:$L_1 =\{a^n b^l a^k \mid n+l+k 5\}$$L_2 =\{a^n b^l a^k \mid n 5, l>3, k \leq l \}$Which one of the following is true?$L_1$ is regula...
go_editor
1.8k
views
go_editor
asked
Jul 20, 2016
Theory of Computation
ugcnetsep2013ii
theory-of-computation
regular-expression
regular-language
+
–
4
votes
3
answers
33
UGC NET CSE | September 2013 | Part 2 | Question: 14
Regular expression for the language $L=w \in \{0,1\}* \mid w$ has no pair of consecutive zeros $\}$ is $(1+010)*$ $(01+10)*$ $(1+010)*(0+ \lambda)$ $(1+01)* (0+\lambda)$
Regular expression for the language $L=w \in \{0,1\}* \mid w$ has no pair of consecutive zeros $\}$ is$(1+010)*$$(01+10)*$$(1+010)*(0+ \lambda)$$(1+01)* (0+\lambda)$
go_editor
1.2k
views
go_editor
asked
Jul 20, 2016
Theory of Computation
ugcnetsep2013ii
theory-of-computation
regular-expression
+
–
1
votes
2
answers
34
UGC NET CSE | September 2013 | Part 2 | Question: 13
The number of states in a minimal deterministic finite automaton corresponding to the language $L=\{ a^n \mid n \geq 4 \}$ is 3 4 5 6
The number of states in a minimal deterministic finite automaton corresponding to the language $L=\{ a^n \mid n \geq 4 \}$ is3456
go_editor
3.5k
views
go_editor
asked
Jul 20, 2016
Theory of Computation
ugcnetsep2013ii
theory-of-computation
finite-automata
+
–
1
votes
2
answers
35
UGC NET CSE | September 2013 | Part 2 | Question: 12
The efficient data structure to insert/delete a number in a stored set of number is Queue Linked list Doubly linked list Binary tree
The efficient data structure to insert/delete a number in a stored set of number isQueueLinked listDoubly linked listBinary tree
go_editor
4.5k
views
go_editor
asked
Jul 20, 2016
DS
ugcnetsep2013ii
data-structures
queue
linked-list
+
–
5
votes
1
answer
36
UGC NET CSE | September 2013 | Part 2 | Question: 10
Suppose that the splits at every level of Quicksort are in proportion $1-\beta \text{ to } \beta$, where $0 < \beta \leq 0.5$ is a constant. The number of elements in an array is n. The maximum depth is approximately 0.5 $\beta$ Ig n 0.5 (1-$\beta$) Ig n -(Ig n)/(Ig $\beta$) -(Ig n)/Ig (1-$\beta$)
Suppose that the splits at every level of Quicksort are in proportion $1-\beta \text{ to } \beta$, where $0 < \beta \leq 0.5$ is a constant. The number of elements in an ...
go_editor
7.6k
views
go_editor
asked
Jul 20, 2016
DS
ugcnetsep2013ii
data-structures
sorting
algorithms
quick-sort
+
–
1
votes
1
answer
37
UGC NET CSE | September 2013 | Part 2 | Question: 9
The amortized time complexity to perform ____ operation(s) in Splay trees is O(Ig n) Search Search and Insert Search and Delete Search, Insert and Delete
The amortized time complexity to perform ____ operation(s) in Splay trees is O(Ig n)SearchSearch and InsertSearch and DeleteSearch, Insert and Delete
go_editor
1.8k
views
go_editor
asked
Jul 20, 2016
Algorithms
ugcnetsep2013ii
algorithms
time-complexity
+
–
4
votes
3
answers
38
UGC NET CSE | September 2013 | Part 2 | Question: 8
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is 2451 4950 4851 9900
Consider an undirected graph G with 100 nodes. The maximum number of edges to be included in G so that the graph is not connected is2451495048519900
go_editor
10.6k
views
go_editor
asked
Jul 20, 2016
Graph Theory
ugcnetsep2013ii
graph-theory
graph-connectivity
+
–
2
votes
2
answers
39
UGC NET CSE | September 2013 | Part 2 | Question: 7
The $\text{IEEE}$ single-precision and double-precision format to represent floating-point numbers, has a length of ______ and ________ respectively. $8$ bits and $16$ bits $16$ bits and $32$ bits $32$ bits and $64$ bits $64$ bits and $128$ bits
The $\text{IEEE}$ single-precision and double-precision format to represent floating-point numbers, has a length of ______ and ________ respectively.$8$ bits and $16$ bit...
go_editor
1.7k
views
go_editor
asked
Jul 20, 2016
Digital Logic
ugcnetsep2013ii
digital-logic
ieee-representation
+
–
1
votes
2
answers
40
UGC NET CSE | September 2013 | Part 2 | Question: 6
The count-to-infinity problem is associated with Flooding algorithm Hierarchical routing algorithm Distance vector routing algorithm Link state routing algorithm
The count-to-infinity problem is associated withFlooding algorithmHierarchical routing algorithmDistance vector routing algorithmLink state routing algorithm
go_editor
2.1k
views
go_editor
asked
Jul 20, 2016
Computer Networks
ugcnetsep2013ii
computer-networks
routing-algorithm
+
–
1
votes
2
answers
41
UGC NET CSE | September 2013 | Part 2 | Question: 5
The ____ is a set of standards that defines how a dynamic web document should be written, how input data should be supplied to the program, and how the output result should be used. Hyper Text Markup Language File Transfer Protocol Hyper Text Transfer Protocol Common Gateway Interface
The ____ is a set of standards that defines how a dynamic web document should be written, how input data should be supplied to the program, and how the output result shou...
go_editor
2.5k
views
go_editor
asked
Jul 20, 2016
Computer Networks
ugcnetsep2013ii
computer-networks
+
–
1
votes
1
answer
42
UGC NET CSE | September 2013 | Part 2 | Question: 4
What is the maximum length of CAT-5 UTP cable in Fast Ethernet network? 100 meters 200 meters 1000 meters 2000 meters
What is the maximum length of CAT-5 UTP cable in Fast Ethernet network?100 meters200 meters1000 meters2000 meters
go_editor
1.4k
views
go_editor
asked
Jul 20, 2016
Computer Networks
ugcnetsep2013ii
computer-networks
ethernet
+
–
1
votes
1
answer
43
UGC NET CSE | September 2013 | Part 2 | Question: 3
Which of the following substitution technique have the relationship between a character in the plaintext and a character in the ciphertext as one-to-many? Monoalphabetic Polyalphabetic Transpositional None of the above
Which of the following substitution technique have the relationship between a character in the plaintext and a character in the ciphertext as one-to-many?MonoalphabeticPo...
go_editor
2.5k
views
go_editor
asked
Jul 20, 2016
Others
ugcnetsep2013ii
cryptography
encryption-decryption
+
–
1
votes
1
answer
44
UGC NET CSE | September 2013 | Part 2 | Question: 2
In ______ CSMA protocol, after the station finds the line idle, it sends or refrains from sending based on the outcome of a random number generated. Non-persistent 0- persistent 1- persistent p- persistent
In ______ CSMA protocol, after the station finds the line idle, it sends or refrains from sending based on the outcome of a random number generated.Non-persistent0- persi...
go_editor
2.8k
views
go_editor
asked
Jul 20, 2016
Computer Networks
ugcnetsep2013ii
computer-networks
data-link-layer
+
–
0
votes
1
answer
45
UGC NET CSE | September 2013 | Part 2 | Question: 1
A file is downloaded in a home computer using 56 kbps MODEM connected to an Internet Service Provider. If the download of the file completes in 2 minutes, what is the maximum size of the data downloaded? 112 Mbits 6.72 Mbits 67.20 Mbits 672 Mbits
A file is downloaded in a home computer using 56 kbps MODEM connected to an Internet Service Provider. If the download of the file completes in 2 minutes, what is the max...
go_editor
6.3k
views
go_editor
asked
Jul 20, 2016
Computer Networks
ugcnetsep2013ii
computer-networks
ethernet
+
–
4
votes
1
answer
46
UGC NET CSE | September 2013 | Part 2 | Question: 18
The number of 8-bit strings beginning with either 111 or 101 is 64 128 265 None of the above
The number of 8-bit strings beginning with either 111 or 101 is64128265None of the above
im.raj
5.3k
views
im.raj
asked
Jun 16, 2016
Theory of Computation
theory-of-computation
ugcnetsep2013ii
+
–
4
votes
1
answer
47
UGC NET CSE | September 2013 | Part 2 | Question: 20
Consider the following statements: A graph in which there is a unique path between every pair of vertices is a tree. A connected graph with e=v-1 is a tree A connected graph with e=v-1 that has no circuit is a tree Which one of the above statements is/are true? I and III II and III I and II All of the above
Consider the following statements:A graph in which there is a unique path between every pair of vertices is a tree.A connected graph with e=v-1 is a treeA connected graph...
shivani2010
3.4k
views
shivani2010
asked
Jun 9, 2016
DS
graph-connectivity
ugcnetsep2013ii
+
–
1
votes
1
answer
48
UGC NET CSE | September 2013 | Part 2 | Question: 11
The min. number of nodes in a binary tree of depth d (root at level 0) is $(2^d + 1)$ $(2^{(d+1)} - 1)$ $d$ $d + 1$
The min. number of nodes in a binary tree of depth d (root at level 0) is$(2^d + 1)$$(2^{(d+1)} - 1)$$d$$d + 1$
shivani2010
4.1k
views
shivani2010
asked
Jun 9, 2016
DS
binary-tree
data-structures
ugcnetsep2013ii
+
–
1
votes
1
answer
49
UGC NET CSE | September 2013 | Part 2 | Question: 25
If F and G are Boolean functions of degree n. Then, which of the following is true? F $\leq$ F + G and F G $\leq$ F G $\leq$ F + G and F G $\geq$ G F $\geq$ F + G and F G $\leq$ F G $\geq$ F + G and F G $\leq$ F
If F and G are Boolean functions of degree n. Then, which of the following is true?F $\leq$ F + G and F G $\leq$ FG $\leq$ F + G and F G $\geq$ GF $\geq$ F + G and F G $\...
Sanjay Sharma
2.1k
views
Sanjay Sharma
asked
Mar 28, 2016
Set Theory & Algebra
functions
ugcnetsep2013ii
+
–
35
votes
4
answers
50
GATE CSE 1994 | Question: 1.17, UGCNET-Sep2013-II: 32
Linked lists are not suitable data structures for which one of the following problems? Insertion sort Binary search Radix sort Polynomial manipulation
Linked lists are not suitable data structures for which one of the following problems?Insertion sortBinary searchRadix sortPolynomial manipulation
Kathleen
22.9k
views
Kathleen
asked
Oct 4, 2014
DS
gate1994
data-structures
linked-list
normal
ugcnetsep2013ii
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register