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. The number of links between the root of a tree and the leaves






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






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






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






5. A collection of values






6. Two variables that reference the same object






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






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






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






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






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






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






13. To hide similar items with the same name






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






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






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






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






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






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






20. Any container with linear ordering






21. A pattern that describes a set of similar programs






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






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






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






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






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






27. A node of a tree that has children






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






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






30. Composed of individually named data fields






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






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






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






34. Depth first search






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






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






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






38. An elements of a linked list - tree - or graph - often represented by a data structure






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. The process of collecting garbage for recycling






41. A case where a program calls itself






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






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






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






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






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






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






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






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






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







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