ICS 3U/C2018-11-06T08:06:03+00:00

Introduction to Computer Science/Programming

Finding concepts in the text

NOTE: The PDF page references are the actual page numbers in the document, not the PDF page count number.

 

Topic Pages in PDF Pages in text
good programming style 69
commenting 97, 98 64
put statement 78, 83 49, 54
field size 83 53
math operations 60-62, 79-82 42-44, 50-53
randint statement 62 44
variables and get statement 88-94, 184-185 (10.4) 58-61, 123
loop structure 104-110 67-72
for structure 111-118 72-75
exit when statement 105-107, 119-120 68-70, 77-78
if statement 164-165 109-110
else & elsif 166-168 110-112
case construct 170-171 113-115
string length 192 127
catenation 193 128
substrings 194-196 129-130
index command 197-199 131
functions 276-283 181-184
procedures 283-288 185-190
File I/O 216-219 140-143
BONUS CONTENT
arrays 242-246 159-162
sorting an array 246-247 162
arrays in subprograms 300-302 195-202

As you read up about some of Turing’s functions, be sure to fill in your Skills Inventory sheet!

Resources

Course Specific

Supplementary

  • You can download other Turing resources from Turing page on the compsci.ca website.

PDF textbook exercises

Complete these exercises when you are done your other work. The bold ones are more challenging.

Chapter 4 (put, math operations): 4, 6, 7, 8, 10

Chapter 5 (variables): 1, 2, 4, 5, 6, 7, 11, 13, 14, 15

Chapter 6 (repetition): 1, 2, 3, 4, 5, 6a, 6b, 7, 8, 10, 11, 12, 13, 14, 15, 16

Chapter 9 (selection): 1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 15, 17

Chapter 11 (strings): 1, 2, 3, 6, 7

Chapter 12 (file I/O): 2, 6, 9, 10, 12, 13

Chapter 16 (subprograms): 1, 2, 5, 8, 9, 14, 16, 19

Chapter 14 (arrays): 2, 4, 7, 8, 13, 15, 16, 17

Chapter 17 (arrays): 1, 2, 3, 7, 8, 9

STBENEDICT.WCDSB.ca uses cookies to ensure you get the best experience on our website.
Learn more about Cookies