Test
C++
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 (13)
1Stack is also called as
- ALast in last out
- BNone of the mentioned
- CFirst in first out
- DFirst in last out
- ELast in first out
2.... is the component of data structure
- AAlgorithms
- BNone of the mentioned
- COperations
- DAll of the mentioned
- EStorage structures
3Inserting an item into the stack is not full is called .... Operation and deletion of item from the stack, when stack is not empty is called .... operation
- ANone of the mentioned
- Bdelete, insert
- Cpop, push
- Dinsert, delete
- Epush, pop
4answer
- A1,6,2 and 7
- B11 and 12
- C2
- D1,6,2,7 and 9
- E1,6 and 2
5here is a binary tree. if we visit the nodes of this tree using a inorder traversal, in what order will the nodes be visited?
- A1 2 6 4 9 3 7 8 5
- B4 2 9 1 8 3 5 6 7
- C1 2 4 9 6 3 8 5 7
- D4 9 2 8 5 3 7 6 1
- E1 2 3 4 5 6 7 8 9
6.... is a pile in which items are added at one end and removed from each other
- AQueue
- BStack
- CList
- DHash tables
- ENone of the above
7... is a very useful in situation when data have to be stored and then retrieved in reverse order
- AQueue
- BList
- CLink list
- DHash tables
- EStack
8Which data structure allows deleting data elements from and inserting at rear?
- AStacks
- BHash-tables
- CBinary search tree
- DQueues
- EDequeues
9Which of the following data structure can't store the non-homogeneous data elemets?
- APointers
- BRecords
- CStacks
- DArrays
- EQueues
10Assuming that the hash function for a table works well, and the size of the hash table is reasonably large compared to the number of items in the table, the expected(average) time needed to find an item in a hash table containing n items is
- AO(n)
- BO(log n)
- CO(1)
- DO(sqrt(n))
- EO(n * log n)
11What is the asymptotic runtime for traversing all nodes in a binary search tree with n nodes and printing them in order?
- AO(log(n))
- BO(n)
- CO(sqrt(n))
- DO(n*log n)
- EO(n^2)
12Which of the following is non-linear data structure?
- ANone of the mentioned
- BList
- CTrees
- DStrings
- EStacks
13Which of the following is linear data structure?
- AStack
- BGraph
- CBinary tree
- DTrees
- ERed-black trees
Información
- Descripción
- Test sobre C++, creado por Zara Klak el 28/04/2019.
- Autor
- Zara Klak
- Idioma
- English
- Visitas
- 5
- Valoración
- Aún sin valoraciones Valora este test