0 votes 0 votes Consider a Boolean function of 'n' variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is Logarithmic Linear Quadratic Exponential Algorithms ugcnetcse-july2018-paper2 algorithms + – Pooja Khatri asked Jul 13, 2018 • edited Jun 1, 2020 by soujanyareddy13 Pooja Khatri 2.0k views answer comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Jul 13, 2018 reply Follow Share duplicate of https://gateoverflow.in/224659/ugc-net-2018-july-30 0 votes 0 votes Please log in or register to add a comment.
7 votes 7 votes N boolean variable ===> 2n rows in truth table. for saying o/p 1 for the given function, in worst case it needs to check every possible row ===> O(2n) ===> Exponential Option D is correct Shaik Masthan answered Jul 8, 2018 Shaik Masthan comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes N boolean variables will result in 2n output variables in the truth table. In order to determine whether an output 1 is resulted, in the worst case(by brute force), the algo needs to check all possible outputs (2n) which implies an exponential algo Sayan Bose answered Jul 13, 2018 Sayan Bose comment Share Follow See all 0 reply Please log in or register to add a comment.