ITI 1121 Study Guide - Final Guide: Self-Balancing Binary Search Tree, Instance Variable, Doubly Linked List

• School: University of Ottawa
• Department: Information Technology
• Course: ITI 1121
• Professor: All

Document Summary

Ecole de science informatique et de g enie electrique. Instructors: opeyemi adesina, sherif aly, guy-vincent jourdan and marcel turcotte. Section: a or b or c or d. No part of this document may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise without prior written permission from the authors. Question 1 (15 marks: consider the class declaration below: c l a s s a extends b implements c { p u b l i c. Which ones of the following statements are valid, and which ones are invalid? (a) (b) (c) (d) (e) (f) A v a r = new b ( ) ; A v a r = new c ( ) ; B v a r = new a ( ) ; B v a r = new c ( ) ; C v a r = new a ( ) ;