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






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






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






4. The process of collecting garbage for recycling






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






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






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






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






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






10. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






11. A variable containing the address of other data






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






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






14. The next element in a linked list






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






16. A process that removes unwanted elements from a collection






17. First-child/next-sibling






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






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






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






21. Composed of individually named data fields






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






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






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. A list of pairs - where each pair has a key and a value associated with the key






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






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






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






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






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






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






32. All nodes below a give node in a tree






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






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






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






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






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






38. To hide similar items with the same name






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






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






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






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






43. Depth first search






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






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






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






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






48. A case where a program calls itself






49. A collection of values






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







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