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. An elements of a linked list - tree - or graph - often represented by a data structure






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






3. All nodes below a give node in a tree






4. Any container with linear ordering






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






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






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






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






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






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






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






12. The process of collecting garbage for recycling






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






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






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






16. A node of a tree that has children






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






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






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






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






21. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






30. To combine two ordered linear structures into one






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






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






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






34. A case where a program calls itself






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






36. A variable containing the address of other data






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






38. Two variables that reference the same object






39. Depth first search






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






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






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






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






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






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






46. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






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






48. A process that removes unwanted elements from a collection






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






50. Composed of individually named data fields







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