Register
Filter

Recent activity by im.raj

3 answers
2
Asymptotic notations
Is $ (5 - n^3) \in \Omega (n^2) $ ?
Is $ (5 - n^3) \in \Omega (n^2) $ ?
2 answers
3
graph theory
State TRUE or FALSE. The chromatic number of a Bi-partite graph is ALWAYS 2.
State TRUE or FALSE.The chromatic number of a Bi-partite graph is ALWAYS 2.
1 answer
4
UGC NET CSE | December 2012 | Part 2 | Question: 13
Which of the following is true? A relation in BCNF is always in 3NF A relation in 3NF is always in BCNF BCNF and 3NF are same A relation in BCNF is not in 3NF
Which of the following is true?A relation in BCNF is always in 3NFA relation in 3NF is always in BCNFBCNF and 3NF are sameA relation in BCNF is not in 3NF
2 answers
5
Write regular expression to denote a language L which accepts all the strings which begin or end with either 00 or 11
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).
2 answers
6
Database Views
Views are useful for _____ unwanted information, and for collecting together information from more than one relation into a single view. A. Hiding B. Deleting C. Highlighting D. All of the above
Views are useful for _____ unwanted information, and for collecting together information from more than one relation into a single view.A. HidingB. DeletingC. Hi...
4 answers
7
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
1 answer
8
UGC NET CSE | September 2013 | Part 3 | Question: 40
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is $\text{O(n)}$ $\text{O(n Ig n)}$ $\text{O(n$^2$)}$ None of the above
The time complexity of an efficient algorithm to find the longest monotonically increasing subsequence of n numbers is$\text{O(n)}$$\text{O(n Ig n)}$$\text{O(n$^2$)}$None...
1 answer
10
Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ?
A. T(n) = $O( n Log n)$B. T(n) = $O({(logn)}^2)$C. T(n) = $O(n)$D. T(n) = $O(n^2)$
1 answer
12
Which of the following conversion is not possible (algorithmically)?
A. regular grammar to context-free grammar B. nondeterministic FSA to deterministic FSA C. nondeterministic PDA to deterministic PDA D. nondeterministic TM to deterministic TM
A. regular grammar to context-free grammarB. nondeterministic FSA to deterministic FSAC. nondeterministic PDA to deterministic PDAD. nondeterministic TM to de...
3 answers
15
ISRO2007-55
Selection sort algorithm design technique is an example of Greedy method Divide-and-conquer Dynamic Programming Backtracking
Selection sort algorithm design technique is an example ofGreedy methodDivide-and-conquerDynamic ProgrammingBacktracking
8 answers
17
GATE CSE 2005 | Question: 2
An Abstract Data Type (ADT) is: same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used, but none else all of the above
An Abstract Data Type (ADT) is:same as an abstract classa data type that cannot be instantiateda data type for which only the operations defined on it can be used, but no...
1 answer
18
Solve The Recurrence Relation
T(n) = 1, if n = 1 = T(n-1) + 2^n , otherwise
T(n) = 1, if n = 1 = T(n-1) + 2^n , otherwise
1 answer
19
Solve the recurrence Relation
T(n) = T(n-1) + n T(1) = 1
T(n) = T(n-1) + nT(1) = 1
2 answers
20
Bipartite Graph
Consider the graph given below: The two distinct sets of vertices, which make the graph bipartite are: (A) (v1, v4, v6); (v2, v3, v5, v7, v8) (B) (v1, v7, v8); (v2, v3, v5, v6) (C) (v1, v4, v6, v7); (v2, v3, v5, v8) (D) (v1, v4, v6, v7, v8); (v2, v3, v5)
Consider the graph given below: The two distinct sets of vertices, which make the graph bipartite are:(A) (v1, v4, v6); (v2, v3, v5, v7, v8)(B) (v1, v7, v8); (v2, v3, v5,...
1 answer
21
Which one of the following statement is false ?
(A) Context-free languages are closed under union. (B) Context-free languages are closed under concatenation. (C) Context-free languages are closed under intersection. (D) Context-free languages are closed under Kleene closure.
(A) Context-free languages are closed under union.(B) Context-free languages are closed under concatenation.(C) Context-free languages are closed under intersection.(D) C...
3 answers
22
UGC NET CSE | December 2015 | Part 2 | Question: 20
A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G}. Which of the following is a candidate key? A AB ABC ABD
A relation R={A,B,C,D,E,F,G} is given with following set of functional dependencies: F={AD→E, BE→F, B→C, AF→G}. Which of the following is a candidate key?AABABCAB...
1 answer
23
Which of the following is/are not true?
(a) The set of negative integers is countable. (b) The set of integers that are multiples of 7 is countable. (c) The set of even integers is countable. (d) The set of real numbers between 0 and 1/2 is countable.
(a) The set of negative integers is countable.(b) The set of integers that are multiples of 7 is countable.(c) The set of even integers is countable.(d) The set of real n...
2 answers
24
Array
The information about an array used in program will be stored in Symbol Table Activation Record Both (A) and (B) Dope Vector
The information about an array used in program will be stored inSymbol TableActivation RecordBoth (A) and (B)Dope Vector
1 answer
25
Virtual Gate: Programming 3
2 answers
27
Virtual Gate: Programming 5
1 answer
28
Virtual Gate: Programming 2
1 answer
29
Virtual Gate: Programming 4