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 description of operations on a data type that could have multiple possible implementations






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






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






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






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






6. A node of a tree that has children






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






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






9. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






32. Two variables that reference the same object






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






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






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






36. To combine two ordered linear structures into one






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






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






39. A case where tow data structures share some elements






40. Describes a though experiment or view of an entity






41. Describes a function that modifies its arguments






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






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






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






45. All nodes below a give node in a tree






46. First-child/next-sibling






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






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






49. The next element in a linked list






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







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