Cs P2 common

Question 1

Examples of sorting algorithms

Answer 1

Bubble, merge, insertion sort

Question 2

Searching algorithms

Answer 2

linear, binary

Question 3

MOD and DIV

Answer 3

DIV // whole number
MOD % reminder

Question 4

File handling

Answer 4

myfile = open(“nameFile.txt” , “r”)
print(myfile,readlines())
myFile.close()

myfile = open(“asdf.txt” , “w”)
myfile.write(“asdfgrad”)
myfile.close()

myfile = open(“filename.txt” , “a”)
myfile.write(“dfsgsg”)
myfile.close()

Question 5

1D Arrays

Answer 5

Store multiple data values like list X[0] to call on the list
[“fdgdfgh” , “dfsdfgg” , “sdfsgyj”]
X.insert(1,”abcdefg”)

Question 6

Subprograms

Question 7

Translators

Question 8

High level low level

Question 9

IDE

Question 10

Bubble sort

Answer 10

Compare first two items in list and swap if not in same order do same for 2nd and 3rd and so on until reached end of list called on pass. Keep doing passes until a pass results in no swaps

Simple but inefficient for large lists

Question 11

Insertion sort

Answer 11

Compare second item to first item and insert it into the right order then look at 3rd item and insert it into right place and so on until you reach the last item

Question 12

Merge sort

Answer 12

uses facts that small lists are easier to sort and sorted lists are easier to merge

More efficient than insertion for larger lists
Same run time no matter complexity of list

Slower for short lists compared to others
Takes the same amount of time if the whole list is sorted

Question 13

What is casting

Answer 13

changing data type

Question 14

String manipulation

Answer 14

upper(x)
lower(x)
len(x)

Question 15

2D array

Answer 15

List of list [ [“pine” , “elm”] , [“asd” , “sdfa”] , [“asfl”, “lepd”]]

Call on them with X[0,1] being elm