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. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






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






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






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






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






6. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






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. To hide similar items with the same name






9. A node of a tree that has children






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






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






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






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






14. All nodes below a give node in a tree






15. Two variables that reference the same object






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






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






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






19. A process that removes unwanted elements from a collection






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






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






22. The process of collecting garbage for recycling






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






24. A case where a program calls itself






25. Describes a function that modifies its arguments






26. Depth first search






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






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






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






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






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






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






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






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






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. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






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






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






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






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






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






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






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






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






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






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






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






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






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






50. A case where tow data structures share some elements







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