Harlequin Misha COMPUTER SCIENCE & IT   -   Information Systems Auditing Process

What is the primary purpose of performing a risk assessment in an IS audit?

Risk assessment helps prioritize audit focus on areas with higher risk of control failures.
Harlequin Misha COMPUTER SCIENCE & IT   -   Information Systems Auditing Process

Which audit technique involves following a transaction through the entire processing cycle?

A walkthrough involves following a transaction from initiation to completion to understand the process flow.
Harlequin Misha COMPUTER SCIENCE & IT   -   Information Systems Auditing Process

What does the acronym COBIT stand for in the context of IS auditing?

COBIT provides a framework for IT management and governance.
Harlequin Misha COMPUTER SCIENCE & IT   -   Information Systems Auditing Process

Which of the following is the first step in the information systems audit process?

Planning involves defining the scope, objectives, and methodology of the audit.
Harlequin Misha COMPUTER SCIENCE & IT   -   Information Systems Auditing Process

What is the primary objective of an information systems audit?

The primary objective is to evaluate the adequacy and effectiveness of controls within information systems.
Tamoban Javnoi COMPUTER SCIENCE & IT   -   Data Structures & Algorithms

Which data structure is most suitable for implementing an LRU (Least Recently Used) cache?

An LRU (Least Recently Used) cache is most efficiently implemented using a combination of a HashMap and a Doubly Linked List. The HashMap provides O(1) access to cache entries, while the Doubly Linked List maintains the order of usage, allowing for quick updates to the most recently and least recently used elements.
Tamoban Javnoi COMPUTER SCIENCE & IT   -   Data Structures & Algorithms

Why is the space complexity of a recursive algorithm often higher than its iterative counterpart?

The space complexity of a recursive algorithm is often higher than its iterative counterpart because recursion requires additional stack space to store the state of each function call. Each recursive call adds a new frame to the call stack, which increases the overall space complexity.
Tamoban Javnoi COMPUTER SCIENCE & IT   -   Data Structures & Algorithms

Where is a heap data structure typically used?

A heap data structure is typically used to implement a priority queue. Heaps allow for efficient retrieval of the highest (or lowest) priority element and support operations like insertion and deletion in logarithmic time, making them ideal for priority queues.
Tamoban Javnoi COMPUTER SCIENCE & IT   -   Data Structures & Algorithms

When does the Dijkstra's algorithm fail to find the shortest path in a graph?

Dijkstra's algorithm fails to find the shortest path if the graph contains negative weight edges. The algorithm assumes that all edge weights are non-negative, and the presence of negative weights can lead to incorrect results and infinite loops.
Tamoban Javnoi COMPUTER SCIENCE & IT   -   Data Structures & Algorithms

What is the time complexity of inserting an element into a Binary Search Tree (BST) in the worst case?

In the worst case, a Binary Search Tree (BST) can become a skewed tree (like a linked list), where each node has only one child. In such a scenario, the time complexity of inserting an element becomes O(n), where n is the number of nodes in the tree.

COMPUTER SCIENCE & IT