Test your basic knowledge |

Data Structures

Subject : it-skills
Instructions:
  • Answer 50 questions in 15 minutes.
  • If you are not ready to take this test, you can study here.
  • Match each statement with the correct term.
  • Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.

This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. A linked list in which each elements has both forward and backward pointers






2. A section of the runtime stack holding the values of all variables for one invocation






3. A stack containing a stack frame of variable value for each active invocation of procedure






4. A tree node containing a contents value but with no children






5. A problem that is so hard that it cannot be solved unless the problem is small






6. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






7. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






8. A process that removes unwanted elements from a collection






9. Given two sets -the union is the set of elements that are members of either set






10. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






11. To hide similar items with the same name






12. A problem whose solution requires a linear amount of time or space if the problem is size n






13. The next element in a linked list






14. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip






15. In object oriented programming - a description of a set of similar objects






16. Given two sets - the intersection is the set of elements that are members of both sets






17. In a tree - the union of a node's parent and the parent's ancestors






18. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






19. A sequence of records - where each record contains a link to the next one






20. An order of processing a tree in which the parent node is processed after its children






21. A classification of objects into a tree structure that groups related objects






22. An order of processing a tree in which the parent node is processed before its children






23. To look through a data structure until a goal object is found






24. A runtime error that occurs when an operation such as method call is attempted on a null pointer






25. Composed of a collection of data values; implemented with a data structure






26. A search in which children of a node are considered before siblings are considered






27. Two variables that reference the same object






28. Composed of individually named data fields






29. To convert from a pointer to the data that is pointed to






30. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






31. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






32. The process of collecting garbage for recycling






33. A collection of objects that are inserted and removed according to the LIFO principle






34. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






35. A condition of the input data where the data will be handled by call(s) to the same program






36. The number of links between the root of a tree and the leaves






37. A case where tow data structures share some elements






38. A description of operations on a data type that could have multiple possible implementations






39. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






40. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






41. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






42. A node of a tree that has children






43. Values are in the most basic form and cannot be decomposed into smaller parts






44. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure






45. Constructed of multiple components (simple or complex types)






46. An extra record at the start or end of a data structure such as a linked list - to simplify processing






47. A pointer to the next element in a linked list






48. A description of the state of a process such as a board game






49. In a search tree - a program that changes a state into a child state e.g a move in a game






50. First in first out: describes ordering of a queue







Sorry!:) No result found.

Can you answer 50 questions in 15 minutes?


Let me suggest you:

Browse all subjects

Browse all tests

Most popular tests



Major Subjects

Tests & Exams


AP
CLEP
DSST
GRE
SAT
GMAT

Browse all subjects

Browse all tests

Most popular tests