Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-june2013-paper3
2
votes
2
answers
31
UGC NET CSE | June 2013 | Part 3 | Question: 40
The statements s1 and s2 are given as: s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism. s2: Context sensitive languages are closed under concatenation, substitution and homomorphism. Which of ... correct s2 is not correct s1 is not correct s2 is correct Both s1 and s2 are not correct
The statements s1 and s2 are given as:s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse homomorphism.s2: Context sens...
go_editor
2.5k
views
go_editor
asked
Jul 17, 2016
Theory of Computation
ugcnetcse-june2013-paper3
theory-of-computation
+
–
2
votes
1
answer
32
UGC NET CSE | June 2013 | Part 3 | Question: 39
Match the following : ... $\text{a-iii, b-i, c-iv, d-ii}$ $\text{a-ii, b-iv, c-i, d-iii}$
Match the following :$\begin{array} {} \text{a.}& \text{Context sensitive language} & \text{i.} & \text{Deterministic finite automation} \\ \text{b.}& \text{Regular gram...
go_editor
1.5k
views
go_editor
asked
Jul 17, 2016
Theory of Computation
ugcnetcse-june2013-paper3
theory-of-computation
match-the-following
easy
+
–
3
votes
1
answer
33
UGC NET CSE | June 2013 | Part 3 | Question: 38
For every context free grammar (G) there exists an algorithm that passes any $w \in L(G)$ in number of steps proportional to $ln\mid w \mid$ $\mid w \mid$ $\mid w \mid^2$ $\mid w \mid^3$
For every context free grammar (G) there exists an algorithm that passes any $w \in L(G)$ in number of steps proportional to$ln\mid w \mid$$\mid w \mid$$\mid w \mid^2$$\m...
go_editor
2.0k
views
go_editor
asked
Jul 17, 2016
Theory of Computation
ugcnetcse-june2013-paper3
theory-of-computation
context-free-grammar
+
–
2
votes
1
answer
34
UGC NET CSE | June 2013 | Part 3 | Question: 37
A pushdown automation $M=(Q, \Sigma, \Gamma, \delta , q_0, z, F)$ is set to be deterministic subject to which of the following condition(s), for every $q \in Q, a \in \Sigma \cup \{\lambda\} \text{ and } b \in \Gamma$ ... empty then $\delta(q, c, b)$ must be empty for every $c \in \Sigma$ only s1 only s2 both s1 and s2 neither s1 nor s2
A pushdown automation $M=(Q, \Sigma, \Gamma, \delta , q_0, z, F)$ is set to be deterministic subject to which of the following condition(s), for every $q \in Q, a \in \S...
go_editor
1.5k
views
go_editor
asked
Jul 17, 2016
Theory of Computation
ugcnetcse-june2013-paper3
theory-of-computation
pushdown-automata
+
–
4
votes
2
answers
35
UGC NET CSE | June 2013 | Part 3 | Question: 36
The grammar with production rules $S \rightarrow aSb \mid SS \mid \lambda$ generates language $L$ given by: $L = \{ w \in \{a, b\}* \mid n_a(w) = n_b(w) \text{ and } n_a(v) \geq n_b(v) \text{ where v is any prefix of w} \}$ ...
The grammar with production rules $S \rightarrow aSb \mid SS \mid \lambda$ generates language $L$ given by:$L = \{ w \in \{a, b\}* \mid n_a(w) = n_b(w) \text{ and } n_a(v...
go_editor
2.7k
views
go_editor
asked
Jul 17, 2016
Theory of Computation
ugcnetcse-june2013-paper3
theory-of-computation
+
–
2
votes
1
answer
36
UGC NET CSE | June 2013 | Part 3 | Question: 35
Which of the following is/are the fundamental semantic model(s) of parameter passing? in mode out mode in-out mode all of the above
Which of the following is/are the fundamental semantic model(s) of parameter passing?in modeout modein-out modeall of the above
go_editor
1.2k
views
go_editor
asked
Jul 17, 2016
Theory of Computation
ugcnetcse-june2013-paper3
theory-of-computation
grammar
+
–
3
votes
2
answers
37
UGC NET CSE | June 2013 | Part 3 | Question: 34
Horn clauses are special kinds of propositions which can be described as Single atomic proposition on left side Single or multiple atomic proposition on left side A single atomic proposition on left side and a single atomic proposition on right side A single atomic proposition on left side or an empty left side
Horn clauses are special kinds of propositions which can be described asSingle atomic proposition on left sideSingle or multiple atomic proposition on left sideA single a...
go_editor
2.5k
views
go_editor
asked
Jul 17, 2016
Databases
ugcnetcse-june2013-paper3
databases
rdbms
+
–
3
votes
1
answer
38
UGC NET CSE | June 2013 | Part 3 | Question: 33
Refer the points as listed below: What are the operator precedence rules? What are the operator associativity rules? What is the order of operand evaluation? Are these restrictions on operand evaluations side effects? Which of the above must be considered as primary design ... $\text{i, ii and iv}$ $\text{i, ii, iii and iv}$
Refer the points as listed below:What are the operator precedence rules?What are the operator associativity rules?What is the order of operand evaluation?Are these restri...
go_editor
892
views
go_editor
asked
Jul 17, 2016
Programming in C
ugcnetcse-june2013-paper3
programming-in-c
+
–
3
votes
1
answer
39
UGC NET CSE | June 2013 | Part 3 | Question: 32
Arrays in C language can have ____ with reference to memory representation. n-subscripts two-subscripts only one subscript three subscripts only
Arrays in C language can have ____ with reference to memory representation.n-subscriptstwo-subscriptsonly one subscriptthree subscripts only
go_editor
1.7k
views
go_editor
asked
Jul 17, 2016
Programming and DS
ugcnetcse-june2013-paper3
programming-in-c
array
+
–
3
votes
1
answer
40
UGC NET CSE | June 2013 | Part 3 | Question: 31
Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the color of each pixel is represented by a n-bit number, (in an 8-bit machines) is n $\times$ 8 MB n/8 MB (1024 $\times$ 1024)/8 MB 1024 MB
Images tend to be very large collection of data. The size of memory required for a 1024 by 1024 image in which the color of each pixel is represented by a n-bit number, (...
go_editor
2.6k
views
go_editor
asked
Jul 17, 2016
Computer Graphics
ugcnetcse-june2013-paper3
computer-graphics
digital-image-processing
+
–
4
votes
1
answer
41
UGC NET CSE | June 2013 | Part 3 | Question: 30
If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is 40 line-pairs per inch 80 line-pairs per inch 1600 lines per inch 40 lines per inch
If 40 black lines interleaved with 40 white lines can be distinguished across one inch, the resolution is40 line-pairs per inch80 line-pairs per inch1600 lines per inch40...
go_editor
2.5k
views
go_editor
asked
Jul 17, 2016
Computer Graphics
ugcnetcse-june2013-paper3
computer-graphics
resolution
+
–
3
votes
1
answer
42
UGC NET CSE | June 2013 | Part 3 | Question: 29
In homogenous coordinate system (x, y, z) the points z=0 are called Cartesian points Parallel points Origin point Point of infinity
In homogenous coordinate system (x, y, z) the points z=0 are calledCartesian pointsParallel pointsOrigin pointPoint of infinity
go_editor
2.1k
views
go_editor
asked
Jul 17, 2016
Computer Graphics
ugcnetcse-june2013-paper3
computer-graphics
projection
+
–
3
votes
1
answer
43
UGC NET CSE | June 2013 | Part 3 | Question: 28
The refresh rate above which a picture stops flickering and fuses into a steady image is called ____ Crucial fusion frequency Current frequency fusion Critical fusion frequency Critically diffused frequency
The refresh rate above which a picture stops flickering and fuses into a steady image is called ____Crucial fusion frequencyCurrent frequency fusionCritical fusion freque...
go_editor
1.8k
views
go_editor
asked
Jul 17, 2016
Computer Graphics
ugcnetcse-june2013-paper3
computer-graphics
display-devices
+
–
3
votes
2
answers
44
UGC NET CSE | June 2013 | Part 3 | Question: 27
Bresenham line drawing algorithm is attractive because it uses Real arithmetic only Integer arithmetic only Floating point arithmetic Real and integer arithmetic
Bresenham line drawing algorithm is attractive because it usesReal arithmetic onlyInteger arithmetic onlyFloating point arithmeticReal and integer arithmetic
go_editor
3.7k
views
go_editor
asked
Jul 17, 2016
Computer Graphics
ugcnetcse-june2013-paper3
computer-graphics
line-drawing-algorithm
+
–
3
votes
2
answers
45
UGC NET CSE | June 2013 | Part 3 | Question: 26
An actor in an animation is a small program invoked _____ per frame to determine the characteristics of some object in the animation. once twice 30 times 60 times
An actor in an animation is a small program invoked _____ per frame to determine the characteristics of some object in the animation.oncetwice30 times60 times
go_editor
1.7k
views
go_editor
asked
Jul 17, 2016
IS&Software Engineering
ugcnetcse-june2013-paper3
is&software-engineering
uml
+
–
1
votes
1
answer
46
UGC NET CSE | June 2013 | Part 3 | Question: 25
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel's Approximation method is ... $76$ $80$ $90$ $96$
The total transportation cost in an initial basic feasible solution to the following transportation problem using Vogel’s Approximation method is$\begin{array}{|l|l|l|l...
go_editor
4.8k
views
go_editor
asked
Jul 16, 2016
Others
ugcnetcse-june2013-paper3
linear-programming
transportation-problem
+
–
2
votes
1
answer
47
UGC NET CSE | June 2013 | Part 3 | Question: 24
A basic feasible solution to a m-origin, n-destination transportation problem is said to be ______ if the number of positive allocations are less than m+n-1. degenerate non- degenerate unbounded unbalanced
A basic feasible solution to a m-origin, n-destination transportation problem is said to be ______ if the number of positive allocations are less than m+n-1.degeneratenon...
go_editor
6.9k
views
go_editor
asked
Jul 16, 2016
Others
ugcnetcse-june2013-paper3
linear-programming
transportation-problem
+
–
3
votes
1
answer
48
UGC NET CSE | June 2013 | Part 3 | Question: 23
At any iteration of simplex method if $\Delta j (Zj – Cj)$ corresponding to any non-basic variable $Xj$ is obtained as zero, the solution under the test is Degenerate solution Unbounded solution Alternative solution Optimal solution
At any iteration of simplex method if $\Delta j (Zj – Cj)$ corresponding to any non-basic variable $Xj$ is obtained as zero, the solution under the test isDegenerat...
go_editor
4.0k
views
go_editor
asked
Jul 16, 2016
Others
ugcnetcse-june2013-paper3
linear-programming
+
–
3
votes
2
answers
49
UGC NET CSE | June 2013 | Part 3 | Question: 22
What is the baud rate of standard 10 Mbps Ethernet? 10 megabaud 20 megabaud 30 megabaud 40 megabaud
What is the baud rate of standard 10 Mbps Ethernet?10 megabaud20 megabaud30 megabaud40 megabaud
go_editor
6.1k
views
go_editor
asked
Jul 16, 2016
Computer Networks
ugcnetcse-june2013-paper3
computer-networks
ethernet
+
–
2
votes
1
answer
50
UGC NET CSE | June 2013 | Part 3 | Question: 21
Which one of the following media is multidrop? Shielded Twisted pair cable Unshielded Twisted pair cable Thick Coaxial cable Fiber Optic cable
Which one of the following media is multidrop?Shielded Twisted pair cableUnshielded Twisted pair cableThick Coaxial cableFiber Optic cable
go_editor
2.6k
views
go_editor
asked
Jul 16, 2016
Computer Networks
ugcnetcse-june2013-paper3
computer-networks
physical-layer
+
–
1
votes
1
answer
51
UGC NET CSE | June 2013 | Part 3 | Question: 20
The ______ measure the relative strengths of two signals or a signal at two different points. frequency attenuation throughput decibel
The ______ measure the relative strengths of two signals or a signal at two different points.frequencyattenuationthroughputdecibel
go_editor
2.8k
views
go_editor
asked
Jul 16, 2016
Computer Networks
ugcnetcse-june2013-paper3
computer-networks
signals
+
–
1
votes
2
answers
52
UGC NET CSE | June 2013 | Part 3 | Question: 19
An image is 1024$*$800 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it make to transmit it over a 10 Mbps Ethernet? 196.6 seconds 19.66 seconds 1.966 seconds 0.1966 seconds
An image is 1024$*$800 pixels with 3 bytes/pixel. Assume the image is uncompressed. How long does it make to transmit it over a 10 Mbps Ethernet?196.6 seconds19.66 second...
go_editor
4.6k
views
go_editor
asked
Jul 16, 2016
Computer Graphics
ugcnetcse-june2013-paper3
computer-graphics
digital-image-processing
+
–
1
votes
1
answer
53
UGC NET CSE | June 2013 | Part 3 | Question: 18
Match the following $:$ ... $\text{a-ii, b-i, c-iii, d-iv}$ $\text{a-ii, b-iv, c-iii, d-i}$
Match the following $:$$\begin{array} {} \text{a.} & \text{Data link Layer} & \text{i.} & \text{Flow Control} \\ \text{b.} & \text{Network Layer} & \text{ii.} & \text{N...
go_editor
2.0k
views
go_editor
asked
Jul 16, 2016
Computer Networks
ugcnetcse-june2013-paper3
computer-networks
osi-model
+
–
3
votes
4
answers
54
UGC NET CSE | June 2013 | Part 3 | Question: 17
The baud rate of a signal is 600 baud/second. If each signal unit carries 6 bits, then the bit rate of a signal is ____ 3600 100 6/600 None of the above
The baud rate of a signal is 600 baud/second. If each signal unit carries 6 bits, then the bit rate of a signal is ____36001006/600None of the above
go_editor
5.3k
views
go_editor
asked
Jul 16, 2016
Computer Networks
ugcnetcse-june2013-paper3
computer-networks
ethernet
+
–
2
votes
2
answers
55
UGC NET CSE | June 2013 | Part 3 | Question: 16
In a fully connected mesh network with n devices, there are _____ physical channels to link all devices. n(n-1)/2 n(n+1)/2 2n 2n+1
In a fully connected mesh network with n devices, there are _____ physical channels to link all devices.n(n-1)/2n(n+1)/22n2n+1
go_editor
5.0k
views
go_editor
asked
Jul 16, 2016
Computer Networks
ugcnetcse-june2013-paper3
computer-networks
network-topologies
+
–
0
votes
1
answer
56
UGC NET CSE | June 2013 | Part 3 | Question: 15
A vertex cover of an undirected graph $G(V,E)$ is a subset $V_1 \subseteq V$ vertices such that Each pair of vertices in $V_1$ is connected by an edge If $(u,v) \in E$ then $u \in V_1$ and $v \in V_1$ If $(u,v) \in E$ then $u \in V_1$ or $v \in V_1$ All pair of vertices in $V_1$ are not connected by an edge
A vertex cover of an undirected graph $G(V,E)$ is a subset $V_1 \subseteq V$ vertices such thatEach pair of vertices in $V_1$ is connected by an edgeIf $(u,v) \in E$ then...
go_editor
2.1k
views
go_editor
asked
Jul 16, 2016
Graph Theory
ugcnetcse-june2013-paper3
graph-theory
graph-connectivity
+
–
1
votes
1
answer
57
UGC NET CSE | June 2013 | Part 3 | Question: 14
A data file of $1,00,000$ characters contains only the characters $\text{g-1},$ ... code by Huffman codes, the file can be encoded with $2,52,000$ bits $2,64,000$ bits $2,46,000$ bits $2,24,000$ bits
A data file of $1,00,000$ characters contains only the characters $\text{g-1},$ with the frequencies as indicated in table:$\begin{array}{|l|l|l|l|l|l|l|} \hline & \text{...
go_editor
2.8k
views
go_editor
asked
Jul 16, 2016
Computer Networks
ugcnetcse-june2013-paper3
computer-networks
huffman-code
data-link-layer
+
–
0
votes
1
answer
58
UGC NET CSE | June 2013 | Part 3 | Question: 13
In any n-element heap, the number of nodes of height h is, less than equal to $\biggl[ \frac{n}{2^h} \biggr]$ greater than $\biggl[ \frac{n}{2^h} \biggl]$ greater than $\biggl[ \frac{n}{2^h+1} \biggr]$ less than equal to $\biggl [ \frac{n}{2^h+1} \biggr]$
In any n-element heap, the number of nodes of height h is,less than equal to $\biggl[ \frac{n}{2^h} \biggr]$greater than $\biggl[ \frac{n}{2^h} \biggl]$greater than $\big...
go_editor
1.2k
views
go_editor
asked
Jul 16, 2016
DS
ugcnetcse-june2013-paper3
data-structures
binary-heap
+
–
0
votes
1
answer
59
UGC NET CSE | June 2013 | Part 3 | Question: 12
The solution of recurrence relation, $T(n) = 2T (floor (\sqrt{n}))+\log n$ is $O(n \log \log \log n)$ $O(n \log \log n)$ $O(\log \log n)$ $O(\log n \log \log n)$
The solution of recurrence relation, $T(n) = 2T (floor (\sqrt{n}))+\log n$ is$O(n \log \log \log n)$$O(n \log \log n)$$O(\log \log n)$$O(\log n \log \log n)$
go_editor
1.7k
views
go_editor
asked
Jul 16, 2016
Algorithms
ugcnetcse-june2013-paper3
algorithms
recurrence-relation
+
–
1
votes
1
answer
60
UGC NET CSE | June 2013 | Part 3 | Question: 11
The golden ratio $\varphi$ and its conjugate $\bar{\varphi}$ both satisfy the equation $x^3 –x-1=0$ $x^3 +x-1=0$ $x^2 –x-1=0$ $x^2 +x-1=0$
The golden ratio $\varphi$ and its conjugate $\bar{\varphi}$ both satisfy the equation$x^3 –x-1=0$$x^3 +x-1=0$$x^2 –x-1=0$$x^2 +x-1=0$
go_editor
1.9k
views
go_editor
asked
Jul 16, 2016
Others
ugcnetcse-june2013-paper3
quadratic-equations
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register