Scribd
Upload
6 views3 pages

Lab 02

This lab manual outlines the objectives and tasks for a lab in Object Oriented Programming at the National University of Computer and Emerging Sciences. Students will learn about pointers, dynamic arrays, and functions through various programming tasks, including creating an incrementer, generating Fibonacci numbers, and compressing arrays. The manual includes specific programming exercises to enhance practical understanding of these concepts.

Uploaded by

Aiyshah Meerab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views3 pages

Lab 02

This lab manual outlines the objectives and tasks for a lab in Object Oriented Programming at the National University of Computer and Emerging Sciences. Students will learn about pointers, dynamic arrays, and functions through various programming tasks, including creating an incrementer, generating Fibonacci numbers, and compressing arrays. The manual includes specific programming exercises to enhance practical understanding of these concepts.

Uploaded by

Aiyshah Meerab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

National University of Computer and Emerging Sciences

Lab Manual 02
Object Oriented Programming

Course Instructor Miss Abeeda Akram


Lab Instructor (s) Miss. Siddiqua Nayyer
Mr. Dilawar Shabbir
Section BCS – 2A
Semester Spring 2021

Department of Computer Science


FAST-NU, Lahore, Pakistan

1.1 Objectives
After performing this lab, students shall be able to:
 Have an improved understanding of pointers.
 Create and manipulate 1D dynamic array.
 Allocation and de-allocation of 1D array.
 Passing dynamic arrays into functions.
TASK 1:

A C++ program “Incrementer” creates a dynamic array of size 10. This function adds 3 to each
element of the array. You have to add to the elements using pointer only. Array subscript nota-
tion cannot be used.

TASK 2:
Fibonacci sequence is a sequence in which every number after the first two is the sum of the two
preceding ones. Write a C++ program that takes a number n from user that is size and populate a
dynamic array with first n Fibonacci numbers. De-allocation is also required.
For example:
For n=10
Fibonacci Numbers: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55

TASK 3:
Write a C++ program that declares and initializes a float array dynamically and finds the index
of the first occurrence of the second largest element in the array.
For Example:

Input:
Please enter size: 5
Please enter elements: 1.5
7.8
3.2
9.0
7.1

Output:
Second Largest element is: 7.8
Index of second largest element is: 1

TASK 4:
Exercise 1 [Input Array]:
Write a function int* InputArray(int& size) that asks user to enter size of required array,
allocates the memory on heap, takes input in array and returns its pointer.
Exercise 2 [Output Array]:
Write a program void OutputArray(int* myArray, const int& size) that takes a pointer to an
integer array and prints its data.
Write main function to test above functionality.
Exercise 3 [Compress Array]:
Write a function int* CompressArray(int* oiginalArr, int& size) that takes a sorted array and
removes duplicate elements from this array.
Sample Run:
//Input:
Enter Size of array: 10
Enter 10 elements: 1 2 2 2 3 3 3 3 3 7
//Output
Array after Compression: 1 2 3 7

Your function will compress the original array, allocate new array of compressed size
(compressed size is 4 in above example) on heap, copy updated array in new array and return the
new array.
Take input from user by calling int* InputArray(int& size) (function you implemented in
Exercise 1). Call CompressArray, call OutputArray(function you implemented in Exercise 2) to
display the final output.

You might also like