А collision occurs when ... ?

two keys hash to the same table index.

two values hash to the same table index

two keys are hashed to big table inde and rehash needed

List two ways of organizing hashtable.

Breadth first search and Depth first search

InstanceOf used to test

Whether an object belongs to class or not

Quiz

sdp4

1610 R 187 perguntas Atualizado em 24 mai 2018

Fazer o quiz

Perguntas do quiz (187)

1Choosing 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.
1. Aquick
2. Bmerge
3. Cbubble
4. Dheap
2Inventor of merge sort is ?
1. AJohn von Neumann
2. BMr Merge
3. CJohn Lennon
4. DProfessor Sortmerg
3А collision occurs when ... ?
1. Atwo keys hash to the same table index.
2. Btwo values hash to the same table index
3. Ctwo keys are hashed to big table inde and rehash needed
4. Dimpossible to answer
4What are the two parts of ADT?
1. Aprivate, public
2. Bmethods and data fields
3. CParent and Child
4. DInt and Float
5. EQueue and Stack
5List two ways of organizing hashtable.
1. Aopen addressing and chaining
2. Bkey and value
3. Carraylist and vector
4. DBreadth first search and Depth first search
6Which of them has more methods?
1. ASubclass
2. BSuperclass
3. CParentclass
4. DObject
7Indicate the relationship of HastableOpen and Entry classes?
1. Ahas-a
2. Bstatic
3. Cis-b
4. Dis-a
8The relationship when one class is defined inside the definition of another ?
1. Ahas-a
2. Bis
3. Cis-a
9Which of them is NOT an example of Data Structure ?
1. AArrayList
2. BBreadth First Search
3. CSet
4. DPriority Queue
5. EGraph
10Redefinition of method of superclass in a subclass with the same name and number of
parameters?
1. AOverride
2. BOverload
3. CPublic
4. DEncapsulation

11A set view of a map can be obtained through method_______?
1. AentrySet
2. BsetView
3. CgoAhead
4. DemptySet
12Which of them is NOT feature of collection interface ?
1. AGraph
2. BList
3. CQueue
4. DVector
5. ESet
13Redefinition of method with the same name but different number of parameters?
1. AOverload
2. BOverride
3. CEncapsulation
4. DPolymorphism
14 If you want to call the constructor of superclass you would use
1. ASuper()
2. BParent()
3. Cthat()
15Quadratic probing is usually used to ?
1. Areduce collisions
2. Breallocate array
3. Cfor fun
4. Denlarge table size
16This returns TRUE if the collection contains object
1. AFind(obj)
2. BgoTo(obj)
3. CindexF(obj)
4. Dcontains(obj)
5. EindexOf(obj)
17If you want to call different constructor of current class you would use
1. Athis()
2. Bthat()
3. Canay()
4. Dwhich()
18Elements of a List are accessed by means of an
1. Aindex
2. Bposition
3. Cbook
4. Dloop
5. Eswitch
19Set of ordered pairs whose element are known as the key and value is ?
1. Aset
2. Bmap
3. Cgraph
4. Darray
20If there is at least one abstract method in a class, that class is called
1. AAbstract class
2. BChild class
3. CParent class
4. DNot given
21If there are no abstract methods in the class we call that class…
1. AActual class
2. BAbstract class
3. CParent
4. DSuperclass
22A list can ___ or ___ as items(elements) are added or removed
1. Aflow, shrink
2. Bgrow, shrink
3. Cdecrease, think
4. Dfly, sit
5. Eincrease, grow
23Is it possible to inherit from multiple classes ?
1. ANo
2. BYes
24 Is it possible to implement multiple interfaces?
1. Ano
2. Byes
25 The Collection is a _____ of a List ?
1. Asuperinterface
2. Bfather
3. Cnode
4. Dparent
5. Einterface
26Every class has _____as a superclass
1. AObject(parent of classes)
2. BObject(childof classes)
3. CSuperclass
4. Dint
27Which method returns an object at the top of a Stack in JAVA?
1. Atop()
2. Bpop()
3. Cfront()
4. Dpeek()
5. Epoll()
28InstanceOf used to test
1. AWhether an object belongs to class or not
2. BDivision by zero may occur
3. Cclass belongs to object
29Which method adds an item on the top of a Stack in JAVA?
1. Aadd()
2. Btop()
3. Cpeek()
4. Dpush()
5. Ebush()
30Two JAVA API Implementation of Set and Map are
1. Atree and hash
2. Bgraph and vector
3. Clist and hash
4. Dtree and list
31What is not perfect in this code: ave = sum/count;
1. ADivision by zero may occur
2. BDivision by one may occur
3. Cnothing
4. Dnot given
32First in last out structure is...
1. ATree
2. BGraph
3. CSet
4. DQueue
5. EStack
33Attempt to convert a string that is not numeric to a number faults …
1. ANumberFormatException
2. BArrayIndexOutOfBoundsException
3. CDivisionByZero
34 Which structure is widely used in finding palindrome problem?
1. AMap
2. BStack
3. CGraph
4. DQueue
5. ESet
35Average time complexity of Insertion sort is?
1. AO(n^2)
2. BO(1)
3. CO(nlogn)
4. DO(logn)
5. EO(n)
36Attempt to access array element using index less than zero folds
1. AArrayIndexOutOfBoundsException
2. BNumberFormatException
3. COutOfBoundsException
37Which container is not appropriate to implement Stack in JAVA?
1. AArray
2. BGraph
3. CList
4. DVector
38 ________ exception is an error normally due to programmer
1. Aunchecked
2. Bchecked
3. Cnot given
4. Dnull
39Which structure is widely used to calculate the value of postfix expression?
1. AString
2. BArray
3. CSet
4. DStack
5. EQueue
40A 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.
1. AO(1)
2. BO(n)
3. CO(n^2)
4. DO(nlogn)
5. EO(logn)
41________ exception is an error normally not due to programmer
1. Aunchecked
2. Bchecked
3. Cnull
4. Dnot given
42Calculate value of "4 7 * 20 - "
1. A1
2. B3
3. C136
4. D8
5. E144
43ADT that enables a user to access information (data) corresponding to a specified key.
1. AMap
2. BQueue
3. CSet
4. DGraph
44Ability of object of one class to act like it is an object of another class is?
1. AInheritance
2. BPolymorphism
3. CEncapsulation
4. DJava code
5. ESLOC (Source Line of Code)
45What does method empty return for empty stack?
1. Anothing
2. Bempty
3. Chello
4. Dtrue
5. Efalse
46Which of the following is not example of visibility in Java ?
1. AEclipse
2. BJetBrains
3. CNetBeans
47Waiting line of people is similar to which data structure?
1. AGraph
2. BStack
3. CQueue
4. DTree
5. ELinkedList
48Sets the element on position Index to reference entry
1. ASet (Index, Entry )
2. BGEt(Index, Entry)
3. CNothing
4. DSet(Entry)
49Average time complexity of Merge sort is?
1. AO(nlogn)
2. BO(1)
3. CO(logn)
4. DO(n)
5. EO(n^2)
50You can reference an object of a ___ type through a variable of a ___ type
1. Asubclass, superclass
2. Bsuperclass, subclass
3. Csubclass, parent class
4. Dinterface, subclass
51Most sorting algorithm are divided into two basic groups.
1. Afast and slow
2. Bgo amd play
3. Csort and search
4. Dordered and unordered
52What is the time complexity of insert(index) method in ArrayList
1. AO(n)
2. BO(n^2)
3. CO(1)
4. DO(n^3)
53You cast an object referenced by a___ type to an object of a___ type in order to apply methods of the___type to the object –___ :
1. Asubclass, superclass, subclass, downcast
2. Bsuperclass, subclass, subclass, downcast
3. Csubclass, subclass, superclass, downcast
4. Dsubclass, subclass, downcast, superclass
54Which structure is better to use when printing many documents from multiple computers at one printer?
1. ASet
2. BQueue
3. CGraph
4. DStack
5. ETree
55What is the difference between ArrayList and Vector?
1. AVector is synchronized, where ArrayList is not
2. Bthere are same
3. CArrayLIst is synchronized, where Vectoris not
56JAVA API uses ____________ to implement both Set and Map interfaces.
1. Ahash table
2. Btree table
3. Cvector
4. Dgraph
5. EArrayList
57If we call remove() function for the queue, which item will be removed
1. Athird
2. Bsecond
3. Cmiddle
4. Dfirst
5. Elast
58Each node is a single-linked list, has a reference to__ and __
1. Anext node, previous node
2. Bnext node, data
3. Cdata, next node
4. Dimplement, next node
59For(int i=0; i<size; i++){
If(theData[i]==entry){
Return i;
}Return -1;}
This method is similar to which method of ArrayList
1. AIndexOf(entry)
2. Bnumber
3. CIndexOf(cell)
4. Dnot given
60What function return first added item in the queue?
1. AgiveMeFirst()
2. Bfront()
3. Cfirst()
4. DgoBack()
5. Eelement()
61Indicate constant time complexity in terms of Big-O notation
1. AO(1)
2. BO(n)
3. CO(n^2)
4. DO(n^3)
62This method associates specified value with the specified key in the map.
1. Aput(key,value)
2. Bset(key,value)
3. Cget(key,value)
4. Dkey.set(key,value)
63Which function is used to add new item in the queue?
1. Aadd()
2. Bsuffer()
3. Cremove()
4. Doffer()
5. Epoll()
64The collection of abstract methods is called
1. AInterface
2. BPolymorphism
3. CSuper()
4. DTree
65 Indicate logarithm time complexity in terms of big-O notation?
1. Alog(n)
2. Blog(1)
3. Clog(n^2)
4. Dlog(n^3)
66Average time complexity of Shell sort is?
1. AO(n^1.25)
2. BO(n)
3. CO(n^2)
4. DO(nlogn)
5. EO(1)
67Indicate linear time complexity in terms of big-O notation?
1. An
2. Blogn
3. Cn^2
4. Dn^3
68Indicate exponential time complexity in terms of big-O notation?
1. AO(2^n)
2. BO(3^n)
3. CO(1)
4. DO(n)
69What determines whether you should use quadratic sort or a logarithmic sort algorithm?
1. Aarray size
2. Barray indexes
3. Carray type
4. Darray values
5. Eswapping conditions
70 Find the slowest time
1. AO(n!)
2. BO(1)
3. CO(logn)
4. DO(n^2)
71What is the time complexity of ArrayList remove(index) method
1. AO(n)
2. BO(1)
3. CO(n^2)
4. DO(n^3)
72In a double-linked list, each node has a reference to: ___, ___and ___
1. Anext node, previous node, data
2. Bimplement, data, next node
3. Cnext node, data, previous node
4. Ddata, next node previous node
73In open addressing you can not remove an item to be deleted, so what should you do
instead?
1. Amark as deleted flag
2. Bdo nothing
3. Cdelete and save in temporary list
4. Dchange its palce with another item
74What is the time complexity of adding an item in front of a LinkedList
1. AO(1)
2. BO(n)
3. CO(n!)
4. DO(logn)
75Average time complexity of Bubble sort is?
1. AO(n^2)
2. BO(nlogn)
3. CO(1)
4. DO(n)
5. EO(logn)
76What is the time complexity of insert(index) method in ArrayList?
1. AO(n^2)
2. BO(n)
3. CO(1)
4. DO(mxn)
5. EO(logn)
77To remove an item from a single -linked list, you need a reference to
1. Aprevious node
2. Bnext node
3. Cdata
4. Dthe node
78What is the time complexity of adding element in the beginning of ArrayList
1. AO(n)
2. BO(n!)
3. CO(1)
4. DO(logn)
79If two or more keys will be encoded to the same index of a hashtable, it is called.
1. Acollision
2. Berror
3. Cmistake
4. Dduplicate
80Which method removes an item on the top of a Stack in JAVA?
1. Apeek()
2. Bpop()
3. Chop()
4. Dremove()
5. Edrop()
81To remove an item from a double -linked list, you need a reference to
1. Adata
2. Bnode
3. Cnext
4. Dprevious node
82Which method searches for target and returns its position in LinkedList
1. AIndexOf(target)
2. BIndexOf(cell)
3. CNot given
4. DArrayIndexOutOfBloundException
83Inheritance is:
1. Apowerful code reuse mechanism
2. Bproviding access to data
3. Cability of object of one class to act like it is an object of another class
4. Dhiding an access to data
5. Epowerful technique to store all data together
84Hiding access to data members of a class is called:
1. APolymorphism
2. BEncapsulation
3. CInheritence
4. DNone of them
85An iterator allows us to access items of a list
1. Asequentially
2. Bordinal
3. Ctogether
4. Ddon't know
86The relationship when one class is a subclass of another is called:
1. Ahas
2. Bis
3. Ccan
4. Dare
5. Einclude
87How to remove item from LinkedList
1. AChange Link of previous item to next item of item to be removed
2. BChange Item
3. CChange Link of next item to previous item to be changed
4. DChange Link of next item to previous item of item to be removed
88 ___testing focuses on testing the functional characteristics of a module
1. AGreen-box
2. BTerminal
3. CWhite-box
4. DBlack-box
89Ideal data structure for a contact list is ?
1. Atree
2. Bmap
3. Cgraph
4. Dset
5. Evector
90___testing requires the use of test data that exercise each statement in a module
1. AWhite-box
2. BBlack-box
3. CTerminal
4. DGreen-box
91What is attribute of CircularList
1. Anext of last item referencing to the first item
2. Bset of Nubmber
3. CRules
4. Dlast of next item referencing to the last item
92You apply method ____________ to set view to get an object that facilitates sequential
access to the Map elements.
1. Aiterator
2. Baccessor
3. Ctraversal
4. Dpreorder
93What is popularity used to traverse SingleLinkedList
1. AInterface
2. BIterator
3. CTraversator
4. DLoop and switch
5. ECommutator
94Which of the following in Java is very similar to “contract”?
1. Anext of last item referencing to the first item
2. BInterface implementation
3. CInheritance
4. DAccess denied
95The java linked-list class uses a ___ to implement the list interface
1. Aarray-linked list
2. Barray list
3. Clinked list
4. Ddouble-linked list
96List iterator and iterator is the same thing in JAVA
1. AVerdadeiro
2. BFalso
97 Is it possible to traverse containing of a list this way? for(int nextInt : aList){… }
1. Ayes
2. Bno
3. Cmaybe
98Show the method which exists in a DoubleLinkedList and not exist in a SingleLinkedList
1. APrevious()
2. BLast()
3. CNext()
4. DThis()
99Can we access the element of a set by index?
1. Ano
2. Byes
100What relationship class Node and LinkedList have?
1. Ahas-a
2. Bhas
3. Cis
4. Dis-a
101A listIterator allows us to access the elements
1. Aboth forward and backward
2. Bbackward
3. Cneither forward nor backward
4. Dforward
102Which of them is NOT an example of Data Structure ?
1. ABreadth First Search
2. BSearch
3. CSearch1
103A queue is a ___-in ___-out data structure
1. Afirst, first
2. Bfirst, last
3. Clast, first
4. Dlast, last
104Operating system use ___ to determine which print job should be handled next
1. Aqueue
2. Bstack
3. Corder
4. Ddepth
105Two JAVA API implementation of Set and Map are:
1. Atree anf hash
2. Btree and list
3. Cvector
4. DarrayList
106int xxx(int x){

if(n==1)return 1;
return x*xxx(x-1);
}
1. An!
2. Blog(n)
3. Cfibonacci
4. D2^n
107.Data structure similar to tree but it doesn't have limitation according to number of parents
is?
1. Agraph
2. Btree
3. Chash
4. Dvector
108int xxx(int x, int y, int z){
if(z==1){return 1;}
return xxx(x+y,x,z-1);
}
1. Afibonacci
2. Bn!
3. Ctrash in function
4. Dlogn
109Explain how interface is like a contract
1. AClass implementing interface must define none of it’s methods
2. BClass implementing interface must define all it’s methods
3. CClass implementing interface must define only one of it’s methods
4. DClass implementing interface must define some of it’s methods
110Node of a graph is called?
1. Avertex
2. Bedge
3. Croot
111What is the time complexity of recursive Binary Search algorithm?
1. AO(logn)
2. BO(n)
3. CO(1)
4. DO(2^n)
112Recursive implementation works faster than lopped one
1. AVerdadeiro
2. BFalso
113It's possible to implement all recursive algorithms without
1. AVerdadeiro
2. BFalso
114Recursive solutions are more beautiful and easy to understands
1. AVerdadeiro
2. BFalso
115Set of connections between vertices of a graph is called?
1. Aedge
2. Bvertex
3. Cpath
4. Droot
116What are two important differences between abstract class and actual class? What are the
similarities?
1. AAbstract class should have abstract methods. It can’t be instantiated. They both may have
  actual datafields and methods
2. BActual class should have abstract methods. It can’t be instantiated. They both may have
  actual datafields and methods
3. CAbstract class should have actual methods. It can be instantiated. They both may have
  actual datafields and methods
4. DActual class should have actual methods. It can be instantiated. They both have not
  abstract datafields and methods
5. EAbstract class should have not abstract methods. It can be instantiated. They both may have actual datafields and methods
117Quicksort is implemented recursively
1. AVerdadeiro
2. BFalso
118List four subclasses of RuntimeException: IndexOutOfBounds, Arithmetic, IlegalArgument,
1. AOutputMismatch
2. BInputMismatch
3. CLogarithmic
4. DLegalArgument
5. EIllegalMismatch
119What the time complexity of LinearSearch algorithm?
1. AO(n)
2. BO(1)
3. CO(logn)
4. DO(nlogn)
120Graph where each edge has a direction is called?
1. Adirected
2. Bsymmetric
3. Cunconnected
121How protected visibility can be equivalent to public?
1. AIf two related classes are in the different package.
2. BIf two related classes are in the same package.
3. CIf one related class is in the same package.
4. DIf two related methods are in the same package.
5. EIf two related methods are in the different package.
122for(i<n)
if(a[i] == item)
return i;
This algorithm is similar to ...
1. ALinear Search
2. BBinary Search
3. CHuffman tree
4. DFull binary search
123Adjacent matrix representing undirected graph should be?
1. Asymmetric
2. Bassymmetric
3. Cconnected
124Explain why Shape can not be an actual class
1. ABecause it has abstract methods
2. BBecause it has actual methods
3. CBecause it has not abstract methods
4. DBecause it has not actual methods
125To use Binary Search items should be ...
1. Aordered
2. Btraversed
3. Cmatched
4. Ddivorced
126Vertex is ________ to another vertex if there is an edge connecting them
1. Aadjacent
2. Bsubling
3. Cbrotherhood
4. DBFS
127Overriding
1. Athe different method realized differently in a child class.
2. Bthe same method realized differently in a child class.
3. Cthe same method realized samely in a child class.
4. Dthe same method not realized differently in a child class.
5. Ethe same method realized differently in a parent class.
128.A __________ is a sequence of vertices in which each successive vertex is connected to its
predecessor. (Graphs)
1. Apath
2. Bcycle
3. Croute
4. Dweight
129Overloading
1. Athe same method realized differently in a child class.
2. Bwhen number of parameters changed then it will be another method.
3. Cthe same method realized differently in a parent class.
4. Dwhen single of parameter changed then it will be another method.
5. Ewhen number of parameters changed then it still will be same method.
130A ___________ path is a simple path in which only the first and last items are the same.
1. Acycle
2. Btrip
3. Cmapped
4. Dlooped
131The node of a tree without children is called ...?
1. Aleaf
2. Bsubtree
3. Csiding
4. Dfull
132Describe the use of the keywords super. and super(...)?
1. AIf you want to call some method of parent class then use super.
2. BIf you want to call some method of child class then use super.
3. CIf you want to call some method of parent class then use normal.
4. DIf you want to call some method of child class then use normal.
5. EIf you want to call some method of parent class then do not use super.
133.If there is no path path from vertex to any other vertex that graph is considered to be ?
1. Aunconnected
2. Bconnected
134A _______ of a node is a tree whose root is a child of that node
1. Aparent
2. Bsubtree
3. Cleaf
4. Droot
5. Echild
135What can you say about class Object?
1. AObject is child of all classes in JAVA.
2. BObject is parent of one class in JAVA.
3. CObject is child of one class in JAVA.
4. DObject is parent of all classes in JAVA.
5. EObject is parent of some class in JAVA.
136Indicate two ways of graph implementations
1. Alist and matrix
2. Bhash and list
3. CArrauList and vector
4. DTree and map
137.A __________ graph is one in which [E] is close to but less than [V]^2.
1. Adense
2. Bsparse
3. Ccute
4. Dbad
138 Describe the difference between is - a and has - a relationships?
1. AHas - a – parent child relationship Is - a – when one class has another inside itself.
2. BHas - a – parent child relationship Is - a – when all classes have another inside itself.
3. CIs - a – parent child relationship Has - a – when one class has another inside itself.
4. DIs - a – parent child relationship Has - a – when all classes have another inside itself.
139A ________ graph is one where [E] is much less than [V]^2.
1. Asparse
2. Bdense
3. Ci don`t know
4. Dgo home and cry
140What is the advantage of specifying an abstract data type as an interface instead of just going ahead and implementing it as a class?
1. AAny class can implement many interface and can not extend more than one class
2. BAll classes can implement only one interface and can not extend more than one class
3. CAll classes can implement only one interface and can extend more than one class
4. DAny class can implement many interface and can extend more than one class
5. EAll class can implement many interface and can extend more than one class
141Which of the graph implementation is more efficient in terms of memory usage?
1. Alist
2. Btree
3. Cmap
4. Dgraph
142The ______ of a node is a measure of its distance from the root
1. Alevel
2. Bdistance
3. Cparent
4. Droot
5. Esibling
143Which of the graph implementations is more simple?
1. Amatrix
2. Blist
3. Ctree
144What are two different uses of a term interface in programming
1. AInterface is a java keyword. Relationship between user and computer (HCI).
2. BInterface is not a java keyword. Relationship between user and computer (HCI).
3. CInterface is a java keyword. Relationship between programm and computer (HCI).
4. DInterface is a not java keyword. Relationship between user and programm (HCI).
5. EInterface is a java keyword. Relationship with user and computer (HCI).
145Why do we need BFS and DFS algorithms?
1. Ato have fun
2. Bto traverse a graph
3. Cbe aware of collision
146Distance from the root to its deepest leaf is knows as ______ of a tree?
1. Aheight
2. Broot
3. Cpath
4. Dsubtree
5. Edepth
147What do abstract methods and interfaces have in common? How do they differ?
1. AIn interface methods are defined. But in abstract classes the abstract methods can be defined to show its default behaviour.
2. BIn interface methods are not defined. But in actual classes the abstract methods can be defined to show its default behaviour.
3. CIn interface methods are not defined. But in abstract classes the abstract methods can be defined to show its default behaviour.
4. DIn interface methods are defined. But in abstract classes the actual methods can be defined to show its default behaviour.
5. EIn interface methods are defined. But in abstract classes the abstract methods cannot be defined to show its default behaviour.
148Traversing graph visiting a start node first, then all nodes that are adjacent to it next.
1. ABFS
2. BDFS
149 List two subclasses of IOException:
1. AEOFException, FileFoundException
2. BEOFException, FileNotFoundException
3. CSQLException, FileNotFoundException
4. DEOFException, SQLException
150Traversing graph visiting a start node first, then choose one node that is adjacent to it next.
1. ABFS
2. BDFS
151Dijkstra's algorithm use ______ algorithm to traverse all nodes.
1. ABFS
2. BDFS
152Explain why Shape can not be an interface
1. ABecause it has not actual methods
2. BBecause it has actual methods
3. CBecause it has abstract methods
4. DBecause it has not abstract methods
5. EBecause it has actual and abstract methods
153Graph is considered to be ___________ if there is a path from each vertex to any other
vertex.
1. Aconnected
2. Bfull
3. Cdirected
154.In ___________ graph is {v, u} is edge then {u, v} is not necessary an edge
1. Adirected
2. Bconnected
155Tree where every item must have at most 2 children is called?
1. ABinary Tree
2. BUnary Tree
3. CHuffman Tree
4. DGeneral Tree
156Structured set of data is called _______.
1. Adata structure
2. Balgorithm
157What does encapsulation mean, and how it is used in JAVA?
1. AEncapsulation – unlimiting access to datafields.
2. BEncapsulation is one of the OOPs feature that allows us to perform a single action in different ways.
3. CEncapsulation is one of the OOPs feature that is not allows us to perform a single action in different ways.
4. DEncapsulation – limiting access to datafields.
158An ordered set of instructions is called.
1. Aalgorithm
2. Bmodel
3. Cdata
159What is the benefit of encoding letters trough Huffman tree
1. Aearning space
2. Bit is smart
3. Cjust for fun
4. Dmore beautiful
5. Eit is simple
160Describe the use of the keywords this. and this (...)?
1. AThis() – used to get datafields of current class This. – used to call the constructor
  of current class.
2. BThis. – used to get datafields of current class This() – used to call the constructor
  of current class.
3. CThis. – used to call the constructor of current class This() – used to get datafields of current class
4. DThis. – used to get datafields of all classes This() – used to call the constructor
  of current class.
5. EThis. – used to get datafields of all classes This() – used to call the constructor
  of all classes.
161Explain the relationship between classes Number, Integer and Short.
1. ANumber is child of Integer and Short.
2. BInteger is parent of Number and Short.
3. CNumber is parent of Integer and Short.
4. DShort is parent of Number and Integer.
5. EInteger is child of Number and Short.
162A tree where left child is less and right child is more than its parent called?
1. ABinary
2. BHuffman Tree
3. CDFS
4. DBreadth first search
163Search a binary search tree costs?
1. AO(logn)
2. BO(nlogn)
3. CO(1)
4. DO(n)
164The four kinds of visibility in order of decreasing visibility are:
1. APublic, package, protected, private
2. BPrivate, protected, package, public
3. CPackage, private, public, protected
4. DProtected, package, private, public
5. EPrivate, public, protected, package
165What is default package visibility?
1. AClasses in the different package are visible to each other without import.
2. BClasses in the same package are visible to each other without import.
3. CClasses in the same package are not visible to each other without import.
4. DClasses in the different package are not visible to each other without import.
5. EClasses in the same package are invisible to each other without import.
166Form of method determined by its name and arguments
1. AJava method
2. BSignature method
3. CGet method
4. DData method
5. ESet method
167A tree where all nodes should have 2 children and leaves have no children is called?
1. Afull binary tree
2. Bgeneral tree
3. Cunary tree
4. Dperfect tree
5. Ebinary tree
168An____ specifies the requirements of an ADT as a contract between the____ and ____; A ____ implements the ADT
1. Ainterface, user, developer, method
2. Bimplemetation, developer, user, class
3. Cinterface, developer, user,class
4. Dimplemetation, user, developer, class
5. Eimplemetation, developer, user, method
169Visit root node, traverses left subtree, traverse right subtree traversal is called?
1. Ainorder
2. Bpreorder
3. Cpostorder
170An interface can be implemented by multiple classes -
1. Atrue
2. Bfalse
171Traverse left subtree, Visit root node, traverse right subtree traversal is called?
1. Apreorder
2. Binorder
3. Cpostorder
172traverse left subtree visit root node traversal is called?
1. Ainorder
2. Bpostorder
3. Cpreorder
173This method of a binary tree class return true if tree is a leaf and false otherwise?
1. AisLeaf()
2. BisEmpty()
3. CnoMore()
4. DisLast()
5. EgoHome()
174Element insertion to a Binary Search tree costs?
1. AO(logn)
2. BO(1)
3. CO(n)
4. DO(nlogn)
175Does binary search tree contain duplicates?
1. Ano
2. Byes
3. Cgo home
4. Dmaybe
176Complete binary tree where all children must be smaller than parents is?
1. Amaxheap
2. Bminheap
3. Chiphop
4. Dtreeheap
177Complete binary tree where all children must be bigger than parents is?
1. Aminheap
2. Bmaxheap
3. Chiphop
4. Dfullheap
5. Etreeheap
178Insert and remove items from a heap costs?
1. AO(1)
2. BO(n)
3. CO(nlogn)
4. DO(nxn)
179The heap is used to implement the special kind of a queue called priority queue
1. Aheap
2. Bdeap
3. CDFS
4. DDBS
180A ________ tree is a binary tree used to store a code that facilitates the compression
1. Aheap
2. BHuffman
3. CDijkstra
4. DDFS
5. EDBS
181Data structure based on BST where all items are sorted and unique is?
1. Agraph
2. BtreeMap
3. CtreeSet
4. Dvector
5. Etree
182Recursive nonlinear data structure that is used to represent data organized in a hierarchy?
1. Atree
2. Bvector
3. Cgraph
4. DarrayList
5. ElinkedList
183In a Huffman tree, the item with the lowest frequency of occurrence will have the _____ code.
1. Alongest
2. Beasiest
3. Cshortest
4. Dbinary
5. Edeepest
184Which of the following is recursive algorithm?
1. AQuickSort
2. BInsertionsort
3. CSelectionsort
4. DBUBBLESORT
185Average time complexity of Selection sort is?
1. AO(n^2)
2. BO(n^3)
3. CO(n^2,25)
4. DO(n)
186Average time complexity of Heap sort is?
1. AO(logn)
2. BO(nlogn)
3. CO(n)
4. DO(1)
187Average time complexity of Quick sort is?
1. AO(nlogn)
2. BO(logn)
3. CO(n)
4. DO(1)

Informações

Descrição: Quiz sobre sdp4, criado por 1610 R em 24-05-2018.
Autor: 1610 R
Idioma: English
Visualizações: 359
Histórico: Criado em 24 mai 2018 · atualizado em 24 mai 2018
Avaliação: Ainda sem avaliações
Avalie este quiz
Avalie este quiz

sdp4

Crie uma conta grátis para terminar este quiz

Perguntas do quiz (187)

Informações

Fale Conosco

O que você acha do novo visual?