| CS-211 Programming Languages (B.Tech 3rd Semester, 2052) Time : 3 Hours Maximum Marks : 60 NOTE:- This paper consist of Three Sections. Section A is compulsory. Do any Four questions from Section B and any two questions from Section C Section-A Marks : 20 1 (a) What do you mean by inheritance ? (b) Define a pointer. (c) Define a virus and list its types. (d) Define the term data hiding and Data abstruction. (e) What is an array ? How does it differs from the ordinary variable ? (f) What are 'Nested for' loops ? (g) Differentiate between Interpreater and Compiler. (h) What are keywords ? (i) What do you mean by compaired Data Structures ? (j) Define the term Dynamic binding. Section-B Marks:5 Each 2. What is the difference between direct and indirect base class ? Expalin them with examples. 3. Write a program in C++ to sort out a set of names in the Alphabetical order using pointer Technique. 4. How are arrays usually processed in C++ ? Can entire arrays be proessed with single instructions, without using repetition ? 5. Write a program in C++ to find the number of vowels in each word of a given text using a pointer - "PUNJAB TECHNICAL UNIVERSITY ". 6. Write a program to display all the odd numbers between 1 and 100 using do-while loop. Section-C Marks : 10 Each 7. (a) Write a program to display the entered number in reverse order. (b) What are breaking control statements ? 8. Explain the following : (a) Windows application with MFC (b) Active X Controls (c) OLE 9. (a) Write differences between C and C++. (b) Recursion Vs. Iteration. |
| PROGRAMMING LANGUAGES |
| PAPER NO.2 |
| <<PREVIOUS 1 2 |
 |
 |
 |
|
| PUT ON JUNE, 2K2 |
| SIMILAR PAPERS : APPLICATION PROGRAMING FOR ENFINEERS (ECE) |