comp1002_leq_1

Why do we need pseudocode?

• To write code that can be directly executed on a computer

• To help us visualize and plan the algorithms without syntax constraints

• Eliminate the need for programming language

• To improve the performance of the final code

• Replace the need for documentation

When creating a decision tree based on some input data, do all the results need to fit perfectly into the shape of the tree?

• Yes

• No

What this pseudo code represents?

• It finds the max number in the input list

• It sorts the input list in descending order

• It sorts the input list in ascending order

• It only checks, if the input list is sorted or not

• None of the give options, just a loop through the input list

As an analogy for abstraction, which one of the following is the highest level of abstraction?

• Umbrella

• Waterproof shoes

• Waterproof gloves

• Waterproof hat

Select the options (multiple) that represent the concept of nested loops

• A chef preparing multiple dishes

• A teacher grading exams, where each exam has multiple questions, and each question has sub-parts that need to be evaluated

• A gardener planting a variety of flowers in a garden bed, with each flower type needing its own planting method and a specific level of water.

• A traveler visiting multiple cities, where each city has its own set of attractions to explore.

We have 4 meetings to schedule in total. One team can only do one meeting at a time. To schedule following meetings; at minimum how many time slots do we need to book?

• Marketing: Team A, Team B

• Sales: Team B, Team C

• Development: Team A, Team D

• Design: Team C, Team D

• 1

• 2

• 3

• 4

• None of the given answers is right

Convert the decimal number 12 to an 8-bit binary number

In a weighted graph, what does the weight of an edge represent?

• How heavy it is

• Strength of connection between two nodes

• A quantitative measure; like distance, cost, or capacity

• Chronological order in which the edges were added to the graph

Which one of the following is the correct adjacency matrix for given graph (ignore extra comma)

• 0, 1, 0,

  3, 0, 5,

  1, 0, 0,

• 0, 3, 1,

  1, 0, 0,

  0, 5, 0,

• 0, 1, 0,

  1, 0, 1,

  1, 0, 0,

• None of these

What is the purpose of functionA?

• It checks if first and last rows can be swapped without any change

• It checks if the input matrix is a square matrix (number of rows and cols are same) or not

• It checks whether the matrix remains unchanged after transpose (swap rows with columns and vice versa)

• It checks if first and last columns can be swapped without any change

• it checks if the matrix diagonal (1, 4, 9 in this example) are all equal to each other or not