Test
Sin título
Crea una cuenta gratis para terminar este test
Guarda tu progreso y consulta tu resultado final.
¿Ya tienes cuenta? Inicia sesión
Preguntas del test (39)
1In computer science, a tree is an abstract model of a hierarchical structure
- AVerdadero
- BFalso
22. A tree consists of nods with a parent-child relation
- AVerdadero
- BFalso
33. A general tree node can have at most two children nodes
- AVerdadero
- BFalso
44. A binary tree node can have at least two children nodes
- AVerdadero
- BFalso
51. In computer science, a normal Queue has the property of first in first out
- AVerdadero
- BFalso
62. In computer science, a normal Queue has the property of last in last out
- AVerdadero
- BFalso
73. In computer science, a Priority Queue has the property of first in first out
- AVerdadero
- BFalso
84. In computer science, a Priority Queue has the property of last in last out
- AVerdadero
- BFalso
91. In computer science, a map models a searchable collection of key-value entries
- AVerdadero
- BFalso
102. The main operations of a map include, but not limited to, searching, inserting, and deleting items
- AVerdadero
- BFalso
113. General speaking, a map data structure would allow multiple entries with identical key value
- AVerdadero
- BFalso
124. A skip list for a set S of distinct key value pairs consist of a single list in its internal structure
- AVerdadero
- BFalso
131. The structure of binary tree is exactly the same as the structure of binary tree
- AVerdadero
- BFalso
142. The search process on a binary search tree data structure resembles the sequential search process
- AVerdadero
- BFalso
153. The search process on a binary search tree data structure resembles the binary search process
- AVerdadero
- BFalso
164. An AVL Tree is a binary tree such that for every internal node v of T, the heights of the children of V can differ by at least 1
- AVerdadero
- BFalso
171. A graph G=(V,E), where |E| = 100 and |V| = 10, is a dense graph
- AVerdadero
- BFalso
182. A graph G=(V,E), where |E| = 100 and |V| = 100 is a dense graph
- AVerdadero
- BFalso
194. The Breadth First Search algorithm traverse a graph in a linear time in terms of the number of vertices and edges of the graph.
- AVerdadero
- BFalso
203. Adjacency-list representation provides a compact way to represent dense graphs, whereas adjacency-matrix representation may be preferred for sparse graphs.
- AVerdadero
- BFalso
215. Depth First Search algorithm will discover all vertices at distance k from S before discovering vertices at distance k + 1 from S, where is the origin (starting vertex) of the graph.
- AVerdadero
- BFalso
226. Breadth First Search algorithm will explore edges out of the most recently discovered vertex that still has unexplored edges leaving it.
- AVerdadero
- BFalso
237. Breadth First Search has a faster time complexity than Depth First Search.
- AVerdadero
- BFalso
24The Depth of a tree node p equals to?
- ANumber of tree edges leading to p from an external node.
- BNumber of tree nodes below p in the tree.
- CNumber of ancestors of p, including p itself.
- DNumber of ancestors of p, excluding p itself.
25The Height of a tree node p equals to?
- ANumber of tree edges leading to p from root.
- BNumber of tree nodes above p in the tree.
- CZero, if p is an external node.
- DZero, if p is an internal node.
26The Height of a tree T equals to?
- AHeight of the root of the tree T
- BNumber of descendant nodes of deepest external nodes in T
- CNumber of ancestor nodes of the root of T
- DNone of above options are correct.
27Tree traversal algorithms include
- APreorder traversal
- BPostorder traversal
- CInorder traversal
- DAll of above
28A normal queue is a?
- AFIFO (first in first out) data structure.
- BLIFO (last in first out) data structure.
- COrdered array.
- DLinear tree.
29If the elements “A”, “B”, “C” and “D” are placed in a normal queue with “A” being the first to be entered to the queue, followed by “B”, “C” and “D”. If they are then deleted one at a time, in what order will they be removed?
- AABCD
- BDCBA
- CDCAB.
- DCannot be determined with the information given.
30If the elements “A”, “B”, “C” and “D” are placed in a priority queue with “A” being the first to be entered to the queue, followed by “B”, “C” and “D”. If they are then deleted one at a time, in what order will they be removed?
- AABCD
- BDCBA
- CDCAB
- DCannot be determined with the information given.
31If the elements “A”, “B”, “C” and “D” are placed in a priority queue with “A” being the first to be entered to the queue, followed by “B”, “C” and “D”. Also, among these elements, “D” has the highest priority, followed by “C”, “B”, and “A”. If they are then deleted one at a time, in what order will they be removed?
- AABCD
- BDCBA
- CDCAB
- DNone of the above.
32In computer science, the put(k,v) function of Map ADT
- AInsert new entry(k,v) to map if such entry does not exist in map.
- BDelete entry(k,v) in map.
- CSet value of entry with key k to v if such entry already exist in map.
- DBoth a and c are correct.
33In computer science, the performance of put(k,v) function of Map ADT takes?
- AO(n).
- BO(n^2).
- CO(lgn).
- DO(nlgn).
34In computer science, the performance of find(k) function of Map ADT?
- AAlways takes O(n).
- BAlways takes O(1).
- CTakes O(n) in the worst case.
- DTakes O(1) in the worst case.
35In computer science, the performance of Insertion function for a skip list is?
- AAlways O(n).
- BAlways O(lgn).
- CExpected to be O(n).
- DExpected to be O(lgn).
36The height of an AVL tree storing n keys is
- AO(n) in the worst case.
- BO(lgn) in the best case.
- CAlways O(n).
- DAlways O(lgn).
37After inserting an new node to an AVL tree
- AThe tree will always have to be rebalanced.
- BThe tree will never have to be rebalanced.
- CThe tree may have to be rebalanced.
- DAll of above.
38After deleting an existing node from an AVL tree
- AThe tree will always have to be rebalanced.
- BThe tree will never have to be rebalanced.
- CThe tree may have to be rebalanced.
- DAll of above.
39The performance of find/search operation for an AVL tree
- AIs O(n) in the worst case.
- Bis O(lgn) in the best case.
- CWill always be faster than O(n) .
- DWill never be faster than O(n).
Información
- Descripción
- Test sobre Sin título, creado por Michael Horstketter el 07/05/2019.
- Autor
- Michael Horstketter
- Idioma
- English
- Visitas
- 0
- Historial
- Creado el 7 may 2019 · actualizado el 7 may 2019
- Valoración
- Aún sin valoraciones Valora este test