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. Any container with linear ordering






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






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






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






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






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






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






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






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






10. Two variables that reference the same object






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






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






13. Describes a function that modifies its arguments






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






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






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






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






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






19. A variable containing the address of other data






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






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






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






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






24. A pointer to data






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






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






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






28. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






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






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






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






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






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






34. Describes a though experiment or view of an entity






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






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






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






38. First-child/next-sibling






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






40. All nodes below a give node in a tree






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






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






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






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






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






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






47. A process that removes unwanted elements from a collection






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






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






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







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