Scribd
Upload
670 views4 pages

COMP9024 Data Structures and Algorithms: Sample

This document appears to be a sample final exam for a course on data structures and algorithms. It provides instructions for completing the exam, which consists of two parts: Part A contains 8 multiple choice questions worth a total of 12 marks, and Part B contains 10 questions worth a total of 88 marks, testing topics covered throughout the course. Sample multiple choice questions are provided at the end for students to review.

Uploaded by

Kiruthiga Prabakaran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
670 views4 pages

COMP9024 Data Structures and Algorithms: Sample

This document appears to be a sample final exam for a course on data structures and algorithms. It provides instructions for completing the exam, which consists of two parts: Part A contains 8 multiple choice questions worth a total of 12 marks, and Part B contains 10 questions worth a total of 88 marks, testing topics covered throughout the course. Sample multiple choice questions are provided at the end for students to review.

Uploaded by

Kiruthiga Prabakaran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Name: ______________________________

Student ID: __________________________

Signature: __________________________

The University of New South Wales


Session 2, 2012

Sample Final Examination

COMP9024
Data Structures and Algorithms

 Time allowed: Three Hours


 Reading time: 10 minutes
 Number of Questions: 8 questions in Part-A, and 10 questions in Part-B
 Total number of marks: 100
 Answer All Questions (using the space provided on this pink question paper)
 Questions are not worth equal marks
 No examination materials permitted
 Calculators may not be used
 This paper may not be retained by the candidate.

Answers must be written in ink. Except where they are


expressly required, pencils may be used only for drawing,
sketching or graphical work.

Page 1 of 4

:::::::::::::::: Part‐A: Multiple Choice Questions (12 marks) ::::::::::::::::
 
There  are  eight  multiple  choice  questions  in  this  section.  Each  question  in  this  section  is 
worth 1.5 marks. There is no additional penalty for answering a question incorrectly. Each 
question  has  one  possible  answer.  Please  select  the  most  suitable  answer.  
 
Please  put  a  tick  (  √ )  next  to  the  correct  answer.  In  case  you  change  your  mind,  please 
clearly erase (cross‐out) the previous answer(s).  
 
A question with more than one tick and/or an ambiguous tick will result in zero mark.  
 
 Multiple choice questions are based on all the topics covered in the course  
(Week‐1 to 13) 
 
 See “Sample Multiple Choice Questions” at the end of this document. 

::::::::::::::::::::::::::::::::::::::::::: Part‐B (88 marks) ::::::::::::::::::::::::::::::::::
 

Q1 (10 marks)
Questions based on the following (and other related) topics: 
 Conceptual questions on Trees (ALL types of trees) 

Q2 (6 marks)
Questions based on the following (and other related) topics:
 Priority Queues and Heaps (lecture notes and exercises)

Q3 (6 marks)
Questions based on the following (and other related) topics:
 AVL Trees (lecture notes and exercises)
 
 
Q4 (6 marks)
Questions based on the following (and other related) topics:
 B Trees (lecture notes and exercises)

Page 2 of 4
Q5 (10 marks)
Questions based on the following (and other related) topics:
 Select the most suitable ADT,
 Sorting

Q6 (10 marks)
Questions based on the following (and other related) topics:
 Graph (a question based on Week-9_10 Exercises)

 
Q7 (10 marks)
Questions based on the following (and other related) topics:
 Pattern Matching/Text Processing (a question based on Week-13 exercises)
 

Q8 (10 marks) (Nominated question for ass2)


Questions based on the following (and other related) topics:
 Ass-2

Q9 (8 marks)
Questions based on the following (and other related) topics:
 Sorting (lecture notes and exercises)

Q10 (12 marks)


Questions based on the following (and other related) topics:
 Graphs (lecture notes and exercises)
 
 

--- end ---

Page 3 of 4
Sample Multiple Choice Questions
 Multiple choice questions are based on all the topics covered in the course  
(Week‐1 to 13) 
 
 
M1:   If, in a given computing environment, data moves are very expensive and comparisons 
are cheap, which sorting method is likely to be best for a medium‐large file? 
 

A) selection 
B) heap 
C) insertion 
D) merge 
E) quick 
 
M2:   A  certain  quadratic  time  algorithm  uses  500  elementary  operations  to  process  an 
input of size 10. What is the most likely number of elementary operations it will use if 
given an input of size 1000? 
 

A) 40 
B) 500 
C) 50000 
D) 1000000 
E) 5000000 

M3:   When the entries 7, 4, 6, 1, 2, 3, 8, 5 are successively inserted into an initially empty 
binary search tree, what is the height of the resulting tree? 
 

A) 4  
B) 3 
C) 7 
D) 2 
E) 1 

M4:   For a graph ADT, which one of the following is true? 
 

A) A simple path is a circular sequence of alternating vertices and edges. 
B) A simple path must contain all the vertices of the graph. 
C) In a DFS algorithm, each edge is labelled once only.  
D) In a DFS algorithm, each vertex is labelled once only. 
E) In a DFS algorithm, each edge is labelled twice. 

………..
………..
………..
………..

:: End ::

Page 4 of 4

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy