Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetjan2017ii
0
votes
3
answers
1
UGC NET CSE | January 2017 | Part 2 | Question: 1
Consider a sequence $F_{00}$ defined as : $F_{00}\left ( 0 \right )= 1, F_{00}\left ( 1 \right )= 1\\$ $F_{00}\left ( n \right )= \frac{10 * F_{00}\left ( n-1 \right )+100}{F_{00}\left ( n-2 \right )} \text{ for }n\geq 2 \\$ Then ... $\left ( 1, 2, 55, 110, 600, 1200 \right )$ $\left ( 1, 55, 110, 600, 1200 \right )$
Consider a sequence $F_{00}$ defined as :$F_{00}\left ( 0 \right )= 1, F_{00}\left ( 1 \right )= 1\\$$F_{00}\left ( n \right )= \frac{10 * F_{00}\left ( n-1 \right )+100}...
go_editor
1.7k
views
go_editor
asked
Mar 24, 2020
Others
ugcnetjan2017ii
non-gate
+
–
0
votes
4
answers
2
UGC NET CSE | January 2017 | Part 2 | Question: 2
Match the following : ...
Match the following :$\begin{array}{llll} & \textbf{List – I} & {} & \textbf{List – II} \\ \text{a.} & \text{Absurd} & \text{i.} & \text{Clearly impossible being con...
go_editor
991
views
go_editor
asked
Mar 24, 2020
Mathematical Logic
ugcnetjan2017ii
mathematical-logic
+
–
0
votes
3
answers
3
UGC NET CSE | January 2017 | Part 2 | Question: 3
The functions mapping $R$ into $R$ are defined as : $f\left(x \right)=x^{3} - 4x, g\left(x \right)=\frac{1}{x^{2}+1}$ and $h\left(x \right)=x^{4}.$ Then find the value of the following composite functions : $h_{o}g\left(x \right)$ ... $\left ( x^{2}+1 \right )^{-4}$ and $\left [ \left ( x^{3}-4x \right )^{2}+1 \right ]^{-4}$
The functions mapping $R$ into $R$ are defined as :$f\left(x \right)=x^{3} - 4x, g\left(x \right)=\frac{1}{x^{2}+1}$ and $h\left(x \right)=x^{4}.$Then find the value of t...
go_editor
822
views
go_editor
asked
Mar 24, 2020
Set Theory & Algebra
ugcnetjan2017ii
functions
set-theory&algebra
+
–
0
votes
2
answers
4
UGC NET CSE | January 2017 | Part 2 | Question: 4
How many multiples of $6$ are there between the following pairs of numbers? $0$ and $100$ and $-6$ and $34$ $1$ and $6$ $17$ and $6$ $17$ and $7$ $16$ and $7$
How many multiples of $6$ are there between the following pairs of numbers?$0$ and $100$ and $-6$ and $34$$1$ and $6$$17$ and $6$$17$ and $7$$16$ and $7$
go_editor
875
views
go_editor
asked
Mar 24, 2020
Set Theory & Algebra
ugcnetjan2017ii
set-theory&algebra
factors
+
–
0
votes
4
answers
5
UGC NET CSE | January 2017 | Part 2 | Question: 5
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true? $\text{deg}\left ( v \right )\geq \frac{n}{2}$ for each vertex $v\\$ ... $v$ and $w$ are not connected by an edge All of the above
Consider a Hamiltonian Graph $G$ with no loops or parallel edges and with $\left | V\left ( G \right ) \right |= n\geq 3$. The which of the following is true?$\text{deg}\...
go_editor
2.0k
views
go_editor
asked
Mar 24, 2020
Graph Theory
ugcnetjan2017ii
graph-theory
graph-coloring
+
–
3
votes
6
answers
6
UGC NET CSE | January 2017 | Part 2 | Question: 6
In propositional logic if $\left ( P \rightarrow Q \right )\wedge \left ( R \rightarrow S \right )$ and $\left ( P \vee R \right )$ are two premises such that $\begin{array}{c} (P \to Q) \wedge (R \to S) \\ P \vee R \\ \hline Y \\ \hline \end{array}$ $Y$ is the premise : $P \vee R$ $P \vee S$ $Q \vee R$ $Q \vee S$
In propositional logic if $\left ( P \rightarrow Q \right )\wedge \left ( R \rightarrow S \right )$ and $\left ( P \vee R \right )$ are two premises such that$$\begin{arr...
go_editor
2.8k
views
go_editor
asked
Mar 24, 2020
Mathematical Logic
ugcnetjan2017ii
discrete-mathematics
propositional-logic
+
–
0
votes
2
answers
7
UGC NET CSE | January 2017 | Part 2 | Question: 7
ECL is the fastest of all logic families. High speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ________. Race condition Saturation Delay High impedance
ECL is the fastest of all logic families. High speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven...
go_editor
1.2k
views
go_editor
asked
Mar 24, 2020
Digital Logic
ugcnetjan2017ii
digital-logic
digital-circuits
+
–
0
votes
2
answers
8
UGC NET CSE | January 2017 | Part 2 | Question: 8
A binary $3$-bit down counter uses $J$-$K$ flip-flops, $FF_{i}$ with inputs $J_{i}$, $K_{i}$ and outputs $Q_{i}$, $i$ = $0, 1, 2$ respectively. The minimized expression for the input from following is : $J_{0} = K_{0} = 0$ $J_{0} = K_{0} = 1$ ... $J_{2} = K_{2} =\overline{Q}_{1} \overline{Q}_{0}$ I, III, V I, IV, VI II, III, V II, IV, VI
A binary $3$-bit down counter uses $J$-$K$ flip-flops, $FF_{i}$ with inputs $J_{i}$, $K_{i}$ and outputs $Q_{i}$, $i$ = $0, 1, 2$ respectively. The minimized expression f...
go_editor
1.2k
views
go_editor
asked
Mar 24, 2020
Digital Logic
ugcnetjan2017ii
digital-logic
flip-flop
+
–
0
votes
4
answers
9
UGC NET CSE | January 2017 | Part 2 | Question: 9
Convert the octal number $0.4051$ into its equivalent decimal number. $0.5100098$ $0.2096$ $0.52$ $0.4192$
Convert the octal number $0.4051$ into its equivalent decimal number.$0.5100098$$0.2096$$0.52$$0.4192$
go_editor
1.5k
views
go_editor
asked
Mar 24, 2020
Digital Logic
ugcnetjan2017ii
digital-logic
number-system
+
–
0
votes
6
answers
10
UGC NET CSE | January 2017 | Part 2 | Question: 10
The hexadecimal equivalent of the octal number $2357$ is : $2EE$ $2FF$ $4EF$ $4FE$
The hexadecimal equivalent of the octal number $2357$ is :$2EE$$2FF$$4EF$$4FE$
go_editor
1.5k
views
go_editor
asked
Mar 24, 2020
Digital Logic
ugcnetjan2017ii
digital-logic
number-system
+
–
0
votes
3
answers
11
UGC NET CSE | January 2017 | Part 2 | Question: 11
Which of the following cannot be passed to a function in C++? Constant Structure Array Header file
Which of the following cannot be passed to a function in C++?ConstantStructureArrayHeader file
go_editor
2.4k
views
go_editor
asked
Mar 24, 2020
Object Oriented Programming
ugcnetjan2017ii
object-oriented-programming
functions
+
–
0
votes
3
answers
12
UGC NET CSE | January 2017 | Part 2 | Question: 12
Which one of the following is correct for overloaded functions in $C++$? Compiler sets up a separate function for every definition of function. Compiler does not set up a separate function for every definition of function. Overloaded functions cannot handle different types of objects. Overloaded functions cannot have same number of arguments.
Which one of the following is correct for overloaded functions in $C++$?Compiler sets up a separate function for every definition of function.Compiler does not set up a s...
go_editor
1.7k
views
go_editor
asked
Mar 24, 2020
Object Oriented Programming
ugcnetjan2017ii
object-oriented-programming
functions
+
–
0
votes
2
answers
13
UGC NET CSE | January 2017 | Part 2 | Question: 13
Which of the following storage classes have global visibility in $C/C++$? Auto Extern Static Register
Which of the following storage classes have global visibility in $C/C++$?AutoExternStaticRegister
go_editor
864
views
go_editor
asked
Mar 24, 2020
Programming and DS
ugcnetjan2017ii
programming-in-c
storage-classes-in-c
+
–
0
votes
3
answers
14
UGC NET CSE | January 2017 | Part 2 | Question: 14
Which of the following operators cannot be overloaded in $\textsf{C/C++}$ ? Bitwise right shift assignment Address of Indirection Structure reference
Which of the following operators cannot be overloaded in $\textsf{C/C++}$ ?Bitwise right shift assignmentAddress ofIndirectionStructure reference
go_editor
2.0k
views
go_editor
asked
Mar 24, 2020
Object Oriented Programming
ugcnetjan2017ii
object-oriented-programming
+
–
1
votes
5
answers
15
UGC NET CSE | January 2017 | Part 2 | Question: 15
If $X$ is a binary number which is power of $2$, then the value of $X \& (X-1)$ is : $11\dots11$ $00\dots00$ $100\dots0$ $000\dots1$
If $X$ is a binary number which is power of $2$, then the value of $X \& (X-1)$ is :$11\dots11$$00\dots00$$100\dots0$$000\dots1$
go_editor
1.6k
views
go_editor
asked
Mar 24, 2020
Digital Logic
ugcnetjan2017ii
digital-logic
number-system
+
–
1
votes
2
answers
16
UGC NET CSE | January 2017 | Part 2 | Question: 16
An attribute $A$ of datatype varchar $(20)$ has value 'Ram' and the attribute $B$ of datatype char $(20)$ has value 'Sita' in oracle. The attribute $A$ has ________ memory spaces and $B$ has _______ memory spaces. $20,20$ $3,20$ $3,4$ $20,4$
An attribute $A$ of datatype varchar $(20)$ has value 'Ram' and the attribute $B$ of datatype char $(20)$ has value 'Sita' in oracle. The attribute $A$ has ________ memor...
go_editor
1.2k
views
go_editor
asked
Mar 24, 2020
Databases
ugcnetjan2017ii
databases
database-design
+
–
0
votes
3
answers
17
UGC NET CSE | January 2017 | Part 2 | Question: 17
Integrity constraints ensure that changes made to the database by authorized users do not result into loss of data consistency. Which of the following statement(s) is (are) true w.r.t.the examples of integrity constraints? An instructor Id. No. cannot be null, ... true. a false, b and c are true. a and b are true; c false. a,b and c are false.
Integrity constraints ensure that changes made to the database by authorized users do not result into loss of data consistency. Which of the following statement(s) is (ar...
go_editor
1.5k
views
go_editor
asked
Mar 24, 2020
Databases
ugcnetjan2017ii
databases
sql
+
–
6
votes
5
answers
18
UGC NET CSE | January 2017 | Part 2 | Question: 18
Let $M$ and $N$ be two entities in an $E-R$ diagram with simple single value attributes. $R_{1}$ and $R_{2}$ are two relationship between $M$ and $N$, where as $R_{1}$, is one-to-many and $R_{2}$, is many-to-many. The minimum number of tables required to represent $M, N, R_{1}$, and $R_{2}$, in the relational model are ___________. $4$ $6$ $7$ $3$
Let $M$ and $N$ be two entities in an $E-R$ diagram with simple single value attributes. $R_{1}$ and $R_{2}$ are two relationship between $M$ and $N$, where as $R_{1}$, i...
go_editor
3.2k
views
go_editor
asked
Mar 24, 2020
Databases
ugcnetjan2017ii
databases
er-diagram
+
–
0
votes
4
answers
19
UGC NET CSE | January 2017 | Part 2 | Question: 19
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ into $R_{1} \left (MN \right )$ and $R_{2} \left (PQ \right )$ ... but not lossless join Dependency preserving and lossless join Lossless join but not dependency preserving Neither dependency preserving nor lossless join.
Consider a schema $R(MNPQ)$ and functional dependencies $M\rightarrow N, P\rightarrow Q$. Then the decomposition of $R$ into $R_{1} \left (MN \right )$ and $R_{2} \left...
go_editor
2.2k
views
go_editor
asked
Mar 24, 2020
Databases
ugcnetjan2017ii
databases
dependency-preserving
+
–
0
votes
3
answers
20
UGC NET CSE | January 2017 | Part 2 | Question: 20
The order of a leaf node in a $B^{+}$ tree is the maximum number of children it can have. Suppose that block size is $1$ kilobytes, the child pointer takes $7$ bytes long and search field value takes $14$ bytes long. The order of the leaf node is _________. $16$ $63$ $64$ $65$
The order of a leaf node in a $B^{+}$ tree is the maximum number of children it can have. Suppose that block size is $1$ kilobytes, the child pointer takes $7$ bytes long...
go_editor
1.6k
views
go_editor
asked
Mar 24, 2020
Databases
ugcnetjan2017ii
databases
b+tree
+
–
0
votes
5
answers
21
UGC NET CSE | January 2017 | Part 2 | Question: 21
Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array ? Insertion - $0(1)$, Deletion - $0(1)$, Maximum - $0(1)$, Minimum - $0(1)$ Insertion - $0(1)$, Deletion - $0(1)$, ... , Minimum - $0(1)$ Insertion - $0(n)$, Deletion - $0(n)$, Maximum - $0(n)$, Minimum - $0(n)$
Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array ?Insertion – $0(1)$, Deletion – $...
go_editor
3.6k
views
go_editor
asked
Mar 24, 2020
Algorithms
ugcnetjan2017ii
algorithms
array
+
–
1
votes
3
answers
22
UGC NET CSE | January 2017 | Part 2 | Question: 22
The seven elements $A, B, C, D, E,F$ and $G$ are pushed onto a stack in reverse order, i.e., starting from $G$. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now, one element is popped from the stack. The popped item is ___________. $A$ $B$ $F$ $G$
The seven elements $A, B, C, D, E,F$ and $G$ are pushed onto a stack in reverse order, i.e., starting from $G$. The stack is popped five times and each element is inserte...
go_editor
7.2k
views
go_editor
asked
Mar 24, 2020
DS
ugcnetjan2017ii
data-structures
stack
+
–
1
votes
7
answers
23
UGC NET CSE | January 2017 | Part 2 | Question: 23
Which of the following is a valid heap? $a$ $b$ $c$ $d$
Which of the following is a valid heap? $a$$b$$c$$d$
go_editor
1.5k
views
go_editor
asked
Mar 24, 2020
DS
ugcnetjan2017ii
data-structures
binary-heap
+
–
2
votes
6
answers
24
UGC NET CSE | January 2017 | Part 2 | Question: 24
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 involving a particular key $x$ is less than __________. $1$ $1/n$ $1/m$ $n/m$
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 ...
go_editor
1.9k
views
go_editor
asked
Mar 24, 2020
DS
ugcnetjan2017ii
cryptography
hashing
data-structures
+
–
0
votes
4
answers
25
UGC NET CSE | January 2017 | Part 2 | Question: 25
Which of the following statements is false? Optimal binary search tree construction can be performed efficiently using dynamic programming. Breadth-first search cannot be used to find connected components of a graph. Given the prefix ... cannot be reconstructed uniquely. Depth-first-search can be used to find the connected components of a graph.
Which of the following statements is false?Optimal binary search tree construction can be performed efficiently using dynamic programming.Breadth-first search cannot be u...
go_editor
3.9k
views
go_editor
asked
Mar 24, 2020
Algorithms
ugcnetjan2017ii
algorithms
binary-tree
binary-search-tree
+
–
1
votes
3
answers
26
UGC NET CSE | January 2017 | Part 2 | Question: 26
Match the following Layers and Protocols for a user browsing with $\text{SSL}:$ ... $\text{a-ii, b-iii, c-iv, d-i}$ $\text{a-iii, b-i, c-iv, d-ii}$
Match the following Layers and Protocols for a user browsing with $\text{SSL}:$$\begin{array}{clcl} \text{a.} & \text{Application of layer} & \text{i.} & \text{TCP} \\...
go_editor
1.2k
views
go_editor
asked
Mar 24, 2020
Computer Networks
ugcnetjan2017ii
computer-networks
osi-protocol
+
–
0
votes
2
answers
27
UGC NET CSE | January 2017 | Part 2 | Question: 27
The maximum size of the data that the application layer can pass on to the $TCP$ layer below is ________. $2^{16}$ bytes $2^{16}$ bytes + $TCP$ header length $2^{16}$ bytes – $TCP$ header length $2^{15}$ bytes
The maximum size of the data that the application layer can pass on to the $TCP$ layer below is ________.$2^{16}$ bytes$2^{16}$ bytes + $TCP$ header length$2^{16}$ bytes ...
go_editor
1.3k
views
go_editor
asked
Mar 24, 2020
Computer Networks
ugcnetjan2017ii
computer-networks
application-layer
+
–
2
votes
5
answers
28
UGC NET CSE | January 2017 | Part 2 | Question: 28
A packet whose destination is outside the local $TCP/IP$ network segment is sent to ________. File server $DNS$ server $DHCP$ server Default gateway
A packet whose destination is outside the local $TCP/IP$ network segment is sent to ________.File server$DNS$ server$DHCP$ serverDefault gateway
go_editor
1.4k
views
go_editor
asked
Mar 24, 2020
Computer Networks
ugcnetjan2017ii
computer-networks
tcp
+
–
1
votes
4
answers
29
UGC NET CSE | January 2017 | Part 2 | Question: 29
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated __________. automatically by server by exchanging information with neighbour nodes with back up database
Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated __________.automaticallyby serverby ...
go_editor
1.7k
views
go_editor
asked
Mar 24, 2020
Computer Networks
ugcnetjan2017ii
computer-networks
distance-vector-routing
+
–
0
votes
3
answers
30
UGC NET CSE | January 2017 | Part 2 | Question: 30
In link state routing algorithm after construction of link state packets, new routes are computed using : DES algorithm Dijkstra's algorithm RSA algorithm Packets
In link state routing algorithm after construction of link state packets, new routes are computed using :DES algorithmDijkstra's algorithmRSA algorithmPackets
go_editor
2.3k
views
go_editor
asked
Mar 24, 2020
Computer Networks
ugcnetjan2017ii
computer-networks
link-state-routing
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register