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 collection of objects that are inserted and removed according to the LIFO principle






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






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






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






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






6. Depth first search






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






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






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






10. A list of pairs - where each pair has a key and a value associated with the key






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






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






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






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






15. Describes a though experiment or view of an entity






16. All nodes below a give node in a tree






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






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






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






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






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






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






23. The process of collecting garbage for recycling






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






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






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






27. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






37. To combine two ordered linear structures into one






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






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






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






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






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






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






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






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






46. A runtime error that occurs when an operation such as method call is attempted on a null pointer






47. A case where a program calls itself






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






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






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







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