Académique Documents
Professionnel Documents
Culture Documents
1.12. The last step in problem solving is to evaluate the solution. This means:
a. To check if the knowledge base for errors.
b. To check if the set of step by step instructions developed in step 5, list instructions that enable you to
solve the problem, solve the problem identified in step 1.
c. To check is the solution solves a problem.
d. To test for understanding of the identified problem.
Answer: B
1.13. An algorithm is:
a. A solution that can not be reached through a set of step by step instructions.
b. The results of the problem.
c. The set of step by step instructions to solve the problem.
d. The knowledge base of a solution.
Answer: C
1.14. Step 4 is to select the best way to solve the problem. This means:
a. To weed out unacceptable solutions.
b. To specify pros and cons of each valid solution.
c. Select one solution after weighing the pros and cons.
d. All of the above.
Answer: D
1.15. A problem that requires a heuristic solution might be:
a. Balancing your checkbook.
b. Choosing stock on the stock market.
c. A calculus problem.
d. Baking a cake.
Answer: B
1.16 The solution to a problem is
a. The set of step-by-step instructions to solve the problem.
b. The program
c. The results.
d. All of the above.
Answer: A
1.17. After you have identified alternative solutions
a. You are ready to evaluate the solution(s).
b. You are ready to select the best solution.
c. You are ready to write the algorithm.
d. You are ready to identify the knowledge base.
Answer: B
1.18. To select the best solution, you should
a. Identify and list the pros and cons of each alternative solution.
b. Develop an algorithm for each solution.
c. Develop the knowledge base for each solution.
d. Identify the problem.
Answer: A
1.19. To create a set of instructions to make Otto walk in a figure other than a square, the following
instruction(s) would need to be added to the instruction set:
a. Turn 1 degree, turn is always right.
b. Turn x degrees, where x is a given number of degrees in an angle, turn is always right.
c. Turn x degrees, where x is a given number of degrees in an angle, turn is always left.
d. Any of the above.
Answer: D
1.20. A set of step-by-step instructions is processed:
a. In the order they are presented and processed.
b. Can skip around to other instructions.
c. Can return to a previously processed instruction.
d. In random order.
Answer: A
1.21. The set of step-by-step instructions written for the solution to a problem must:
a. Be within the knowledge base of the problem.
b. Can use any instruction, regardless of the user or the machine.
c. Does not have to be in order of processing.
d. All of the above.
Answer: A
1.22. To identify the best alternative solutions you should:
a. Use other peoples ideas as well as your own.
b. Use only your own ideas.
c. Use any solution, no matter how unacceptable it is.
d. Identify only the first few that you think about.
Answer: A
1.23. When writing a set of instructions for the computer:
a. The instructions must be in proper order.
b. The instructions must be complete.
c. The instructions assume the computer knows nothing.
d. All of the above.
Answer: D
1.24. A problem that would require an algorithmic solution is:
a. Playing a game of chess.
b. Making a cup of cocoa.
c. Deciding which stock to buy.
d. All of the above.
Answer: B
1.25. Computers can best deal with problems that require:
a. Large amounts of calculations.
b. Reasoning.
c. Trial and error.
d. All of the above.
Answer: A
2.13. In the following expression, what is the order of execution of the operators and the result, given A = 4,
B = 5, E = 3, G = True, F = True?
A * B + 7 > E ^ 3 OR NOT G AND F
a. *, +, >, ^, NOT, AND : Result is True
b. AND, NOT, >, ^, *, +, : Result is False
c. ^, *, +, >, NOT, AND, OR : Result is True
d. ^, *, +, >, NOT, AND, OR : Result is False
Answer: C
2.14. Evaluate the following equation for R, given A = 4, B = 5, C = 8 is:
R = A + B * 2 (C + 4) / A
a. 11
b. 10
c. 12
d. 15
Answer: A
2.15. In the equation: R = A + B * 2 (C + 4) / A, the operands are:
a. +, *, -, /
b. A, B, C
c. R
d. =
Answer: B
2.16. An ideal variable name for a client name is:
a. C
b. Cli
c. Client_name
d. CN
Answer: c
2.17. The concatenation of 4 and 10 is:
a. 410.
b. 410
c. 40.
d. 40.
Answer: B
2.18. The data type of a parameter may be:
a. a constant.
b. a variable.
c. an expression.
d. all of the above.
Answer: D
2.19. In the expression 4 + 10, the operand(s)
a. are the 4 and the 10.
b. is the +.
c. is 14.
d. none of the above.
Answer: A
10
11
4.20. The variable names in the formal and actual parameter listings:
a. Must be the same.
b. May be the same.
c. Cannot be the same.
d. Only the call-by-value names must be the same.
Answer: B
4.21. The sequential logic structure:
a. Processes instructions in order of listing.
b. Allows the computer to make a choice of two paths to follow.
c. Allows the computer to repeat instructions.
d. Allows the computer to make a choice of two or more paths to follow.
Answer: A
4.22. The decision logic structure:
a. Processes instructions in order of listing.
b. Allows the computer to make a choice of two paths to follow.
c. Allows the computer to repeat instructions.
d. Allows the computer to make a choice of two or more paths to follow.
Answer: B
4.23. The loop logic structure:
a. Processes instructions in order of listing.
b. Allows the computer to make a choice of two paths to follow.
c. Allows the computer to repeat instructions.
d. Allows the computer to make a choice of two or more paths to follow.
Answer: C
4.24. The case logic structure within the decision logic structure:
a. Processes instructions in order of listing.
b. Allows the computer to make a choice of two paths to follow.
c. Allows the computer to repeat instructions.
d. Allows the computer to make a choice of two or more paths to follow.
Answer: D
4.25. The values of local variables:
a. Are defined within a module.
b. Are defined within the calling module.
c. Can only be changed within the module.
d. Are available to any called module.
Answer: A
12
13
14
15
16
Multiple Choice:
6.15. A single decision logic structure:
a. Allows the computer to choose from two paths of execution according to a specified condition.
b. Predetermines a path the computer needs to take for all sets of data.
c. Allows the computer to choose from two or more paths of execution according to specified conditions.
d. All of the above.
Answer: A
6.16. Using the decision straight through logic structure for multiple decisions:
a. Has the true proceeding to the next instruction and the false executing an action.
b. Has the true proceeding to another IF/THEN/ELSE instruction and the false executing an action.
c. Has the false proceeding to the next instruction and the true executing an action.
d. None of the above.
Answer: C
6.17. The use of positive logic or negative logic:
a. Has either the true or the false proceeding to another IF/THEN/ELSE instruction.
b. Has either the true of the false proceeding to execute an action and then proceed to the next instruction.
c. With the exception of the last nested IF/THEN/ELSE instruction does not allow both the true and the
false to execute an action.
d. All of the above.
Answer: D
6.18. A decision table consists of:
a. The conditions and the actions.
b. The conditions and the consequences.
c. The conditions, the combinations of T/F for the conditions, and the consequences.
d. None of the above.
Answer: C
6.19. The types of nested IF/THEN/ELSE instructions are:
a. Positive and negative logic structure.
b. Straight through logic structure.
c. Positive logic structure , negative logic structure, and a logic structure that has actions or other
IF/THEN/ELSE instructions on both the true and false parts of the instruction.
d. Positive, negative, and straight through logic.
Answer: C
6.20. The ELSE part of the IF/THEN/ELSE instruction:
a. Is optional.
b. Contains the false instruction.
c. Must be used in nested IF/THEN/ELSE instructions.
d. All of the above.
e. b and c.
Answer: D
6.21. Straight-through logic:
a. Does not use the ELSE.
b. Is used when the conditions in the IF/THEN/ELSE instructions are unrelated.
c. Is using sequential logic structure to execute the decision instructions.
d. All of the above.
e. a and b.
Answer: D
17
6.22. The indented algorithm of a positive logic nested IF/THEN/ELSE looks like:
a. A sideways V on the left side.
b. A straight vertical line on the left side.
c. A diagonal line on the left side.
d. None of the above.
Answer: C
6.23. The indented algorithm of a negative logic nested IF/THEN/ELSE looks like:
a. A sideways V on the left side.
b. A straight vertical line on the left side.
c. A diagonal line on the left side.
d. None of the above.
Answer: A
6.24. The indented algorithm of straight through multiple IF/THEN/ELSE instructions looks like:
a. A sideways V on the left side.
b. A straight vertical line on the left side.
c. A diagonal line on the left side.
d. None of the above.
Answer: B
6.25. The false statements are always executed using:
a. Straight-through logic.
b. Positive logic.
c. Negative logic.
d. None of the above.
Answer: D
6.26. To decide which decision logic to use when using multiple IF/THEN/ELSE instructions, you should:
a. Consider which type is the easiest for you to develop.
b. Consider which type is the most readable and machine efficient.
c. Consider which type is the easiest to maintain.
d. All of the above.
e. a and c.
f. b and c.
Answer: F
6.27. Decision tables:
a. Are used for developing company policies to include in a solution.
b. Are used for the developer to communicate the solution to the client.
c. Are rarely used.
d. All of the above.
e. a and b.
f. b and c.
Answer: E
6.28. The diamond is used in the flowchart to indicate the decision logic structure. The flowlines from the
diamond:
a. Indicates the entrance on the top, the exit on the bottom, and the true and false from the sides.
b. Indicates the entrance on the top and the true and false from the sides.
c. May flow to or from the diamond from any of the corners.
d. Only use the sides and not the corners of the diamond.
Answer: C
18
6.29. When using positive or negative logic, when there are no true statements:
a. The THEN part may be excluded.
b. The positive and negative logic are reversed so there will be true statements.
c. A Continue statement is used to preserve the THEN part.
d. All of the above.
e. b and c.
f. a and b.
Answer: E
6.30. A good application for the case structure is
a. Medical deductions
b. Payroll calculations
c. Changing a specific character to a specific numeric value
d. All of the above
Answer: d
6.31. The case logic structure algorithm:
a. Starts with an IF and ends with an IF/END.
b. Starts with a CASE OF VARIABLE and ends with the OTHERWISE.
c. Starts with a CASE OF VARIABLE and ends with an END-OF-CASE.
d. None of the above.
Answer: C
6.32. Case logic structure may be used to:
a. Indicate a specific set of instructions to be used.
b. Indicate only one instruction for multiple values of a variable.
c. Indicate a specific value for a variable.
d. a and d
e. None of the above.
Answer: D
6.33. Case logic structure is a type of:
a. Sequential logic structure
b. Decision logic structure
c. Loop logic structure..
d. None of the above.
Answer: B
6.34. The data type of the constants:
a. May be numeric, string, or character.
b. Must be the same data type as the variable.
c. Must all be the same data type in one case logic structure.
d. All of the above.
e. a and b.
f. b and c.
Answer: D
19
20
21
22
7.25. Recursion:
a. Is a special form of a loop.
b. Is a function that calls itself.
c. Must have a way to halt the calling of the module.
d. All of the above.
e. None of the above.
f. b and c.
Answer: D
23
24
25
26
9.13. Use the selection exchange method to show the first pass of the following array:
27
Element
Values
1
15
2
23
3
17
4
12
5
65
a. 12, 17, 23, 15, 65
b. 12, 23, 17, 15, 65
c. 15, 17, 12, 23, 65
d. 17, 15, 12, 23, 65
Answer: B
9.14. Use the bubble sort method to show the first pass of the following array:
Element
Values
1
15
2
23
3
17
4
12
5
65
a. 12, 17, 23, 15, 65
b. 12, 23, 17, 15, 65
c. 15, 17, 12, 23, 65
d. 17, 15, 12, 23, 65
Answer: C
9.15. Given a stack, what would the final value of the stack pointer be after the following instructions were
executed:
PUSH 23
PUSH 35
PUSH 42
POP X
PUSH 20
POP X
POP X
PUSH 30
a. 1.
b. 2.
c. 3.
d. 4.
e. 5.
Answer: B
9.16. The Shell sort:
a. Finds the smallest value and exchanges it with the first value, then continues with the second value, third
value, etc.
b. Is a system of comparisons and exchanges of adjacent elements to move the largest to the bottom of the
selected group of values.
c. Is a system of comparisons and exchanges of elements that are non-adjacent. The gap is halved at each
pass.
d. None of the above.
Answer: C
9.17. The selection exchange sort:
28
a. Finds the smallest value and exchanges it with the first value, then continues with the second value, third
value, etc.
b. Is a system of comparisons and exchanges of adjacent elements to move the largest to the bottom of the
selected group of values.
c. Is a system of comparisons and exchanges of elements that are non-adjacent. The gap is halved at each
pass.
d. None of the above.
Answer: A
9.18. When processing a queue:
a. An error occurs when adding data to the queue and the queue is filled.
b. An error occurs when deleting data from the queue and queue is empty.
c. An error occurs when the wrong option is entered.
d. All of the above.
Answer: D
9.20. In a queue:
a. Data is added to the top and deleted from the bottom.
b. Data is added to the bottom and deleted from the top.
c. The data in the queue is moved to the top when data is deleted.
d. The data in the queue is moved down when data is deleted.
Answer: B
9.21. When processing a stack:
a. Additions are at one end and deletions are at the other end.
b. Additions and deletions are both at the same end.
c. Additions are at the top and deletions are at the bottom.
d. Additions are at the bottom and deletions are at the top.
Answer: B
29
30
31
32
33
11.13. The number of added field(s) to a file that uses the linked list technique of accessing data are:
a. One.
b. Two.
c. A linked field for each order of processing the file.
d. Two linked fields for each order of processing the file.
Answer: C
11.14. The list pointer maintained with a list contains:
a. The smallest value in the list.
b. The record number of the smallest value in the list.
c. The mid value in the list.
d. The record number of the mid value in the list.
Answer: B.
11.15. The empty pointer maintained with a list:
a. Contains the record number of the next record to be added to the list.
b. Points to a list within a list.
c. If it contains a zero, the next record to be added must added in a newly created record.
d. All of the above
e. a and c.
Answer: D.
11.16. A circularly linked list:
a. Is the same as any other linked list.
b. Has no end, as the list value of the last value in the list points to the record number of the first value in
the list.
c. Is connected to the empty list.
d. b and c.
Answer: B
11.17. In a linked list:
a. Data is held in records.
b. Data is held in arrays.
c. Data is held in separate variables.
d. None of the above.
e. All of the above.
Answer: A
11.18. Each record in a linked list:
a. Has at least one extra field to hold the links.
b. Has all of the related data to one entity of the file.
c. Has only one extra field to hold the links.
d. Used one of the existing fields as the links.
e. a and b.
Answer: E
11.19. The records in a file using a linked list:
a. Must be in order when starting.
b. Must be in order at all times.
c. Does not need to be in order.
d. None of the above.
Answer: A
34
35
36
12.12. Given the following data, what would the root value be if the tree were transversed as NLR,
(Remember the data should be in alphabetical order. )
Dave
Julie
Martha
Adam
Frank
Peter
Norman
a. Julie
b. Adam
c. Martha
d. Peter
e. Norman
Answer: A
12.13. The added field(s) to a file that uses the binary tree technique of accessing data are:
a. Right branch.
b. Left branch.
c. Root.
d. All of the above.
e. a and b.
f. a and c.
Answer: E
12.14. Transversal of a binary tree:
a. Means the method of accessing and processing the nodes.
b. Has three methods, Preorder, Inorder, and Postorder.
c. Is the method of finding the root.
d. a and b.
d. b and c.
Answer: D.
12.15. To process data using preorder processing:
a. Node is processed first, then the left branch, then the right.
b. The left branch is processed first, then the node and then the right branch
c. The left branch is processed first, then the right branch, and then the node
d. The right branch is processed first, then the node, and then the left branch.
Answer: A
12.16. To process data using inorder processing:
a. Node is processed first, then the left branch, then the right.
b. The left branch is processed first, then the node and then the right branch
c. The left branch is processed first, then the right branch, and then the node
d. The right branch is processed first, then the node, and then the left branch.
Answer: B
12.17. To process data using postorder processing:
a. Node is processed first, then the left branch, then the right.
b. The left branch is processed first, then the node and then the right branch
c. The left branch is processed first, then the right branch, and then the node
d. The right branch is processed first, then the node, and then the left branch.
Answer: C
37
38
Answer:T
13.6ADBMSaccesstothedatathroughtheuseofindexingandbuiltinproceduresslows
performanceofthesystem
Answer:F
13.7Constraintsarerulesthatthedatamustadheretoinorderforthedatatobesaved
Answer:T
13.8Triggersarebuiltin,userdefinedroutinesthatoccurwhendataismanipulated,usually
fromadatainsert,update,ordeleteaction.
Answer:T
13.9ADatabaseTransactionusuallyhasabegincommitorbeginrollbackcycledependingon
theoutcomeofthetransaction.
Answer:T
13.10UsingRemoteProcedureCalls(RPCs)orStandardQueryLanguage(SQL)theclient
communicateswithaserver.
Answer: T
Multiple Choice:
13.11. When using database terminology:
a. a table is the same as an entity set.
b. a record is the same as an attribute.
c. a field is the same as an entity
d. none of the above.
e. a, b and c.
Answer: A
39
40
41
semanticconcepts:entities,relationships,andattributes.
Answer:T
14.9 Theschemaofyourdatabaseshowstherelationshipsamongthetables.
Answer:T
Multiple Choice:
14.10 A Table is a:
a. An group of related records or entities
b. A spreadsheet
c. A place where the computer is stored
d. All of the above
Answer: A
14.11 A Field is used to:
a. Play baseball
b. Store data of a particular type
c. Is always a primary key
d. All of the above
Answer: B
14.12 Primary Keys:
a. Are used in database tables
b. Are a field
c. Is a unique value
d. All of the above
Answer: D
42
43
44
15.13. A GUI:
a. Is a Graphic User Interface.
b. Can only use a pointing device to activate it.
c. Uses only icons for interaction.
d. All of the above.
Answer: A
15.14. Interactivity:
a. Is the interaction between the computer parts and is not seen by the user.
b. Requires the user to do something in order for the computer to react, such as click a button.
c. Is only used in procedural programming.
d. Is only accomplished through the use of a mouse.
Answer: B
15.15. A class:
a. Is a group of objects.
b. Has a set of properties associated with it.
c. Is the same thing as a single variable.
d. Has no relationship with other classes, sub-classes, or super-classes.
Answer: B
2.16. An example of a navigational tool is:
a. Mouse up or down.
b. Button on the screen.
c. A key that is pressed.
d. All of the above.
e. None of the above.
Answer: B
15.17. In a solution developed using object-oriented programming:
a. There may be some modules that are never executed.
b. All modules must be executed.
c. Different modules may be executed every time the solution is processed.
d. a and c.
Answer: D.
15.18. Once a class is defined:
a. It may be referenced as a single variable.
b. A sub class may be defined.
c. An object may be defined.
d. All of the above.
e. None of the above.
Answer: D
15.19. Functions:
a. Are basically the same as modules.
b. Can be executed at any time during the execution of a program.
c. Are only executed during the processing of an event.
d. All of the above.
e. a and b.
f. None of the above.
Answer: E
45
46
structural:
Answer: T
16.4. Usecasediagramsdescribehowasystemfunctionsfromtheusersstandpoint.
Answer: T
16.5. It is important to design the interaction before you develop the modules or scripts.
Answer: T
16.6. The screen design is unimportant as long as all of the information and data is there.
Answer: F
16.7. UML is a new method for storing data in a database
Answer: F
16.8. Class Diagrams determine how the user interface interacts.
Answer: F
16.9. Navigation design should be deigned with the developer and program design in mind.
Answer: F
16.10. Storyboards are optional in the design of an event-driven object-oriented program.
Answer: F
Multiple Choice:
16.11. A class diagram:
a. Is a list of classes used in the program.
b. Is a list of events used in the program.
c. Shows the classes and how they are processed.
d. Shows the data structure, attributes and methods of a class.
Answer: D
16.12. The audience:
a. Should be incorporate into the design using Use Case Diagrams.
b. Is not important.
c. Should be considered but should not be an important aspect in the design of the project.
d. None of the above.
Answer: A
47
48
49
50
17.13. Games:
a. Need a story line
b. Need resources
c. Should have a goal
d. Should have a reward
e. All of the above
Answer: E
17.14. Resources of a game include:
a. Objects
b. An environment
c. Sprites
d. Backgrounds
e. All of the above
Answer: E.
17.15. Events are:
a. Part of the environment
b. Sounds
c. The interaction between the player and the game
d. Part of the script
17.16. Timelines:
a. Are part of the scripts
b. Guide objects
c. Specify when something happens
d. None of the above
Answer: C
17.18. Sounds:
a. Are expected by players
b. Are used in the background
c. Are used when something happens
d. All of the above
e. None of the above
Answer: D
51
52
53
54
55
56
57
58
20.20. After the completion processing of the program to update a sequential file,
a. The old master file is the same as the new master file.
b. The backup file is the same as the new master file.
c. The old master file is the same as the backup file.
d. None of the above.
Answer: A
20.21. Updating a file uses a process called
a. Interactive processing.
b. Batch processing.
c. Alternative processing.
d. Change processing.
Answer: B
20.22. When deleting a record, the record
a. May be retained in the master file, but marked as deleted.
b. May be destroyed.
c. May be placed in an activity file.
d. a and c.
e. None of the above.
Answer: D
20.23. A record that is added to the file
a. Is placed at the end of the file.
b. Is placed in order.
c. Is placed at the beginning of the file.
d. None of the above.
Answer: B
20.24. In the process of updating a file
a. The file is kept in order of the primary key.
b. The file order is destroyed.
c. The file is kept in order of the secondary key.
d. The file is kept in order of a foreign key.
Answer: A
20.25. When changing the data in a record, the corrected record
a. Is placed back in order of the primary key.
b. Is placed at the end of the file.
c. Is placed in the activity file.
d. a and c.
e. None of the above.
Answer: D
59