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 stack containing a stack frame of variable value for each active invocation of procedure






2. A queue implemented within an array - where the first elements of the array logically follows the last elements






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






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






5. Container for storing a collection of data in unique key/value pairs






6. A process that removes unwanted elements from a collection






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






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






9. The process of collecting garbage for recycling






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






11. The amount of space on the runtime stack required for execution of a program






12. First-child/next-sibling






13. A contiguous block of memory containing elements of the same type - accessed by numeric index






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






29. Depth first search






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






31. Any container with linear ordering






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






33. To hide similar items with the same name






34. A pattern that describes a set of similar programs






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






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






37. Describes a function that modifies its arguments






38. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children






39. The next element in a linked list






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






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






42. Describes a data structure or device in which all accesses have the same cost - O(1)






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






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






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






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






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






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






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






50. To combine two ordered linear structures into one







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