Kopieren und bearbeiten

CS_DATA_STRUCT

Beschreibung

Quiz am CS_DATA_STRUCT, erstellt von Dina Kim am 26/03/2019.
Dina Kim
Quiz von Dina Kim, aktualisiert more than 1 year ago
Dina Kim
Erstellt von Dina Kim vor etwa 5 Jahre
115
4
0

Zusammenfassung der Ressource

Frage 1

Frage
Inheritance is ...
Antworten
  • 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

Frage 2

Frage
Qucksort is implemented recursively
Antworten
  • True
  • False

Frage 3

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

Frage 4

Frage
Which of the graph implementations is more simple?
Antworten
  • Matrix
  • map
  • set
  • list

Frage 5

Frage
To use Binary Search items should be ...
Antworten
  • ordereed
  • matched
  • divorced
  • traversed
  • beaten

Frage 6

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

Frage 7

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

Frage 8

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

Frage 9

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

Frage 10

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

Frage 11

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

Frage 12

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

Frage 13

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

Frage 14

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

Frage 15

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

Frage 16

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

Frage 17

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

Frage 18

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

Frage 19

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

Frage 20

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

Frage 21

Frage
First in last out structure is ...
Antworten
  • stack
  • graph
  • queue
  • tree

Frage 22

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

Frage 23

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

Frage 24

Frage
Every class has __________ as a superclass.
Antworten
  • object
  • main
  • string
  • java
  • subject

Frage 25

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

Frage 26

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

Frage 27

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

Frage 28

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

Frage 29

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

Frage 30

Frage
A collision occurs when ... ?
Antworten
  • 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

Frage 31

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

Frage 32

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

Frage 33

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

Frage 34

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

Frage 35

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

Frage 36

Frage
Finding the shortest path algorithm is called?
Antworten
  • Dijkstra
  • DFS
  • BFS
  • Binary Search

Frage 37

Frage
Which part is accessible to user?
Antworten
  • public
  • private
  • protected
  • interacted
  • social

Frage 38

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

Frage 39

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

Frage 40

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

Frage 41

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

Frage 42

Frage
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.
Antworten
  • quick
  • heap
  • merge
  • selection
  • bubble

Frage 43

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

Frage 44

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

Frage 45

Frage
The Collection is a _________ of a List
Antworten
  • superinterface
  • node
  • interface
  • parent
  • father

Frage 46

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

Frage 47

Frage
A queue _________ in ___________ out data structure.
Antworten
  • first, first
  • set,get
  • last,last
  • first,last
  • last,first

Frage 48

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

Frage 49

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

Frage 50

Frage
______________ exception is an error normally due to programmer.
Antworten
  • unchecked
  • checked
  • hacked
  • cracked

Frage 51

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

Frage 52

Frage
ListIterator and Iterator is the same thing in JAVA.
Antworten
  • True
  • False

Frage 53

Frage
The function that calls itself is called ...
Antworten
  • recursive function
  • functional function
  • defensive function
  • impressive function

Frage 54

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

Frage 55

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

Frage 56

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

Frage 57

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

Frage 58

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

Frage 59

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

Frage 60

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

Frage 61

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

Frage 62

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

Frage 63

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

Frage 64

Frage
Ideal data structure for a contact list is ?
Antworten
  • map
  • vector
  • graph
  • tree
  • set

Frage 65

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

Frage 66

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

Frage 67

Frage
It is possible to implement all recursive algorithms without recursion
Antworten
  • True
  • False

Frage 68

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

Frage 69

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

Frage 70

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

Frage 71

Frage
Is it possible to implement multiple interfaces?
Antworten
  • True
  • False

Frage 72

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

Frage 73

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

Frage 74

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

Frage 75

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

Frage 76

Frage
Recursive solutions are more beautiful and easy to understand.
Antworten
  • True
  • False

Frage 77

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

Frage 78

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

Frage 79

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

Frage 80

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

Frage 81

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

Frage 82

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

Frage 83

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

Frage 84

Frage
The collection of abstract methods is called?
Antworten
  • interface
  • function
  • abstract class
  • class
  • method

Frage 85

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

Frage 86

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

Frage 87

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

Frage 88

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

Frage 89

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

Frage 90

Frage
Is it possible to inherit from multiple classes?
Antworten
  • True
  • False

Frage 91

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

Frage 92

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

Frage 93

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

Frage 94

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

Frage 95

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

Frage 96

Frage
Gets the size of the ArrayList
Antworten
  • size()
  • sizeOf()
  • length(list)
  • size(list)
  • length

Frage 97

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

Frage 98

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

Frage 99

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

Frage 100

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

Frage 101

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

Frage 102

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

Frage 103

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

Frage 104

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

Frage 105

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

Frage 106

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

Frage 107

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

Frage 108

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

Frage 109

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

Frage 110

Frage
Find the slowest time
Antworten
  • O(n!)
  • O(n)
  • O(2^n)
  • O(100)
  • O(n^4)

Frage 111

Frage
Node of a graph is called?
Antworten
  • vertex
  • edge
  • path
  • weight
  • dijkstra

Frage 112

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

Frage 113

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

Frage 114

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

Frage 115

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

Frage 116

Frage
Which of them has more methods?
Antworten
  • subclass
  • superclass

Frage 117

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

Frage 118

Frage
Structured set of data is called _______.
Antworten
  • data structure
  • set of data
  • algorithm
  • data pattern
  • design of data

Frage 119

Frage
Circular Array is usually used to implement ...
Antworten
  • queue
  • tree
  • stack
  • graph
  • shreck

Frage 120

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

Frage 121

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

Frage 122

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

Frage 123

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

Frage 124

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

Frage 125

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

Frage 126

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

Frage 127

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

Frage 128

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

Frage 129

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

Frage 130

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

Frage 131

Frage
instanceof used to test ...
Antworten
  • 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

Frage 132

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

Frage 133

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

Frage 134

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

Frage 135

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

Frage 136

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

Frage 137

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

Frage 138

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

Frage 139

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

Frage 140

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

Frage 141

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

Frage 142

Frage
Can we access the element of a set by index?
Antworten
  • no
  • yes
  • maybe

Frage 143

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

Frage 144

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

Frage 145

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

Frage 146

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

Frage 147

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

Frage 148

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

Frage 149

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

Frage 150

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

Frage 151

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

Frage 152

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

Frage 153

Frage
What does method empty return for empty stack?
Antworten
  • true
  • false
  • nothing
  • empty
  • hello

Frage 154

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

Frage 155

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

Frage 156

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

Frage 157

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

Frage 158

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

Frage 159

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

Frage 160

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

Frage 161

Frage
Adjacent matrix representing undirected graph should be?
Antworten
  • symmetric
  • triangular
  • linear
  • diagonal
  • orthognal

Frage 162

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

Frage 163

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

Frage 164

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

Frage 165

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

Frage 166

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

Frage 167

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

Frage 168

Frage
Recursive implementation works faster than lopped one.
Antworten
  • True
  • False

Frage 169

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

Frage 170

Frage
Which part is not accessible to user?
Antworten
  • Private
  • Based
  • Controlled
  • Shifted
  • Public

Frage 171

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

Frage 172

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

Frage 173

Frage
The function that calls itself is called ...
Antworten
  • recursive function
  • functional function
  • defensive function
  • overloaded function
  • impressive function

Frage 174

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

Frage 175

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

Frage 176

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

Frage 177

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

Frage 178

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

Frage 179

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

Frage 180

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

Frage 181

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

Frage 182

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

Frage 183

Frage
A Stack is __________ in _________ out data structure.
Antworten
  • last,first
  • first,first
  • back, top
  • end,end
  • front,front
Zusammenfassung anzeigen Zusammenfassung ausblenden

Möchten Sie mit GoConqr kostenlos Ihre eigenen Quiz erstellen? eigenen Mehr erfahren.

ähnlicher Inhalt

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
Bibliothek durchsuchen