• 3.1 ~ What does it mean to provide a variable declaration?
• 3.1 ~ Is it necessary to declare variables before any other steps are done in a problem?
• 3.1 ~ If a variable has been declared, but not assigned anything yet, will the program have problems if it is used in a comparison?
• 3.1 ~ Does Boolean mean only TRUE/FALSE?
• 3.2 ~ If one wanted to use a character in an algorithm, would one have to put it in single quotes?
• 3.2 ~ Is it possible to compare or assign strings to characters? What if the string is only one letter?
• 3.2 - 3.3 ~ When using characters and strings, is it necessary to put them in any sort of quotation marks?
• 3.3 ~ If a string is declared, can a character be assigned to it?
• 3.3 ~ Is the value "1-23-444" a valid data type of num? Or would that be considered a string?

• 4.1 ~ Does the order of code in the main algorithm matter?
• 4.2 ~ Is it ok to do math to variables that you want to print out?
• 4.2 ~ What do the commands DIV and MOD do?
• 4.3 ~ Is it allowable to do arithmetic in print statements?
• 4.3 ~ Can a record be printed directly, that is can I print an entire record in one statement?
• 4.3 ~ In pseudocode, is there a command for a newline? Or can we just assume there is a return after each separate print statement?
• 4.4.1 ~ Can chars be compared like numbers and strings? ex:'a'<'b' ; 'b'='b'
• 4.4.1 ~ Can I compare strings with an equal sign?
• 4.4.1 ~ Can a string be compared using inequalities? For example is "ab" > "a" ?
• 4.4.1 ~ If an if(NOT(some=someother))is used, is a boolean necessary anywhere? Are two sets of parenthesis needed as above or can it be written as if(NOT some=someother)?
• 4.4.1 ~ What is the purpose of NOT? Why should it be used?
• 4.4.2 ~ Can I compare a String variable to a Character variable?
• 4.4.2 ~ Can I compare two functions?? like F1(a)=F2(b)
• 4.4.2 ~ When a boolean operator is used, is it ok to use a comma to say that one number is greater than the others?
• 4.4.2 ~ If one writes something like (A > B, C), where A, B and C are numbers in an algorithm, does it read that as (A>B) and (A>C)?
• 4.4.3 ~ Does an elseif require its own endif?
• 4.4.3 ~ Can more than one action be performed in a conditional, once the condition is met?
• 4.4.3 ~ What can I say if I don't want the program to do anything after the "then" statement?
• 4.4.3 ~ Can I have a conditional statement inside of another conditional statement?
• 4.5 ~ What does a sample algorithm look like?

• 5 ~ If MAX is a constant declared in the main algorithm, then can it be used in any of the modules without declaring it?
• 5 ~ Are constants global?
• 5 ~ When you declare a constant, can it be a String?
• 5 ~ When declaring constants consisting of numbers and symbols, such as the social security number, is it necessary to quote it in any way so that mathematical functions aren't performed on the numbers?
• 5 ~ Do we have to declare constants? For example: If I want to divide something by 3...do I have to declare 3 as a constant?
• 5 ~ When should something be a constant instead of a variable?
• 5 ~ Why is it necessary to comment?
• 5 ~ Is it necessary to make a separate procedure to print out a menu?
• 5 ~ If I wanted to make sure the counter starts at zero, can I just list that as a precondition and assume it's taken care of? Or would I have to actually write it in the module somewhere?
• 5 ~ What are preconditions and how are they used?

• 6.1 ~ What is a module and when should I use them?
• 6.2 ~ What is the calling module?
• 6.2 ~ What is a parameter?
• 6.2 ~ Are out parameters considered to be zero before any value is assigned to them? Or does a value have to be specified before you can do something with it?
• 6.2 ~ What is the interaction between the formal and actual parameters? Are they the same thing or something different? Do the names of the variables just change names when passes in essentially?
• 6.2 ~ If I declare my variable for the character-to-be-read locally inside my module, what happens to it each time the module is called again? Will it effectively erase and re-create the variable place to be used to read the next character, or will it screw up?
• 6.2 ~ When should I choose to use a procedure rather than a function?
• 6.2 ~ When do I use "in", "out" and "in/out" parameters?
• 6.2 ~ Are variables local to a module or are they global to everything?
• 6.2 ~ Can a module be declared with no parameters?
• 6.2 ~ Can variables be declared in the formal parameter list and not be in the actual parameter list?
• 6.2 ~ If the formal and actual parameter are called the same thing, are they different variables or are they the same?
• 6.2 ~ Is there a difference between the "returnsa" statement and the use of an out parameter? Are they interchangeable?
• 6.2 ~ What are the pre- and post- conditions?
• 6.3 ~ Can you end a procedure inside of an if/then statement
• 6.3 ~ Can procedures be printed like functions can?
• 6.3, 6.4 ~ What is meant by a "module header"?
• 6.3, 6.4 ~ When a question says that a module "returns a value", am I supposed to take that as meaning that a parameter is passed out or could it mean that the value is somehow returned to the calling module (i.e. a funct ion resolving to the needed value)?
• 6.3, 6.4 ~ Where do you declare modules, inside or outside the algorithm?
• 6.3, 6.4, 6.5, 6.6 ~ How do I declare and use modules in an algorithm?
• 6.4 ~ Can a Function have an "out" parameter in it?
• 6.4 ~ Can a function be printed directly?
• 6.4 ~ Can a function have more than one "in" parameter?
• 6.4 ~ If I have a function returns statement (in an if statement) in the middle of a loop and the condition becomes true, will the function just return the value and forget about everything else inside the code or would that cause some kind of problem?
• 6.4 ~ If I change the value of a variable within a function and then return the variable will I be changing the outside world? In essence what I'm saying is can I change return a variable if I changed the value of it?
• 6.4 ~ Can an arithmetic statement be returned from a function?
• 6.4 ~ Can a function return an entire array, or just one array element?
• 6.4 ~ Does a function have to return something?
• 6.4 ~ Can a function call another function?
• 6.4 ~ Can we call a function to execute without assigning it value to anything?
• 6.4 ~ Can a function receive several values even though it only resolves to one single value?
• 6.4 ~ Can in parameters of a function be modified?
• 6.4 ~ Can a function have a pointer as a parameter?
• 6.5 ~ How is a procedure and function called from the algorithm or another calling module? Is it necessary to assign a procedure to a variable?
• 6.5 ~ Can a function call a procedure?
• 6.5 ~ What's the difference between a module, which takes in three numbers and a module is passed three numbers?
• 6.5 ~ What does it mean to return something to the calling algorithm or module?
• 6.6 ~ How do I trace my algorithm to make sure that it works right?
• 6.7 ~ Can recursion be used for something other than mathematical operations? If so, then how can do we use it?
• 6.7 ~ When doing recursion, is it ok to add or subtract to a variable in the procedure being re-called?
• 6.7 ~ In a procedure, if you run that same procedure but then have another command below where you recall that procedure does it finish the procedure before running the command below it?
• 6.7 ~ What is recursion? At least not from a computer science point of view.
• 6.7 ~ How do I keep track of the number of times my procedure has called itself?
• 6.7 ~ I understand recursion but only with numbers, what about other cases?
• 6.7 ~ Is it ok to use recursion and iteration in the same problem?
• 6.7 ~ Can I say something like: My_function returns My_function (something)?

• 7.2 ~ When you define your own data type, let's say it's called My_Type and it has a few fields in it, can you assign a My_Type to a My_Type? Or must you write a separate function to do this . . . to assign each field?
• 7.2 ~ Do we have to fill in the records with information or can we assume that the records are already filled with information?
• 7.2 ~ How is a record declared?
• 7.2 ~ Can we assign a record equal to another record?
• 7.2 ~ What is a type declaration? Does this just mean a record?
• 7.2 ~ How are the different fields of a record printed out?
• 7.2 ~ What is meant by good abstraction with records?
• 7.5 ~ Are pointers an atomic datatype and what can of value can they hold?
• 7.5 ~ Does the pointer to the new list point to anything when we get it, or does it point to NIL?
• 7.5 ~ Can you assume that it is pointing to the beginning of the linked list?
• 7.5 ~ How is a pointer declared?
• 7.5 ~ Is modifying pointers considered changing the outside world?
• 7.6.1 ~ How do we remember the front of the list when adding to a linked list?
• 7.6.1 ~ What does it mean by passing a pointer to the head of the list?
• 7.6.1 ~ What exactly is a "linked list of numbers?"
• 7.6.1 ~ When dealing with linked lists, can we assume a list will always be there?
• 7.6.1 ~ When doing recursion on a linked list of type "in/out", why do we not lose the head of the list?
• 7.6.1 ~ When declaring a record to hold linked lists are the words List_Node, data and next always used or do we make up our own words to use?
• 7.6.1 ~ How do you add to a list by a particular field in the data record?
• 7.6.1 ~ How does one go about deleting a node from a linked list?
• 7.6.2 ~ What is a queue?
• 7.6.3 ~ What is the difference between sequential and nested loops?
• 7.6.3 ~ Can there be more than one test in the exitif condition?
• 7.6.3 ~ Can we do If(Array[1, 1..Max] = value)then?
• 7.6.3 ~ Can a loop function have 2 exitifs???
• 7.6.3 ~ Would arrays or link list be better for modeling stacks and queues?
• 7.6.3 ~ When using arrays, is it better to use recursion or iteration?
• 7.6.4 ~ Should a binary search tree root be passed to a procedure as an in/out like linked lists or just an in since it won't be changing?
• 7.6.4 ~ What is a leaf?
• 7.7.1 ~ Does declaring an array mean defining it and also declaring a variable to be of this data type?

• 8.3.3 ~ What is the "smart" bubble sort? How is it coded?
• 8.6 ~ Can a node be visited more than once?
• 8.6 ~ When it says to pick the shortest edge, that means the actual outer edge right?
• 8.6 ~ When doing the MST, do all the points have to connect in a continuous order? What I mean is, if there was a person on A, would they have to be able to walk totally through the path of the MST touching every point, or a re you allowed to jump around as long as every point is connected to another point?
• 8.6 ~ What is the purpose of a MST?
• 8.6 ~ Does the MST have to be one continuous line or can you have branches?
• 8.6 ~ What are in-order, pre-order and post-order traversals?
• 8.6 ~ What is a minimal spanning tree? Does each node have to be connected to every other node in the graph?

• 10.3.1 ~ What do the N and P stand for, are they constants?
• 10.3.2 ~ When searching for a value in a Link List, and the problem does not say the list is sorted, is the work used to find the value the same as actually deleting the value, or is there a special Big-Oh for the actual deleting of the value?
• 10.3.2 ~ When traversing a Linked List to find a value, does the way it is sorted matter?
• 10.3.2 ~ When dealing with arrays, are all big-oh's the same regardless of sorts or even/odd number of elements?
• 10.3.3 ~ Is it possible to have a Big Oh of O(2), or is there only O(1), O(N), and so forth?

Last modified: by CS1311-WWW