Question
Download Solution PDFConsider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is:
Answer (Detailed Solution Below)
Detailed Solution
Download Solution PDFConcept:
Boolean function: In Boolean function, each argument is represented in form of only 0 or 1.
Explanation:
Given, n Boolean variables.
If there are n Boolean variables, then number of Boolean functions possible are 2n.
Suppose we have 4 Boolean variables, so number of Boolean functions are = 24 = 16
Here, we have to find the order of algorithm which determines whether Boolean function produces an output 1.
For this, we need to check each Boolean function one by one in worst case.
As, there are 2n Boolean functions, we have to check all of these in worst case.
As, it is in exponential form. So, order of the algorithm is also in exponential form.
Diagram representation of Boolean function with n Boolean variables:
As, each Boolean variable is mapped with either 0 or 1, that’s why Boolean function are 2n.
Last updated on Jul 6, 2025
-> The UGC NET Answer Key 2025 June was released on the official website ugcnet.nta.ac.in on 06th July 2025.
-> The UGC NET June 2025 exam will be conducted from 25th to 29th June 2025.
-> The UGC-NET exam takes place for 85 subjects, to determine the eligibility for 'Junior Research Fellowship’ and ‘Assistant Professor’ posts, as well as for PhD. admissions.
-> The exam is conducted bi-annually - in June and December cycles.
-> The exam comprises two papers - Paper I and Paper II. Paper I consists of 50 questions and Paper II consists of 100 questions.
-> The candidates who are preparing for the exam can check the UGC NET Previous Year Papers and UGC NET Test Series to boost their preparations.