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






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






3. Any container with linear ordering






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






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






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






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






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






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






10. A case where a program calls itself






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






12. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






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






14. Describes a though experiment or view of an entity






15. A collection of values






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






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






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






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






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






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






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






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






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






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






26. The process of collecting garbage for recycling






27. An item (or description of items) being sough in a search






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






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






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






31. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






41. A case where tow data structures share some elements






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






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






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






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






46. Constructed of multiple components (simple or complex types)






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






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






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






50. A process that removes unwanted elements from a collection