BENG (HONS) ELECTRONIC ENGINEERING BENG (HONS) TELECOMMUNICATIONS. Cohort: BEE/10A/FT, BEE/10B/FT &BTEL/10B/FT

Transcription

1 BENG (HONS) ELECTRONIC ENGINEERING BENG (HONS) TELECOMMUNICATIONS Cohort: BEE/10A/FT, BEE/10B/FT &BTEL/10B/FT Special Resit Examinations for September 2014 MODULE: PROGRAMMING FOR ENGINEERS MODULE CODE: PROG1114 Duration: 3 Hours Instructions to Candidates: 1. Answer all questions. 2. Questions may be answered in any order but your answers must show the question number clearly. 3. Always start a new question on a fresh page. 4. All questions do not carry equal marks. 5. Total marks 100. This question paper contains 4 questions and 7 pages. Page 1 of 7

2 QUESTION 1: (25 MARKS) ANSWER ALL QUESTIONS (a) The following code segments are erroneous. Correct the error(s) in each segment of code below. i) double mainint = ; double int = * mainint; cout<< setprecision(2) << fixed; cout<< "The calculated amount is" << int; ii) int t; cout << "Enter a number: "; cin << T; cout << "Your number is " << t; iii) x = 1; while( x <= 10 ); x++; } iv) string* sub1; string* sub2; *sub1 = Programming ; sub1 = sub2; v) int* x= &10; (10 marks) Page 2 of 7

3 (b) Write a block of code that prints out the odd numbers 1 through 999. You do not need to write a full program. (3 marks) Explain the difference between the two expressions below. x = 2 and x == 2 (d) What does the function fixed in the <iomanip> library do? (e) Highlight the difference between compile errors and runtime errors. Give a specific example of each type of error. (f) Rewrite the following for loop as a do-while loop. (4.5 marks) for (int x=0; x<100; x++) cout << x << " "; (3.5 marks) QUESTION 2: (25 MARKS) (a) Write a function dosum(n) that computes the sum of the numbers 1 through some integer N, where the signs alternate between + and -. For example, dosum(7) should return 4 because = 4. The program should include for loops. (5 marks) Page 3 of 7

4 (b) Briefly explain what is meant, by saying that a function called search is recursive. The binary search uses the divide and conquer strategy. It repeatedly divides the array into two pieces and then searches the piece that could contain the target value. Write a recursive binarysearch function to perform the binary search of an array. The function should receive an integer array, the starting subscript, ending subscript and search key as arguments. If the search key is found, the function should return the array subscript; otherwise, it should return -1. (10 marks) (d) Write a program that reads all data from the file experiment.txt, containing integers, and display them on the screen. (8 marks) Page 4 of 7

5 QUESTION 3: (25 MARKS) (a) Give two advantages of using functions to modularise a program? (b) Convert the following if/else sequence to a switch statement. int x; cin >> x; if (x == 2) cout << "x=2"; else if (x==3 x==5) { cout << "x=3 or 5"; x++; } (d) else if (x==4) cout << "x=4"; else cout << "Else."; (4 marks) Briefly explain the difference between passing parameters by value and passing parameters by reference. (4 marks) With appropriate example distinguish between static binding and dynamic binding? (5 marks) Page 5 of 7

6 (e) Write the output of the following program. #include <iostream> using namespace std; int main () { int *p; int x=37; cout<< Line 1: x = <<x<<endl; p=&x; cout<< Line 3: *p= <<*p<<, x = <<x<<endl; *p=58; cout<< Line 5: *p= <<*p<<, x = <<x<<endl; cout<< Line 6: Address of p = <<&p<<endl; cout<< Line 7: Value of p = <<p<<endl; cout<< Line 8: Value of the location pointed to by p = <<*p<<endl; cout<< Line 9: Address of x = <<&x<<endl; cout<< Line 10: Value of x = <<x<<endl; return 0; } (10 marks) QUESTION 4: (25 MARKS) (a) Write detailed notes on Classes and Objects. Your answer should include the following: (b) (i) Class and object definitions, (ii) Class declaration, (iii) Levels of restriction, (iv) Member variables and functions, (9 marks) i) What is a queue? ii) Write the class interface for a node and for a queue using the predefined node in C++. (8 marks) Page 6 of 7

7 A linked list may be represented as follows: The list starts with a pointer Head, which points to the first node and the next field of each node points to the next node. Diagrammatically show the steps i) to add a node at the beginning of the list. ii) to add a node at the end of the list. iii) to add a node in between two nodes. (6 marks) ***END OF QUESTION PAPER*** Page 7 of 7