Solved Exam 2 - Fundamentals of Programming II | CS 215, Exams of Computer Science

Download Solved Exam 2 - Fundamentals of Programming II | CS 215 and more Exams Computer Science in PDF only on Docsity!

/ CS215 Spring 2007 Written Exam 2 Version A ‘Closed book, closed notes, NO CALCULATORS or ics, remain seated and raise hand for questions, Witden Seon 71 red a e ae Tor) 00 Truc/False (2 points cach) Jndicate whether the statence or statement is tre or false, wie : BS ofRe Bae L 2 3. 4 aM es » An STL template specifier (what the data structure can bold) can only be a simple type such as int or floot. A doubly linked list can be traversed in two directions, . To insert an item into a linked list, the address in cach node must be changect. In order for a dynamic linked data structure to work properly, its nodes must be allocated contiguously in memory. The only way to implement the stack ADT is by using linked nodes. Whea a dynamic object is passed by value, a deep copy is created only if a copy constructor is. provided. A pointer variable can be passed as a parameter to a fumetion cither by valuc or by reference. A pointer variable is a variable whose content is a memory address. The size of a dynamic army is only limited by the ammount of available memory. ‘The delete operator has no effect if the pointer it is executed on has the value NULL. Version A Page - | -