FT Exam CSCI0823 ND3B

In which notation are operators written in-between their operands?

• a) Prefix notation
• b) Postfix notation
• c) Infix notation
• d) Polish notation

In infix notation, what do we use to make the order of evaluation of operators clear?

• a) Parentheses ()
• b) Brackets []
• c) Curly braces {}
• d) Angle brackets <>

Which notation is also known as "Reverse Polish notation"?

• a) Prefix notation
• b) Postfix notation
• c) Infix notation
• d) Polish notation

In postfix notation, how are operators positioned in relation to their operands?

• a) Before the operands
• b) After the operands
• c) Between the operands
• d) Surrounding the operands

Which notation is evaluated left-to-right and does not use brackets to change the order of evaluation?

• a) Prefix notation
• b) Postfix notation
• c) Infix notation
• d) Polish notation

In prefix notation, where are operators positioned in relation to their operands?

• a) Before the operands
• b) After the operands
• c) Between the operands
• d) Surrounding the operands

Which notation uses a stack data structure to evaluate expressions?

• a) Infix notation
• b) Postfix notation
• c) Prefix notation
• d) Mixfix notation

What is backtracking in Prolog?

• a) A form of searching
• b) A mechanism for finding multiple solutions
• c) A process of undoing variable bindings
• d) A method of resolving conflicts in rule matching

When does Prolog backtrack?

• a) When it finds a solution to all goals
• b) When it encounters an unsatisfiable goal
• c) When it reaches the end of the database
• d) When it encounters a rule with multiple clauses

What is the purpose of backtracking in Prolog?

• a) To improve efficiency of the search process
• b) To allow for exploring alternative solutions
• c) To handle exceptions and errors
• d) To backtrack and undo previous choices