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 Kaluti
3
votes
1
answer
101
combinatory
Consider all possible permutations of eight distinct elements a, b, c, d, e, f, g, h. In how many of them, will d appear before b? Note that d and b may not necessarily be consecutive.
Consider all possible permutations of eight distinct elements a, b, c, d, e, f, g, h. In how many of them, will d appear before b? Note that d and b may not necessarily b...
283
views
asked
Oct 7, 2017
0
votes
0
answers
102
digital logic
he Boolean expression corresponding to the circuit is A tautology An inconsistency Independent of A None of the above
he Boolean expression corresponding to the circuit is A tautology An inconsistency Independent of A None of the above
444
views
asked
Sep 29, 2017
0
votes
1
answer
103
digital logic
f2(x2, x1, x0) will be Σm(2, 3, 4) Σm(1, 2, 6, 7) Σm(1, 2, 5, 6) None of these
f2(x2, x1, x0) will be Σm(2, 3, 4) Σm(1, 2, 6, 7) Σm(1, 2, 5, 6) None of these
290
views
asked
Sep 29, 2017
0
votes
1
answer
104
digital logic
A decimal number has 25 digits. The number of bits required for its equivalent binary representation is approximately 1)50 2)75 3)60 4)70
A decimal number has 25 digits. The number of bits required for its equivalent binary representation is approximately1)502)753)604)70
498
views
asked
Sep 29, 2017
0
votes
1
answer
105
digital logic
625
views
asked
Sep 26, 2017
0
votes
1
answer
106
digital logic
how many two input multiplexers are required to construct a 2^(10) input multiplexer?
how many two input multiplexers are required to construct a 2^(10) input multiplexer?
358
views
asked
Sep 26, 2017
0
votes
1
answer
107
digital logic
F = w'xz + w'yz + x'yz' + wxy'z d = wyz The minimum no of nand and nor gate required to implement the above function respectively are :
F = w'xz + w'yz + x'yz' + wxy'zd = wyzThe minimum no of nand and nor gate required to implement the above function respectively are :
2.9k
views
asked
Sep 26, 2017
3
votes
1
answer
108
generating function
Let p be an odd prime number. Find the number of subsets A of the set {1, 2, …, 2p} such that (i) A has exactly p elements, and (ii) the sum of all the elements in A is divisible by p.
Let p be an odd prime number. Find the number of subsets A of the set {1, 2, …, 2p} such that(i) A has exactly p elements, and(ii) the sum of all the elements in A is d...
374
views
asked
Sep 23, 2017
0
votes
0
answers
109
database
350
views
asked
Sep 19, 2017
0
votes
0
answers
110
database
440
views
asked
Sep 19, 2017
0
votes
1
answer
111
combinatorics
10 persons are seated at round table. The number of ways of selecting 3 persons out of them if no two persons are adjacent to each other is?
10 persons are seated at round table. The number of ways of selecting 3 persons out of them if no two persons are adjacent to each other is?
294
views
asked
Sep 16, 2017
0
votes
0
answers
112
probability
149
views
asked
Sep 15, 2017
2
votes
1
answer
113
Lattice question
Consider the ordering relation x | y ⊆ N × N over natural numbers N such that x|y iff there exists z ∈ N such that x · z = y. A set is called lattice if every finite subset has a least upper bound and greatest lower bound. It is called a complete lattice if every subset has a least upper bound and greatest lower bound.is it a complete lattice or lattice explain ?
Consider the ordering relation x | y ⊆ N × N over natural numbers N such that x|y iff there exists z ∈ N such that x · z = y. A set is called lattice if every finit...
950
views
asked
Sep 9, 2017
Mathematical Logic
complete-lattice
+
–
0
votes
0
answers
114
Graph theory
Consider the ordering relation x | y ⊆ N × N over natural numbers N such that x|y iff there exists z ∈ N such that x · z = y. A set is called lattice if every finite subset has a least upper bound and greatest lower bound. It is called a complete lattice if every subset has a least upper bound and greatest lower bound. is it complete lattice or lattice explain?
Consider the ordering relation x | y ⊆ N × N over natural numbers N such that x|y iff there exists z ∈ N such that x · z = y. A set is called lattice if every finit...
134
views
asked
Sep 9, 2017
1
votes
2
answers
115
self doubt
Find the total number of equivalent relations possible on a set S={4,7,1}. is there any other way to solve it without using bell formula?
Find the total number of equivalent relations possible on a set S={4,7,1}.is there any other way to solve it without using bell formula?
602
views
asked
Sep 9, 2017
1
votes
2
answers
116
Graph Theory Question
Consider a social network with n persons. Two persons A and B are said to be connected if either they are friends or they are related through a sequence of friends: that is, there exists a set of persons F1, . . . , Fm such that A and F1 ... . It is known that there are k persons such that no pair among them is connected. What is the maximum number of friendships possible?
Consider a social network with n persons. Two persons A and B are said to be connected if either they are friends or they are related through a sequence of friends: that ...
918
views
asked
Sep 9, 2017
Graph Theory
graph-connectivity
+
–
3
votes
1
answer
117
LU Decomposition
Find the value of a+b where a is for numerator and b is for denominator of l32 in the matrix A i am getting l32 as 32/(-51) plz confirm
Find the value of a+b where a is for numerator and b is for denominator of l32 in the matrix A i am getting l32 as 32/(-51) plz confirm
532
views
asked
Sep 9, 2017
3
votes
1
answer
118
self doubt
Consider the set N∗ of finite sequences of natural numbers with x ≤p y denoting that sequence x is a prefix of sequence y. Then, which of the following is true? Every non-empty subset of N∗ has a least upper bound. N∗ is uncountable. ≤p is a total order. Every non-empty subset of N∗ has a greatest lower bound.
Consider the set N∗ of finite sequences of natural numbers with x ≤p y denoting that sequence x is a prefix of sequence y. Then, which of the following is true? E...
698
views
asked
Sep 9, 2017
Set Theory & Algebra
lattice
+
–
1
votes
1
answer
119
self doubt
Which of the following is true: (a) differentiable and continous (d) none of these (c) not differentiable but continous (b) neither differentiable nor continous
Which of the following is true: (a) differentiable and continous (d) none of these (c) not differentiable but continous (b) neither differentiable nor continous
492
views
asked
Sep 9, 2017
3
votes
2
answers
120
self doubt
Twin primes are pairs of numbers p and p+2 such that both are primes-for instance, 5 and 7, 11 and 13, 41 and 43. The Twin Prime Conjecture says that there are infinitely many twin primes. Let TwinPrime(n) be a predicate that is true if n and n+2 are twin primes. Which of the ... (n)) ∃m. ∀n. n ≤ m implies TwinPrime(n) ∃m. ∀n. TwinPrime(n) implies n ≤ m ∀m. ∃n. n ≤ m and TwinPrime(n)
Twin primes are pairs of numbers p and p+2 such that both are primes—for instance, 5 and 7, 11 and 13, 41 and 43. The Twin Prime Conjecture says that there are infinite...
600
views
asked
Sep 9, 2017
Page:
« prev
1
2
3
4
5
6
7
8
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register