Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged ugcnetcse-june2013-paper2
1
votes
1
answer
1
UGC NET CSE | June 2013 | Part 2 | Question: 50
The $mv$ command changes the inode the inode-number the directory entry both the directory entry and the inode
The $mv$ command changesthe inodethe inode-numberthe directory entryboth the directory entry and the inode
go_editor
2.2k
views
go_editor
asked
Jul 14, 2016
Operating System
ugcnetcse-june2013-paper2
unix
+
–
1
votes
1
answer
2
UGC NET CSE | June 2013 | Part 2 | Question: 49
Consider the following UNIX command: sort<in>temp; head-30<temp; nm temp Which of the following functions shall be performed by this command? Sort, taking the input from “temp”, prints 20 lines from temp ... and then prints 30 lines from “temp” on terminal. Finally “temp” is removed.
Consider the following UNIX command:sort<in>temp; head-30<temp; nm tempWhich of the following functions shall be performed by this command?Sort, taking the input from &ld...
go_editor
1.4k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
3
votes
1
answer
3
UGC NET CSE | June 2013 | Part 2 | Question: 46
A virtual memory based memory management algorithm partially swaps out a process. This is an example of short term scheduling long term scheduling medium term scheduling mutual exclusion
A virtual memory based memory management algorithm partially swaps out a process. This is an example ofshort term schedulinglong term schedulingmedium term schedulingmutu...
go_editor
4.1k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
2
votes
1
answer
4
UGC NET CSE | June 2013 | Part 2 | Question: 45
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known as handoff mobile switching mobile routing cell switching
When a mobile telephone physically moves from one to another cell, the base station transfers ownership to the cell getting strongest signal. This process is known ashand...
go_editor
2.3k
views
go_editor
asked
Jul 14, 2016
Graph Theory
ugcnetcse-june2013-paper2
+
–
2
votes
1
answer
5
UGC NET CSE | June 2013 | Part 2 | Question: 44
A set of processors $P1, P2, \dots Pk$ can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis; that is $ P1 \parallel P2 \parallel P3 \parallel \dots \parallel Pk$ ... $Pi \parallel Pj \text{ for all } i \leq j$ $Pi \parallel Pj \text{ for all } i \geq j$
A set of processors $P1, P2, \dots Pk$ can execute in parallel if Bernstein’s conditions are satisfied on a pairwise basis; that is $ P1 \parallel P2 \parallel P3 \...
go_editor
1.1k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
3
votes
2
answers
6
UGC NET CSE | June 2013 | Part 2 | Question: 43
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form? -42 -22 -21 -106
Which one of the following is decimal value of a signed binary number 1101010, if it is in 2’s complement form?-42-22-21-106
go_editor
4.1k
views
go_editor
asked
Jul 14, 2016
Graph Theory
ugcnetcse-june2013-paper2
+
–
2
votes
3
answers
7
UGC NET CSE | June 2013 | Part 2 | Question: 42
A Boolean operator $\ominus$ is defined as follows: 1 $\ominus$ 1 =1, 1 $\ominus$ 0 = 0, 0 $\ominus$ 1 = 0 and 0 $\ominus$ 0 =1 What will be the truth value of the expression (x $\ominus$ y ) $\ominus$ z = x $\ominus$ (y $\ominus$ z)? Always true Always false Sometimes true True when x,y, z are all true
A Boolean operator $\ominus$ is defined as follows:1 $\ominus$ 1 =1, 1 $\ominus$ 0 = 0, 0 $\ominus$ 1 = 0 and 0 $\ominus$ 0 =1What will be the truth value of the expressi...
go_editor
2.5k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
6
votes
3
answers
8
UGC NET CSE | June 2013 | Part 2 | Question: 41
How many different Boolean functions of degree 4 are there? $2^4$ $2^8$ $2^{12}$ $2^{16}$
How many different Boolean functions of degree 4 are there?$2^4$$2^8$$2^{12}$$2^{16}$
go_editor
7.0k
views
go_editor
asked
Jul 14, 2016
Digital Logic
ugcnetcse-june2013-paper2
digital-logic
boolean-algebra
+
–
1
votes
1
answer
9
UGC NET CSE | June 2013 | Part 2 | Question: 36
A test contains 100 true/false questions. How many different ways can a student answer the question on the test, if the answer may be left blank also. $^{100}P_2$ $^{100}C_2$ $2^{100}$ $3^{100}$
A test contains 100 true/false questions. How many different ways can a student answer the question on the test, if the answer may be left blank also.$^{100}P_2$$^{100}C_...
go_editor
2.2k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
3
votes
2
answers
10
UGC NET CSE | June 2013 | Part 2 | Question: 35
Give as good a big-O estimate as possible for the following functions: $(n \log n+ n^2 )(n^3 +2) \text{ and } (n! +2^n) (n^3 + \log (n^2 +1))$ $O(n^5 + 2n^2) \text{ & } O(n^{3*}n!)$ $O(n^5) \text{ & } O(n^{3*}2^n)$ $O(n^5) \text{ & } O(n^{3*}n!)$ $O(n^5 + 2n^2) \text{& } O(n^{3*}2^n)$
Give as good a big-O estimate as possible for the following functions:$(n \log n+ n^2 )(n^3 +2) \text{ and } (n! +2^n) (n^3 + \log (n^2 +1))$$O(n^5 + 2n^2) \text{ & } O(n...
go_editor
3.1k
views
go_editor
asked
Jul 14, 2016
Computer Networks
ugcnetcse-june2013-paper2
asymptotic-notation
+
–
4
votes
3
answers
11
UGC NET CSE | June 2013 | Part 2 | Question: 34
The relation “devides” on a set of positive integers is_____ Symmetric and transitive Anti symmetric and transitive Symmetric only Transitive only
The relation “devides” on a set of positive integers is_____Symmetric and transitiveAnti symmetric and transitiveSymmetric onlyTransitive only
go_editor
7.8k
views
go_editor
asked
Jul 14, 2016
Set Theory & Algebra
ugcnetcse-june2013-paper2
relations
set-theory&algebra
+
–
1
votes
2
answers
12
UGC NET CSE | June 2013 | Part 2 | Question: 32
The task of correcting and preprocessing data is called as Data streaming Data cleaning Data mining Data storming
The task of correcting and preprocessing data is called asData streamingData cleaningData miningData storming
go_editor
2.5k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
1
votes
2
answers
13
UGC NET CSE | June 2013 | Part 2 | Question: 31
Repository of information gathered from multiple sources, storing under unified scheme at a single site is called Data mining Meta Data Data warehousing Database
Repository of information gathered from multiple sources, storing under unified scheme at a single site is calledData miningMeta DataData warehousingDatabase
go_editor
2.3k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
2
votes
2
answers
14
UGC NET CSE | June 2013 | Part 2 | Question: 29
The value of postfix expression: 834+-382/+*2$3+ is 17 131 64 52
The value of postfix expression: 834+-382/+*2$3+ is171316452
go_editor
6.3k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
1
votes
1
answer
15
UGC NET CSE | June 2013 | Part 2 | Question: 27
For a B-tree of height h and degree t, the total CPU time used to insert a node is O(h log t) O(t log h) O(t$^2$h) O(th)
For a B-tree of height h and degree t, the total CPU time used to insert a node isO(h log t)O(t log h)O(t$^2$h)O(th)
go_editor
2.6k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
4
votes
2
answers
16
UGC NET CSE | June 2013 | Part 2 | Question: 26
Given an open address hash table with load factor $\alpha <1$, the expected number of probes in a successful search is Atmost $\frac{1}{\alpha}$ In $( \frac{1-\alpha}{\alpha})$ Atmost $\frac{1}{\alpha}$ In $( \frac{1 }{1-\alpha})$ Atleast $\frac{1}{\alpha}$ In $( \frac{1 }{1-\alpha})$ Atleast $\frac{1}{\alpha}$ In $( \frac{\alpha }{1-\alpha})$
Given an open address hash table with load factor $\alpha <1$, the expected number of probes in a successful search isAtmost $\frac{1}{\alpha}$ In $( \frac{1-\alpha}{\alp...
go_editor
2.7k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
2
votes
1
answer
17
UGC NET CSE | June 2013 | Part 2 | Question: 25
Which is the correct statement(s) for Non Recursive predictive parser? $S1 : First(\alpha) = \{ t \mid \alpha_{\Rightarrow}$ * $t \beta \text{ for some string } \beta \} _{\Rightarrow}$ * $t \beta$ ... Both statements S1 and S2 are incorrect S1 is incorrect S2 is correct S1 is correct S2 is incorrect Both statements S1 and S2 are correct
Which is the correct statement(s) for Non Recursive predictive parser?$S1 : First(\alpha) = \{ t \mid \alpha_{\Rightarrow}$ * $t \beta \text{ for some string } \beta \} _...
go_editor
2.3k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
2
votes
3
answers
18
UGC NET CSE | June 2013 | Part 2 | Question: 24
Given a Non-deterministic Finite Automaton (NFA) with states $\text{p}$ and $\text{r}$ as initial and final states respectively and transition table as given below $:$ ... $5$ $4$ $3$ $2$
Given a Non-deterministic Finite Automaton (NFA) with states $\text{p}$ and $\text{r}$ as initial and final states respectively and transition table as given below $:$$$\...
go_editor
7.8k
views
go_editor
asked
Jul 14, 2016
Theory of Computation
ugcnetcse-june2013-paper2
theory-of-computation
+
–
1
votes
1
answer
19
UGC NET CSE | June 2013 | Part 2 | Question: 23
The equivalent production rules corresponding to the production rules $S \rightarrow S \alpha_1 \mid S \alpha_2 \mid \beta_1 \mid \beta_2$ is $S \rightarrow \beta_1 \mid \beta_2, A \rightarrow \alpha_1 A \mid \alpha_2 A \mid \lambda$ ...
The equivalent production rules corresponding to the production rules $S \rightarrow S \alpha_1 \mid S \alpha_2 \mid \beta_1 \mid \beta_2$ is$S \rightarrow \beta_1 \mid \...
go_editor
3.9k
views
go_editor
asked
Jul 14, 2016
Compiler Design
ugcnetcse-june2013-paper2
compiler-design
+
–
1
votes
2
answers
20
UGC NET CSE | June 2013 | Part 2 | Question: 22
Given a grammar $S1 \rightarrow Sc, S \rightarrow SA \mid A, A \rightarrow aSb \mid ab$, there is a rightmost derivation $S1 \Rightarrow Sc \Rightarrow SAC \Rightarrow SaSbc$ Thus, $SaSbc$ is a right sentential form, and its handle is $SaS$ $bc$ $Sbc$ $aSb$
Given a grammar $S1 \rightarrow Sc, S \rightarrow SA \mid A, A \rightarrow aSb \mid ab$, there is a rightmost derivation $S1 \Rightarrow Sc \Rightarrow SAC \Rightarrow S...
go_editor
2.8k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
3
votes
1
answer
21
UGC NET CSE | June 2013 | Part 2 | Question: 21
Given the production rules of a grammar G1 as $S_1 \rightarrow AB \mid aaB$ $A \rightarrow a \mid Aa$ $B \rightarrow b$ and the production rules of a grammar G2 as $S_2 \rightarrow aS_2bS_2 \mid bS_2 aS_2 \mid \lambda$ Which ... G1 is ambiguous and G2 is ambiguous G1 is not ambiguous and G2 is ambiguous G1 is not ambiguous and G2 is not ambiguous
Given the production rules of a grammar G1 as$S_1 \rightarrow AB \mid aaB$$A \rightarrow a \mid Aa$$B \rightarrow b$and the production rules of a grammar G2 as$S_2 \right...
go_editor
3.6k
views
go_editor
asked
Jul 14, 2016
Compiler Design
ugcnetcse-june2013-paper2
compiler-design
+
–
6
votes
2
answers
22
UGC NET CSE | June 2013 | Part 2 | Question: 20
Given L1=L(a*baa*) L2=L(ab*). The regular expression corresponding to language L3=L1/L2 (right quotient) is given by a*b a*baa* a*ba* None of the above
Given L1=L(a*baa*) L2=L(ab*). The regular expression corresponding to language L3=L1/L2 (right quotient) is given bya*ba*baa*a*ba*None of the above
go_editor
5.6k
views
go_editor
asked
Jul 14, 2016
Theory of Computation
ugcnetcse-june2013-paper2
theory-of-computation
right-quotient
+
–
1
votes
1
answer
23
UGC NET CSE | June 2013 | Part 2 | Question: 19
In IPv4 header, the ____ field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs to identification fragment offset time to live header checksum
In IPv4 header, the ____ field is needed to allow the destination host to determine which datagram a newly arrived fragments belongs toidentificationfragment offsettime t...
go_editor
3.3k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
3
votes
1
answer
24
UGC NET CSE | June 2013 | Part 2 | Question: 18
In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for the three-layer hierarchy? 10 clusters, 24 regions and 20 routers 12 clusters, 20 regions and 20 routers 16 clusters, 12 regions and 25 routers 15 clusters, 16 regions and 20 routers
In hierarchical routing with 4800 routers, what region and cluster sizes should be chosen to minimize the size of the routing table for the three-layer hierarchy?10 clust...
go_editor
10.1k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
1
votes
1
answer
25
UGC NET CSE | June 2013 | Part 2 | Question: 17
In classful addressing, the IP address 190.255.254.254 belongs to Class A Class B Class C Class D
In classful addressing, the IP address 190.255.254.254 belongs toClass AClass BClass CClass D
go_editor
2.8k
views
go_editor
asked
Jul 14, 2016
Computer Networks
ugcnetcse-june2013-paper2
computer-networks
easy
+
–
1
votes
2
answers
26
UGC NET CSE | June 2013 | Part 2 | Question: 16
In _____ substitution, a character in the plaintext is always changed to the same character in ciphertext, regardless of its position in the text. polyalphabetic monoalphabetic transpositional multialphabetic
In _____ substitution, a character in the plaintext is always changed to the same character in ciphertext, regardless of its position in the text.polyalphabeticmonoalphab...
go_editor
3.9k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
1
votes
2
answers
27
UGC NET CSE | June 2013 | Part 2 | Question: 15
Which of the following addresses is used to deliver a message to the correct application program running on a host? Port IP Logical Physical
Which of the following addresses is used to deliver a message to the correct application program running on a host?PortIPLogicalPhysical
go_editor
5.8k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
1
votes
2
answers
28
UGC NET CSE | June 2013 | Part 2 | Question: 14
If $D_1, D_2, \dots D_n$ are domains in a relational model, then the relation is a table, which is a subset of $D_1+D_2+ \dots +D_n$ $D_1 \times D_2 \times \dots \times D_n$ $D_1 \cup D_2 \cup \dots \cup D_n$ $D_1-D_2- \dots -D_n$
If $D_1, D_2, \dots D_n$ are domains in a relational model, then the relation is a table, which is a subset of$D_1+D_2+ \dots +D_n$$D_1 \times D_2 \times \dots \times D_...
go_editor
2.6k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
1
votes
1
answer
29
UGC NET CSE | June 2013 | Part 2 | Question: 13
Which normal form is considered as adequate for usual database design? 2NF 3NF 4NF 5NF
Which normal form is considered as adequate for usual database design?2NF3NF4NF5NF
go_editor
1.2k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
2
votes
2
answers
30
UGC NET CSE | June 2013 | Part 2 | Question: 12
A Network Schema restricts to one to many relationship permits to many to many relationship Stores Data in a Database Stores Data in a Relation
A Network Schemarestricts to one to many relationshippermits to many to many relationshipStores Data in a DatabaseStores Data in a Relation
go_editor
2.6k
views
go_editor
asked
Jul 14, 2016
Others
ugcnetcse-june2013-paper2
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register