Question: QUESTION 1 1. Which statement is not correct about data? A. Data is information B. Data can be input data or output data C. Studies
QUESTION 1
1. Which statement is not correct about data?
| A. | Data is information | |
| B. | Data can be input data or output data | |
| C. | Studies show that programs spend only 10% of their execution time for searching through memory to locate the data they process | |
| D. | The source of data can be any device attached to a computer system |
QUESTION 2
2. Algorithm speed will consider the following factors:
| A. | relative speed of the algorithm | |
| B. | absolute speed of the algorithm | |
| C. | do not need to consider anything | |
| D. | a and b |
QUESTION 3
3. Three criteria are used to determine whether a data structure is acceptable for a particular application are:
| A. | Cost, Speed and memory overhead | |
| B. | Cost, type of storage, type of memory | |
| C. | a and b | |
| D. | None of above |
QUESTION 4
4. Which one is true for Linear List?
| A. | It is a collection of n nodes if there is a unique first node N1, unique last node Nn and only one node in the list | |
| B. | It is a collection of n nodes if there is a unique first node N1, unique last node Nn and for any other node, only one node comes before it and only one node comes after it | |
| C. | It is a collection of n nodes if there is a unique first node N1, unique last node Nn and for any other node, it can have one or more nodes come before or after it | |
| D. | None of above |
QUESTION 5
5. Two objects, objectA and objectB, are objects of one class. The objectA is copied to objectB. How many objects exist after the copy if the copy is performed as a deep copy?(PAGE 41)
| A. | 1 | |
| B. | 2 | |
| C. | cannot know | |
| D. | 1 or 2 depending on real cases |
QUESTION 6
6. Assume 16 lines of code per person per day. Estimate a program will consist of 300,000 lines of code. If the burdened cost of a programmers efforts is $150 per hour, determine the code of the program (page 10)
| A. | 45 million dollars | |
| B. | 10 million dollars | |
| C. | 90 million dollars | |
| D. | 22.5 million dollars |
QUESTION 7
7. Which one is not correct about the class?
| A. | Class is a programmer-defined type | |
| B. | Class consists of data definitions and methods that operate on the data | |
| C. | public class allows a method in any application to declare a reference variable of this class type | |
| D. | Class is one of primitive data type that Java defines in Java library |
QUESTION 8
8. There are 2 nodes are stored in a linear list. What node comes just before and just after the first node?
| A. | None and last node | |
| B. | Node 0 and node 2 | |
| C. | None and node 2 | |
| D. | a and c |
QUESTION 9
9. Put the terms, node, field and data set in size order from small to large: (page 11-12)
| A. | Data set, field, node | |
| B. | Field , data set, node | |
| C. | Field, node, data set | |
| D. | Node, data set, field |
QUESTION 10
10. There are two Access Modes that are used to specify the node to be accessed:
| a. | The node number mode | |
| b. | The type of the node mode | |
| c. | The key field mode | |
| d. | a and b | |
| e. | a and c |
QUESTION 11
11. The following is not true about Binary Search :
| A. | Binary Search algorithm is a technique for rapidly finding a data item stored in an array | |
| B. | Binary Search algorithm will return the index of the array elements where the search value is stored | |
| C. | Binary Search algorithm can be applied on the unsorted arrays | |
| D. | Binary Search algorithm assumes that the data in array are already sorted. in ascending order |
QUESTION 12
12. The basic operations performed on data structures:
| A. | Insert, delete, fetch, update | |
| B. | Insert, search, delete, update | |
| C. | Remove, search, insert, update | |
| D. | fetch, modify, delete, read |
QUESTION 13
13. Built-in data structures are ____?
| A. | Schemes for storing data that are conceived and implemented by the programmer of a particular program | |
| B. | schemes for storing data that are part of a programming language | |
| C. | constructed from structures, such as, parallel arrays, class definitions, hashing schemes, link lists, trees, stacks and queues. | |
| D. | None of above |
QUESTION 14
14. Which one is correct about array?
| A. | int [ ] myInt = new int; | |
| B. | int [3] myInt = new int; | |
| C. | int [ ] myInt = new int[3]; | |
| D. | int [ ] myInt = new int(3); |
QUESTION 15
15. The factors determine the cost of software are: (page 10)
| A. | Lines of code that the software contains | |
| B. | Design, implement, testing, documentation, burdened labor rate | |
| C. | a and b | |
| D. | None of above |
QUESTION 16
16. Which one is not correct about Inheritance?
| A. | Inheritance allows defining a classA that can inherits all the attributes and methods of classB and does not need to redefine. | |
| B. | The classA is called subclass, classB is called superclass | |
| C. | The classA is called the parent class and the classB is called the child class | |
| D. | extends is the keyword that is used to indicate the inheritance |
QUESTION 17
17. Procedural abstraction is:
| A. | We do not need to know what the method is to use it | |
| B. | We do not need to know the implementation details of the method in order to use it | |
| C. | We do not need to know what methods the class has to use it | |
| D. | We do not to know anything about the method to use it |
QUESTION 18
18. Which one is not correct about encapsulation?
| A. | Encapsulation helps to reduce the cost of the software development. and maintenance | |
| B. | Encapsulation produce the code is more easily reused | |
| C. | Encapsulation is the idea that we write the code in a way that establishes compiler enforced protocols for accessing the data that the program process | |
| D. | Encapsulation provides the code such that all the fields can be access from everywhere outside the class |
QUESTION 19
19. Data Structure is ____
| An organization of information usually in the memory | ||
| For better algorithm efficiency and improves the programs performance | ||
| a and b | ||
| none of above |
QUESTION 20
20. A = 23n + 36n2 B = 6 + nlog2(n) + n C = log2n + 36n2
Which one of the following is correct?
| A. | TA = O(n2) TB = O(n) TC = O(log2n) | |
| B. | TA = O(n2) TB = O(nlog2(n)) TC = O(n2) | |
| C. | TA = O(n2) TB = O(+ nlog2(n)) TC = O(log2n) | |
| D. | TA = O(n2) TB = O(n) TC = O(n2) |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
