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. First in first out: describes ordering of a queue






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






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






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






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






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






7. To hide similar items with the same name






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






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






10. Depth first search






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






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






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






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






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






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






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






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






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






20. First-child/next-sibling






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






22. A case where a program calls itself






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






24. The process of collecting garbage for recycling






25. To combine two ordered linear structures into one






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






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






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






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






30. A description of the state of a process such as a board game






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






32. Describes a function that modifies its arguments






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






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






35. The next element in a linked list






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






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






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






39. A case where tow data structures share some elements






40. A process that removes unwanted elements from a collection






41. All nodes below a give node in a tree






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






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






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






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






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






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






48. Composed of individually named data fields






49. A pointer to data






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







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