search
Log In
1 vote
158 views
Write an object oriented code for representing boolean expressions and then a function for checking the equivalence of two boolean expressions.
in Algorithm Challenges 158 views

Please log in or register to answer this question.

Related questions

1 vote
1 answer
1
679 views
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 in lesser time ?
asked Apr 10, 2016 in Algorithm Challenges radha gogia 679 views
2 votes
2 answers
2
892 views
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 1 Answer is 35.
asked Jul 3, 2016 in Algorithm Challenges Arjun 892 views
0 votes
0 answers
3
278 views
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
asked Jun 6, 2016 in Algorithm Challenges Arjun 278 views
0 votes
2 answers
4
410 views
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.
asked Jun 6, 2016 in Algorithm Challenges Arjun 410 views
...