Quiz
CS_DATA_STRUCT
Erstelle ein kostenloses Konto, um dieses Quiz zu beenden
Speichere deinen Fortschritt und sieh dir dein Endergebnis an.
oder mit deiner E-Mail registrieren
Schon ein Konto? Anmelden
Fragen in diesem Quiz (183)
1Inheritance is ...
- APowerful code reuse mechanism
- Bproviding access to data
- Cability of object of one class to act like it is object of another class
- Dhiding an access to data
- Epowerful technique to store all data together
2Qucksort is implemented recursively
- ARichtig
- BFalsch
3Waiting line of people is similar to which data structure?
- AQueue
- BLinkedList
- CStack
- DTree
- EGraph
4Which of the graph implementations is more simple?
- AMatrix
- Bmap
- Cset
- Dlist
5To use Binary Search items should be ...
- Aordereed
- Bmatched
- Cdivorced
- Dtraversed
- Ebeaten
6Reference "rear" of CircularArray is usually indicates ...
- Alast added item
- Bfirst added item
- Csecondly added item
- Dmiddle of array
- Etop of a stack
7If there is no path path from vertex to any other vertex that graph is considered to be ?
- Aunconnected
- Bundirected
- CDFS
- DBFS
- Eweighted
8Can we implement the queue using LinkedList?
- Ayes
- Bno
- Ci don't know
- Dmaybe
- Ei need to learn more about this
9What is not perfect in this code: ave = sum / count;
- Adivision by zero may occur
- Bmultiplication by 10000000 is impossible in JAVA
- Cave should be written as average
- Dsemicolon needed after =
- Eit is not java code
10Returns the reference to the element at position index
- Aget(index)
- Bhas(index)
- CgoTo(index)
- Dfly(index)
- Eset(index)
11Indicate exponential time complexity in terms of big-O notation?
- AO(2^n)
- BO(logn)
- CO(n^4)
- DO(nlogn)
- EO(n)
12Traversing graph visiting a start node first, then all nodes that are adjacent to it next.
- ABFS
- BDFS
- CDIjkstra
- Dmatrix
- Epreorder
13A ________ graph is one where [E] is much less than [V]^2.
- Asprase
- Bdense
- Cpath
- Dhence
- Edirected
14Which method returns an object at the top of a Stack in JAVA?
- Apeek()
- Bfront()
- Ctop()
- Dpop()
- Epoll()
15The ____________ algorithm finds minimum spanning tree for a graph.
- Aprim
- BDFS
- Cmatrix
- DDijkstra
- EBFS
16traverese left subtree, Visit root node, traverse right subtree traversal is called?
- Ainorder
- Bpostorder
- Cpreorder
17Data structure based on BST where all items are sorted and unique is?
- AtreeSet
- Btree
- CtreeMap
- Dvector
- Egraph
18Graph is considered to be ___________ if there is a path from each vertex to any other vertex.
- Aconnected
- Bweighted
- Cdirected
- Dunweighted
- Eunconnected
19What is the difference between ArrayList and Vector?
- AVector is synchronized where ArrayList is not
- BThere is no difference
- Cvector is resizable where ArrayList is not
- Dvector is flexible where ArrayList is not
- Evector is scalable where ArrayList is not
20Visit root node, traverese left subtree, traverse right subtree traversal is called?
- Apreorder
- Binorder
- Cpostorder
21First in last out structure is ...
- Astack
- Bgraph
- Cqueue
- Dtree
22Which container is not appropriate to implement Stack in Java?
- Agraph
- Barray
- Clist
- Dvector
23Average time complexity of Bubble sort is?
- AO(n^2)
- BO(nlogn)
- CO(logn)
- DO(1)
- EO(n^3)
24Every class has __________ as a superclass.
- Aobject
- Bmain
- Cstring
- Djava
- Esubject
25traverse left subtree, traverse right subtree, visit root node traversal is called ?
- Apostorder
- Bpreorder
- Cinorder
26A ___________ tree is a binary tree used to store a code that facilitates file compression.
- AHuffman
- BBFS
- CDFS
- DDijkstra
- Eheap
27Distance from the root to its deepest leaf is known as __________ of a tree?
- Adepth
- Bheight
- Cpath
- Dsubtree
- Eroot
28The node of a tree without children is called ... ?
- Aleaf
- Bsibling
- Croot
- Dtree
- Esubtree
29Which structure is better to use when printing many documents from multiple computers at one printer?
- Aqueue
- Bset
- Ctree
- Dstack
- Egraph
30A collision occurs when ... ?
- Atwo keys hash to the same table index.
- Bi don't know what it is
- Cimpossible to answer
- Dtwo keys are hashed to a very big table index and rehash needed
- Etwo values hash to the same table index
31A __________ graph is one in which [E] is close to but less than [V]^2.
- Adense
- Bsprase
- Cdirected
- Ddark
- Ehence
32Average time complexity of Merge sort is?
- AO(nlogn)
- BO(n^2)
- CO(n^3)
- DO(n)
- EO(logn)
33The _________ is used to implement the special kind of a queue called priority queue.
- Aheap
- BBFS
- CDFS
- DBST
- Edeap
34Average time complexity of Shell sort is?
- AO(n^1.25)
- BO(1)
- CO(n)
- DO(logn)
- EO(n^2)
35If there is at least one abstract method in a class, that class is called ...
- Aabstract class
- Bvanish class
- Ctired class
- Drecursive class
- Egeneral class
36Finding the shortest path algorithm is called?
- ADijkstra
- BDFS
- CBFS
- DBinary Search
37Which part is accessible to user?
- Apublic
- Bprivate
- Cprotected
- Dinteracted
- Esocial
38Dijkstra's algorithm use ______ algorithm to traverse all nodes.
- ABFS
- BDFS
- Cmatrix
- Dtree
- EPrime's
39A list can _________ or _________ as elements added or removed.
- Agrow, shrink
- Bincrease, grow
- Cfly, sit
- Ddecrease, think
- Eflow, shrink
40What is the time complexity of recursive Binary Search algorithm?
- AO(logn)
- BO(NxM)
- CO(nlogn)
- DO(n)
41Why do we need BFS and DFS algorithms?
- Ato traverse a graph
- Bto measure graphh
- Cto remove an item from graph
- Dto find the way
- Eto add new item in a graph
42Choosing 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.
- Aquick
- Bheap
- Cmerge
- Dselection
- Ebubble
43Show the method which exists in DoubleLinkedList and not exist in SingleLinkedList?
- Aprevious()
- Bnext()
- Cconstructor
- DhasBefore()
- EhasNext()
44What determines whether you should use quadratic sort or a logarithmic sort algorithm?
- Aarray size
- Barray values
- Cswapping conditions
- Darray type
- Earray index
45The Collection is a _________ of a List
- Asuperinterface
- Bnode
- Cinterface
- Dparent
- Efather
46The _________ level of a node is a measure of its distance from the root.
- Alevel
- Bdistance
- Cparent
- Dfather
47A queue _________ in ___________ out data structure.
- Afirst, first
- Bset,get
- Clast,last
- Dfirst,last
- Elast,first
48for(int i=0; i< size; i++){
if(theData[i]==entry){
return i;
}
return -1;
}
This method is similar to which method of ArrayList?- AindexOf(entry)
- Bget(entry)
- Cequals(entry)
- Dset(entry)
49______________ exception is an error normally not due to programmer.
- Achecked
- Bunchecked
- Ccracked
- Dhacked
50______________ exception is an error normally due to programmer.
- Aunchecked
- Bchecked
- Chacked
- Dcracked
51Distance from the deepest leaf to the root of a tree is called?
- Aheight
- Bdepth
- Cleaf
- Dtree
- Ebreadth
52ListIterator and Iterator is the same thing in JAVA.
- ARichtig
- BFalsch
53The function that calls itself is called ...
- Arecursive function
- Bfunctional function
- Cdefensive function
- Dimpressive function
54If you want to call different constructor of current class you would use ...
- Athis()
- Bthis.
- Csuper.
- Dsuper()
55Which method adds an item on the top of the Stack in JAVA?
- Apush()
- Bpeek()
- Ctop()
- Dadd()
56In open addressing you can not remove an item to be deleted, so what should you do instead?
- Amark as deleted flag
- Bgo home and dance
- Cdelete and save in temporary list
- Dchange its place with another item
- Edo nothing
57What is the best time complexity of recursively finding fibbonachi nuber?
- AO(n)
- BH2O
- CO(n^2)
- DO(logn)
- EO(1)
58A __________ is a sequence of vertices in which each successive vertex is connected to its predecessor. (Graphs)
- Apath
- Bgraph
- Croute
- Dcycle
- Eweight
59Searching a binary search tree costs?
- AO(logn)
- BO(n)
- CO(1)
- DO(n^2)
60Average time complexity of Selection sort is?
- AO(n^2)
- BO(nlogn)
- CO(logn)
- DO(n)
61Full name of this course is ?
- AAlgorithms and Data Structures
- BSDP4
- CProgramming with Java
- DBasic circuit theory
- EAlgoritmization and programming language
62In ___________ graph is {v, u} is edge then {u, v} is not necessary an edge.
- Adirected
- Bundirected
- Cweighted
- Dconnected
63Average time complexity of Quick sort is?
- AO(nlogn)
- BO(logn)
- CO(n)
- DO(1)
64Ideal data structure for a contact list is ?
- Amap
- Bvector
- Cgraph
- Dtree
- Eset
65Each recursive function has two cases ________ and _________.
- Abase, recursive
- Bcontinued, stopped
- Clooped, switched
- Dlelik, bolik
- Ebase,defensive
66Array reallocation cost is ______?
- AO(n)
- BO(1)
- CO(logn)
- DO(nlogn)
- EO(n^2)
67It is possible to implement all recursive algorithms without recursion
- ARichtig
- BFalsch
68Set of connections between vertices of a graph is called?
- Aedge
- Bvertex
- Croof
- Dpath
- Ecycle path
69Hiding access to data members of a class is called ...
- AEncapsulation
- BOverloading
- COverriding
- DInheritance
- EPolymorphism
70Using a hash table enables us to retrive an item in a __________ time.
- Aconstant
- Blinear
- Caverage
- Dnlogn
- Elogarithmic
71Is it possible to implement multiple interfaces?
- ARichtig
- BFalsch
72Sets the element on position index to reference entry
- Aset(index, entry)
- Bentry.set(index)
- Cindex.set(entry)
- DsetTo(index, entry)
- Eset.index(entry)
73Which of the graph implementation is more efficient in terms of memory usage?
- Alist
- BBFS
- Cmap
- Dmatrix
- Eset
74In the queue implemented as a LinkedList, poll() function should ...
- Aremove first added item
- Bremove last added item
- Cplay with items
- Dremove middle item
- Eadd new item
75Which function is used to add new item in the queue?
- Aoffer()
- Bpoll()
- Cadd()
- Dsuffer()
- Eremove()
76Recursive solutions are more beautiful and easy to understand.
- ARichtig
- BFalsch
77Which structure is widely used to calculate the value of postfix expression?
- AStack
- BArray
- CSet
- DString
- EQueue
78This returns true if the collection contains obj.
- Acontains(obj)
- BgoTO(obj)
- CindexF(obj)
- Dfind(obj)
- EindexOf(obj)
79Redefinition of the method of superclass in a subclass with the same name and number of parameters is...
- Aoverride
- Boverload
- Coverbeat
- Doverhead
- Eupperload
80If you want to call the constructor of superclass you would use ...
- Asuper()
- Bthis()
- Cthis.
- Dsuper.
- Econstructor()
81Element insertion to a Binary Search tree costs?
- AO(logn)
- BO(1)
- CO(n)
- DO(n^2)
- EO(f(n))
82Distance from the deepest leaf to the root of a tree is called?
- Aheight
- Bbreadth
- Cleaf
- Dtree
- Edepth
83What is the time complexity of adding an item in front of a LinkedList?
- AO(1)
- BO(n)
- CO(n^2)
- DO(n^3)
- EO(nlogn)
84The collection of abstract methods is called?
- Ainterface
- Bfunction
- Cabstract class
- Dclass
- Emethod
85This method returns a string that textually represents an object.
- AtoString()
- BtoGo()
- CtoText()
- Dequals()
- EhashCode()
86Graph where each edge has a direction is called?
- Adirected
- Bwayed
- Cmapped
- Dstrong
- Estricted
87Which of the following is not example of visibility in JAVA.
- AEclipsed
- BPublic
- CPrivate
- DProtected
- EPackage
88A tree where left child is less and right child is more than its parent called?
- ABinary Search Tree
- BBinary tree
- CHuffman tree
- DBreadth first search
- EDFS
89How to handle exceptions
- Atry{}catch(){}
- Btry{}batch(){}
- Cfly{}catch(){}
- Dpoimai{}menya{}esli{}smozhesh()
- Ego{}home()
90Is it possible to inherit from multiple classes?
- ARichtig
- BFalsch
91Vertex is ________ to another vertex if there is an edge connecting them.
- Aadjacent
- Bbrotherhood
- Csibling
- DBFS
- EDIJkstra
92If two or more keys will be encoded to the same index of a hashtable, it is called.
- Acollision
- Bduplicate
- Cdecision
- Derror
- Emistake
93Returns entry at the front of a Deque without removing it
- ApeekFirst()
- BpollFirst()
- CpopFirst()
- DtakeFirst()
- Eget(index)
94Complete binary tree where all children must be bigger than parents is ?
- Aminheap
- Bmaxheap
- Cfullheap
- Dhiphop
- Etreeheap
95Which function return first added item in the queue?
- Aelement ()
- BgiveMeFirst
- CgoBack()
- Dfirst()
- Efront()
96Gets the size of the ArrayList
- Asize()
- BsizeOf()
- Clength(list)
- Dsize(list)
- Elength
97Traversing graph visiting a start node first, then choose one node that is adjacent to it next.
- ADFS
- BBFS
- Cmatrix
- Dtree
- EDIjkstra
98The relationship when one class is a subclass of another is called ...
- Ais-a
- Bhas-a
- Cto-c
- Dis-b
- Ehas-b
99Recursive nonlinear data structure that is used to represent data organized in a hirarchy?
- Atree
- Bvector
- Cgraph
- DarrayList
- ElinkedList
100Which of them is not an example of Data Structure
- ABreadth First Search
- BGraph
- CArrayList
- DSet
- EPriority Queue
101Two JAVA API implementation of Set and Map are:
- Atree and hash
- Bgraph and tree
- Clist and hash
- Dgraph and vector
- Etree and list
102Which of them is not a feature of Collection Interface?
- Agraph
- Bset
- Cqueue
- Dvector
- Elist
103Indicate two ways of graph implementations
- Alist and matrix
- Btree and hash
- Cset and map
- Darray and vector
- Equeue and stack
104Indicate logarithmic time complexity in terms of big-O notation?
- AO(logn)
- BO(1)
- CO(n)
- DO(2)
- EO(done)
105What are the two parts of ADT?
- APrivate and Public
- BArrayList and Vector
- CParent and Child
- DInt and Float
- EQueue and Stack
106public xxx(int index){
return theData[index];
}
this behaviour is similar to which method of ArrayList class?
- Aget
- Bequals
- Cset
- Dsize
- EgoHome
107Indicate the relationship of HashtableOpen and Entry classes?
- Ahas-a
- Bis-a
- Cis-b
- Dstatic
- Epublic
108Which method removes an item on the top of a Stack in JAVA?
- Apop()
- Bpeek()
- Chop()
- Ddrop()
- Eremove()
109How to remove item from LinkedList?
- Achange link of prev item to next item of item to be removed
- Bgo home and cry
- Cchange link of next item to prev item of item to be removed
- Dchange link of removing item to prev
- Echange link of remobingitem to next
110Find the slowest time
- AO(n!)
- BO(n)
- CO(2^n)
- DO(100)
- EO(n^4)
111Node of a graph is called?
- Avertex
- Bedge
- Cpath
- Dweight
- Edijkstra
112calculate the value of "4 7 * 20 -"
- A8
- B136
- C3
- D144
- E1
113Complete binary tree where all children must be smaller than parents is ?
- Amaxheap
- Bminheap
- Cfullheap
- Dhiphop
- Etreeheap
114The relationship when one class is defined inside the definition of another is called...
- Ahas-a
- Bis-a
- Cis-b
- Dhas-b
- Eto-c
115Prim's algorithm is used to calculate __________.
- Athe minimum spanning tree of a graph
- BBFS
- CDFS
- Dcyclic path
- Edirection path
116Which of them has more methods?
- Asubclass
- Bsuperclass
117A ___________ of a node is a tree whose root is a child of that node.
- Asubtree
- Bleaf
- Croot
- Dchild
- Eparent
118Structured set of data is called _______.
- Adata structure
- Bset of data
- Calgorithm
- Ddata pattern
- Edesign of data
119Circular Array is usually used to implement ...
- Aqueue
- Btree
- Cstack
- Dgraph
- Eshreck
120int xxx(int x){
if(n==1) return 1;
return x*xxx(x-1);
}
this function calculates- An!
- Bfibbonachi
- Cx^n
- D2^n
- Ex/n
121JAVA API uses ____________ to implement both Set and Map interfaces.
- Ahash table
- Bvector
- Ctree table
- Darraylist
- Egraph
122Average time complexity of Insertion sort is?
- AO(n^2)
- BO(2^n)
- CO(1)
- DO(logn)
- EO(nlogn)
123What is the time complexity of ArrayList remove(index) method?
- AO(n)
- BO(n^3)
- CO(1)
- DO(nlogn)
- EO(nxn)
124Does binary search tree contain duplicates?
- Ano
- Byes
- Ci have to go
- Di don't know
- Emaybe
125for (i<n)
if (a[i] == item)
return i;
This algotithm is similar to ...- Alinear search
- Bdeep sort
- Cheap sort
- Dbinary search
- Emerge sort
126Would an operating system use stack or queue to determine which print job should be handled next?
- Aqueue
- Btree
- Cstack
- Dset
- Egraph
127What is popularly used to traverse SingleLinkedList?
- Aiterator
- Bloop and switch
- Cinterface
- Dcommutator
- Etraversator
128Quadratic probing is usually used to ?
- Areduce collisions
- Benlarge table size
- Creallocate array
- Dfor fun
- Ecalculate x^2
129To apply Dijkstra's algorithm graph should be.
- Aweighted
- Bdirected
- Cisomorphic
- Dundirected
- Ecyclic
130Inventor of merge sort is ?
- AJohn von Neumann
- BJohn Lennon
- CVan der Sar
- DMr Merge
- EProfessor Sortmerg
131instanceof used to test ...
- Awhether an object belongs to class or not
- Bweather object has parent or nor
- Cweather is is the biggest object
- Dweather object is object or not
- Eweather objectplays football or not
132Most sorting algorithm are divided into two basic groups.
- Afast and slow
- Bsort and search
- Cbest and worst
- Dgo and play
- Eordered and unordered
133Attempt to convert a string that is not numeric to a number faults ...
- ANumberFormatException
- BArithmeticException
- CDoNotSpeakException
- DSDP4IsNotSubjectException
- EBadProgrammerException
134Average time complexity of Heap sort is?
- AO(nlogn)
- BO(n)
- CO(1)
- DH2O
- EO(n^2)
135A 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.
- AO(1)
- BO(n)
- CO(n^2)
- DO(logn)
- EO(nlogn)
136Data structure similar to tree but it doesn't have limitation according to number of parents is?
- Agraph
- Btree
- Ctreeset
- Dqueue
- Edequeue
137Set of ordered pairs whose element are known as the key and value is ?
- Amap
- Bset
- Cgraph
- Darray
- Etoo easy for me
138Ability of object of one class to act like it is an object of another class is?
- APolymorphism
- BEncapsulation
- CJava code
- DInheritance
- ESLOC(Source line of code)
139A ________ is a special cas of a graph. A ________ is a connected graph that contain no cycles.
- Atree,tree
- Bmatrix,list
- Cset,map
- DBFS,DFS
- Etree,hash
140What relationship class Node and LinkedList have?
- Ahas-a
- Bis-a
- Cto-c
- Dis-b
- Ehas-b
141Which of the following is recursive algorithm?
- Aquicksort
- Bselectionsort
- Cinsertionsort
- Dbubblesort
- Eall of them are recursive
142Can we access the element of a set by index?
- Ano
- Byes
- Cmaybe
143List two ways of organizing hashtable.
- Aopen addressing and chaining
- Bbreadth first search and depth first search
- Ckey and value
- Darraylist and vector
- Eprime's and dijkstra
144This method of a binary tree class return true if tree is a leaf and false otherwise?
- AisLeaf()
- BisEmpty()
- CnoMore()
- DisLast()
- EgoHome()
145ADT that enables a user to access information (data) corresponding to a specified key.
- Amap
- Bled
- Cset
- Dqueue
- Egraph
146An ordered set of instructions is called.
- Aalgorithm
- Bhello world
- Cpseudocode
- Ddata structure
- Earray
147OOP stands for?
- AObject oriented programming
- BOmar oriented programming
- CObject oriented playing
- DObstacle oriented programming
- EOOP is the keyword of Java programming and stands for nothing
148Is it possible to traverse contaning of a list this way?
for( int nextInt : aList ){ ... }- Ayes
- Bno
- Cmaybe
- Di don't know
149Which structure is widely used in finding palindrome problem?
- Astack
- Bqueue
- Cgraph
- Dset
- Emap
150Adding an item to the beginning of CircularArray costs?
- AO(1)
- BO(logn)
- CO(n)
- DO(n^2)
- E7 iterations
151What is the attribute of CircularList?
- ANext of last item referencing to the first item
- BNext of best item referencing to the worst item
- CNext of first item referencing to the last item
- DI need to go home and prepare for this
- EPrev of last item referencing to last item
152Attempt to access array element using index less than 0 faults ...
- AArrayIndexOutOfBoundsException
- BInputMismatchException
- CArithmeticException
- DMCDonerException
- EGoHomeException
153What does method empty return for empty stack?
- Atrue
- Bfalse
- Cnothing
- Dempty
- Ehello
154Elements of a List are accessed by means of an __________
- Aindex
- Bposition
- Cloop
- Dswitch
- Ebook
155If we call remove() function for the queue, which item will be removed?
- Afirst
- Bsecond
- Cmiddle
- Dthird
- Elast
156This method associates specified value with the specified key in the map.
- Aput(key, value)
- Bset(key, value)
- Cget(key, value)
- Dassociate(key, value)
- Ekey.set(value)
157Indicate linear time complexity in terms of big-O notation?
- AO(n)
- BO(loglogn)
- CO(logn)
- DO(n^2)
- EO(n^3)
158A tree where all nodes should have 2 children and leaves have no children is called?
- Afull binary tree
- Bbinary tree
- Cunary tree
- Dgeneral tree
159Insert and remove items from a heap costs?
- AO(logn)
- BO(nlogn)
- CO(n)
- DO(n^2)
- EO(1)
160What is the time complexity of adding element in the beginning of ArrayList?
- AO(n)
- BO(nlogn)
- CO(logn)
- DO(n^2)
- EO(25)
161Adjacent matrix representing undirected graph should be?
- Asymmetric
- Btriangular
- Clinear
- Ddiagonal
- Eorthognal
162Which of the following in java is very similar to "contract"?
- AInterface implementation
- BClass overriding
- CClass inheritance
- DDancing in a queue
- EMethod overloading
163Where new item added in the queue?
- Ato the end
- Bposition chosen randomly
- Cin the middle
- Din the beginning
- Eit is impossible to add new item in the queue
164Which method searches for target and returns its position in LinkedList?
- AindexOf(target)
- Bget(target)
- Cset(target)
- Dgo(target)
- Eequal(target)
165A ___________ path is a simple path in which only the first and last items are the same.
- Acycle
- Btour
- Cmapped
- Dtrip
- Elooped
166Graph where each edge has a direction is called?
- Adirected
- Bsticked
- Cstrong
- Dwayed
- Emapped
167Redefinition of method with the same name but different number of parameters is called...
- Aoverload
- Boverride
- Cinheritance
- Dpolymorphism
- Eencapsulation
168Recursive implementation works faster than lopped one.
- ARichtig
- BFalsch
169If there are no abstract methods in the class we call that class ...
- AActual Class
- BAbstract Class
- CNon abstract Class
- DSuper Class
- EFunny Class
170Which part is not accessible to user?
- APrivate
- BBased
- CControlled
- DShifted
- EPublic
171What is the time complexity of insert(index) method in ArrayList
- AO(n)
- BO(logn)
- CO(1)
- DO(n^2)
- EO(100)
172What is the feature of Deque?
- Acheap element addition and removal from the beginning
- Bcheap element addition and removal from the end
- Ccheap element addition and removal from the middle
- Dremoval
- Eaddition
173The function that calls itself is called ...
- Arecursive function
- Bfunctional function
- Cdefensive function
- Doverloaded function
- Eimpressive function
174int xxx(int x, int y, int z){
if(z==1){return 1;}
return xxx(x+y, x, z-1);
}
this function is- AFibbonachi
- Bit is trash function
- Cx^n
- Dn!
- E2^n
175What is the time complexity of Linear Search algorithm?
- AO(n)
- BO(nlogn)
- CO(1)
- DO(n^2)
- EO(logn)
176The node of a tree without children is called ... ?
- Aleaf
- Btree
- Csiblin
- Droot
- Esubtree
177Tree where every item must have at most 2 children is called?
- ABinary Tree
- BGeneral Tree
- CHuffman Tree
- DGeneric Tree
- EUnary Tree
178What is the benefit of encoding letters trough Huffman tree.
- Aearning space
- Bmore beautiful
- Cjust for fun
- Dit is simple
- Eit is smart
179A set view of a map can be obtained through method_______?
- AentrySet
- BemptySet
- CsetView
- DviewAsSet
- EgoAhead
180You apply method ____________ to set view to get an object that facilitates sequential access to the Map elements.
- Aiterator
- Bpreorder
- Caccessor
- Dtraversal
- Eposorder
181If you want to call data member of superclass you would use ...
- Asuper.
- Bthis.
- Cthis()
- Dsuper()
- Emethod
182In a Huffman tree, the item with the lowest frequency of occurrence will have the ___________ code.
- Ashortest
- Bdeepest
- Clongest
- Deasiest
- Ebinary
183A Stack is __________ in _________ out data structure.
- Alast,first
- Bfirst,first
- Cback, top
- Dend,end
- Efront,front
Informationen
- Beschreibung
- Quiz am CS_DATA_STRUCT, erstellt von Dina Kim am 26/03/2019.
- Autor
- Dina Kim
- Sprache
- English
- Aufrufe
- 139
- Bewertung
- Noch keine Bewertungen Bewerte dieses Quiz