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






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






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






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






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






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






7. Describes a though experiment or view of an entity






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






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






10. The next element in a linked list






11. Describes a function that modifies its arguments






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






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






14. A case where tow data structures share some elements






15. First-child/next-sibling






16. To hide similar items with the same name






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






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






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. A given collection of values along with a collection of operations for use on those values






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






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






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






24. Depth first search






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






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






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






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






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






30. A pointer to data






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






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






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






34. A case where a program calls itself






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






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






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






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






39. Composed of individually named data fields






40. Last in first out: describes the order of a stack






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






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






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






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






45. The process of collecting garbage for recycling






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






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






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






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






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







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