Data Structure and Algorithms Quiz 2 | Englishfreetest.com

  • Do test 20 minutes
  • Number Questions: 10 questions
  • By: englishfreetest.com
Do test

Here's the exercise 'Data Structure and Algorithms Quiz 2 | Englishfreetest.com' about Technical Quiz - Technical Tests.


Put your knowledge about all things technology to the test Because everything tech, from computers and the internet to software and big data, changes rapidly on a day-to-day basis, it’s now a must to stay up to date with the technology that dominates our modern day lives. Are you up to speed on what’s going on in the tech industry today? Take our quiz to find out. Test how much you know about technology

You can find more to the lesson and more exercises. Technical Quiz - Technical Tests in here.

Finally, click here to "Test" for start practice exercise .

  • Test content
    Question 1: The operation of processing each element in the list is known as
    A. Sorting
    B. Merging
    C. Inserting
    D. Traversal
    Question 2: When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return
    A. FAEKCDBHG
    B. FAEKCDHGB
    C. EAFKHDCBG
    D. FEAKDCHBG
    Question 3: When does top value of the stack changes?
    A. Before deletion
    B. While checking underflow
    C. At the time of deletion
    D. After deletion
    Question 4: Which of the following is not the type of queue?
    A. Priority queue
    B. Circular queue
    C. Single ended queue
    D. Ordinary queue
    Question 5: Which of the following is non-liner data structure?
    A. Stacks
    B. List
    C. Strings
    D. Trees
    Question 6: The logical or mathematical model of a particular organization of data is called a ____
    A. Data structure
    B. Data arrangement
    C. Data configuration
    D. Data formation
    Question 7: Which of the following points is/are true about Linked List data structure when it is compared with array
    A. Arrays have better cache locality that can make them better in terms of performance
    B. It is easy to insert and delete elements in Linked List
    C. Random access is not allowed in a typical implementation of Linked Lists
    D. All of the above
    Question 8: Which of the following case does not exist in complexity theory
    A. Best case
    B. Worst case
    C. Average case
    D. Null case
    Question 9: Which of the following data structure is linear type?
    A. Graph
    B. Trees
    C. Binary tree
    D. Stack
    Question 10: The situation when in a linked list START=NULL is
    A. underflow
    B. overflow
    C. housefull
    D. saturated