Review Intro To Computer System Which of the following software engineering meth
ID: 3768000 • Letter: R
Question
Review Intro To Computer System
Which of the following software engineering methodologies is the most rigid?
A. Incremental model B. Waterfall model
C. Extreme programming D. Evolutionary prototyping
Which of the following is a notational system for representing object-oriented designs?
A. UML B. Structure charts C. Modular designs D. Dataflow diagrams
Which of the following is an attempt to construct software from off-the-shelf components as is done in other engineering fields?
A. Extreme programming B. Evolutionary prototyping
C. Component architecture D. Open-source development
Which of the following is most likely an example of a one-to-one relationship?
A. Subscribers and magazines B. Birth dates and people
C. Planets and their moons D. Dinner guests and table settings
Which of the following is most likely an example of a many-to-many relationship?
A. Subscribers and magazines B. Birth dates and people
C. Planets and their moons D. Dinner guests and table settings
Which of the following is not a feature of UML?
A. Use case diagrams B. Class diagrams
C. Dataflow diagrams D. Sequence diagrams
The use of design patterns in software engineering was adopted from what other field?
A. Business administration B. Architecture
C. Biology D. Chemistry
Which of the following is a form of glass-box testing?
A. Basis path testing B. Boundary value analysis C. Beta testing
Which of the following is a means of controlling the complexity of a software system?
A. CRC cards B. Modularity C. Specifications D. Beta testing
Which of the following is a way of testing the design of a software system?
A. Entity-relationship diagram B. Class diagram
C. Structure chart D. Structured walkthrough
Which of the following is not related to the others?
A. Structure chart B. Imperative paradigm
C. Class diagram D. Function
Which of the following is the method proposed by UML for representing sequences of communication between objects?
A. Class diagram B. Use case diagram
C. Sequence diagram D. Generalization
Which of the following is not represented in a class diagram?
A. Generalizations B. The methods within a class
C. The attributes within a class D. The number of instances each class will have
Which of the following is least related to the Pareto principle?
When it rains, it pours.
Birds of a feather flock together.
Better late than never.
The Pareto principle is traditionally applied during which phase of software development?
A. Requirements Analysis B. Design
C. Implementation D. Testing
Which of the following is the oldest approach to software development?
A. Component architecture B. Waterfall model
C. Open-source development D. Extreme programming
Which of the following is not a tool for designing modular systems?
A. Structure charts B. Data dictionaries
C. Class diagrams D. Sequence diagrams
Which of the following is a stronger form of cohesion?
A. Functional cohesion B. Logical cohesion
Which of the following appears to be the most functionally cohesive?
A module that handles all of a customer’s banking needs
A module that handles only transactions related to checking accounts
A module that only records deposits to checking accounts
A module that collects data for monthly statements
If a class diagram indicates a one-to-one relationship between class X and class Y, then
there will be only one object in the system of “type” X.
each object of “type” X will be associated with only one object of “type” Y.
there will be exactly one object of “type” X and exactly one object of “type” Y.
an object of “type” Y cannot occur without first constructing an object of “type” X.
Copyright laws were established
to allow authors to distribute their work while maintaining certain ownership rights.
to allow authors to maintain ownership of their ideas.
to restrict access to publications to certain groups within society.
to allow ideas to be traced back to their origins.
Which of the following is a LIFO structure?
A. Array B. Stack C. Queue D. Tree
Which of the following is a FIFO structure?
A. Array B. Stack C. Queue D. Tree
Which of the following is static in the sense that it does not change size or shape as information is stored and retrieved?
A. Array B. Stack C. Queue D. Tree
Suppose you were going to retrieve items of data that you would later need to process in the opposite order from that in which they were retrieved. Which of the following would be the best structure in which to store the items?
A. Tree B. Stack C. Queue D. Traditional linked list
Suppose a binary tree contained the nodes W, X, Y, and Z. If W and X were children of Y, and Z had no children, which node would be the root?
A. W B. X C. Y D. Z
Suppose a binary tree contained the nodes W, X, Y, and Z, and each node had at most one child. How many terminal nodes would be in the tree?
A. One B. Two C. Three D. Undetermined
If the two-dimensional array X were stored in row-major order, then in the block of main memory containing X, which of the following would be true?
The entry X[1,2] would appear before X[2,1].
The entry X[1,2] would appear after X[2,1].
The entry X[1,2] would be in the same location as X[2,1].
None of the above
Which of the following is not used when determining the location of an entry in a two-dimensional array stored in row-major order?
A. Indices B. Number of rows in the array
C. Address polynomial D. Number of columns in the array
Which of the following is not a means of locating an entry in a linked storage structure?
A. head pointer B. child pointer C. root pointer D. null pointer
If a stack contained the entries w, x, y, z (from top to bottom), which of the following would be the contents after two entries were removed and the entry r was inserted?
A. w, x, r B. y, z, r C. r, y, z D. r, w, x
If a queue contained the entries w, x, y, z (from head to tail), which of the following would be the contents after two entries were removed and the entry r was inserted?
A. w, x, r B. y, z, r C. r, y, z D. r, w, x
If the number of nodes in a binary tree is 2n (where n is a positive integer), then the entire tree would contain at least
A. 2n + 1 nodes B. 22n nodes C. 2n + 1 - 1 nodes D. 2n + 2 nodes
If the longest path in a binary tree contained exactly four nodes, what is the maximum number of nodes that could be in the entire tree?
A. 4 B. 7 C. 15 D. 31
The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure?
def printTree (Tree):
if (Tree is not None):
< >< >< >A. B. C.
The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure?
def printTree (Tree):
if (Tree is not None):
< >
printTree (Tree.Right)
< >A. B. C.
The table below represents a portion of a computer’s main memory containing a binary tree. Each node consists of three cells, the first being data, the second being a pointer to the node’s left child, and the third being a pointer to the node’s right child. If the null pointer is represented by 00 and the tree’s root pointer contains 50, which of the following is a picture of the tree?
Address Contents
50 A
51 56
52 53
53 B
54 00
55 00
56 C
57 00
58 00
A. B. C.
Suppose a binary tree is implemented as a linked structure in which each node contains both a left child pointer and a right child pointer. Which of the following statements is false?
The number of nodes in the tree is always at least the number of nodes on the longest path in
the tree.
B. The number of null pointers in the tree is always greater than the number of nodes in the tree.
C. Each terminal node in the tree is always at the end of a path that is as least as long as any other path in the tree.
D. Both the left child and right child pointers of every terminal node are null.
The table below represents a portion of a computer’s main memory containing a binary tree stored row by row in a contiguous block as described in the chapter. What is the left child of the node V?
Address Contents
50 T
51 U
52 V
53 W
54 X
55 Y
56 Z
A. W B. X C. Y D. Z
The table below represents a portion of a computer’s main memory containing a binary tree stored row by row in a contiguous block as described in the chapter. What is the parent of the node Z?
Address Contents
50 T
51 U
52 V
53 W
54 X
55 Y
56 Z
A. T B. U C. V D. Y
In a machine language, the technique in which the data to be manipulated by an instruction is included within the instruction itself is called
A. Immediate addressing B. Direct addressing C. Indirect addressing
In a machine language, the technique in which an instruction contains the location of a pointer to the data to be manipulated is called
A. Immediate addressing B. Direct addressing C. Indirect addressing
43. Which of the following accesses a database in terms of a database model?
A. Application software B. Database management system C. Actual database
44. Which of the following describes only the portion of a database available to a particular user?
A. Database model B. Schema C. Subschema D. DBMS
45. Which of the following relational operations combine data from more than one relation?
A. SELECT B. PROJECT C. JOIN
46. Which of the following relational operations extracts entire columns from a relation?
A. SELECT B. PROJECT C. JOIN
47. Which of the following relational operations extracts entire rows from a relation?
A. SELECT B. PROJECT C. JOIN
48. Which of the following relational operations is performed by the SQL statement below?
SELECT A, B, C FROM X
A. SELECT B. PROJECT C. JOIN
49. Given the relation X below
X: A B C
2 5 7
3 3 3
4 3 2
5 2 8
What value will be extracted by the following query?
TEMP ¬ SELECT from X where B > C
RESULT ¬ PROJECT A from TEMP
A. 2 B. 3 C. 4 D. 5
50. Given the relation X below
X: A B C
2 5 7
3 3 3
4 4 2
5 2 8
What value will be retrieved by the following query?
TEMP ¬ SELECT from X where B = C
RESULT ¬ PROJECT B from TEMP
A. 2 B. 3 C. 4 D. 5
51. Given the relation below
X: A B C
2 5 7
3 3 6
4 4 2
5 2 2
What values will be retrieved by the following SQL statement?
SELECT A, B FROM X WHERE X.B = X.C
A. 2, 5 B. 3, 6 C. 2, 2 D. 5, 2
52. Given the two relations X and Y below
X: A B Y: C D
7 s t 3
2 z r 2
What value would be retrieved by executing the following SQL statement?
SELECT Y.C FROM X, Y WHERE X.A < Y.D
A. s B. z C. t D. r
53. Which of the following is not a potential problem caused by multiple transactions manipulating a database at the same time?
A. Lost update problem B. Clustering C. Deadlock D. Incorrect summary problem
54. Which of the following features within a DBMS is not provided to maintain database integrity?
A. Concurrent transaction processing B. Log
C. Locking protocol D. Commit points
55. Which of the following data mining techniques would be applied when trying to identify traits that characterize the citizens of a democracy who fail to vote?
A. Class description B. Class discrimination
C. Cluster analysis D. Association analysis
56. Which of the following data mining techniques would be applied when trying to identify traits that predict whether a citizen in a democracy will or will not vote?
A. Class description B. Class discrimination
C. Cluster analysis D. Association analysis
57. Which of the following data mining techniques would be applied when trying to identify any underlying heterogeneity within housing patterns in a community?
A. Class description B. Class discrimination
C. Cluster analysis D. Association analysis
58. Which of the following data mining techniques would be applied when trying to identify common properties between different groups of shoppers?
A. Class description B. Class discrimination
C. Cluster analysis D. Association analysis
59. Which of the following file structures is most efficient in cases in which the file is always processed in its entirety a predetermined order?
A. Sequential B. Indexed C. Hash
60. Which of the following file structures is commonly used for the storage of text files?
A. Sequential B. Indexed C. Hash
61. Which of the following file structures is associated with the problem of clustering?
A. Sequential B. Indexed C. Hash
62. Which of the following file structures requires a small “auxiliary” storage system that must be updated as entries in the file are inserted or deleted.
A. Sequential B. Indexed C. Hash
63. Which of the following is not associated with a parallel projection?
A. Projection plane
B. Projectors
C. Center of projection
D. All of the above
64. The image is stored in the
A. Image window
B. Z-buffer
C. Center of projection
D. Frame buffer
65. The shape of an object is usually represented by
A. A sphere
B. A polygonal mesh
C. A triangle
D. A texture map
66. A polygonal mesh consists of
A. Planer patches
B. Pixels
C. Spheres
D. Bezier curves
67. Which of the following is not a way of constructing a polygonal mesh?
A. Digitizing
B. Procedural model
C. Texture mapping
D. Particle system
68. Which of the following is not contained in a scene graph?
A. Models of the objects in the scene
B. Information about the camera
C. Information about lighting
D. The view volume
69. The incidence angle is measured relative to
A. The line normal to the surface
B. A line parallel to the surface
C. The line followed by the reflected ray
D. None of the above
70. The phenomenon of a light ray bending as it passes through materials of different density is called
A. Reflection
B. Incidence
C. Refraction
D. Ray tracing
71. Which of the following is not naturally handled by a local lighting model?
A. Specular light
B. Diffuse light
C. Ambient light
D. Shadows
72. Which of the following is not a step in the traditional rendering pipeline?
A. Scan conversion
B. Rasterization
C. In-betweening
D. Clipping
73. Which of the following is associated with clipping?
A. Phong shading
B. The view volume
C. Texture mapping
D. Bump mapping
74. Which of the following is not associated with scan conversion?
A. A z-buffer
B. The painter’s algorithm
C. Digitizing
D. Pixel positions
75. Another name for scan conversion is
A. Rasterization
B. Digitizing
C. Bump mapping
D. Ray tracing
76. Hidden-surface removal is the process of
A. Discarding those objects that fall outside the view volume
B. Applying a parallel projection rather than a perspective projection
C. Identifying parts of surfaces that are in a shadow
D. Identifying surfaces that are blocked from the camera’s view
77. Which of the following is the simplest shading technique?
A. Phong shading
B. Flat shading
C. Gouraud shading
D. Bump mapping
78. Which of the following is an advantage of ray tracing over the traditional rendering pipeline?
A. It is less time consuming.
B. It implements a local lighting model.
C. It can be implemented in real time.
D. It implements a global lighting model.
79. Which is not a feature of radiosity?
A. Objects tend to appear dull rather than shiny.
B. Moving the camera position does not require massive changes.
C. Specular light is easily simulated.
D. It is a computationally complex undertaking.
80. Which of the following is not a property of the rendering pipeline?
A. It relies on recursive ray tracing.
B. It implements a local lighting model.
C. It is often implemented in firmware.
D. Its use leads to efficient rendering systems.
81. Producing a sequence of frames to fill the gap between key frames is called
A. Storyboarding
B. Morphing
C. In-betweening
D. Motion capture
82. Motion capture is a means of applying
A. A global lighting model
B. A local lighting model
C. Dynamics
D. Kinematics
83. Avars are used to
A. Adjust a character’s shape
B. Simulate textured surfaces
C. Locate objects in a scene graph
D. Reposition the camera
Explanation / Answer
Which of the following software engineering methodologies is the most rigid?
Anw:Waterfall Model
Which of the following is a notational system for representing object-oriented designs?
Anw:UML
Which of the following is an attempt to construct software from off-the-shelf components as is done in other engineering fields?
Anw:Component Architecture
Which of the following is most likely an example of a one-to-one relationship?
Anw:Dinner guests and table settings
Which of the following is most likely an example of a many-to-many relationship?
Anw:Subscribers and magazines
Which of the following is not a feature of UML?
Anw:Sequence diagrams
The use of design patterns in software engineering was adopted from what other field?
Anw:Architecture
Which of the following is a form of glass-box testing?
Anw:Basis Path Testing
Which of the following is a means of controlling the complexity of a software system?
Anw:
Which of the following is a way of testing the design of a software system?
Anw:Structured Walkthrough
Which of the following is not related to the others?
Anw:Structure Chart
Which of the following is the method proposed by UML for representing sequences of communication between objects?
Anw:
Which of the following is not represented in a class diagram?
Anw:
Which of the following is least related to the Pareto principle?
Anw:Better late than never
The Pareto principle is traditionally applied during which phase of software development?
Anw:Testing
Which of the following is the oldest approach to software development?
Anw:Waterfall model
Which of the following is a stronger form of cohesion?
Anw:Functional cohesion
Which of the following appears to be the most functionally cohesive?
Anw:A module that only records deposit to checking accounts
If a class diagram indicates a one-to-one relationship between class X and class Y, then
Anw:each object of "type" X will be associated with only object of "type" Y
Copyright laws were established
Anw:to allow authors to distribute their work white maintainig certain ownership rights
Which of the following is a LIFO structure?
Anw:Stack
Which of the following is a FIFO structure?
Anw:Queue
Suppose you were going to retrieve items of data that you would later need to process in the opposite order from that in which they were retrieved. Which of the following would be the best structure in which to store the items?
Anw:stack
Suppose a binary tree contained the nodes W, X, Y, and Z. If W and X were children of Y, and Z had no children, which node would be the root?
Anw:Y
Suppose a binary tree contained the nodes W, X, Y, and Z, and each node had at most one child. How many terminal nodes would be in the tree?
Anw:One
If the two-dimensional array X were stored in row-major order, then in the block of main memory containing X, which of the following would be true?
Anw:The entry X[1,2] would appear before X[2,1].
Which of the following is not used when determining the location of an entry in a two-dimensional array stored in row-major order?
Anw:Number of rows in the array
Which of the following is not a means of locating an entry in a linked storage structure?
Anw:NIL pointer
If a stack contained the entries w, x, y, z (from top to bottom), which of the following would be the contents after two entries were removed and the entry r was inserted?
Anw: r, y, z
If a queue contained the entries w, x, y, z (from head to tail), which of the following would be the contents after two entries were removed and the entry r was inserted?
Anw: y, z, r
If the number of nodes in a binary tree is 2n (where n is a positive integer), then the entire tree would contain at least
Anw:2n + 1 - 1 node
If the longest path in a binary tree contained exactly four nodes, what is the maximum number of nodes that could be in the entire tree?
Anw:15
The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure?
Anw:
The nodes in which of the trees below will be printed in alphabetical order by the following recursive procedure?
Anw:
The table below represents a portion of a computer’s main memory containing a binary tree. Each node consists of three cells, the first being data, the second being a pointer to the node’s left child, and the third being a pointer to the node’s right child. If the null pointer is represented by 00 and the tree’s root pointer contains 50, which of the following is a picture of the tree?
Address Contents
50 A
51 56
52 53
53 B
54 00
55 00
56 C
57 00
58 00
Anw:
44. Which of the following describes only the portion of a database available to a particular user?
Anw:Subschema
45. Which of the following relational operations combine data from more than one relation?
Anw:JOIN
46.Which of the following relational operations extracts entire rows from a relation?
Anw:PROJECT
47. Which of the following relational operations extracts entire rows from a relation?
Anw:Select
48. Which of the following relational operations is performed by the SQL statement below?
SELECT A, B, C FROM X
Anw:Project
49. Given the relation X below
X: A B C
2 5 7
3 3 3
4 3 2
5 2 8
What value will be extracted by the following query?
TEMP ¬ SELECT from X where B > C
RESULT ¬ PROJECT A from TEMP
Anw:4
50. Given the relation X below
X: A B C
2 5 7
3 3 3
4 4 2
5 2 8
What value will be retrieved by the following query?
TEMP ¬ SELECT from X where B = C
RESULT ¬ PROJECT B from TEMP
Anw:3
51. Given the relation below
X: A B C
2 5 7
3 3 6
4 4 2
5 2 2
What values will be retrieved by the following SQL statement?
SELECT A, B FROM X WHERE X.B = X.C
Anw:5, 2
52. Given the two relations X and Y below
X: A B Y: C D
7 s t 3
2 z r 2
What value would be retrieved by executing the following SQL statement?
SELECT Y.C FROM X, Y WHERE X.A < Y.D
Anw:t
53. Which of the following is not a potential problem caused by multiple transactions manipulating a database at the same time?
Anw:Clustering
54. Which of the following features within a DBMS is not provided to maintain database integrity?
Anw:Concurrent transaction processing
55. Which of the following data mining techniques would be applied when trying to identify traits that characterize the citizens of a democracy who fail to vote?
Anw:Class description
56. Which of the following data mining techniques would be applied when trying to identify traits that predict whether a citizen in a democracy will or will not vote?
Anw:Class discrimination
57. Which of the following data mining techniques would be applied when trying to identify any underlying heterogeneity within housing patterns in a community?
Anw:Cluster analysis
58. Which of the following data mining techniques would be applied when trying to identify common properties between different groups of shoppers?
Anw:Association analysis
59. Which of the following file structures is most efficient in cases in which the file is always processed in its entirety a predetermined order?
Anw:Sequential
60. Which of the following file structures is commonly used for the storage of text files?
Anw:Sequential
61. Which of the following file structures is associated with the problem of clustering?
Anw:Hash
62. Which of the following file structures requires a small “auxiliary” storage system that must be updated as entries in the file are inserted or deleted.
Anw:Indexed
Avars are used to
Anw:Locate objects in a scene graph
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.