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






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






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






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






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






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






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






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






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






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






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






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






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






14. To combine two ordered linear structures into one






15. A collection of values






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






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






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






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






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






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






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






23. Describes a function that modifies its arguments






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






25. A node of a tree that has children






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






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






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






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






30. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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






39. To hide similar items with the same name






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






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






42. Describes a though experiment or view of an entity






43. All nodes below a give node in a tree






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






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






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






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






48. The process of collecting garbage for recycling






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






50. Any container with linear ordering







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