GoConqr hat ein neues Design! Sag uns, wie es dir gefällt.

Kostenlos registrieren

Quiz

C++

Zara Klak 13 Fragen

Quiz starten

Fragen in diesem Quiz (13)

  1. 1Stack is also called as
    1. ALast in last out
    2. BNone of the mentioned
    3. CFirst in first out
    4. DFirst in last out
    5. ELast in first out
  2. 2.... is the component of data structure
    1. AAlgorithms
    2. BNone of the mentioned
    3. COperations
    4. DAll of the mentioned
    5. EStorage structures
  3. 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
    1. ANone of the mentioned
    2. Bdelete, insert
    3. Cpop, push
    4. Dinsert, delete
    5. Epush, pop
  4. 4answerBild zu Frage 4
    1. A1,6,2 and 7
    2. B11 and 12
    3. C2
    4. D1,6,2,7 and 9
    5. E1,6 and 2
  5. 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?Bild zu Frage 5
    1. A1 2 6 4 9 3 7 8 5
    2. B4 2 9 1 8 3 5 6 7
    3. C1 2 4 9 6 3 8 5 7
    4. D4 9 2 8 5 3 7 6 1
    5. E1 2 3 4 5 6 7 8 9
  6. 6.... is a pile in which items are added at one end and removed from each other
    1. AQueue
    2. BStack
    3. CList
    4. DHash tables
    5. ENone of the above
  7. 7... is a very useful in situation when data have to be stored and then retrieved in reverse order
    1. AQueue
    2. BList
    3. CLink list
    4. DHash tables
    5. EStack
  8. 8Which data structure allows deleting data elements from and inserting at rear?
    1. AStacks
    2. BHash-tables
    3. CBinary search tree
    4. DQueues
    5. EDequeues
  9. 9Which of the following data structure can't store the non-homogeneous data elemets?
    1. APointers
    2. BRecords
    3. CStacks
    4. DArrays
    5. EQueues
  10. 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
    1. AO(n)
    2. BO(log n)
    3. CO(1)
    4. DO(sqrt(n))
    5. EO(n * log n)

Informationen

Beschreibung
Quiz am C++, erstellt von Zara Klak am 28/04/2019.
Sprache
English
Aufrufe
5
Bewertung
Noch keine Bewertungen
Bewerte dieses Quiz
Bewerte dieses Quiz

Feedback

Worum geht es?

Wie gefällt dir das neue Design?

Dein Eindruck