CS_DATA_STRUCT

Descripción

Test sobre CS_DATA_STRUCT, creado por Dina Kim el 26/03/2019.
Dina  Kim
Test por Dina Kim, actualizado hace más de 1 año
Dina  Kim
Creado por Dina Kim hace más de 5 años
115
4

Resumen del Recurso

Pregunta 1

Pregunta
Inheritance is ...
Respuesta
  • 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

Pregunta 2

Pregunta
Qucksort is implemented recursively
Respuesta
  • True
  • False

Pregunta 3

Pregunta
Waiting line of people is similar to which data structure?
Respuesta
  • Queue
  • LinkedList
  • Stack
  • Tree
  • Graph

Pregunta 4

Pregunta
Which of the graph implementations is more simple?
Respuesta
  • Matrix
  • map
  • set
  • list

Pregunta 5

Pregunta
To use Binary Search items should be ...
Respuesta
  • ordereed
  • matched
  • divorced
  • traversed
  • beaten

Pregunta 6

Pregunta
Reference "rear" of CircularArray is usually indicates ...
Respuesta
  • last added item
  • first added item
  • secondly added item
  • middle of array
  • top of a stack

Pregunta 7

Pregunta
If there is no path path from vertex to any other vertex that graph is considered to be ?
Respuesta
  • unconnected
  • undirected
  • DFS
  • BFS
  • weighted

Pregunta 8

Pregunta
Can we implement the queue using LinkedList?
Respuesta
  • yes
  • no
  • i don't know
  • maybe
  • i need to learn more about this

Pregunta 9

Pregunta
What is not perfect in this code: ave = sum / count;
Respuesta
  • 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

Pregunta 10

Pregunta
Returns the reference to the element at position index
Respuesta
  • get(index)
  • has(index)
  • goTo(index)
  • fly(index)
  • set(index)

Pregunta 11

Pregunta
Indicate exponential time complexity in terms of big-O notation?
Respuesta
  • O(2^n)
  • O(logn)
  • O(n^4)
  • O(nlogn)
  • O(n)

Pregunta 12

Pregunta
Traversing graph visiting a start node first, then all nodes that are adjacent to it next.
Respuesta
  • BFS
  • DFS
  • DIjkstra
  • matrix
  • preorder

Pregunta 13

Pregunta
A ________ graph is one where [E] is much less than [V]^2.
Respuesta
  • sprase
  • dense
  • path
  • hence
  • directed

Pregunta 14

Pregunta
Which method returns an object at the top of a Stack in JAVA?
Respuesta
  • peek()
  • front()
  • top()
  • pop()
  • poll()

Pregunta 15

Pregunta
The ____________ algorithm finds minimum spanning tree for a graph.
Respuesta
  • prim
  • DFS
  • matrix
  • Dijkstra
  • BFS

Pregunta 16

Pregunta
traverese left subtree, Visit root node, traverse right subtree traversal is called?
Respuesta
  • inorder
  • postorder
  • preorder

Pregunta 17

Pregunta
Data structure based on BST where all items are sorted and unique is?
Respuesta
  • treeSet
  • tree
  • treeMap
  • vector
  • graph

Pregunta 18

Pregunta
Graph is considered to be ___________ if there is a path from each vertex to any other vertex.
Respuesta
  • connected
  • weighted
  • directed
  • unweighted
  • unconnected

Pregunta 19

Pregunta
What is the difference between ArrayList and Vector?
Respuesta
  • 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

Pregunta 20

Pregunta
Visit root node, traverese left subtree, traverse right subtree traversal is called?
Respuesta
  • preorder
  • inorder
  • postorder

Pregunta 21

Pregunta
First in last out structure is ...
Respuesta
  • stack
  • graph
  • queue
  • tree

Pregunta 22

Pregunta
Which container is not appropriate to implement Stack in Java?
Respuesta
  • graph
  • array
  • list
  • vector

Pregunta 23

Pregunta
Average time complexity of Bubble sort is?
Respuesta
  • O(n^2)
  • O(nlogn)
  • O(logn)
  • O(1)
  • O(n^3)

Pregunta 24

Pregunta
Every class has __________ as a superclass.
Respuesta
  • object
  • main
  • string
  • java
  • subject

Pregunta 25

Pregunta
traverse left subtree, traverse right subtree, visit root node traversal is called ?
Respuesta
  • postorder
  • preorder
  • inorder

Pregunta 26

Pregunta
A ___________ tree is a binary tree used to store a code that facilitates file compression.
Respuesta
  • Huffman
  • BFS
  • DFS
  • Dijkstra
  • heap

Pregunta 27

Pregunta
Distance from the root to its deepest leaf is known as __________ of a tree?
Respuesta
  • depth
  • height
  • path
  • subtree
  • root

Pregunta 28

Pregunta
The node of a tree without children is called ... ?
Respuesta
  • leaf
  • sibling
  • root
  • tree
  • subtree

Pregunta 29

Pregunta
Which structure is better to use when printing many documents from multiple computers at one printer?
Respuesta
  • queue
  • set
  • tree
  • stack
  • graph

Pregunta 30

Pregunta
A collision occurs when ... ?
Respuesta
  • 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

Pregunta 31

Pregunta
A __________ graph is one in which [E] is close to but less than [V]^2.
Respuesta
  • dense
  • sprase
  • directed
  • dark
  • hence

Pregunta 32

Pregunta
Average time complexity of Merge sort is?
Respuesta
  • O(nlogn)
  • O(n^2)
  • O(n^3)
  • O(n)
  • O(logn)

Pregunta 33

Pregunta
The _________ is used to implement the special kind of a queue called priority queue.
Respuesta
  • heap
  • BFS
  • DFS
  • BST
  • deap

Pregunta 34

Pregunta
Average time complexity of Shell sort is?
Respuesta
  • O(n^1.25)
  • O(1)
  • O(n)
  • O(logn)
  • O(n^2)

Pregunta 35

Pregunta
If there is at least one abstract method in a class, that class is called ...
Respuesta
  • abstract class
  • vanish class
  • tired class
  • recursive class
  • general class

Pregunta 36

Pregunta
Finding the shortest path algorithm is called?
Respuesta
  • Dijkstra
  • DFS
  • BFS
  • Binary Search

Pregunta 37

Pregunta
Which part is accessible to user?
Respuesta
  • public
  • private
  • protected
  • interacted
  • social

Pregunta 38

Pregunta
Dijkstra's algorithm use ______ algorithm to traverse all nodes.
Respuesta
  • BFS
  • DFS
  • matrix
  • tree
  • Prime's

Pregunta 39

Pregunta
A list can _________ or _________ as elements added or removed.
Respuesta
  • grow, shrink
  • increase, grow
  • fly, sit
  • decrease, think
  • flow, shrink

Pregunta 40

Pregunta
What is the time complexity of recursive Binary Search algorithm?
Respuesta
  • O(logn)
  • O(NxM)
  • O(nlogn)
  • O(n)

Pregunta 41

Pregunta
Why do we need BFS and DFS algorithms?
Respuesta
  • to traverse a graph
  • to measure graphh
  • to remove an item from graph
  • to find the way
  • to add new item in a graph

Pregunta 42

Pregunta
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.
Respuesta
  • quick
  • heap
  • merge
  • selection
  • bubble

Pregunta 43

Pregunta
Show the method which exists in DoubleLinkedList and not exist in SingleLinkedList?
Respuesta
  • previous()
  • next()
  • constructor
  • hasBefore()
  • hasNext()

Pregunta 44

Pregunta
What determines whether you should use quadratic sort or a logarithmic sort algorithm?
Respuesta
  • array size
  • array values
  • swapping conditions
  • array type
  • array index

Pregunta 45

Pregunta
The Collection is a _________ of a List
Respuesta
  • superinterface
  • node
  • interface
  • parent
  • father

Pregunta 46

Pregunta
The _________ level of a node is a measure of its distance from the root.
Respuesta
  • level
  • distance
  • parent
  • father

Pregunta 47

Pregunta
A queue _________ in ___________ out data structure.
Respuesta
  • first, first
  • set,get
  • last,last
  • first,last
  • last,first

Pregunta 48

Pregunta
for(int i=0; i< size; i++){ if(theData[i]==entry){ return i; } return -1; } This method is similar to which method of ArrayList?
Respuesta
  • indexOf(entry)
  • get(entry)
  • equals(entry)
  • set(entry)

Pregunta 49

Pregunta
______________ exception is an error normally not due to programmer.
Respuesta
  • checked
  • unchecked
  • cracked
  • hacked

Pregunta 50

Pregunta
______________ exception is an error normally due to programmer.
Respuesta
  • unchecked
  • checked
  • hacked
  • cracked

Pregunta 51

Pregunta
Distance from the deepest leaf to the root of a tree is called?
Respuesta
  • height
  • depth
  • leaf
  • tree
  • breadth

Pregunta 52

Pregunta
ListIterator and Iterator is the same thing in JAVA.
Respuesta
  • True
  • False

Pregunta 53

Pregunta
The function that calls itself is called ...
Respuesta
  • recursive function
  • functional function
  • defensive function
  • impressive function

Pregunta 54

Pregunta
If you want to call different constructor of current class you would use ...
Respuesta
  • this()
  • this.
  • super.
  • super()

Pregunta 55

Pregunta
Which method adds an item on the top of the Stack in JAVA?
Respuesta
  • push()
  • peek()
  • top()
  • add()

Pregunta 56

Pregunta
In open addressing you can not remove an item to be deleted, so what should you do instead?
Respuesta
  • mark as deleted flag
  • go home and dance
  • delete and save in temporary list
  • change its place with another item
  • do nothing

Pregunta 57

Pregunta
What is the best time complexity of recursively finding fibbonachi nuber?
Respuesta
  • O(n)
  • H2O
  • O(n^2)
  • O(logn)
  • O(1)

Pregunta 58

Pregunta
A __________ is a sequence of vertices in which each successive vertex is connected to its predecessor. (Graphs)
Respuesta
  • path
  • graph
  • route
  • cycle
  • weight

Pregunta 59

Pregunta
Searching a binary search tree costs?
Respuesta
  • O(logn)
  • O(n)
  • O(1)
  • O(n^2)

Pregunta 60

Pregunta
Average time complexity of Selection sort is?
Respuesta
  • O(n^2)
  • O(nlogn)
  • O(logn)
  • O(n)

Pregunta 61

Pregunta
Full name of this course is ?
Respuesta
  • Algorithms and Data Structures
  • SDP4
  • Programming with Java
  • Basic circuit theory
  • Algoritmization and programming language

Pregunta 62

Pregunta
In ___________ graph is {v, u} is edge then {u, v} is not necessary an edge.
Respuesta
  • directed
  • undirected
  • weighted
  • connected

Pregunta 63

Pregunta
Average time complexity of Quick sort is?
Respuesta
  • O(nlogn)
  • O(logn)
  • O(n)
  • O(1)

Pregunta 64

Pregunta
Ideal data structure for a contact list is ?
Respuesta
  • map
  • vector
  • graph
  • tree
  • set

Pregunta 65

Pregunta
Each recursive function has two cases ________ and _________.
Respuesta
  • base, recursive
  • continued, stopped
  • looped, switched
  • lelik, bolik
  • base,defensive

Pregunta 66

Pregunta
Array reallocation cost is ______?
Respuesta
  • O(n)
  • O(1)
  • O(logn)
  • O(nlogn)
  • O(n^2)

Pregunta 67

Pregunta
It is possible to implement all recursive algorithms without recursion
Respuesta
  • True
  • False

Pregunta 68

Pregunta
Set of connections between vertices of a graph is called?
Respuesta
  • edge
  • vertex
  • roof
  • path
  • cycle path

Pregunta 69

Pregunta
Hiding access to data members of a class is called ...
Respuesta
  • Encapsulation
  • Overloading
  • Overriding
  • Inheritance
  • Polymorphism

Pregunta 70

Pregunta
Using a hash table enables us to retrive an item in a __________ time.
Respuesta
  • constant
  • linear
  • average
  • nlogn
  • logarithmic

Pregunta 71

Pregunta
Is it possible to implement multiple interfaces?
Respuesta
  • True
  • False

Pregunta 72

Pregunta
Sets the element on position index to reference entry
Respuesta
  • set(index, entry)
  • entry.set(index)
  • index.set(entry)
  • setTo(index, entry)
  • set.index(entry)

Pregunta 73

Pregunta
Which of the graph implementation is more efficient in terms of memory usage?
Respuesta
  • list
  • BFS
  • map
  • matrix
  • set

Pregunta 74

Pregunta
In the queue implemented as a LinkedList, poll() function should ...
Respuesta
  • remove first added item
  • remove last added item
  • play with items
  • remove middle item
  • add new item

Pregunta 75

Pregunta
Which function is used to add new item in the queue?
Respuesta
  • offer()
  • poll()
  • add()
  • suffer()
  • remove()

Pregunta 76

Pregunta
Recursive solutions are more beautiful and easy to understand.
Respuesta
  • True
  • False

Pregunta 77

Pregunta
Which structure is widely used to calculate the value of postfix expression?
Respuesta
  • Stack
  • Array
  • Set
  • String
  • Queue

Pregunta 78

Pregunta
This returns true if the collection contains obj.
Respuesta
  • contains(obj)
  • goTO(obj)
  • indexF(obj)
  • find(obj)
  • indexOf(obj)

Pregunta 79

Pregunta
Redefinition of the method of superclass in a subclass with the same name and number of parameters is...
Respuesta
  • override
  • overload
  • overbeat
  • overhead
  • upperload

Pregunta 80

Pregunta
If you want to call the constructor of superclass you would use ...
Respuesta
  • super()
  • this()
  • this.
  • super.
  • constructor()

Pregunta 81

Pregunta
Element insertion to a Binary Search tree costs?
Respuesta
  • O(logn)
  • O(1)
  • O(n)
  • O(n^2)
  • O(f(n))

Pregunta 82

Pregunta
Distance from the deepest leaf to the root of a tree is called?
Respuesta
  • height
  • breadth
  • leaf
  • tree
  • depth

Pregunta 83

Pregunta
What is the time complexity of adding an item in front of a LinkedList?
Respuesta
  • O(1)
  • O(n)
  • O(n^2)
  • O(n^3)
  • O(nlogn)

Pregunta 84

Pregunta
The collection of abstract methods is called?
Respuesta
  • interface
  • function
  • abstract class
  • class
  • method

Pregunta 85

Pregunta
This method returns a string that textually represents an object.
Respuesta
  • toString()
  • toGo()
  • toText()
  • equals()
  • hashCode()

Pregunta 86

Pregunta
Graph where each edge has a direction is called?
Respuesta
  • directed
  • wayed
  • mapped
  • strong
  • stricted

Pregunta 87

Pregunta
Which of the following is not example of visibility in JAVA.
Respuesta
  • Eclipsed
  • Public
  • Private
  • Protected
  • Package

Pregunta 88

Pregunta
A tree where left child is less and right child is more than its parent called?
Respuesta
  • Binary Search Tree
  • Binary tree
  • Huffman tree
  • Breadth first search
  • DFS

Pregunta 89

Pregunta
How to handle exceptions
Respuesta
  • try{}catch(){}
  • try{}batch(){}
  • fly{}catch(){}
  • poimai{}menya{}esli{}smozhesh()
  • go{}home()

Pregunta 90

Pregunta
Is it possible to inherit from multiple classes?
Respuesta
  • True
  • False

Pregunta 91

Pregunta
Vertex is ________ to another vertex if there is an edge connecting them.
Respuesta
  • adjacent
  • brotherhood
  • sibling
  • BFS
  • DIJkstra

Pregunta 92

Pregunta
If two or more keys will be encoded to the same index of a hashtable, it is called.
Respuesta
  • collision
  • duplicate
  • decision
  • error
  • mistake

Pregunta 93

Pregunta
Returns entry at the front of a Deque without removing it
Respuesta
  • peekFirst()
  • pollFirst()
  • popFirst()
  • takeFirst()
  • get(index)

Pregunta 94

Pregunta
Complete binary tree where all children must be bigger than parents is ?
Respuesta
  • minheap
  • maxheap
  • fullheap
  • hiphop
  • treeheap

Pregunta 95

Pregunta
Which function return first added item in the queue?
Respuesta
  • element ()
  • giveMeFirst
  • goBack()
  • first()
  • front()

Pregunta 96

Pregunta
Gets the size of the ArrayList
Respuesta
  • size()
  • sizeOf()
  • length(list)
  • size(list)
  • length

Pregunta 97

Pregunta
Traversing graph visiting a start node first, then choose one node that is adjacent to it next.
Respuesta
  • DFS
  • BFS
  • matrix
  • tree
  • DIjkstra

Pregunta 98

Pregunta
The relationship when one class is a subclass of another is called ...
Respuesta
  • is-a
  • has-a
  • to-c
  • is-b
  • has-b

Pregunta 99

Pregunta
Recursive nonlinear data structure that is used to represent data organized in a hirarchy?
Respuesta
  • tree
  • vector
  • graph
  • arrayList
  • linkedList

Pregunta 100

Pregunta
Which of them is not an example of Data Structure
Respuesta
  • Breadth First Search
  • Graph
  • ArrayList
  • Set
  • Priority Queue

Pregunta 101

Pregunta
Two JAVA API implementation of Set and Map are:
Respuesta
  • tree and hash
  • graph and tree
  • list and hash
  • graph and vector
  • tree and list

Pregunta 102

Pregunta
Which of them is not a feature of Collection Interface?
Respuesta
  • graph
  • set
  • queue
  • vector
  • list

Pregunta 103

Pregunta
Indicate two ways of graph implementations
Respuesta
  • list and matrix
  • tree and hash
  • set and map
  • array and vector
  • queue and stack

Pregunta 104

Pregunta
Indicate logarithmic time complexity in terms of big-O notation?
Respuesta
  • O(logn)
  • O(1)
  • O(n)
  • O(2)
  • O(done)

Pregunta 105

Pregunta
What are the two parts of ADT?
Respuesta
  • Private and Public
  • ArrayList and Vector
  • Parent and Child
  • Int and Float
  • Queue and Stack

Pregunta 106

Pregunta
public xxx(int index){ return theData[index]; } this behaviour is similar to which method of ArrayList class?
Respuesta
  • get
  • equals
  • set
  • size
  • goHome

Pregunta 107

Pregunta
Indicate the relationship of HashtableOpen and Entry classes?
Respuesta
  • has-a
  • is-a
  • is-b
  • static
  • public

Pregunta 108

Pregunta
Which method removes an item on the top of a Stack in JAVA?
Respuesta
  • pop()
  • peek()
  • hop()
  • drop()
  • remove()

Pregunta 109

Pregunta
How to remove item from LinkedList?
Respuesta
  • 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

Pregunta 110

Pregunta
Find the slowest time
Respuesta
  • O(n!)
  • O(n)
  • O(2^n)
  • O(100)
  • O(n^4)

Pregunta 111

Pregunta
Node of a graph is called?
Respuesta
  • vertex
  • edge
  • path
  • weight
  • dijkstra

Pregunta 112

Pregunta
calculate the value of "4 7 * 20 -"
Respuesta
  • 8
  • 136
  • 3
  • 144
  • 1

Pregunta 113

Pregunta
Complete binary tree where all children must be smaller than parents is ?
Respuesta
  • maxheap
  • minheap
  • fullheap
  • hiphop
  • treeheap

Pregunta 114

Pregunta
The relationship when one class is defined inside the definition of another is called...
Respuesta
  • has-a
  • is-a
  • is-b
  • has-b
  • to-c

Pregunta 115

Pregunta
Prim's algorithm is used to calculate __________.
Respuesta
  • the minimum spanning tree of a graph
  • BFS
  • DFS
  • cyclic path
  • direction path

Pregunta 116

Pregunta
Which of them has more methods?
Respuesta
  • subclass
  • superclass

Pregunta 117

Pregunta
A ___________ of a node is a tree whose root is a child of that node.
Respuesta
  • subtree
  • leaf
  • root
  • child
  • parent

Pregunta 118

Pregunta
Structured set of data is called _______.
Respuesta
  • data structure
  • set of data
  • algorithm
  • data pattern
  • design of data

Pregunta 119

Pregunta
Circular Array is usually used to implement ...
Respuesta
  • queue
  • tree
  • stack
  • graph
  • shreck

Pregunta 120

Pregunta
int xxx(int x){ if(n==1) return 1; return x*xxx(x-1); } this function calculates
Respuesta
  • n!
  • fibbonachi
  • x^n
  • 2^n
  • x/n

Pregunta 121

Pregunta
JAVA API uses ____________ to implement both Set and Map interfaces.
Respuesta
  • hash table
  • vector
  • tree table
  • arraylist
  • graph

Pregunta 122

Pregunta
Average time complexity of Insertion sort is?
Respuesta
  • O(n^2)
  • O(2^n)
  • O(1)
  • O(logn)
  • O(nlogn)

Pregunta 123

Pregunta
What is the time complexity of ArrayList remove(index) method?
Respuesta
  • O(n)
  • O(n^3)
  • O(1)
  • O(nlogn)
  • O(nxn)

Pregunta 124

Pregunta
Does binary search tree contain duplicates?
Respuesta
  • no
  • yes
  • i have to go
  • i don't know
  • maybe

Pregunta 125

Pregunta
for (i<n) if (a[i] == item) return i; This algotithm is similar to ...
Respuesta
  • linear search
  • deep sort
  • heap sort
  • binary search
  • merge sort

Pregunta 126

Pregunta
Would an operating system use stack or queue to determine which print job should be handled next?
Respuesta
  • queue
  • tree
  • stack
  • set
  • graph

Pregunta 127

Pregunta
What is popularly used to traverse SingleLinkedList?
Respuesta
  • iterator
  • loop and switch
  • interface
  • commutator
  • traversator

Pregunta 128

Pregunta
Quadratic probing is usually used to ?
Respuesta
  • reduce collisions
  • enlarge table size
  • reallocate array
  • for fun
  • calculate x^2

Pregunta 129

Pregunta
To apply Dijkstra's algorithm graph should be.
Respuesta
  • weighted
  • directed
  • isomorphic
  • undirected
  • cyclic

Pregunta 130

Pregunta
Inventor of merge sort is ?
Respuesta
  • John von Neumann
  • John Lennon
  • Van der Sar
  • Mr Merge
  • Professor Sortmerg

Pregunta 131

Pregunta
instanceof used to test ...
Respuesta
  • 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

Pregunta 132

Pregunta
Most sorting algorithm are divided into two basic groups.
Respuesta
  • fast and slow
  • sort and search
  • best and worst
  • go and play
  • ordered and unordered

Pregunta 133

Pregunta
Attempt to convert a string that is not numeric to a number faults ...
Respuesta
  • NumberFormatException
  • ArithmeticException
  • DoNotSpeakException
  • SDP4IsNotSubjectException
  • BadProgrammerException

Pregunta 134

Pregunta
Average time complexity of Heap sort is?
Respuesta
  • O(nlogn)
  • O(n)
  • O(1)
  • H2O
  • O(n^2)

Pregunta 135

Pregunta
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.
Respuesta
  • O(1)
  • O(n)
  • O(n^2)
  • O(logn)
  • O(nlogn)

Pregunta 136

Pregunta
Data structure similar to tree but it doesn't have limitation according to number of parents is?
Respuesta
  • graph
  • tree
  • treeset
  • queue
  • dequeue

Pregunta 137

Pregunta
Set of ordered pairs whose element are known as the key and value is ?
Respuesta
  • map
  • set
  • graph
  • array
  • too easy for me

Pregunta 138

Pregunta
Ability of object of one class to act like it is an object of another class is?
Respuesta
  • Polymorphism
  • Encapsulation
  • Java code
  • Inheritance
  • SLOC(Source line of code)

Pregunta 139

Pregunta
A ________ is a special cas of a graph. A ________ is a connected graph that contain no cycles.
Respuesta
  • tree,tree
  • matrix,list
  • set,map
  • BFS,DFS
  • tree,hash

Pregunta 140

Pregunta
What relationship class Node and LinkedList have?
Respuesta
  • has-a
  • is-a
  • to-c
  • is-b
  • has-b

Pregunta 141

Pregunta
Which of the following is recursive algorithm?
Respuesta
  • quicksort
  • selectionsort
  • insertionsort
  • bubblesort
  • all of them are recursive

Pregunta 142

Pregunta
Can we access the element of a set by index?
Respuesta
  • no
  • yes
  • maybe

Pregunta 143

Pregunta
List two ways of organizing hashtable.
Respuesta
  • open addressing and chaining
  • breadth first search and depth first search
  • key and value
  • arraylist and vector
  • prime's and dijkstra

Pregunta 144

Pregunta
This method of a binary tree class return true if tree is a leaf and false otherwise?
Respuesta
  • isLeaf()
  • isEmpty()
  • noMore()
  • isLast()
  • goHome()

Pregunta 145

Pregunta
ADT that enables a user to access information (data) corresponding to a specified key.
Respuesta
  • map
  • led
  • set
  • queue
  • graph

Pregunta 146

Pregunta
An ordered set of instructions is called.
Respuesta
  • algorithm
  • hello world
  • pseudocode
  • data structure
  • array

Pregunta 147

Pregunta
OOP stands for?
Respuesta
  • Object oriented programming
  • Omar oriented programming
  • Object oriented playing
  • Obstacle oriented programming
  • OOP is the keyword of Java programming and stands for nothing

Pregunta 148

Pregunta
Is it possible to traverse contaning of a list this way? for( int nextInt : aList ){ ... }
Respuesta
  • yes
  • no
  • maybe
  • i don't know

Pregunta 149

Pregunta
Which structure is widely used in finding palindrome problem?
Respuesta
  • stack
  • queue
  • graph
  • set
  • map

Pregunta 150

Pregunta
Adding an item to the beginning of CircularArray costs?
Respuesta
  • O(1)
  • O(logn)
  • O(n)
  • O(n^2)
  • 7 iterations

Pregunta 151

Pregunta
What is the attribute of CircularList?
Respuesta
  • 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

Pregunta 152

Pregunta
Attempt to access array element using index less than 0 faults ...
Respuesta
  • ArrayIndexOutOfBoundsException
  • InputMismatchException
  • ArithmeticException
  • MCDonerException
  • GoHomeException

Pregunta 153

Pregunta
What does method empty return for empty stack?
Respuesta
  • true
  • false
  • nothing
  • empty
  • hello

Pregunta 154

Pregunta
Elements of a List are accessed by means of an __________
Respuesta
  • index
  • position
  • loop
  • switch
  • book

Pregunta 155

Pregunta
If we call remove() function for the queue, which item will be removed?
Respuesta
  • first
  • second
  • middle
  • third
  • last

Pregunta 156

Pregunta
This method associates specified value with the specified key in the map.
Respuesta
  • put(key, value)
  • set(key, value)
  • get(key, value)
  • associate(key, value)
  • key.set(value)

Pregunta 157

Pregunta
Indicate linear time complexity in terms of big-O notation?
Respuesta
  • O(n)
  • O(loglogn)
  • O(logn)
  • O(n^2)
  • O(n^3)

Pregunta 158

Pregunta
A tree where all nodes should have 2 children and leaves have no children is called?
Respuesta
  • full binary tree
  • binary tree
  • unary tree
  • general tree

Pregunta 159

Pregunta
Insert and remove items from a heap costs?
Respuesta
  • O(logn)
  • O(nlogn)
  • O(n)
  • O(n^2)
  • O(1)

Pregunta 160

Pregunta
What is the time complexity of adding element in the beginning of ArrayList?
Respuesta
  • O(n)
  • O(nlogn)
  • O(logn)
  • O(n^2)
  • O(25)

Pregunta 161

Pregunta
Adjacent matrix representing undirected graph should be?
Respuesta
  • symmetric
  • triangular
  • linear
  • diagonal
  • orthognal

Pregunta 162

Pregunta
Which of the following in java is very similar to "contract"?
Respuesta
  • Interface implementation
  • Class overriding
  • Class inheritance
  • Dancing in a queue
  • Method overloading

Pregunta 163

Pregunta
Where new item added in the queue?
Respuesta
  • to the end
  • position chosen randomly
  • in the middle
  • in the beginning
  • it is impossible to add new item in the queue

Pregunta 164

Pregunta
Which method searches for target and returns its position in LinkedList?
Respuesta
  • indexOf(target)
  • get(target)
  • set(target)
  • go(target)
  • equal(target)

Pregunta 165

Pregunta
A ___________ path is a simple path in which only the first and last items are the same.
Respuesta
  • cycle
  • tour
  • mapped
  • trip
  • looped

Pregunta 166

Pregunta
Graph where each edge has a direction is called?
Respuesta
  • directed
  • sticked
  • strong
  • wayed
  • mapped

Pregunta 167

Pregunta
Redefinition of method with the same name but different number of parameters is called...
Respuesta
  • overload
  • override
  • inheritance
  • polymorphism
  • encapsulation

Pregunta 168

Pregunta
Recursive implementation works faster than lopped one.
Respuesta
  • True
  • False

Pregunta 169

Pregunta
If there are no abstract methods in the class we call that class ...
Respuesta
  • Actual Class
  • Abstract Class
  • Non abstract Class
  • Super Class
  • Funny Class

Pregunta 170

Pregunta
Which part is not accessible to user?
Respuesta
  • Private
  • Based
  • Controlled
  • Shifted
  • Public

Pregunta 171

Pregunta
What is the time complexity of insert(index) method in ArrayList
Respuesta
  • O(n)
  • O(logn)
  • O(1)
  • O(n^2)
  • O(100)

Pregunta 172

Pregunta
What is the feature of Deque?
Respuesta
  • 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

Pregunta 173

Pregunta
The function that calls itself is called ...
Respuesta
  • recursive function
  • functional function
  • defensive function
  • overloaded function
  • impressive function

Pregunta 174

Pregunta
int xxx(int x, int y, int z){ if(z==1){return 1;} return xxx(x+y, x, z-1); } this function is
Respuesta
  • Fibbonachi
  • it is trash function
  • x^n
  • n!
  • 2^n

Pregunta 175

Pregunta
What is the time complexity of Linear Search algorithm?
Respuesta
  • O(n)
  • O(nlogn)
  • O(1)
  • O(n^2)
  • O(logn)

Pregunta 176

Pregunta
The node of a tree without children is called ... ?
Respuesta
  • leaf
  • tree
  • siblin
  • root
  • subtree

Pregunta 177

Pregunta
Tree where every item must have at most 2 children is called?
Respuesta
  • Binary Tree
  • General Tree
  • Huffman Tree
  • Generic Tree
  • Unary Tree

Pregunta 178

Pregunta
What is the benefit of encoding letters trough Huffman tree.
Respuesta
  • earning space
  • more beautiful
  • just for fun
  • it is simple
  • it is smart

Pregunta 179

Pregunta
A set view of a map can be obtained through method_______?
Respuesta
  • entrySet
  • emptySet
  • setView
  • viewAsSet
  • goAhead

Pregunta 180

Pregunta
You apply method ____________ to set view to get an object that facilitates sequential access to the Map elements.
Respuesta
  • iterator
  • preorder
  • accessor
  • traversal
  • posorder

Pregunta 181

Pregunta
If you want to call data member of superclass you would use ...
Respuesta
  • super.
  • this.
  • this()
  • super()
  • method

Pregunta 182

Pregunta
In a Huffman tree, the item with the lowest frequency of occurrence will have the ___________ code.
Respuesta
  • shortest
  • deepest
  • longest
  • easiest
  • binary

Pregunta 183

Pregunta
A Stack is __________ in _________ out data structure.
Respuesta
  • last,first
  • first,first
  • back, top
  • end,end
  • front,front
Mostrar resumen completo Ocultar resumen completo

Similar

State & Local Govt - Budgetary Accounting
turquoise_cat
Liberalism Mindmap
floragair
3. Describe the state of nature for Hobbes, Locke, and Rousseau.
Elisabeth Morell
Woody, Alternate, Simple, Families F-R
Wes Smalley
types of economy
Jesse McNab
body parts and sickness
Ambre Badipi
War on Terror
Wesley Spearman
React siblings components
Kostas Diakogiannis
Liberalism Mindmap
hollie garner
United States Capitals
Rob Perry
Secularism
Selective Study