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 linked list in which the last element points back to the first element






2. Depth first search






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






4. Two variables that reference the same object






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






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






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






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






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. A search in which children of a node are considered before siblings are considered






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






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






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






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






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






17. A process that removes unwanted elements from a collection






18. All nodes below a give node in a tree






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






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






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






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






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






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






27. A variable containing the address of other data






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






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






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






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






32. A pattern that describes a set of similar programs






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






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






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






36. A collection of values






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






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






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






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






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






42. Any container with linear ordering






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






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






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






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






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






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






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






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







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