CSEC Serious
CSEC Fun
App/Web Dev HTML
App/Web Dev CSS
Miscellaneous
100
When you assign a value to a variable, you are ____ the variable.
initializing
100
Print “Hello, World!” on your computer. (Code it right now! 1 minute time limit)
...
100
This tag is used to create a link in HTML
<a>
100
How do you reference HTML tags in CSS?
id or class
100
How many CS courses are offered by Markville?
5
200
How do you declare a 1 dimensional integer array of size N in Java?
int[] arrayName = new int[N];
200
What are the 2 colours used in the syntax highlighting of the Eclipse IDE light theme?
Blue and purple
200
The attribute in the <img> tag for alternative text is called:
alt
200
How do you link a CSS file?
<link rel=’stylesheet’ href=’style.css’> in <head> tag
200
What is Ms Wong's real age?
43…………. erm I mean 25!
300
boolean b = ( 5 != 5 || (1-0)>(0-1) && !('a' == 65 && !!("b".equals('b'))));
what is b?
true
300
What is the name of CSEC on Google Maps?
Markville Computer Science Education Institute
300
How might you center a div within a div?
Depends
300
Nav bar
300
Which alumni from Markville Secondary School has the youtube channel with the most subscribers?
Jason Chan (119k subs)
400
The underlying data structures used in the c++ std::set and std::unordered_set.
red-black tree and hash table
400
Solve a 5 point problem on DMOJ (First person to finish, cannot solve something already attempted before)
DO IT
400
What is the importance of using media queries?
allow for responsive web design
allow for different styles on different screen sizes/ devices.
400
What flex properties are default when you use display: flex and apply it to a container?
flex-direction: row → places elements out horizontally
400
What is the maximum number of parts you can divide a 3D candy cane into with 3 straight continuous cuts? (no moving around the pieces)
12
500
Each circle marks a town Santa needs to visit. Each line represents a road between the towns of a certain length. What is the length of the shortest path Santa could take such that all the towns will be visited at least once.
Ans: Path: 0-5-1-4-6-4-3-2, Dist: 16
500
State the time complexity of the following algorithm:
O(1) because APPARENTLY Ms. Wong never lies, so the algorithm never enters the loop…..
Fun fact, this was a question on our test XD
500
Name 15 HTML tags
Verify responses
500
What does this code do?
Full marks: Draw a simple diagram
Bonus 250 points: explain that the page also opens a print menu
500
How many holes does a hollow ball have?
0