The Fundamentals

A) A Stack is another name for the Tree structure

B) A Stack is another name for the Hash Table structure

C) A First-In/First-Out data structure

D) A Last-In/First-Out data structure

A) New classes should share some of the attributes of existing classes

B) The owner of a feature should only reveal what is absolutely necessary for the others to use that feature

C) Using simple things to represent complexity and avoid repetition

D) Using the same method names to represent different things

A) Any single line of code

B) Anything that produces a value

C) Any statement is an expression

D) Anything that can be used in the left-hand side of an assignment operator

A) Proxy

B) Map

C) Class

D) Generator Function

A) Adding a record to an object is significantly faster than pushing a record into an array

B) Objects are more efficient in terms of storage

C) Most operations involve looking up a record, and objects can do that better than arrays

D) Working with objects make the code more readable

A) Code is grouped with the state it modifies

B) Side effects are not allowed

C) Data fields and methods are kept in units

D) Every object in the program has to be a function

A) Read, Extend, Print, Loop

B) Run, Examine, Put, Loop

C) Read, Eval, Print, Loop

D) Run, Edit, Print, Loop

A) Functional Testing

B) Unit Testing

C) Black-box Testing

D) Usability Testing

A) It makes the source code private

B) It’s cross-platform

C) The code is ready to run as is on any machine

D) It’s always faster

A) Their code is more readable

B) Their code is more difficult to write than low-level languages

C) Their code is private because it’s compiled

D) All of the above

A) Functional Programming

B) Procedural Programming

C) Event-driven Programming

D) Object-oriented Programming

A) C++

B) JavaScript

C) Assembly

D) Java