Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by sh!va
1
votes
1
answer
511
Find max flow of graph
Find the max-flow in the following graph: 2 4 5 6
Find the max-flow in the following graph:2456
1.3k
views
asked
Jul 15, 2016
1
votes
1
answer
512
DBMS: Spot the wrong statement
Spot the wrong statement. Subschema is related with external view only. Data dictionary is a tool used exclusively by the database administrator. To define a schema DDL, DML and DCL are comulsory. SET concept is used in network model
Spot the wrong statement.Subschema is related with external view only.Data dictionary is a tool used exclusively by the database administrator.To define a schema DDL, DML...
802
views
asked
Jul 15, 2016
Unknown Category
databases
+
–
0
votes
1
answer
513
Choose the wrong statement regarding Object oriented design
Choose the wrong statement regarding Object oriented design: A. A signal is generated in case of asynchronous events only. B. a powertype is a metaclass whose instances are super classes of a given class C. A table in database can be considered as artifact. D. In UML, a subsystem is considered as a type of package
Choose the wrong statement regarding Object oriented design:A. A signal is generated in case of asynchronous events only.B. a powertype is a metaclass whose instances are...
407
views
asked
Jul 15, 2016
Unknown Category
uml
+
–
0
votes
1
answer
514
How many layers does ATM has?
ATM standard defines : (A) 2 layers (B) 3 layers (C) 5 layers (D) 7 layers
ATM standard defines :(A) 2 layers (B) 3 layers(C) 5 layers (D) 7 layers
3.1k
views
asked
Jul 14, 2016
2
votes
2
answers
515
The hexadecimal equivalent of the decimal number
The hexadecimal equivalent of the decimal number 0.25 is (A)0 .25 (B) 0.35 (C)0 .40 (D) 0.15
The hexadecimal equivalent of the decimal number 0.25 is (A)0 .25(B) 0.35 (C)0 .40 (D) 0.15
1.9k
views
asked
Jul 14, 2016
Digital Logic
number-representation
digital-logic
+
–
0
votes
1
answer
516
How I can bookmark others' question in gateoverflow?
Hi.. Suppose one member asked a good question in gateoverflow site and currently it is unanswered. How I can bookmark others' question so that I will get notification when somebody give answer to it?
Hi..Suppose one member asked a good question in gateoverflow site and currently it is unanswered. How I can bookmark others' question so that I will get notification when...
835
views
asked
Jul 13, 2016
Unknown Category
gateoverflow
+
–
1
votes
1
answer
517
Equivalent number of digits in octal system
If a number requires 6 hexadecimal digits for its representation, what is the minimum number of octal digits required to represent it ? (A) 6 (B)7 (C) 8 (D) 9
If a number requires 6 hexadecimal digits for its representation, what is the minimum number of octal digits required to represent it ?(A) 6(B)7(C) 8(D) 9
899
views
asked
Jul 13, 2016
Digital Logic
digital-logic
number-representation
+
–
1
votes
1
answer
518
A device which converts BCD to Seven Segment is called
A device which converts BCD to Seven Segment is called (A) Encoder (B) Decoder (C) Multiplexer (D) Demultiplexer
A device which converts BCD to Seven Segment is called(A) Encoder(B) Decoder(C) Multiplexer(D) Demultiplexer
4.0k
views
asked
Jul 13, 2016
Digital Logic
digital-logic
+
–
1
votes
1
answer
519
Predict output of DFA
Consider an output-producing, deterministic finite state automaton (DFA) of the kind indicated in the figure below, in which it is assumed that every state is a final state. Assume that the input is at least four bits long. Which of the following is(are) true? I. The last ... the input ends with "1100". (A) I only (B) II only (C) I and II only (D) II and III only
Consider an output-producing, deterministic finite state automaton (DFA) of the kind indicated in the figure below, in which it is assumed that every state is a final sta...
2.0k
views
asked
Jul 13, 2016
0
votes
1
answer
520
What is a desirable choice for the partitioning element in quick sort?
A desirable choice for the partitioning element in quick sort is (A) First element of the list (B) Last element of the list (C) Randomly chosen element of the list (D) Median of the list
A desirable choice for the partitioning element in quick sort is(A) First element of the list(B) Last element of the list(C) Randomly chosen element of the list(D) Median...
5.9k
views
asked
Jul 13, 2016
Algorithms
sorting
algorithms
+
–
1
votes
2
answers
521
Which is a valid octal constant?
The valid octal constants from the following (i) 0245 (ii) 0387 (iii) 04.32 (iv) –0467 (A) (i) and (ii) (B) (iii) and (iv) (C) (i) (iii) and (iv) (D) (i) and (iv)
The valid octal constants from the following(i) 0245 (ii) 0387 (iii) 04.32 (iv) –0467(A) (i) and (ii)(B) (iii) and (iv)(C) (i) (iii) and (iv)(D) (i) and (iv)
3.6k
views
asked
Jul 12, 2016
Digital Logic
number-representation
digital-logic
+
–
2
votes
2
answers
522
MTU is specified by
MTU is specified by (A) Data link layer frame size (B) Hardware technology (C) TCP Segment size (D) Congestion window size
MTU is specified by(A) Data link layer frame size(B) Hardware technology(C) TCP Segment size(D) Congestion window size
1.8k
views
asked
Jul 12, 2016
Computer Networks
computer-networks
+
–
1
votes
2
answers
523
What is the number of terminal strings generated by given context-free grammar ?
S→ A 0B A→ BB|0 B →AA|1 What is the number of terminal strings of length 5 generated by the context-free grammar shown above? 4 5 6 7
S→ A 0BA→ BB|0B →AA|1What is the number of terminal strings of length 5 generated by the context-free grammar shown above?4567
1.1k
views
asked
Jul 12, 2016
Compiler Design
compiler-design
context-free-grammar
+
–
1
votes
2
answers
524
Relation between NP, recursive and recusive enumerable
I) Every language in NP is recursive. II)Every language in NP is recursively enumerable. Which of the statements is /are true? A. I only B. II only C. Both I and II D Neither I nor II
I) Every language in NP is recursive.II)Every language in NP is recursively enumerable.Which of the statements is /are true?A. I onlyB. II onlyC. Both I and IID Neither I...
3.0k
views
asked
Jul 12, 2016
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
2
votes
2
answers
525
Find which recurrence relaton is not polynomial?
If T (0) = T (1 ) = 1, each of the following recurrences for n ≥ 2 defines a function T on the non negative integers. Which of the following CANNOT be bounded by a polynomial function? T ( n) = 3T(n/2)+ n2 T(n)= T(7n/8)+ 8n T (n)= 2T(n-2)+1 T (n)= T(n-1)+ n2 How to solve this? Please explain
If T (0) = T (1 ) = 1, each of the following recurrences for n ≥ 2 defines a function T on the non negative integers. Which of the following CANNOT be bounded by a poly...
4.6k
views
asked
Jul 12, 2016
Algorithms
recurrence-relation
algorithms
+
–
0
votes
1
answer
526
What is the maximum number of hosts for given network mask?
A network on the Internet has a sub net mask of 255.255.240.0 What is the maximum number of hosts it can handle ? I am confused with the concept. In given mask there are 12 zeros, so Maximum of 2 12 = 4096 hosts are ... 4064 Option 2: We have to subtract 2 from total no of hosts Hence 4096 -2 = 4094 Which is correct? Please explain
A network on the Internet has a sub net mask of 255.255.240.0What is the maximum number of hosts it can handle ? I am confused with the concept.In given mask there are 12...
5.5k
views
asked
Jul 12, 2016
Computer Networks
computer-networks
+
–
1
votes
2
answers
527
What is the minimum number of multiplications required to compute the chain of matrices?
What is the minimum number of multiplications required to compute the chain of matrices A = A1.A2.A3.A4 with size of A1 is 10x100, A2 is 100x5, A3 is 5x50, and A4 is 50x1?
What is the minimum number of multiplications required to compute the chain of matrices A = A1.A2.A3.A4 with size of A1 is 10x100, A2 is 100x5, A3 is 5x50, and A4 is 50x1...
5.5k
views
asked
Jul 12, 2016
Linear Algebra
matrix
+
–
2
votes
4
answers
528
Find he minimum number of scalar multiplications in matrix multiplication
Four matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of total scalar multiplications. For example, when multiplied as ((M1 x M2 ... 100, r = 20, s = 5, and t = 80, then what is the minimum number of scalar multiplications needed ?
Four matrices M1, M2, M3, and M4 have dimensions p x q, q x r, r x s, and s x t respectively can be multiplied in several ways with different number of total scalar multi...
22.2k
views
asked
Jul 12, 2016
Algorithms
algorithms
matrix-chain-ordering
+
–
0
votes
1
answer
529
Find the weight of minimum spanning tree
Consider a graph whose vertices are points in the plane with integer coordinates (x, y) such that 1<=x <= n and 1 <= y <= n, where n >= 2 is an integer. Two vertices (x1, y1) and (x2, Y2) are adjacent iff |x1 -x2| <= 1 and ly1 - ... (y1 - y2)2). What is the weight of a minimum weight-spanning tree in the graph? a) n-1 b) n+1 c) n d) log n
Consider a graph whose vertices are points in the plane with integer coordinates (x, y) such that 1<=x <= n and 1 <= y <= n, where n >= 2 is an integer. Two vertices (x1,...
722
views
asked
Jul 12, 2016
Programming in C
graph-theory
algorithms
+
–
3
votes
1
answer
530
Which search sequence is not possible in binary search tree?
A binary search tree is used to locate the number $43.$ Which of the following probe sequence is not possible? $61 \quad 52 \quad 14 \quad 17 \quad 40 \quad 43$ $23 \quad 50 \quad 40 \quad 60 \quad 43$ $10 \quad 65 \quad 31\quad 48\quad 37 \quad 43$ $81 \quad 61 \quad 52 \quad 14 \quad 41 \quad 43$
A binary search tree is used to locate the number $43.$ Which of the following probe sequence is not possible?$61 \quad 52 \quad 14 \quad 17 \quad 40 \quad 43$$23 \...
5.2k
views
asked
Jul 12, 2016
Programming in C
algorithms
binary-search-tree
+
–
Page:
« prev
1
...
21
22
23
24
25
26
27
28
29
30
31
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register