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






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






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






4. A node of a tree that has children






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






6. First-child/next-sibling






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






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






9. Describes a though experiment or view of an entity






10. A variable containing the address of other data






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 pointer to data






13. A process that removes unwanted elements from a collection






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






15. A case where tow data structures share some elements






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






17. Composed of a collection of data values; implemented with a data structure






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






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






20. To combine two ordered linear structures into one






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






22. A case where a program calls itself






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






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






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. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






28. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






36. To hide similar items with the same name






37. Describes a function that modifies its arguments






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






39. Two variables that reference the same object






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






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






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






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






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






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






46. Depth first search






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






48. A linked list in which the last element points back to the first element






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






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







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