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. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






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






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






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






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






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






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






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






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






10. A collection of values






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






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






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






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






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






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






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






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






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






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






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






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






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






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






25. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






26. A pattern that describes a set of similar programs






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






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






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






30. A pointer to data






31. A collection of objects that are inserted and removed according to the LIFO principle






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






33. A node of a tree that has children






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






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






36. A case where tow data structures share some elements






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






38. Depth first search






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






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






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






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






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






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






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






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






47. Any container with linear ordering






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






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






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







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