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. Values are in the most basic form and cannot be decomposed into smaller parts






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






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






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






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






6. Describes a function that modifies its arguments






7. A pointer to data






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






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






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






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






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






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






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






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






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






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






18. A variable containing the address of other data






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






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






21. A process that removes unwanted elements from a collection






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






23. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






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






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






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






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






36. The process of collecting garbage for recycling






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






38. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






49. To hide similar items with the same name






50. A pattern that describes a set of similar programs







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