# Class Notes for Computer Science at MacEwan University (MACEWAN)

MACEWANCMPT-101Nesrine AbbasWinter

## CMPT-101 Lecture Notes - Lecture 16: Data Segment, Pseudocode

OC7732112 Page
54
#this will check to see if count is greater than 1. If it is, it will subtract 1 from and print the count. #this will output the larger of the two numb
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT-101 Lecture Notes - Lecture 1: The Algorithm

OC7732112 Page
28
An algorithm is a step-by-step process that will result in a desired outcome. We get steps and the necessary input in order to resolve the issue by fol
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT 101 Lecture 10: More Repetition

OC7732111 Page
16
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT 101 Lecture 7: Decision Making

OC7732111 Page
20
Computers can make decisions based off of conditions. Note: copy/paste the following directly into wingide for a functioning program. #the first step i
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT-101 Lecture Notes - Lecture 9: Negative Number, Prime Number

OC7732113 Page
23
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT 101 Lecture 5: Functions and Characters

OC7732112 Page
36
Adding t after a backslash in a statement adds a tab space. Adding n after a backslash in a statement adds a new line. Print is the command in python u
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT 101 Lecture 11: Indexes

OC7732111 Page
30
#you can find letters in a message or sequence of letters by the index. #for example, try the following in the shell: #however, e and o are also in hel
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT 101 Lecture 13: Sorting Lists

OC7732111 Page
43
#find the largest. def find_largest (nums, n): largest = nums[0] position = 0 for i in range (1,n): if nums[i] > largest: largest = nums position = i r
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT-101 Lecture Notes - Lecture 3: Decimal Mark

OC7732111 Page
34
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT-101 Lecture Notes - Lecture 14: Computer Memory, Capacitor, Or Gate

OC7732112 Page
34
In order to do anything, computers need millions and billions of bytes. In python, the statement 5+3 is solved by converting 5 and 3 into binary, and t
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT 101 Lecture 12: Lists

OC7732111 Page
31
View Document
MACEWANCMPT-101Nesrine AbbasWinter

## CMPT-101 Lecture Notes - Lecture 8: Kilowatt Hour, Dollar Sign

OC7732111 Page
23
View Document
Showing 1 — 12 of 26 result

## Popular Courses

View all courses (40+)

## Popular Professors

View all professors (4+)

Class Notes (1,000,000)
CA (610,000)
MacEwan (1,000)
Computer Science (20)