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. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






19. A case where a program calls itself






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






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






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






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






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






25. The next element in a linked list






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






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






28. A variable containing the address of other data






29. Composed of individually named data fields






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






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






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






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






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






35. A node of a tree that has children






36. Describes a function that modifies its arguments






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






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






39. To hide similar items with the same name






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






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






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






43. The process of collecting garbage for recycling






44. Depth first search






45. Describes a though experiment or view of an entity






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






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






48. A problem that is so hard that it cannot be solved unless the problem is small






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






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







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