2023 Victorian Certificate of Education Algorithmics (HESS) Examination - Section A Multiple-choice Questions

Sep 20, 2026

Victorian Certificate of Education 2023 Algorithmics (HESS) written examination with reading and writing schedules, question-and-answer book structure, and exam room instructions. The document specifies permitted and prohibited materials, student numbering and sign-off requirements, and the procedure for submitting the multiple-choice answer sheet. Section A contains multiple-choice questions covering algorithm theory and graph methods, including stack operation signatures, directed acyclic graphs, decision tree non-leaf meanings, depth-first search order, shortest/lowest-cost edge selection, and related problem-solving prompts.

LanguageEnglish

CategoryExam

FormatPDF

Pages32

Reading Time1 h 21 min

AccessFree to download

Structure of book

Materials and instructions

Section A – Multiple-choice questions

Question 1 to Question 11

Victorian Certificate of Education 2023 SUPERVISOR TO ATTACH PROCESSING LABEL HERE STUDENT NUMBER | | | | --- | --- | | | | | | --- | --- | --- | | | | | | --- | --- | --- | ALGORITHMICS (HESS) Written examination Wednesday 15 November 2023 Reading time: 3.00 pm to 3.15 pm (15 minutes) Writing time: 3.15 pm to 5.15 pm (2 hours) QUESTION AND ANSWER BOOK Structure of book | Section | Number of
questions | Number of questions to be answered | Number of
marks | | --- | --- | --- | --- | | A | 20 | 20 | 20 | | B | 10 | 10 | 80
Total 100 | • Students are permitted to bring into the examination room: pens, pencils, highlighters, erasers, sharpeners, rulers and one scientific calculator. • Students are NOT permitted to bring into the examination room: blank sheets of paper and/or correction fluid/tape. Materials supplied • Question and answer book of 29 pages • Answer sheet for multiple-choice questions Instructions • Write your student number in the space provided above on this page. • Check that your name and student number as printed on your answer sheet for multiple-choice questions are correct, and sign your name in the space provided to verify this. • All written responses must be in English. At the end of the examination • Place the answer sheet for multiple-choice questions inside the front cover of this book. Students are NOT permitted to bring mobile phones and/or any other unauthorised electronic devices into the examination room. © VICTORIAN CURRICULUM AND ASSESSMENT AUTHORITY 2023 2023 ALGORITHMICS EXAM 2 SECTION A–Multiple-choice questions | Instructions for Section A
Answer all questions in pencil on the answer sheet provided for multiple-choice questions. Choose the response that is correct or that best answers the question.
A correct answer scores 1; an incorrect answer scores 0.
Marks will not be deducted for incorrect answers.
No marks will be given if more than one answer is completed for any question.
Use the Master Theorem to solve recurrence relations of the form shown below. | | | | --- | --- | --- | | 􀀗 􀀞n 􀀛 T (n) 􀀖􀀕 aT 􀀝􀀜 b 􀀚􀀙 􀀘 knc
􀀕􀀔 d
and its solution T (n) | if n 􀀓 1
if n 1
􀀜 O (nc )􀀚
􀀛 O (nc log n)􀀚􀀙 O (nlog ba ) | where a > 0, b > 1, c ≥ 0, d ≥ 0, k > 0
if a 􀀞 bc
if a bc
if a 􀀝 bc | Question 1 Which one of the following is the signature specification for the ‘push’ operation of a stack? A. stack → stack B. stack → element C. element × stack → stack D. element × stack → element Question 2 Which one of the following graphs is a directed acyclic graph? A. B. C. D. SECTION A – continued d o n o t w r i t e i n t h i s area do not w r i t e i n t h i s area 3 2023 ALGORITHMICS EXAM Question 3 What do the non-leaf nodes in a decision tree represent? A. the different answer options to decision questions B. the results of the problem C. the decision questions D. the distance from the root node Question 4 Consider the following graph. Depth-first search is run on the graph, starting at node A. The order in which the nodes are traversed could be: A. A, B, C, D, E, F B. A, B, C, D, F, E C. A, B, D, C, E, F D. A, B, D, C, F, E Question 5 Which one of the following graph algorithms repeatedly selects the lowest-cost edge that connects out from a connected component of nodes? A. the Bellman-Ford algorithm B. Dijkstra’s algorithm C. the Floyd-Warshall algorithm D. Prim’s algorithm SECTION A – continued TURN OVER 2023 ALGORITHMICS EXAM 4 Question 6 Consider the following algorithm. Algorithm graph_sum(G, u, total): Mark u as visited If there are no unvisited nodes adjacent to u Do Return total Select v as an unvisited node adjacent to u connected by the most expensive edge Return graph_sum(G, v, total + cost(u,v)) What is the value returned by the graph_sum algorithm when executed on the graph, G, shown below with u

FAQs

What materials are students allowed to bring into the exam room?

Students may bring pens, pencils, highlighters, erasers, sharpeners, rulers and one scientific calculator.

What must students do before starting written responses?

Students must write their student number in the space provided, confirm their name and student number on the multiple-choice answer sheet, and sign their name to verify it.

Which algorithmic topic does Section A Multiple-choice Questions cover?

Section A includes questions on core algorithmics concepts such as stack operation signatures, graph traversal and graph properties, decision trees, and algorithmic methods like shortest-edge selection and dynamic programming.

Sep 20, 2026

Uploaded by eBook King