Question

Question 8

1. A = 23n + 36n²        B = 6 + nlog₂(n) + n      C = log₂n + 36n²

   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)

0.5 points

Question 9

1. 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

0.5 points

Question 10

1. 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 programmer’s 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

0.5 points

Question 11

1. 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

0.5 points

Question 12

1. 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

0.5 points

Question 13

1. 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

0.5 points

Question 14

1. Which one is not correct about the object (page 40)?

   	A.	Object is an instance of a class
   	B.	After an object is declared, the client code can invoke any public accessible methods declared in the class by using objectName.methodName()
   	C.	In Java, accessing information in objects requires only one memory access as primitive variable (page 40)
   	D.	In Java, accessing information in objects requires two memory

0.5 points

Question 15

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

0.5 points

Question 16

1. Two objects, objectA and object, 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 shallow copy?

   	A.	1
   	B.	2
   	C.	cannot know
   	D.	1 or 2 depending on real cases

0.5 points

Question 17

1. 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

0.5 points

Question 18

1. 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

0.5 points

Question 19

1. Big-O analysis is __________

   	A.	An analysis technique that is used to set a bound of the upper limit of a mathematical function.
   	B.	An analysis technique that is based on the assumption that one of the term of the function will dominate all but negligible portion of the value of the function as the independent variable gets large.
   	C.	An analysis that is used to evaluate functional relationships
   	D.	All of above

0.5 points

Question 20

1. 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);

Answer 1

`Hey,

Note: Brother if you have any queries related the answer please do comment. I would be very happy to resolve all your queries.

8) OPTION B IS CORRECT BECAUSE IN ALGO A THE BIGGEST TERM IS n^2, in b the biggest term is n*log(n) and in c it is n^2

9) OPTION A IS CORRECT Cost, Speed and memory overhead

10) OPTION D IS CORRECT

11) We do not need to know the implementation details of the method in order to use it

12) Binary Search algorithm can be applied on the unsorted arrays

Note: Brother According to Chegg's policy we are only allowed to answer first 5 part if there are many. So, I request you to post other part as separate posts.

Kindly revert for any queries

Thanks.