Question

Write, specify and prove the function negative that
finds whether there occurs a negative number in the array or not,
starting from the first cell of the array

(Note: Prototype is as below) void negative ( int const * arr ,
size_t len){

}

Answer #1

//C code

void negative ( int const * arr , size_t len){

int flag=0;

for(int i=0;i<len;i++)

{

if (arr[i]<0)

flag=1;

}

if (flag==1)

printf("Array contain negative number");

else

printf("No negative number");

}

**Output:-**

1.For arr={4,-7,5,9,2,6,45} and len=7

**Array contain negative number**

2.For arr={4,7,5,9,2,6,45} and len=7

**No negative number**

This function declare a flag variable 0 and check for each element of the array if any element of the array is negative then this flag will be equal to 1.

So, we can easily check if flag will be 1 then there
is **Array contain negative number.** If flag is 0
then** No negative number.**

WRITE C++ PROGRAM FOR 1,2,3,4 PARTS of question,
DO ADD COOMENTS AND DISPLAY THE OUTPUT OF A RUNNING COMPILER
QUESTION:
1) 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 and populate an array with
first n Fibonacci numbers.
For example:
For n=10
Fibonacci Numbers: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55
2):
Write...

For some reason I followed the steps in my project and I am getting the incorrect output and when I am submitting it, it gives me compilation error.
Printing empty array -- next line should be blank
Testing append: Shouldn't crash!
Should print 100 through 110 below, with 110 on a new
line:
100
101 102 103 104 105 106 107 108 109
110
Checking capacity of new array:
OK
Append test #2:
Should print 100 through 120 below, on...

STRICT DOWNVOTE IF NOT DONE FULLY, WILL REPORT ALSO IF
COPY PASTED OR MODIFIED ANSWER Develop a class, using
templates, to provide functionality for a set of recursive
functions. The functions specified as recursive must be written
recursively (not iterativly). The UML class specifications are
provided below. A main will be provided. Additionally, a make file
will need to be developed and submitted. ● Recursion Set Class The
recursion set template class will implement the template functions.
recursionSet -length: int...

Do a theta analysis and count the
number of computations it performed in each
function/method of the following code:
import java.io.*;
import java.util.Scanner;
class sort
{
int a[];
int n;
long endTime ;
long totalTime;
long startTime;
static BufferedReader br = new BufferedReader(new
InputStreamReader(System.in));
public sort(int nn) // Constructor
{
a = new int[nn];
n = nn;
endTime= 0;
totalTime =0;
startTime =0;
}
public static void main(String args[]) throws IOException
{
System.out.print("\nEnter number of students: ");
int nn =...

Complete this in C++ and explain what is being done.
1 Introduction
The functions in the following subsections can all go in one big
file called pointerpractice.cpp.
1.1 Basics
Write a function, int square 1(int∗ p), that takes a pointer to
an int and returns the square of the int that it points to.
Write a function, void square 2(int∗ p), that takes a pointer to
an int and replaces that int (the one pointed to by p) with its...

My assignment:
Triplet Template Class Directions:
Define a template class for a generic triplet. The private data
member for the triplet is a generic array with three elements. The
triplet ADT has the following functions:
default constructor
explicit constructor: initialize the data member using
parameters
three accessors (three get functions) which will return the
value of each individual element of the array data member
one mutator (set function) which will assign values to the
data member...

Task 2: Compare strings. Write a function compare_strings() that
takes pointers to two strings as inputs and compares the character
by character. If the two strings are exactly same it returns 0,
otherwise it returns the difference between the first two
dissimilar characters. You are not allowed to use built-in
functions (other than strlen()) for this task. The function
prototype is given below: int compare_strings(char * str1, char *
str2);
Task 3: Test if a string is subset of another...

Please answer the following C question:
Read the following files called array-utils5A.c and
array-utils5A.h. Build an executable with gcc -Wall -DUNIT_TESTS=1
array-utils5A.c
The definitions for is_reverse_sorted and all_different
are both defective. Rewrite the definitions so that they are
correct.
The definition for is_alternating is missing. Write
a correct definition for that function, and add unit tests for it,
using the unit tests for is_reverse_sorted and all_different as
models.
Please explain the logic errors present in in the definition of
is_reverse_sorted...

Data Structures using C++
Consider the classes QueueADT and ArrayQueueType:
QueueADT:
#ifndef QUEUEADT_H
#define QUEUEADT_H
template <class ItemType>
class QueueADT
{
public:
// Action
responsibilities
virtual void resetQueue() =
0;
// Reset the
queue to an empty queue.
// Post: Queue
is empty.
virtual void add(const
ItemType& newItem) = 0;
// Function to
add newItem to the queue.
// Pre: The
queue exists and is not full.
...

Using the following code perform ALL of the tasks below in
C++:
-------------------------------------------------------------------------------------------------------------------------------------------
Implementation:
Overload input operator>> a bigint in the following
manner: Read in any number of digits [0-9] until a semi colon ";"
is encountered. The number may span over multiple lines. You can
assume the input is valid.
Overload the operator+ so that it adds two bigint together.
Overload the subscript operator[]. It should return the i-th
digit, where i is the 10^i position. So the first...

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 5 minutes ago

asked 5 minutes ago

asked 5 minutes ago

asked 12 minutes ago

asked 49 minutes ago

asked 51 minutes ago

asked 55 minutes ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago

asked 1 hour ago