Log in
Home1,900,000CA1,000,000

Syllabus for COMP 202 Giulia Alberini

8 views8 pages
redhorse12
19 Jan 2022
School
McGill University
Department
Computer Science (Sci)
Course
COMP 202
Professor
Giulia Alberini

For unlimited access to Class Notes, a Class+ subscription is required.

Do you feel this document is helpful?
jc123 and 40170 others unlocked
COMP 202 Full Course Notes
100
COMP 202 Full Course Notes
Verified Note
100 documents

Document Summary

Tas will be available for o ce hours, on the third oor of the trottier building, to help you with your assignments and answer questions about the course material. Ta"s o ce hours and e-mail address will be posted on mycourses. Post all your questions about the course (including assignments and the midterm/ nal) on the mycourses message boards so that everyone can see both the questions and the answers. You may freely answer other students" questions as well, with one important exception: you may not provide solution code (although you are permitted to provide one or two lines of code to illustrate a point). Of course, you can send e-mail to a teaching assistant or instructor directly for private matters. Students are expected to monitor both their mcgill e-mail account and mycourses for course- related news and information. Please read this document carefully and keep it for reference throughout the term.

Related Documents

COMP 202 Lecture Notes - Touchscreen, Java Syntax, Light Pen
greygnat7
Syllabus for ENGINEER 1P03 Elizabeth Hassan, Robert Fleisig
redhorse12
ECSE 200 Lecture Notes - Mesh Analysis, Electrical Engineering, Thrice
lilacfish589

Related Questions

Answer the following short questions. Your answer should be precise.

  1. Can we declare base class constructor or destructor as virtual if yes then why we want to do?
  2. How we can declare a class as abstract and why we need abstract classes?
  3. Why we cannot able to create objects of abstract classes give reasonable justification of that.   

This question is related to Object orientated programming in c++

Programming Writing Montreal Maps In the following questions, you will write classes that allow one to suggest a route to get from one point to another on a metro or train line. Note that for all of these questions, we will make the simplifying assumption that the earth is flat and that everything resides in 2 dimensions. (There were metros before Columbus and Galileo, right?) 6. Write a class MetroStation in which you define a new type MetroStation. (10 points) A MetroStation is defined to have the following private properties: • String name This represents the name of the metro station (e.g. Atwater, McGill, etc) • double xPosition This represents the x location of the metro station. • double y Position This represents the y location of the metro station. An MetroStation object should have the following public methods/behaviors defined on it. • A constructor that takes as input a String stationName, a double x, and a double y. The constructor should initialize the properties name, xPosition, and yPosition to these three values respectively • A method getName() which returns the name of the Metrostation. • A method get XPosition () which returns the x location of the Metrostation • A method get Position () which returns the y location of the Metrostation • A method equals (Metrostation other) which returns a boolean representing whether the name property of the this MetroStation is equal to the name property of other.

33. Base10 is the set of numbers created from the digits {0,1,2,3,4,5,6,7,8,9}. Whereas base2, which is the set of numbers created with {0,1}. We could similarly define base; as the ordered set of characters created from {X,Y,Z}. What is the following basez number, Yxz, in base ? Random graph For this section you will need to look at the classes Graph and GraphNode present in the appendix. A Graph consists of a number of nodes, each of which has connections to other nodes in the graph. You can think of nodes as a representation of a person in a social network (e.g. Facebook). The ArrayList connectedTo variable in GraphNodes is the list of friends that particular person has. For example, in the following graph, the node O is friends with node 1 and 2. On the other hand, node 2 and node 1 are not friends, hence the lack of link. 0-0 In the constructor of the Graph, the process of connecting nodes is randomized. Moreover, we will not allow a node to be connected to itself and we are going to assume that the arguments passed to the Graph constructor respect the following conditions: n > 2, and n > nbConnections. Pay close attention to the character order