Register

Equivalence of Boolean Expressions

• retagged by
719 views

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · InstructionsNext → · Kenneth Rosen Editio...
← Previous in category · Evaluate an arithmet...Next in category → · Maximum Continuous S...
Position:
Show:

Related questions

1 1 vote
1 answers 1 answer
4.3k
4.3k views
radha gogia asked Apr 10, 2016
4,325 views
what is the best time complexity to find maximum product of exactly k elements in an array ?
According to me first we sort the array in O(nlogn) time and then in O(k) time , find the product , so total time complexity is O(nlogn) , so am I right or can it be done...
3 3 votes
2 2 answers
5.9k
5.9k views
Arjun asked Jul 3, 2016
5,891 views
Maximum Continuous Sum in an Array
Given an array of $n$ elements find the maximum continuous sum in it. For example consider the below array of $n=6$.23 4 -10 2 15 1Answer is 35.
0 0 votes
0 0 answers
2.1k
2.1k views
Arjun asked Jun 6, 2016
2,096 views
Evaluate an arithmetic expression
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
2 2 votes
1 answers 1 answer
3.2k
3.2k views
Arjun asked Apr 9, 2016
3,228 views
Open the lock
You are given a number lock of 4 digits and it accepts a serial input. What should be the minimum length of an input string so that the lock is guaranteed to open assumin...