menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIT Madras Direct PhD Interview Experience-July 2020
IIT Hyderabad M.Tech RA CSE Interview Experience-July 2020
IIT Hyderabad AI M.tech RA Interview Experience-July 2020
GATE 2021 BROCHURE
IIT Gandhinagar – Direct PhD Interview Experience June 2020
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(16)
Puzzles
(5)
Algorithm Challenges
(11)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent Blog Comments
it'll be automatic.
@gatecse Suppose if someone is the top user of...
Thanks for the clarification.
"Weekly Top User": It is only one person per...
gatecse Even my name is showing in the list of...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Equivalence of Boolean Expressions
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.
placement-questions
asked
Jun 6, 2016
in
Algorithm Challenges
Arjun
158
views
answer
comment
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
1
vote
1
answer
1
679
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 in lesser time ?
asked
Apr 10, 2016
in
Algorithm Challenges
radha gogia
679
views
placement-questions
2
votes
2
answers
2
892
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 1 Answer is 35.
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
placement-questions
dynamic-programming
0
votes
0
answers
3
278
views
Evaluate an arithmetic expression
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
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
placement-questions
0
votes
2
answers
4
410
views
Multiplication without '*'
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.
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
placement-questions
...