Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Deepthi_ts
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Deepthi_ts
0
votes
1
#test_series
Consider a scenario where 3 processes P1, P2 and P3 are sharing X resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known that the maximum combined need of both processes P1 and P2 at a time is 9 and they always execute only in a combined manner. Then the value of X+ 7 is ________.
Consider a scenario where 3 processes P1, P2 and P3 are sharing X resources of the same type. The maximum need of the three processes is 4, 8, 6. It is also known tha...
322
views
answered
Jan 12, 2018
1
votes
2
Higher Engg. Mathematics by B.S. Grewal probability & statistics
Out of 50 rare books, 3 of which are especially valuable, 5 are stolen at random by a thief.? What is the probability that a) none of the 3 is included b) 2 of the 3 are included?
Out of 50 rare books, 3 of which are especially valuable, 5 are stolen at random by a thief.?What is the probability that a) none of the 3 is included b) 2 of the 3 are i...
2.3k
views
answered
Jan 12, 2018
Probability
probability
+
–
1
votes
3
#DS #Graphs
Tell me 1. Possible number of BINARY TREES with n vertices ? 2. Possible number of BINARY SEARCH TREES with n vertices ? 3. Possible number of TREES with n vertices ? 4. Possible number of LABELED Trees with n vertices? 5. Possible number of UNLABELED Trees with n vertices? Also, When Cayley's Formula is applied and when Catalan Number is applied ?
Tell me1. Possible number of BINARY TREES with n vertices ? 2. Possible number of BINARY SEARCH TREES with n vertices ?3. Possible number of TREES with n vertices ?4. Pos...
377
views
answered
Oct 12, 2017
0
votes
4
output
main() { int a=2; if(a==2) { a=~a+2<<1; printf("%d",a); } else { break; } a)-3 b)-2 c)1 d)compile error
main(){int a=2;if(a==2){a=~a+2<<1;printf("%d",a);}else{break;}a)-3b)-2c)1d)compile error
255
views
answered
Oct 12, 2017
1
votes
5
co_williams
What would be the bias value for a. A base-2 exponent in a 6-bit field? b. A base-8 exponent in a 7-bit field?
What would be the bias value fora. A base-2 exponent in a 6-bit field?b. A base-8 exponent in a 7-bit field?
547
views
answered
Oct 12, 2017
0
votes
6
Time complexity
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the complexity to search an element in this array a)O(m*n) b)O(m2) or O(n2) c)O(log2(m*n)) d)O(m+n)
Given a 2D array X[m][n] which has m rows and n columns. The array X is row wise and column wise sorted (i.e) each individula row and column is sorted. What is the comple...
833
views
answered
Oct 12, 2017
Algorithms
sorting
time-complexity
+
–
0
votes
7
Associative
A fully associative cache memory unit with a capacity of 64KB is built using a block size of 32 words.The size of the physical address is 30 bits. The size of the tag comparator (in bits) is ____________
A fully associative cache memory unit with a capacity of 64KB is built using a block size of 32 words.The size of the physical address is 30 bits. The size of the tag com...
723
views
answered
Oct 12, 2017
1
votes
8
upload snaps
Someone please help me in guiding how to upload snap of questions by phone.
Someone please help me in guiding how to upload snap of questions by phone.
209
views
answered
Oct 12, 2017
1
votes
9
UGC NET CSE | January 2017 | Part 3 | Question: 42
What can you say about the following statements? XML tags are case-insensitive In JavaScript, identifier names are case-sensitive Cascading Style Sheets (CSS) cannot be used with XML All well formed XML documents must contain a document type definition ... II are false only III and IV are false only I and III are false only II and IV are false
What can you say about the following statements?XML tags are case-insensitiveIn JavaScript, identifier names are case-sensitiveCascading Style Sheets (CSS) cannot be used...
1.8k
views
answered
Oct 12, 2017
Web Technologies
ugcnetcse-jan2017-paper3
web-technologies
programming
+
–
0
votes
10
UGC NET CSE | January 2017 | Part 3 | Question: 32
Any decision tree that sorts n elements has height ____ $\Omega (\lg \: n)$ $\Omega (n)$ $\Omega (n \: \lg \: n)$ $\Omega (n^2)$
Any decision tree that sorts n elements has height ____$\Omega (\lg \: n)$$\Omega (n)$$\Omega (n \: \lg \: n)$$\Omega (n^2)$
7.5k
views
answered
Oct 11, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
tree
+
–
0
votes
11
UGC NET CSE | January 2017 | Part 3 | Question: 33
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case. $O(1)$ $O( \lg n)$ $O(n)$ $O(n \lg n)$
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take _____ time in the worst case.$O(1...
2.3k
views
answered
Oct 11, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
red-black-tree
+
–
1
votes
12
UGC NET CSE | January 2017 | Part 3 | Question: 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5 $ is...
3.5k
views
answered
Oct 11, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
matrix-chain-ordering
+
–
0
votes
13
UGC NET CSE | January 2017 | Part 3 | Question: 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5> $ is $630$ $580$ $480$ $405$
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is $< 5,10,3,12,5 $ is...
3.5k
views
answered
Oct 11, 2017
Algorithms
ugcnetcse-jan2017-paper3
algorithms
matrix-chain-ordering
+
–
4
votes
14
aptitudee
A) Statements No proud is animal Some sheeps are animals All cats are sheeps Conclusions 1.No cat is proud 2.Some cats are animals 3.No animal is cat 4.Some prouds are sheep OPTIONS 1.Only 3 folllows 2.Either 2 or 3 follows 3.only 1 follows 4.only 3 and 4 follows
A) Statements No proud is animalSome sheeps are animalsAll cats are sheepsConclusions1.No cat is proud2.Some cats are animals3.No animal is cat4.Some prouds are sheepOP...
1.2k
views
answered
Oct 11, 2017
Quantitative Aptitude
analytical-aptitude
logical-reasoning
statements-follow
+
–
6
votes
15
helpless mind
What is the difference between Base addressing and Index addressing? And finally how does based indexed addressing works?
What is the difference between Base addressing and Index addressing?And finally how does based indexed addressing works?
2.3k
views
answered
Oct 11, 2017
CO and Architecture
co-and-architecture
addressing-modes
+
–
5
votes
16
# gate cse 1998 2 marks
Plz explain the answer of ques no. 4 a) 2NF b) 3NF
Plz explain the answer of ques no. 4a) 2NFb) 3NF
824
views
answered
Apr 26, 2017
Databases
databases
database-normalization
+
–
2
votes
17
UGC NET CSE | Junet 2015 | Part 3 | Question: 68
Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
Consider the following transportation problem:The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given be...
10.8k
views
answered
Apr 21, 2017
Optimization
ugcnetcse-june2015-paper3
transportation-problem
optimization
+
–
3
votes
18
Peter Linz chapter 2 exercise
How to solve this type of questions ? Every substring of four symbols has at most two 0's. For example, 001110 and 011001 are in the language, but 10010 is not since one of its substrings, 0010, contains three zeros. over the alphabet 0 and 1.
How to solve this type of questions ?Every substring of four symbols has at most two 0's. For example, 001110 and 011001 are in the language, but 10010 is not since one o...
1.7k
views
answered
Apr 11, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
3
votes
19
Peter line 2.1
Construct the DFA for all string with at least one a and exactly two b
Construct the DFA for all string with at least one a and exactly two b
220
views
answered
Apr 11, 2017
0
votes
20
theory of computation
Let sigma = { 0,1 } . Construct a minimal DFA which accepts set of all strings in which "Every substring of four symbols has at most two 0’s". For example, 001110 and 011001 are in the language, but 10010 is not since one of its substrings, 0010, contains three zeros.
Let sigma = { 0,1 } . Construct a minimal DFA which accepts set of all strings in which"Every substring of four symbols has at most two 0’s". For example, 001110 and 01...
4.5k
views
answered
Apr 11, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
21
theory of computation
Is the language given below regular or not ? I feel it is regular. The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 } - { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1b2a2 , a1b3a1 and few more strings (but finite number of ... language is regular ... QUESTION TAKEN FROM PETER LINZ TEXTBOOK AND ANSWER WAS NOT GIVEN. So please verify whether i am correct ...???
Is the language given below regular or not ?I feel it is regular.The equivalent language is, L = {anblak ; n>=1,l>=1,k>=1 } - { a1b1a1 , a1b1a2 , a1b1a3 , a1b2a1 , a1...
544
views
answered
Apr 11, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
22
Union of Two Language
WHat is the union of the following wo languages L=0*1+0+1* ∪ 10*1 L=001 U 0*1*
WHat is the union of the following wo languagesL=0*1+0+1* ∪ 10*1L=001 U 0*1*
399
views
answered
Apr 11, 2017
Theory of Computation
theory-of-computation
+
–
0
votes
23
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
4.9k
views
answered
Apr 11, 2017
Theory of Computation
finite-automata
+
–
1
votes
24
Peter Linz Exercise 4.3
233
views
answered
Apr 11, 2017
Theory of Computation
theory-of-computation
regular-language
+
–
0
votes
25
Automata Theory by HMU
Is L(G) finite, for a given CFG G. Is decidable or undecidable?
Is L(G) finite, for a given CFG G.Is decidable or undecidable?
310
views
answered
Apr 11, 2017
0
votes
26
introduction to computer theory second edition by daniel chapter 5 question 14 (ii)
build an fa that accepts language of all strings of length 4 or more such that next to last (second last) letter is equal to the second letter of input string
build an fa that accepts language of all strings of length 4 or more such that next to last (second last) letter is equal to the second letter of input string
1.4k
views
answered
Apr 11, 2017
Theory of Computation
finite-automata
+
–
2
votes
27
theory of computation
The language generated by the below grammar is S --> aSS / b
The language generated by the below grammar is S aSS / b
1.5k
views
answered
Apr 11, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
28
theory of computation
301
views
answered
Apr 11, 2017
Theory of Computation
theory-of-computation
finite-automata
+
–
0
votes
29
sub: Theory Of Computation Topic: regular exp. to DFA
To Convert regular expression to DFA -> In most of the RE we can not directly convert it to DFA we have to first converting it to NFA-null then NFA-without null and then DFA and that takes too much time to me plz tell me any short cut to do this if any else conform me this is the only way.
To Convert regular expression to DFA - In most of the RE we can not directly convert it to DFA we have to first converting it to NFA-null then NFA-without null and then D...
462
views
answered
Apr 11, 2017
Theory of Computation
regular-expression
finite-automata
theory-of-computation
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register