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 tree node containing a contents value but with no children






2. A pointer to data






3. Depth first search






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






5. A node of a tree that has children






6. Two variables that reference the same object






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






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






9. First-child/next-sibling






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






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






12. A pattern that describes a set of similar programs






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






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






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






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






17. The process of collecting garbage for recycling






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






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






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






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






22. A process that removes unwanted elements from a collection






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






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






25. A variable containing the address of other data






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






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






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






29. Any container with linear ordering






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






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






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






33. An elements of a linked list - tree - or graph - often represented by a data structure






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






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






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






37. The next element in a linked list






38. In a tree - a node that points to a given node






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






40. The top node of a tree - from which all other nodes can be reached






41. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






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






50. Use of a function or method without knowing how it's accomplished







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