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. An elements of a linked list - tree - or graph - often represented by a data structure






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






3. Describes a function that modifies its arguments






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






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






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






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






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






9. A pattern that describes a set of similar programs






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






11. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






21. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






30. To hide similar items with the same name






31. To combine two ordered linear structures into one






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






33. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






35. A variable containing the address of other data






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






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






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






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






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






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






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






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






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. In a tree search - to move back from the node currently being examined to its parent






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






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






48. Depth first search






49. The next element in a linked list






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







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