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. Composed of a collection of data values; implemented with a data structure






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






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






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






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






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






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






8. Depth first search






9. Any container with linear ordering






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






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






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






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






14. A case where a program calls itself






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






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






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






18. The process of collecting garbage for recycling






19. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






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






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






22. A node of a tree that has children






23. A variable containing the address of other data






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. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






41. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






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







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