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 data structure that can be identified at runtime as being a member of a class






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






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






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






5. Two variables that reference the same object






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






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






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






9. A collection of values






10. Composed of individually named data fields






11. Any container with linear ordering






12. A variable containing the address of other data






13. All nodes below a give node in a tree






14. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






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






16. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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






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






28. A pattern that describes a set of similar programs






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






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






31. A case where a program calls itself






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






33. Describes a function that modifies its arguments






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






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






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






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






38. An item (or description of items) being sough in a search






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






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






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






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






43. A case where tow data structures share some elements






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






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






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






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






48. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






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






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