MT211 ITC450 A hash function which squares the key and takes three digits from the middle.

Transcription

1 MT211 ITC450 A pointer variable is avariable whose content is a) Text value b) An address, or memory location Syntax to declare pointed variable a. datetype *indetifier; b. *datatype identifier A list where addition and deletions are done at opposite ends. a) Stack b) Queue c) List A hash function which squares the key and takes three digits from the middle. a) Folding hashing b) Division-Remainder hashing c) Mid-Square hashing A function that calls another function and eventually result in the original function call a) Indirectly recursive b) Infinite recursive c) Directly recursive An AVL tree is binary search tree also called a) Tree b) Average Tree c) Height-balanced tree A.. is complete binary tree, where the values stored in anode is greater than or equal to the values of its children. a) Array 1

2 deletequeue : b) Heap a. Removes all the elements from the queue, leaving the queue empty b. Removes the front element of the queue; the queue must exist and must not be empty c. Checks whether the queue is full. If the queue is full, it returns the value true; otherwise, it returns the value false addqueue : a. Removes the front element of the queue; the queue must exist and must not be empty b. Returns the front (first) element of the queue; the queue must exist c. Adds a new element to the rear of the queue; the queue must exist and must not be full How many elements in the following queue? a. One b. Three c. Two The address of the first node in a link list is stored in a) link b) head c) heap d) array The diagram shows: a) Unsorted List b) None c) Sorted List d) List The formula mid=first +last/2 is used for a) Sequential search 2

3 b) Simple search c) Binary search In linear probing the following average number of comparison is considered as: ( 1 α) + 2 a) Unsuccessful search b) Successful search In chained addressing the following average number of comparison is considered as: 1+ α 2 a) Unsuccessful search b) Successful search When using hashing we have to consider:(may be more than one answer) Queque is full: a) A good hash function b) How to resolve collision c) An easy and simple algorithm a) The queuefront is Null b) If the system crashes c) If we run out of memory The number of passes to sort the numbers: 8, 22,7,9,31,19,5,13 a) 6 b) 8 c) 5 d) control structures:uses looping to repeat a set of statements a) Recursive 3

4 b) None c) Iterative The process of accessing data stroed in a tape is similar to manipulating data on a a) Stack b) Queue c) Heap d) List The diagram is a structure of a Data Link a) List b) Node c) Link d) Stack The correct answer at the question marks is Template<class Type> Bool queue Type<Type>::? { return (count == maxqueuesize); } a. isfullqueue () b. isemptyqueue () c. initialize Queue () The diagram is an example of a. delete queue b. none c. add queue isempty, isfull, listsize, maxlistsixe, Print ETC are the properties of a. Circular queue b. class arraylisttype c. Linked Lists In ADT, the

5 a) Data and operations are encapsulated b) All of the above c) Operation are declared d) Data are declared In a queue data structure the elements are added at one end, called the and deleted from the other end, called the a. rear, front b. both answers are incorrect A list is also known as a stack a) LIFO b) Unordered c) Ordered d) FIFO Inorder, preorder, postorder are examples of a) Traversal b) Trees c) Search d) Binary search The following is code for: PointerdataClass::~pointerDataClass() { Delete[]p; } a) Constructer b) Destructor c) Initializing Traverse the left subtree o o Visit the node Traverse the right subtree 5

6 These are the steps for a. postorder b. Inorder c. Preorder When an ordered list is in..state, the list is empty a) A slow b) A restricted c) An underflow Recursive function in which the last statement executed is the recursive call a. Directly recursive function b. Tail recursive function c. Infinite recursive function CODED QUESTIONS Second=new int[10]; for(int j=0; j<10; j++) Second[j] = first[j]; The code above is an example of, choose one answer a) Shallow against Deep copy and Pointers b) Shallow versus hardcopy and Pointers c) Shallow versus Deep copy and Pointers The following pseudo code represents template<class elemtype> int arraylisttype<elemtype>::seqsearch(const elemtype& item) { int loc; bool found = false; for(loc = 0; loc < length; loc++) if(list[loc] == item) { 6

7 found = true; break; } if(found) return loc; else return -1; }//end seqsearch a. Binary Search b. Sequential Search c. Simple Search Study the code below and identify the line in blue as a a) class String { public: String(const char *s); String(const String &copy); ~String(); char getcharacter ( int index); void deletecharacter ( int index); String & substring( int index, int sublength ); int length(); void print(); void println (); private: int len ; char * sptr ; }; (2 words) Answer: Default constructor Study the code below and identify the line in red as a class String { public: String(const char *s); String(const String &copy); ~String(); char getcharacter ( int index); void deletecharacter ( int index); String & substring( int index, int sublength ); int length(); 7

8 void print(); void println (); private: int len ; char * sptr ; }; Answer: Copy constructor q=p ->link; p->link=q->link; delete q; The code above is for choose one answer a) Insertion b) Deletion c) Creation The diagram below shows a. int *p; int num; b. int; p; int num2; c. int p; int num1; The values belonging to pointer data types are the a. spaces on the Hard Disk reserved for variables 8

9 b. memory addresses of a computer c. regular data types similar to the onew we usually use The pointer in the diagram is a. P b. x c Functions and Pointers example a. void example(int* &p) b. void example ( double *q) c. void example ( int* &p, double *q) The statement (*studentptr).gpa = 3.9; is equal to a. studentptr->gpa!= 3.9; b. studentptr->gpa >3.9; c. studentptr->gpa = 3.9; The diagram shows 9

10 a. Doubly Linked List b. circular List c. No list Code Sequence below is used for newnode link = q p link = newnode a. Deletion b. Creation c. Insertion The correct answer at the question marks is Template<class Type> Bool queue Type<Type>::? { return (count == maxqueuesize); } a. isfullqueue () b. initialize Queue () c. isemptyqueue () The diagram represents 10

11 a. AVL Trees b. Binary Tree c. Perfectly Balanced Binary Tree A technique to resolve collision which uses dynamic linked lists. a. linear probing b. random probing c. chained addressing Load factor is = a. HT size b. number of records in a table / HTSize c. HTSize / number of records in a table is an open addressing technique. If there is a collision, we continue from the hash location on, looking for the next available position. a. Random probing b. Chained addressing c. Linear probing InitializeQueue operation: 11

12 a. Checks whether the queue is empty. If the queue is empty, it returns the value true; otherwise, it returns the value false b. Initializes the queue to an empty state c. Removes all the elements from the queue, leaving the queue empty destroyqueue : a. Removes all the elements from the queue, leaving the queue empty b. Initializes the queue to an empty state c. Checks whether the queue is empty. If the queue is empty, it returns the value true; otherwise, it returns the value false isemptyqueue : a. Checks whether the queue is empty. If the queue is empty, it returns the value true; otherwise, it returns the value false b. Removes all the elements from the queue, leaving the queue empty c. Initializes the queue to an empty state The following code is for Template<class elemtype> struct nodetype { elemtype info; nodetype<elemtype> *llink; nodetype<elemtype> *rlink; }; a. node b. node of a binary tree c. node of a AVL TREE hash function : simple way to obtain a storage address is to divide the key value by the number of buckets and use the remainder as the storage address. a. Division-Remainder hashing b. Folding c. Mid-Square Hashing 12

13 What does the following C++ function perform? int hashfunction (char *key, int keylength ) { int sum = 0; for( int j = 0; j <= keylength ; j++) sum = sum + static_cast < int >(key[j]); return (sum % HTSize ); }//end hashfunction a. The C++ function uses the mid-square method to compute the address of the key b. The C++ function uses the division method to compute the address of the key c. The C++ function uses the folding method to compute the address of the key The following diagram shows: a. Binary Tree b. Tree c. Binary search tree In a hash table, a occurs when two keys hash to the same location a. collision b. folding c. sequential In a Mid-Square hashing function an eight digit integer maps to a. % b =1100 mapped to

14 c * = resulting in 708 as storage address In a folding hashing function an eight digit integer maps to a = 1100 used as 1100 b * = mapped to 708 c = 1100 truncated to 100 There are two categories of collision resolution techniques : a. Open addressing (closed hashing) and Mid-Square addressing b. Folding and Chaining (open hashing) c. Open addressing (closed hashing) and Chaining (open hashing) The diagram shows a. Search Trees b. NON AVL Trees c. AVL Trees SHORT ANSWER The many phases a program, goes through from the time it conceived until the time it is retired. Answer: software life cycle In a stack all activity occurs at one end-the. Answer: top is an acronym of last in first out. Answer :LIFO inserts a copy of item into the stack Answer: push(item) 14

15 Removes all the elements from the stack, leaving the stack empty Answer: destroystack The operation removes the data item from the stack Answer: pop The operation returns true if the stack is empty (i.e. has no elements). Answer: IsEmpty The data type of the link component of each node pointer variable is the type itself. Answer: node A... consists of two parts, asset of data items and fundamentals operations on this set Answer: datatype A is a data structure in which the last data item placed into the structure is the first accessed. Answer: stack :Returns the top element of the stack. Prior to this operation, the stack must exist and must not be empty. Answer: top Checks where the stack is full. if full, it returns true; otherwise it returns false Answer: isfullstack An is precise, step by step method of doing a task in a finite amount of time. Answer: algorithm A linked list in which the last node points to the node is called a circular linked list. Answer: first A pointer to the first node of the list is called the head pointer. And the pointer to the last node of the list is called the pointer. Answer: tail box testing method examines the logical structure of the program, and for each alternative that may occur, test data are devised that will lead to that alternative. Answer: white C++ classes are similar to structures, with the main difference being that classes can have functions, or methods, as well as variables, or data members in their definitions. These data members are called which are members of a class. Answer: Components The data type of each node depends on the specific application that is, what kind of data is being processed; however, the link component of each node is a. Answer: pointer 15

16 The operation to place a data item on the top of the stack is. Answer: push The operation on a stack object returns the actual number of elements in a stack. Answer: size Each pointer to a node must be declared as a pointer. Answer: variable section. Has a list of items that are made available to anyone who uses the new data type. Public Name the linked list: linked list is a linked list in which every node has a next pointer and a back pointer Every node (except the last node) contains the address of the next node, and every node (except the first node) contains the address of the previous node. linked list can be traversed in either direction Answer: doubly This section begins with the keyword followed by a colon. After a colon is a list of items that are part of the class but are not directly available to programmers who use the class. Answer: Private The address of the first node in a linked list is stored in the Answer: pointer head Classes use the technique of information hiding to avoid incorrect use of the class. This is done via the protected, private and key words. Answer: public A class can be considered a type, where an is an instance of a class. Answer: object design: is to Identify components (objects) which form the basis of solution and determine how these objects interact with one another Answer: object-oriented Steps to build a linked list forward: Create a new node called newnode If first is, the list is empty so you can make first and last point to newnode If first is not make last point to newnode and make last = newnode (1 word) : NULL What is needed to build a linked list backwards? a for the first node a to the new node being added (1 word) Answer: pointer 16

17 In the implementation of a linked list, the list is accessed through one or more to nodes. That is, the linked list consists of several nodes linked one by one. Answer: pointers للجميع تمنياتي بالتوفيق *(المجروح )* 17