0 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 3.0k views answer comment Share Follow Print See 1 comment 1 1 comment reply Shaik Masthan commented Jul 13, 2018 reply Follow flag duplicate of https://gateoverflow.in/224659/ugc-net-2018-july-30 0 0 replyShare Please log in or register to add a comment.
7 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 0 reply Please log in or register to add a comment.
2 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 0 reply Please log in or register to add a comment.