Data Structure and Algorithms Quiz 1 | Englishfreetest.com

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

Here's the exercise 'Data Structure and Algorithms Quiz 1 | 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 memory address of the first element of an array is called
    A. floor address
    B. foundation address
    C. first address
    D. base address
    Question 2: Herder node is used as sentinel in ___
    A. Graphs
    B. Stacks
    C. Binary tree
    D. Queues
    Question 3: Stack is also called as
    A. Last in first out
    B. First in last out
    C. Last in last out
    D. First in first out
    Question 4: Two dimensional arrays are also called
    A. tables arrays
    B. matrix arrays
    C. both of above
    D. none of above
    Question 5: ____ is not the component of data structure
    A. Operations
    B. Storage Structures
    C. Algorithms
    D. None of above
    Question 6: Which of the following data structure can't store the non-homogeneous data elements?
    A. Arrays
    B. Records
    C. Pointers
    D. None
    Question 7: The time factor when determining the efficiency of algorithm is measured by
    A. Counting microseconds
    B. Counting the number of key operations
    C. Counting the number of statements
    D. Counting the kilobytes of algorithm
    Question 8: Which of the following is two way list?
    A. grounded header list
    B. circular header list
    C. linked list with header and trailer nodes
    D. none of above
    Question 9: Which if the following is/are the levels of implementation of data structure
    A. Abstract level
    B. Application level
    C. Implementation level
    D. All of the above
    Question 10: Two main measures for the efficiency of an algorithm are
    A. Processor and memory
    B. Complexity and capacity
    C. Time and space
    D. Data and space