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. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






10. A variable containing the address of other data






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






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






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






14. All nodes below a give node in a tree






15. A node of a tree that has children






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






17. To hide similar items with the same name






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






19. Composed of individually named data fields






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






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






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






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






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






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






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






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






28. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






36. Depth first search






37. Describes a though experiment or view of an entity






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






39. A collection of values






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






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






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






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






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






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






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






47. First-child/next-sibling






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






49. A case where a program calls itself






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