17455547
Questão 1
Questão
Inheritance is ...
Responda
-
Powerful code reuse mechanism
-
providing access to data
-
ability of object of one class to act like it is object of another class
-
hiding an access to data
-
powerful technique to store all data together
Questão 2
Questão
Qucksort is implemented recursively
Responda
- True
- False
Questão 3
Questão
Waiting line of people is similar to which data structure?
Responda
-
Queue
-
LinkedList
-
Stack
-
Tree
-
Graph
Questão 4
Questão
Which of the graph implementations is more simple?
Responda
-
Matrix
-
map
-
set
-
list
Questão 5
Questão
To use Binary Search items should be ...
Responda
-
ordereed
-
matched
-
divorced
-
traversed
-
beaten
Questão 6
Questão
Reference "rear" of CircularArray is usually indicates ...
Responda
-
last added item
-
first added item
-
secondly added item
-
middle of array
-
top of a stack
Questão 7
Questão
If there is no path path from vertex to any other vertex that graph is considered to be ?
Responda
-
unconnected
-
undirected
-
DFS
-
BFS
-
weighted
Questão 8
Questão
Can we implement the queue using LinkedList?
Responda
-
yes
-
no
-
i don't know
-
maybe
-
i need to learn more about this
Questão 9
Questão
What is not perfect in this code: ave = sum / count;
Responda
-
division by zero may occur
-
multiplication by 10000000 is impossible in JAVA
-
ave should be written as average
-
semicolon needed after =
-
it is not java code
Questão 10
Questão
Returns the reference to the element at position index
Responda
-
get(index)
-
has(index)
-
goTo(index)
-
fly(index)
-
set(index)
Questão 11
Questão
Indicate exponential time complexity in terms of big-O notation?
Responda
-
O(2^n)
-
O(logn)
-
O(n^4)
-
O(nlogn)
-
O(n)
Questão 12
Questão
Traversing graph visiting a start node first, then all nodes that are adjacent to it next.
Responda
-
BFS
-
DFS
-
DIjkstra
-
matrix
-
preorder
Questão 13
Questão
A ________ graph is one where [E] is much less than [V]^2.
Responda
-
sprase
-
dense
-
path
-
hence
-
directed
Questão 14
Questão
Which method returns an object at the top of a Stack in JAVA?
Responda
-
peek()
-
front()
-
top()
-
pop()
-
poll()
Questão 15
Questão
The ____________ algorithm finds minimum spanning tree for a graph.
Responda
-
prim
-
DFS
-
matrix
-
Dijkstra
-
BFS
Questão 16
Questão
traverese left subtree, Visit root node, traverse right subtree traversal is called?
Responda
-
inorder
-
postorder
-
preorder
Questão 17
Questão
Data structure based on BST where all items are sorted and unique is?
Responda
-
treeSet
-
tree
-
treeMap
-
vector
-
graph
Questão 18
Questão
Graph is considered to be ___________ if there is a path from each vertex to any other vertex.
Responda
-
connected
-
weighted
-
directed
-
unweighted
-
unconnected
Questão 19
Questão
What is the difference between ArrayList and Vector?
Responda
-
Vector is synchronized where ArrayList is not
-
There is no difference
-
vector is resizable where ArrayList is not
-
vector is flexible where ArrayList is not
-
vector is scalable where ArrayList is not
Questão 20
Questão
Visit root node, traverese left subtree, traverse right subtree traversal is called?
Responda
-
preorder
-
inorder
-
postorder
Questão 21
Questão
First in last out structure is ...
Responda
-
stack
-
graph
-
queue
-
tree
Questão 22
Questão
Which container is not appropriate to implement Stack in Java?
Responda
-
graph
-
array
-
list
-
vector
Questão 23
Questão
Average time complexity of Bubble sort is?
Responda
-
O(n^2)
-
O(nlogn)
-
O(logn)
-
O(1)
-
O(n^3)
Questão 24
Questão
Every class has __________ as a superclass.
Responda
-
object
-
main
-
string
-
java
-
subject
Questão 25
Questão
traverse left subtree, traverse right subtree, visit root node traversal is called ?
Responda
-
postorder
-
preorder
-
inorder
Questão 26
Questão
A ___________ tree is a binary tree used to store a code that facilitates file compression.
Responda
-
Huffman
-
BFS
-
DFS
-
Dijkstra
-
heap
Questão 27
Questão
Distance from the root to its deepest leaf is known as __________ of a tree?
Responda
-
depth
-
height
-
path
-
subtree
-
root
Questão 28
Questão
The node of a tree without children is called ... ?
Responda
-
leaf
-
sibling
-
root
-
tree
-
subtree
Questão 29
Questão
Which structure is better to use when printing many documents from multiple computers at one printer?
Responda
-
queue
-
set
-
tree
-
stack
-
graph
Questão 30
Questão
A collision occurs when ... ?
Responda
-
two keys hash to the same table index.
-
i don't know what it is
-
impossible to answer
-
two keys are hashed to a very big table index and rehash needed
-
two values hash to the same table index
Questão 31
Questão
A __________ graph is one in which [E] is close to but less than [V]^2.
Responda
-
dense
-
sprase
-
directed
-
dark
-
hence
Questão 32
Questão
Average time complexity of Merge sort is?
Responda
-
O(nlogn)
-
O(n^2)
-
O(n^3)
-
O(n)
-
O(logn)
Questão 33
Questão
The _________ is used to implement the special kind of a queue called priority queue.
Responda
-
heap
-
BFS
-
DFS
-
BST
-
deap
Questão 34
Questão
Average time complexity of Shell sort is?
Responda
-
O(n^1.25)
-
O(1)
-
O(n)
-
O(logn)
-
O(n^2)
Questão 35
Questão
If there is at least one abstract method in a class, that class is called ...
Responda
-
abstract class
-
vanish class
-
tired class
-
recursive class
-
general class
Questão 36
Questão
Finding the shortest path algorithm is called?
Responda
-
Dijkstra
-
DFS
-
BFS
-
Binary Search
Questão 37
Questão
Which part is accessible to user?
Responda
-
public
-
private
-
protected
-
interacted
-
social
Questão 38
Questão
Dijkstra's algorithm use ______ algorithm to traverse all nodes.
Responda
-
BFS
-
DFS
-
matrix
-
tree
-
Prime's
Questão 39
Questão
A list can _________ or _________ as elements added or removed.
Responda
-
grow, shrink
-
increase, grow
-
fly, sit
-
decrease, think
-
flow, shrink
Questão 40
Questão
What is the time complexity of recursive Binary Search algorithm?
Responda
-
O(logn)
-
O(NxM)
-
O(nlogn)
-
O(n)
Questão 41
Questão
Why do we need BFS and DFS algorithms?
Responda
-
to traverse a graph
-
to measure graphh
-
to remove an item from graph
-
to find the way
-
to add new item in a graph
Questão 42
Questão
Choosing pivot and place all items smaller than pivot to the left and bigger ones to the right, then repeat the same with two branches is similar to _____________ sort algorithm.
Responda
-
quick
-
heap
-
merge
-
selection
-
bubble
Questão 43
Questão
Show the method which exists in DoubleLinkedList and not exist in SingleLinkedList?
Responda
-
previous()
-
next()
-
constructor
-
hasBefore()
-
hasNext()
Questão 44
Questão
What determines whether you should use quadratic sort or a logarithmic sort algorithm?
Responda
-
array size
-
array values
-
swapping conditions
-
array type
-
array index
Questão 45
Questão
The Collection is a _________ of a List
Responda
-
superinterface
-
node
-
interface
-
parent
-
father
Questão 46
Questão
The _________ level of a node is a measure of its distance from the root.
Responda
-
level
-
distance
-
parent
-
father
Questão 47
Questão
A queue _________ in ___________ out data structure.
Responda
-
first, first
-
set,get
-
last,last
-
first,last
-
last,first
Questão 48
Questão
for(int i=0; i< size; i++){
if(theData[i]==entry){
return i;
}
return -1;
}
This method is similar to which method of ArrayList?
Responda
-
indexOf(entry)
-
get(entry)
-
equals(entry)
-
set(entry)
Questão 49
Questão
______________ exception is an error normally not due to programmer.
Responda
-
checked
-
unchecked
-
cracked
-
hacked
Questão 50
Questão
______________ exception is an error normally due to programmer.
Responda
-
unchecked
-
checked
-
hacked
-
cracked
Questão 51
Questão
Distance from the deepest leaf to the root of a tree is called?
Responda
-
height
-
depth
-
leaf
-
tree
-
breadth
Questão 52
Questão
ListIterator and Iterator is the same thing in JAVA.
Responda
- True
- False
Questão 53
Questão
The function that calls itself is called ...
Responda
-
recursive function
-
functional function
-
defensive function
-
impressive function
Questão 54
Questão
If you want to call different constructor of current class you would use ...
Responda
-
this()
-
this.
-
super.
-
super()
Questão 55
Questão
Which method adds an item on the top of the Stack in JAVA?
Responda
-
push()
-
peek()
-
top()
-
add()
Questão 56
Questão
In open addressing you can not remove an item to be deleted, so what should you do instead?
Responda
-
mark as deleted flag
-
go home and dance
-
delete and save in temporary list
-
change its place with another item
-
do nothing
Questão 57
Questão
What is the best time complexity of recursively finding fibbonachi nuber?
Responda
-
O(n)
-
H2O
-
O(n^2)
-
O(logn)
-
O(1)
Questão 58
Questão
A __________ is a sequence of vertices in which each successive vertex is connected to its predecessor. (Graphs)
Responda
-
path
-
graph
-
route
-
cycle
-
weight
Questão 59
Questão
Searching a binary search tree costs?
Responda
-
O(logn)
-
O(n)
-
O(1)
-
O(n^2)
Questão 60
Questão
Average time complexity of Selection sort is?
Responda
-
O(n^2)
-
O(nlogn)
-
O(logn)
-
O(n)
Questão 61
Questão
Full name of this course is ?
Responda
-
Algorithms and Data Structures
-
SDP4
-
Programming with Java
-
Basic circuit theory
-
Algoritmization and programming language
Questão 62
Questão
In ___________ graph is {v, u} is edge then {u, v} is not necessary an edge.
Responda
-
directed
-
undirected
-
weighted
-
connected
Questão 63
Questão
Average time complexity of Quick sort is?
Responda
-
O(nlogn)
-
O(logn)
-
O(n)
-
O(1)
Questão 64
Questão
Ideal data structure for a contact list is ?
Responda
-
map
-
vector
-
graph
-
tree
-
set
Questão 65
Questão
Each recursive function has two cases ________ and _________.
Responda
-
base, recursive
-
continued, stopped
-
looped, switched
-
lelik, bolik
-
base,defensive
Questão 66
Questão
Array reallocation cost is ______?
Responda
-
O(n)
-
O(1)
-
O(logn)
-
O(nlogn)
-
O(n^2)
Questão 67
Questão
It is possible to implement all recursive algorithms without recursion
Responda
- True
- False
Questão 68
Questão
Set of connections between vertices of a graph is called?
Responda
-
edge
-
vertex
-
roof
-
path
-
cycle path
Questão 69
Questão
Hiding access to data members of a class is called ...
Responda
-
Encapsulation
-
Overloading
-
Overriding
-
Inheritance
-
Polymorphism
Questão 70
Questão
Using a hash table enables us to retrive an item in a __________ time.
Responda
-
constant
-
linear
-
average
-
nlogn
-
logarithmic
Questão 71
Questão
Is it possible to implement multiple interfaces?
Responda
- True
- False
Questão 72
Questão
Sets the element on position index to reference entry
Responda
-
set(index, entry)
-
entry.set(index)
-
index.set(entry)
-
setTo(index, entry)
-
set.index(entry)
Questão 73
Questão
Which of the graph implementation is more efficient in terms of memory usage?
Responda
-
list
-
BFS
-
map
-
matrix
-
set
Questão 74
Questão
In the queue implemented as a LinkedList, poll() function should ...
Responda
-
remove first added item
-
remove last added item
-
play with items
-
remove middle item
-
add new item
Questão 75
Questão
Which function is used to add new item in the queue?
Responda
-
offer()
-
poll()
-
add()
-
suffer()
-
remove()
Questão 76
Questão
Recursive solutions are more beautiful and easy to understand.
Responda
- True
- False
Questão 77
Questão
Which structure is widely used to calculate the value of postfix expression?
Responda
-
Stack
-
Array
-
Set
-
String
-
Queue
Questão 78
Questão
This returns true if the collection contains obj.
Responda
-
contains(obj)
-
goTO(obj)
-
indexF(obj)
-
find(obj)
-
indexOf(obj)
Questão 79
Questão
Redefinition of the method of superclass in a subclass with the same name and number of parameters is...
Responda
-
override
-
overload
-
overbeat
-
overhead
-
upperload
Questão 80
Questão
If you want to call the constructor of superclass you would use ...
Responda
-
super()
-
this()
-
this.
-
super.
-
constructor()
Questão 81
Questão
Element insertion to a Binary Search tree costs?
Responda
-
O(logn)
-
O(1)
-
O(n)
-
O(n^2)
-
O(f(n))
Questão 82
Questão
Distance from the deepest leaf to the root of a tree is called?
Responda
-
height
-
breadth
-
leaf
-
tree
-
depth
Questão 83
Questão
What is the time complexity of adding an item in front of a LinkedList?
Responda
-
O(1)
-
O(n)
-
O(n^2)
-
O(n^3)
-
O(nlogn)
Questão 84
Questão
The collection of abstract methods is called?
Responda
-
interface
-
function
-
abstract class
-
class
-
method
Questão 85
Questão
This method returns a string that textually represents an object.
Responda
-
toString()
-
toGo()
-
toText()
-
equals()
-
hashCode()
Questão 86
Questão
Graph where each edge has a direction is called?
Responda
-
directed
-
wayed
-
mapped
-
strong
-
stricted
Questão 87
Questão
Which of the following is not example of visibility in JAVA.
Responda
-
Eclipsed
-
Public
-
Private
-
Protected
-
Package
Questão 88
Questão
A tree where left child is less and right child is more than its parent called?
Responda
-
Binary Search Tree
-
Binary tree
-
Huffman tree
-
Breadth first search
-
DFS
Questão 89
Questão
How to handle exceptions
Responda
-
try{}catch(){}
-
try{}batch(){}
-
fly{}catch(){}
-
poimai{}menya{}esli{}smozhesh()
-
go{}home()
Questão 90
Questão
Is it possible to inherit from multiple classes?
Responda
- True
- False
Questão 91
Questão
Vertex is ________ to another vertex if there is an edge connecting them.
Responda
-
adjacent
-
brotherhood
-
sibling
-
BFS
-
DIJkstra
Questão 92
Questão
If two or more keys will be encoded to the same index of a hashtable, it is called.
Responda
-
collision
-
duplicate
-
decision
-
error
-
mistake
Questão 93
Questão
Returns entry at the front of a Deque without removing it
Responda
-
peekFirst()
-
pollFirst()
-
popFirst()
-
takeFirst()
-
get(index)
Questão 94
Questão
Complete binary tree where all children must be bigger than parents is ?
Responda
-
minheap
-
maxheap
-
fullheap
-
hiphop
-
treeheap
Questão 95
Questão
Which function return first added item in the queue?
Responda
-
element ()
-
giveMeFirst
-
goBack()
-
first()
-
front()
Questão 96
Questão
Gets the size of the ArrayList
Responda
-
size()
-
sizeOf()
-
length(list)
-
size(list)
-
length
Questão 97
Questão
Traversing graph visiting a start node first, then choose one node that is adjacent to it next.
Responda
-
DFS
-
BFS
-
matrix
-
tree
-
DIjkstra
Questão 98
Questão
The relationship when one class is a subclass of another is called ...
Responda
-
is-a
-
has-a
-
to-c
-
is-b
-
has-b
Questão 99
Questão
Recursive nonlinear data structure that is used to represent data organized in a hirarchy?
Responda
-
tree
-
vector
-
graph
-
arrayList
-
linkedList
Questão 100
Questão
Which of them is not an example of Data Structure
Responda
-
Breadth First Search
-
Graph
-
ArrayList
-
Set
-
Priority Queue
Questão 101
Questão
Two JAVA API implementation of Set and Map are:
Responda
-
tree and hash
-
graph and tree
-
list and hash
-
graph and vector
-
tree and list
Questão 102
Questão
Which of them is not a feature of Collection Interface?
Responda
-
graph
-
set
-
queue
-
vector
-
list
Questão 103
Questão
Indicate two ways of graph implementations
Responda
-
list and matrix
-
tree and hash
-
set and map
-
array and vector
-
queue and stack
Questão 104
Questão
Indicate logarithmic time complexity in terms of big-O notation?
Responda
-
O(logn)
-
O(1)
-
O(n)
-
O(2)
-
O(done)
Questão 105
Questão
What are the two parts of ADT?
Responda
-
Private and Public
-
ArrayList and Vector
-
Parent and Child
-
Int and Float
-
Queue and Stack
Questão 106
Questão
public xxx(int index){
return theData[index];
}
this behaviour is similar to which method of ArrayList class?
Responda
-
get
-
equals
-
set
-
size
-
goHome
Questão 107
Questão
Indicate the relationship of HashtableOpen and Entry classes?
Responda
-
has-a
-
is-a
-
is-b
-
static
-
public
Questão 108
Questão
Which method removes an item on the top of a Stack in JAVA?
Responda
-
pop()
-
peek()
-
hop()
-
drop()
-
remove()
Questão 109
Questão
How to remove item from LinkedList?
Responda
-
change link of prev item to next item of item to be removed
-
go home and cry
-
change link of next item to prev item of item to be removed
-
change link of removing item to prev
-
change link of remobingitem to next
Questão 110
Questão
Find the slowest time
Responda
-
O(n!)
-
O(n)
-
O(2^n)
-
O(100)
-
O(n^4)
Questão 111
Questão
Node of a graph is called?
Responda
-
vertex
-
edge
-
path
-
weight
-
dijkstra
Questão 112
Questão
calculate the value of "4 7 * 20 -"
Responda
-
8
-
136
-
3
-
144
-
1
Questão 113
Questão
Complete binary tree where all children must be smaller than parents is ?
Responda
-
maxheap
-
minheap
-
fullheap
-
hiphop
-
treeheap
Questão 114
Questão
The relationship when one class is defined inside the definition of another is called...
Responda
-
has-a
-
is-a
-
is-b
-
has-b
-
to-c
Questão 115
Questão
Prim's algorithm is used to calculate __________.
Responda
-
the minimum spanning tree of a graph
-
BFS
-
DFS
-
cyclic path
-
direction path
Questão 116
Questão
Which of them has more methods?
Responda
-
subclass
-
superclass
Questão 117
Questão
A ___________ of a node is a tree whose root is a child of that node.
Responda
-
subtree
-
leaf
-
root
-
child
-
parent
Questão 118
Questão
Structured set of data is called _______.
Responda
-
data structure
-
set of data
-
algorithm
-
data pattern
-
design of data
Questão 119
Questão
Circular Array is usually used to implement ...
Responda
-
queue
-
tree
-
stack
-
graph
-
shreck
Questão 120
Questão
int xxx(int x){
if(n==1) return 1;
return x*xxx(x-1);
}
this function calculates
Responda
-
n!
-
fibbonachi
-
x^n
-
2^n
-
x/n
Questão 121
Questão
JAVA API uses ____________ to implement both Set and Map interfaces.
Responda
-
hash table
-
vector
-
tree table
-
arraylist
-
graph
Questão 122
Questão
Average time complexity of Insertion sort is?
Responda
-
O(n^2)
-
O(2^n)
-
O(1)
-
O(logn)
-
O(nlogn)
Questão 123
Questão
What is the time complexity of ArrayList remove(index) method?
Responda
-
O(n)
-
O(n^3)
-
O(1)
-
O(nlogn)
-
O(nxn)
Questão 124
Questão
Does binary search tree contain duplicates?
Responda
-
no
-
yes
-
i have to go
-
i don't know
-
maybe
Questão 125
Questão
for (i<n)
if (a[i] == item)
return i;
This algotithm is similar to ...
Responda
-
linear search
-
deep sort
-
heap sort
-
binary search
-
merge sort
Questão 126
Questão
Would an operating system use stack or queue to determine which print job should be handled next?
Responda
-
queue
-
tree
-
stack
-
set
-
graph
Questão 127
Questão
What is popularly used to traverse SingleLinkedList?
Responda
-
iterator
-
loop and switch
-
interface
-
commutator
-
traversator
Questão 128
Questão
Quadratic probing is usually used to ?
Responda
-
reduce collisions
-
enlarge table size
-
reallocate array
-
for fun
-
calculate x^2
Questão 129
Questão
To apply Dijkstra's algorithm graph should be.
Responda
-
weighted
-
directed
-
isomorphic
-
undirected
-
cyclic
Questão 130
Questão
Inventor of merge sort is ?
Responda
-
John von Neumann
-
John Lennon
-
Van der Sar
-
Mr Merge
-
Professor Sortmerg
Questão 131
Questão
instanceof used to test ...
Responda
-
whether an object belongs to class or not
-
weather object has parent or nor
-
weather is is the biggest object
-
weather object is object or not
-
weather objectplays football or not
Questão 132
Questão
Most sorting algorithm are divided into two basic groups.
Responda
-
fast and slow
-
sort and search
-
best and worst
-
go and play
-
ordered and unordered
Questão 133
Questão
Attempt to convert a string that is not numeric to a number faults ...
Responda
-
NumberFormatException
-
ArithmeticException
-
DoNotSpeakException
-
SDP4IsNotSubjectException
-
BadProgrammerException
Questão 134
Questão
Average time complexity of Heap sort is?
Responda
-
O(nlogn)
-
O(n)
-
O(1)
-
H2O
-
O(n^2)
Questão 135
Questão
A hash table uses hashing to transform an items key into a table index so that iterations, retrievals and deletions can be performed in expected ___________ time.
Responda
-
O(1)
-
O(n)
-
O(n^2)
-
O(logn)
-
O(nlogn)
Questão 136
Questão
Data structure similar to tree but it doesn't have limitation according to number of parents is?
Responda
-
graph
-
tree
-
treeset
-
queue
-
dequeue
Questão 137
Questão
Set of ordered pairs whose element are known as the key and value is ?
Responda
-
map
-
set
-
graph
-
array
-
too easy for me
Questão 138
Questão
Ability of object of one class to act like it is an object of another class is?
Responda
-
Polymorphism
-
Encapsulation
-
Java code
-
Inheritance
-
SLOC(Source line of code)
Questão 139
Questão
A ________ is a special cas of a graph. A ________ is a connected graph that contain no cycles.
Responda
-
tree,tree
-
matrix,list
-
set,map
-
BFS,DFS
-
tree,hash
Questão 140
Questão
What relationship class Node and LinkedList have?
Responda
-
has-a
-
is-a
-
to-c
-
is-b
-
has-b
Questão 141
Questão
Which of the following is recursive algorithm?
Responda
-
quicksort
-
selectionsort
-
insertionsort
-
bubblesort
-
all of them are recursive
Questão 142
Questão
Can we access the element of a set by index?
Responda
-
no
-
yes
-
maybe
Questão 143
Questão
List two ways of organizing hashtable.
Responda
-
open addressing and chaining
-
breadth first search and depth first search
-
key and value
-
arraylist and vector
-
prime's and dijkstra
Questão 144
Questão
This method of a binary tree class return true if tree is a leaf and false otherwise?
Responda
-
isLeaf()
-
isEmpty()
-
noMore()
-
isLast()
-
goHome()
Questão 145
Questão
ADT that enables a user to access information (data) corresponding to a specified key.
Responda
-
map
-
led
-
set
-
queue
-
graph
Questão 146
Questão
An ordered set of instructions is called.
Responda
-
algorithm
-
hello world
-
pseudocode
-
data structure
-
array
Questão 147
Questão
OOP stands for?
Responda
-
Object oriented programming
-
Omar oriented programming
-
Object oriented playing
-
Obstacle oriented programming
-
OOP is the keyword of Java programming and stands for nothing
Questão 148
Questão
Is it possible to traverse contaning of a list this way?
for( int nextInt : aList ){ ... }
Responda
-
yes
-
no
-
maybe
-
i don't know
Questão 149
Questão
Which structure is widely used in finding palindrome problem?
Responda
-
stack
-
queue
-
graph
-
set
-
map
Questão 150
Questão
Adding an item to the beginning of CircularArray costs?
Responda
-
O(1)
-
O(logn)
-
O(n)
-
O(n^2)
-
7 iterations
Questão 151
Questão
What is the attribute of CircularList?
Responda
-
Next of last item referencing to the first item
-
Next of best item referencing to the worst item
-
Next of first item referencing to the last item
-
I need to go home and prepare for this
-
Prev of last item referencing to last item
Questão 152
Questão
Attempt to access array element using index less than 0 faults ...
Responda
-
ArrayIndexOutOfBoundsException
-
InputMismatchException
-
ArithmeticException
-
MCDonerException
-
GoHomeException
Questão 153
Questão
What does method empty return for empty stack?
Responda
-
true
-
false
-
nothing
-
empty
-
hello
Questão 154
Questão
Elements of a List are accessed by means of an __________
Responda
-
index
-
position
-
loop
-
switch
-
book
Questão 155
Questão
If we call remove() function for the queue, which item will be removed?
Responda
-
first
-
second
-
middle
-
third
-
last
Questão 156
Questão
This method associates specified value with the specified key in the map.
Responda
-
put(key, value)
-
set(key, value)
-
get(key, value)
-
associate(key, value)
-
key.set(value)
Questão 157
Questão
Indicate linear time complexity in terms of big-O notation?
Responda
-
O(n)
-
O(loglogn)
-
O(logn)
-
O(n^2)
-
O(n^3)
Questão 158
Questão
A tree where all nodes should have 2 children and leaves have no children is called?
Responda
-
full binary tree
-
binary tree
-
unary tree
-
general tree
Questão 159
Questão
Insert and remove items from a heap costs?
Responda
-
O(logn)
-
O(nlogn)
-
O(n)
-
O(n^2)
-
O(1)
Questão 160
Questão
What is the time complexity of adding element in the beginning of ArrayList?
Responda
-
O(n)
-
O(nlogn)
-
O(logn)
-
O(n^2)
-
O(25)
Questão 161
Questão
Adjacent matrix representing undirected graph should be?
Responda
-
symmetric
-
triangular
-
linear
-
diagonal
-
orthognal
Questão 162
Questão
Which of the following in java is very similar to "contract"?
Responda
-
Interface implementation
-
Class overriding
-
Class inheritance
-
Dancing in a queue
-
Method overloading
Questão 163
Questão
Where new item added in the queue?
Responda
-
to the end
-
position chosen randomly
-
in the middle
-
in the beginning
-
it is impossible to add new item in the queue
Questão 164
Questão
Which method searches for target and returns its position in LinkedList?
Responda
-
indexOf(target)
-
get(target)
-
set(target)
-
go(target)
-
equal(target)
Questão 165
Questão
A ___________ path is a simple path in which only the first and last items are the same.
Responda
-
cycle
-
tour
-
mapped
-
trip
-
looped
Questão 166
Questão
Graph where each edge has a direction is called?
Responda
-
directed
-
sticked
-
strong
-
wayed
-
mapped
Questão 167
Questão
Redefinition of method with the same name but different number of parameters is called...
Responda
-
overload
-
override
-
inheritance
-
polymorphism
-
encapsulation
Questão 168
Questão
Recursive implementation works faster than lopped one.
Responda
- True
- False
Questão 169
Questão
If there are no abstract methods in the class we call that class ...
Responda
-
Actual Class
-
Abstract Class
-
Non abstract Class
-
Super Class
-
Funny Class
Questão 170
Questão
Which part is not accessible to user?
Responda
-
Private
-
Based
-
Controlled
-
Shifted
-
Public
Questão 171
Questão
What is the time complexity of insert(index) method in ArrayList
Responda
-
O(n)
-
O(logn)
-
O(1)
-
O(n^2)
-
O(100)
Questão 172
Questão
What is the feature of Deque?
Responda
-
cheap element addition and removal from the beginning
-
cheap element addition and removal from the end
-
cheap element addition and removal from the middle
-
removal
-
addition
Questão 173
Questão
The function that calls itself is called ...
Responda
-
recursive function
-
functional function
-
defensive function
-
overloaded function
-
impressive function
Questão 174
Questão
int xxx(int x, int y, int z){
if(z==1){return 1;}
return xxx(x+y, x, z-1);
}
this function is
Responda
-
Fibbonachi
-
it is trash function
-
x^n
-
n!
-
2^n
Questão 175
Questão
What is the time complexity of Linear Search algorithm?
Responda
-
O(n)
-
O(nlogn)
-
O(1)
-
O(n^2)
-
O(logn)
Questão 176
Questão
The node of a tree without children is called ... ?
Responda
-
leaf
-
tree
-
siblin
-
root
-
subtree
Questão 177
Questão
Tree where every item must have at most 2 children is called?
Responda
-
Binary Tree
-
General Tree
-
Huffman Tree
-
Generic Tree
-
Unary Tree
Questão 178
Questão
What is the benefit of encoding letters trough Huffman tree.
Responda
-
earning space
-
more beautiful
-
just for fun
-
it is simple
-
it is smart
Questão 179
Questão
A set view of a map can be obtained through method_______?
Responda
-
entrySet
-
emptySet
-
setView
-
viewAsSet
-
goAhead
Questão 180
Questão
You apply method ____________ to set view to get an object that facilitates sequential access to the Map elements.
Responda
-
iterator
-
preorder
-
accessor
-
traversal
-
posorder
Questão 181
Questão
If you want to call data member of superclass you would use ...
Responda
-
super.
-
this.
-
this()
-
super()
-
method
Questão 182
Questão
In a Huffman tree, the item with the lowest frequency of occurrence will have the ___________ code.
Responda
-
shortest
-
deepest
-
longest
-
easiest
-
binary
Questão 183
Questão
A Stack is __________ in _________ out data structure.
Responda
-
last,first
-
first,first
-
back, top
-
end,end
-
front,front
Quer criar seus próprios Quizzes gratuitos com a GoConqr? Saiba mais.