For more exams
Email;
Western Governors University
Information Systems Security VUN1 Task
1, 2 & 3 Problem-Solving and Algorithmic
Analysis University Examination latest
updated exam questions and
answers(June 2026)
Name Student ID
Date Signature
How to use this exam
1 Set a timer. Practice under real exam conditions! No notes, no AI
assistance.
2 When finished, scan the QR code on the last page to submit and see
the correct answers with detailed explanations.
For more exams
Email;
,For more exams
Email;
3 Review your mistakes carefully and note down areas that need
improvement. Use Studocu AI to create targeted study materials like
quizzes, summaries, and study guides.
Section 40 total marks Multiple Choice
Select the most appropriate answer for each question. Each question is worth
2 marks.
Question 1 2 marks
What is the worst-case time complexity of the Binary Search algorithm when
applied to a sorted
Question 2 2
Which data structure follows the 'First-In, First-Out' (FIFO) marks
principle?
A Priority Queue
B Binary Search Tree
C Stack
D Queue
Question 3 2
marks
For more exams
Email;
, For more exams
Email;
In the context of Big O notation, which of the following growth rates is the
least efficient for large ?
Question 4
Which sorting algorithm is known for having a stable time
complexity in all cases (best, average, and worst)?
A Merge Sort
B Bubble Sort
C Selection Sort D Quick Sort
Question 5 2 marks
What is the primary requirement for a recursive function to prevent infinite
recursion?
A A loop counter
B A global variable
C A return type of void D A base case
Question 6 2 marks
In a Linked List, what is the time complexity of inserting a new element at
the beginning (head) of the list, assuming you have a pointer to the head?
For more exams
Email;
Email;
Western Governors University
Information Systems Security VUN1 Task
1, 2 & 3 Problem-Solving and Algorithmic
Analysis University Examination latest
updated exam questions and
answers(June 2026)
Name Student ID
Date Signature
How to use this exam
1 Set a timer. Practice under real exam conditions! No notes, no AI
assistance.
2 When finished, scan the QR code on the last page to submit and see
the correct answers with detailed explanations.
For more exams
Email;
,For more exams
Email;
3 Review your mistakes carefully and note down areas that need
improvement. Use Studocu AI to create targeted study materials like
quizzes, summaries, and study guides.
Section 40 total marks Multiple Choice
Select the most appropriate answer for each question. Each question is worth
2 marks.
Question 1 2 marks
What is the worst-case time complexity of the Binary Search algorithm when
applied to a sorted
Question 2 2
Which data structure follows the 'First-In, First-Out' (FIFO) marks
principle?
A Priority Queue
B Binary Search Tree
C Stack
D Queue
Question 3 2
marks
For more exams
Email;
, For more exams
Email;
In the context of Big O notation, which of the following growth rates is the
least efficient for large ?
Question 4
Which sorting algorithm is known for having a stable time
complexity in all cases (best, average, and worst)?
A Merge Sort
B Bubble Sort
C Selection Sort D Quick Sort
Question 5 2 marks
What is the primary requirement for a recursive function to prevent infinite
recursion?
A A loop counter
B A global variable
C A return type of void D A base case
Question 6 2 marks
In a Linked List, what is the time complexity of inserting a new element at
the beginning (head) of the list, assuming you have a pointer to the head?
For more exams
Email;
