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. In object oriented programming - a description of a set of similar objects






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






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






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






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






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






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






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






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






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






11. A given collection of values along with a collection of operations for use on those values






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






13. First-child/next-sibling






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






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






16. Any container with linear ordering






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






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






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






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






21. All nodes below a give node in a tree






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






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






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






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






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






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






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






29. A process that removes unwanted elements from a collection






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






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






32. Composed of individually named data fields






33. In a tree - a node pointed to by a parent node






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






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






36. A case where a program calls itself






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






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






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






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






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






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






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






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






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






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






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






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






49. A case where tow data structures share some elements






50. Two variables that reference the same object







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