Question
What is the maximum number of different Boolean
functions involving n Boolean variables?Solution
No of inputs sequences possible for a n variable Boolean function = 2n Each input sequence can give either T or F as output ( 2 possible values ) So total will be 2^2^N
Which of the following types of software testing ensures that previously working functionality is still operational after changes?
Which of the following types of testing is typically conducted by end-users to verify that the developed software meets their requirements?
What is the time complexity of searching an element in a balanced binary search tree (BST) with nnn nodes?
Given the IP address 192.168.10.5 and the subnet mask 255.255.255.240 , what is the range of valid host addresses in this subnet?
Which design pattern is most suitable for controlling access to a resource by limiting the number of clients that can use it concurrently?
Which of the following is NOT a characteristic of a minimum spanning tree (MST) in a connected, undirected graph?
Which tree traversal gives nodes in non-decreasing order for a BST?
Which of the following is NOT a valid feature of IPv6 compared to IPv4?
Which of the following integrity constraints ensures that every non-null foreign key value must reference an existing primary key value in another tabl...
In Java, what will be the output of the following code snippet?
public class Test {
public static void main(String[] args) { <...
Relevant for Exams:
