4.merge3(), it merges array a and b to form c(in descending), if a and b are sorted in ascending o rder. 5 sortasc() - t o s ort array in ascending or

Transcription

1 P RACTICAL QUESTION(contd.) A RRAY a. Program to implement class array_search with following members- M embers data: A n array integer with 100 elements members functions- 1. To i nput n, and n number of elements 2. Linear search 3. Binary search(if array is in ascending order) 4. To display n elements of the array a menu in c++with following options- 1. Array input 2. Linear search 3. Binary searh 4. Array display b) Write a program in C++ with the help of class array_sort with following members- M emb er data : A n array ar of integer with 100 elements N o.of elements actually used by user (int n) a) T o input n, and n number of elements b) S election sort c) B ubble sort d) I nsertion sort e) T o display n elements of the array 1. Selection sort 2. Bubble Sort 3. Insertion Sort 4. Quit I n each menu option of sorting call array input function to enter elements of array and display f unction after sorting to display array. d. Write a program in C++ with the help of class array_merge with following members- A n array a of integer with 100 elements N o.of eleme nts actually used by user in array a (int m) A n array b of integer with 100 elements N o.of elements actually used by user in array b (int n) A n array c of integer with 200 elements N o.of e lements actually used by user in array c (int total) 1. To input array a and b with size m, n respectively 2. merge1(), it merges array a and b to form c(in ascending), if a and b are sorted in ascending and descending order respectiv ely 3.merge2(), it merges array a and b to form c(in ascending), if a and b are sorted in descending a nd ascending order respectively

2 4.merge3(), it merges array a and b to form c(in descending), if a and b are sorted in ascending o rder. 5 sortasc() - t o s ort array in ascending order(using any sorting method) 6. sortdesc() - t o sort array in descending order.(using any sorting method) 6.display() - T o display all the arrays a, b and c. 1. T o merge array a and b to form c(in ascending), if a and b are sorted in ascending and d escending order respectively 2. To merge array a and b to form c(in ascending), if a and b are sorted in descending and a scending order respectively 3. T o merge array a and b to form c(in descen ding), if a and b are sorted in ascending order 4. Q uit In each menu option of merging call array input function to enter elements of array,sorting functions to sort array in ascending or descending order and display function after sorting to d isplay n ew merged array. P ointers 1. Write a program in C++ with the help of following class employee P rivate s: 1 Employee name-s tring 2 Employee code-i nteger 3 Basic Salary-i nteger 4 Da-f 5 Hra-f 6 Total salary-f 7. cal_sal() - T o calculate following C ode D a H ra 1 50% of basic 30% of basic 2 40% of basic 25% of basic A ny other 30% of basic 20% of basic T otal Salary=Basic + Da + Hra Public s: - 1. To input employee detail (name, code and basic) and invokes cal_ sal() to c alculate total salary. 2. A function which returns the address of that object which has got higher basic salary(this function compares calling object and passing object- t his pointer) 3. To display the detail of t he employee I n main() function make two objects of employee. Input and calculate detail of every employee. Finally display the detail of that employee who draws the highest salary S tacks and Queues 1. Write a program in C++ with the help of class array_stack with following members- M ember data: An array of integer ar[max](where MAX is a globally-declared symbolic- constant (integer) w ith size according to the requirement of user) t op (It keeps the index of top most array element) A constructor that initialize 1 in top (s array_stack ready to push) T o push an item in stack.

3 T o pop an item from stack T o display the content of stack without popping 1. A initialize the stack( top must be - 1 ) 2. To push an item in stack. 2. Write a program in C++ with the help of class array_queue with following members- A n array of integer ar[max](where MAX is a globally-declared symbolic- constant (integer) w ith size according to the requirement of user) and rear ( They keep the index of -most and rear- m ost array element) 1. A constructor that initialize 1 in and rear (s array_queue ready for insertion). 4. To display the content of queue without deletion. 1. To initialize the queue( and rear must be - 1 ) 3. Write a program in C++ with the help of class circular_array_queue with following members- A n array of integer a r[max] ( Where MAX is a globally-declared symbolic- constant (integer) with size according to the r equirement of user) and rear ( They keep the index of -most and rear- m ost array element) 1. A constructor that initialize 1 in and rear (s circular_array_queue ready for i nsertion) 2. To insert an item in circular queue. 3. To delete an item from circular queue 4. To display the content of circular queue without deletion. 1. To initialize the queue( and rear must be - 1 ) 4. Write a program in C++ with the help of class linked_stack with following members- ( Nodes of the linked stack are created by self-referential structure node-

4 s truct node { i nt info; n ode *next; }; A pointer top which keeps the address of top- m ost node. 1.A c onstructor that initialize NULL in top (s array_stack ready to push) 2. To push an item on stack. 1. A initialize the stack( to p must be NULL) 2. To push an item in stack. 5. Write a program in C++ with the help of class linked_queue with following members- ( Nodes of the linked queue are created by self-referential structure node- s truct node { i nt info; n ode *next; }; m ember Data : and rear ( They keep the memory address of -most and rear- m ost linked queue) 1. A constructor that initialize NULL in and rear (s linked queue ready for i nsertion). 4. To display the content of queue without deletion. 1. To initialize the queue( and rear must be NULL) S tructured Query Q No:13,14 and 15 Total Language N umber of Questions 1. Revision Tour C lasses and Objects 2

5 3. C onstructors and destructors 2 4. Data File Handling-text file-2,binary file-2 5. Array-4 6. Pointers-1 7. Stacks and Queues SQL-3 T otal Number of questions:24