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. An item (or description of items) being sough in a search






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






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






4. In a tree - a node pointed to by a parent node






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






6. A data structure that can be identified at runtime as being a member of a class






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






8. A simple case that can be solved easily - without recursion






9. A process that removes unwanted elements from a collection






10. In a tree search - to move back from the node currently being examined to its parent






11. Two variables that reference the same object






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






13. A linked list in which the last element points back to the first element






14. A linked list in which each elements has both forward and backward pointers






15. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






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






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






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






19. The process of collecting garbage for recycling






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






21. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used






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






23. To combine two ordered linear structures into one






24. 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






25. 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?"






26. Separation of the properties of a data type from its implementation






27. Composed of multiple sequential elements stored in contiguous bytes of memory






28. A case where tow data structures share some elements






29. The area of program text over which a variable can be referenced






30. The next element in a linked list






31. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






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






34. Describes a function that makes a new data structure but does not modify its arguments






35. First-child/next-sibling






36. Last in first out: describes the order of a stack






37. A list of pairs - where each pair has a key and a value associated with the key






38. Depth first search






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






40. storage that is no longer pointed to by any variable and therefore can no longer be accessed






41. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






43. A given collection of values along with a collection of operations for use on those values






44. A pattern that describes a set of similar programs






45. To hide similar items with the same name






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






47. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






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






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






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







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