Crowdly

Add to Chrome

COMPSCI1018 Computing Science 1S - Computing Systems - 2024-25

Looking for COMPSCI1018 Computing Science 1S - Computing Systems - 2024-25 test answers and solutions? Browse our comprehensive collection of verified answers for COMPSCI1018 Computing Science 1S - Computing Systems - 2024-25 at moodle.gla.ac.uk.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

The reason for using a header node to point to a linked list is

Given a pointer p to a node in a list, you can insert a new node

before (*p) but not after (*p).

❌

It is impossible to have a pointer which is not part of a record

❌

Given a pointer p to a node in a list, you can insert a new node

after (*p) but not before (*p), and if the new node should go

at the beginning that means it can be inserted after the header

✅

View this question

Which of the following is NOT an advantage of "short circuit"

evaluation of the following expression?

i<n && x[i]=y[i]

The short circuit evaluation requires fewer conditional jump

instructions than a complete evaluation

If i<n is False, then evaluating x[i]=y[i] could cause an

invalid array access

It is more efficient to skip evaluating the second part of

the expression if the first part is false

View this question

Suppose we have an integer code, and we need to execute a different statement for each value of the code from 0 to n-1. Which statement correctly describes the time complexity?

An if-then-elif-elif statement would take time O(n)

A jump table would take time O(1)

✅

An if-then-elif-elif statement would take time O(1)

A jump table would take time O(log n)

❌

An if-then-elif-elif statement and a jump table would take

approximately the same time, if n is very large

❌

View this question

Most of the following statements describe useful things that interrupts can do, but one does not. Which of the following statements is NOT true?

Interrupts enable I/O devices to receive service quickly, before

a deadline has expired

Interrupts are more robust for checking arithmetic overflow than

relying on instructions that check the condition code after an operation

Interrupts can be used to implement repeat-until loops

If a process goes into an infinite loop, an interrupt prevents this

process from freezing the system

Interrupts enable the operating system to allow many proccess to

make progress concurrently

View this question

Which of the following statements is NOT true?

Interrupts are used to implement nested conditional statements

Interrupts can be used to check for overflow in arithmetic operations.

A program can be interrupted at any point

When an interrupt occurs, the system must save the registers in order

to make it possible to resume execution of the interrupted program

View this question

Each node in a binary tree is a record with three fields: value, left, and right. Suppose R1 points to a node in the tree. Which instruction would put a pointer to the right subtree into R5?

View this question

Each node in a binary tree is a record with three fields: value, left, and right. Suppose R1 points to a node in the tree. Which instruction would put the value of that node into R3?

View this question

Each node in a binary tree is a record with three fields: value, left, and right. Suppose p is a pointer to a node in the tree. Which instruction would make R1 point to that node?

A database contains 1,000,000 records which can be sorted into ascending order by an ID number. We are searching for the record whose ID number is X. Suppose it takes 1 microsecond to compare one record with X. There are two implementations of the database: one uses a linear list, and one uses a binary search tree. Which statement is true?

The linear list search takes an average of about 500,000 microseconds.

The binary search tree takes an average about 20 microseconds.

Both versions (the linear list and the binary search tree)

take roughly the same time.

The linear list search takes an average of about 1,000,000 microseconds.

The binary search tree takes an average of about 500,000 microseconds

View this question

An algorithm that has time complexity of O(n^2) requires 1 second

to process 10 input records. Approximately how long does it take

to process 1000 input records?