A2 Computer Science Quiz End of Semester 1 Exam Review

What is the full form of BNF in computer science?

• Backward Numbering Format

• Basic Numerical Function

• Backus-Naur Form

• Binary Number Format

Explain the concept of RPN (Reverse Polish Notation) in computer science.

• RPN is a type of computer virus

• RPN is a mathematical notation in which every operator follows all of its operands.

• RPN is a method of organizing files on a computer

• RPN stands for Random Programming Notation

Define Infix notation and provide an example.

• 3 * 4 + 2

• 2 * 3 + 4

• 4 + 2 * 3

• 2 + 3 * 4

What is the significance of postfix notation in computer science?

• It eliminates the need for parentheses and follows a consistent order of operations.

• It increases the complexity of the code and makes it harder to debug.

• It allows for more flexibility in the order of operations.

• It makes the code more readable and easier to understand.

Explain Karnaugh Maps and their application in computer science.

• Karnaugh Maps are used in computer science to design software applications

• Karnaugh Maps are used in computer science to create complex logic circuits

• Karnaugh Maps are used in computer science to optimize network performance

• Karnaugh Maps are used in computer science to simplify logic circuits and minimize the number of logic gates required.

How is de Morgan's law used in Boolean algebra?

• It is used to determine the probability of Boolean events

• It is used to perform arithmetic operations on Boolean variables

• It is used to simplify Boolean expressions by allowing the transformation of AND operations to OR operations, and vice versa.

• It is used to convert Boolean variables to integers

What are the basic principles of de Morgan's law?

• Negation of a conjunction is the conjunction of the negations

• Negation of a conjunction is the disjunction of the conjunctions

• Negation of a conjunction is the disjunction of the negations, and the negation of a disjunction is the conjunction of the negations.

• Negation of a disjunction is the disjunction of the negations

Discuss the importance of de Morgan's law in computer science.

• De Morgan's law has no relevance in computer science

• De Morgan's law is only used in mathematics, not in computer science

• De Morgan's law is only applicable to simple logical expressions, not complex ones

• De Morgan's law is important in computer science for simplifying logical expressions and transforming complex conditions.

Explain the process of simplifying Boolean expressions using de Morgan's law.

• Apply Newton's law of motion to simplify the expression

• Use Pythagoras theorem to simplify the expression

• Use Ohm's law to simplify the expression

• Apply de Morgan's law to the given Boolean expression to simplify it

What is 6.625 in fixed point binary (4 bits for the whole number / 4 bits for fractional part)?

• 01101010

• 10001010

• 01101100

• 10001100