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. Two variables that reference the same object






2. First in first out: describes ordering of a queue






3. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






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






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






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






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






16. All nodes below a give node in a tree






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






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






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






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






21. A process that removes unwanted elements from a collection






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






23. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






47. Any container with linear ordering






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






49. A collection of values






50. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java







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