* TODO func: has_dups * desc: returns 1 if given array a contains at least one duplicate value. example: { 0, 10, 9, 10, 8} : yes, 10 is duplicated { 8, 8, 8, 8, 8} : yes, 8 is duplicated { 0, 10, 9, 15, 8} : no, there are no duplicates */ int has_dups (int a[], int n) { } // DO NOT MOVE OR CHANGE THE LINE BELOW!! #ifndef FUNCS_ONLY } int main() { // you can add testing code here! // DO NOT MOVE OR CHANGE THE LINE BELOW!! #endif

EBK JAVA PROGRAMMING
9th Edition
ISBN:9781337671385
Author:FARRELL
Publisher:FARRELL
Chapter8: Arrays
Section: Chapter Questions
Problem 2RQ
icon
Related questions
Question
Complete the function below. You must not change the fuction signatures, names return types and parametersmust remain as given. Please the code must be in c+
#include <stdio.h>
/*
* TODO
func:
sudoku_ok
* desc: determines if the given array of 9 integers.
represents a valid "row" in the game of sudoku.
*
*
*
*
*
}
*
*
*
*/
int
}
/*
because
In other words:
each of 1, 2, 3, .../
9 must appear exactly
once in the array a for it to be valid.
returns 1 if it is valid
returns 0 otherwise.
* TODO
* func: vec_product
* desc: computes the "vector product" of the given
*
The result (a scalar
array so floats a, and b.
float) is returned.
*
*
*
is
*
*
* wikipedia link:
Note: we do not have a parameter "n" here
the length of the array is ALWAYS 9
sudoku_ok (int a[]) {
/*
https://en.wikipedia.org/wiki/Dot_product#Algebraic_
definition
*/
float vec_product(float a[], float b[], int n) {
*
CLARIFICATION: the function should compute what
commonly called a DOT-product or INNER-product.
*
* TODO
func: has_dups
* desc: returns 1 if given array a contains at
least one
*
*
duplicate value.
example:
{ 0, 10, 9, 10, 8} : yes, 10 is duplicated
{ 8, 8, 8, 8, 8}
duplicated
: yes, 8 is
{0, 10, 9, 15, 8} : no, there are no
Transcribed Image Text:#include <stdio.h> /* * TODO func: sudoku_ok * desc: determines if the given array of 9 integers. represents a valid "row" in the game of sudoku. * * * * * } * * * */ int } /* because In other words: each of 1, 2, 3, .../ 9 must appear exactly once in the array a for it to be valid. returns 1 if it is valid returns 0 otherwise. * TODO * func: vec_product * desc: computes the "vector product" of the given * The result (a scalar array so floats a, and b. float) is returned. * * * is * * * wikipedia link: Note: we do not have a parameter "n" here the length of the array is ALWAYS 9 sudoku_ok (int a[]) { /* https://en.wikipedia.org/wiki/Dot_product#Algebraic_ definition */ float vec_product(float a[], float b[], int n) { * CLARIFICATION: the function should compute what commonly called a DOT-product or INNER-product. * * TODO func: has_dups * desc: returns 1 if given array a contains at least one * * duplicate value. example: { 0, 10, 9, 10, 8} : yes, 10 is duplicated { 8, 8, 8, 8, 8} duplicated : yes, 8 is {0, 10, 9, 15, 8} : no, there are no
/*
* TODO
* func: vec_product
* desc: computes the "vector product" of the given
The result (a scalar
*
array so floats a, and b.
float) is returned.
*
*
* CLARIFICATION: the function should compute what
is
* commonly called a DOT-product or INNER-product.
*
wikipedia link:
*
https://en.wikipedia.org/wiki/Dot_product#Algebraic_
definition
*/
float vec product (float a[], float b[], int n) {
}
/*
* TODO
func: has_dups
* desc: returns 1 if given array a contains at
least one
*
duplicate value.
*
example:
{ 0, 10, 9, 10, 8}
: yes, 10 is duplicated
{ 8, 8, 8, 8, 8} : yes, 8 is duplicated
{ 0, 10, 9, 15, 8} : no, there are no
duplicates
*
*
*
*/
int has_dups (int a[], int n) {
}
// DO NOT MOVE OR CHANGE THE LINE BELOW!!
#ifndef FUNCS_ONLY
int main() {
}
// you can add testing code here!
// DO NOT MOVE OR CHANGE THE LINE BELOW!!
#endif
Transcribed Image Text:/* * TODO * func: vec_product * desc: computes the "vector product" of the given The result (a scalar * array so floats a, and b. float) is returned. * * * CLARIFICATION: the function should compute what is * commonly called a DOT-product or INNER-product. * wikipedia link: * https://en.wikipedia.org/wiki/Dot_product#Algebraic_ definition */ float vec product (float a[], float b[], int n) { } /* * TODO func: has_dups * desc: returns 1 if given array a contains at least one * duplicate value. * example: { 0, 10, 9, 10, 8} : yes, 10 is duplicated { 8, 8, 8, 8, 8} : yes, 8 is duplicated { 0, 10, 9, 15, 8} : no, there are no duplicates * * * */ int has_dups (int a[], int n) { } // DO NOT MOVE OR CHANGE THE LINE BELOW!! #ifndef FUNCS_ONLY int main() { } // you can add testing code here! // DO NOT MOVE OR CHANGE THE LINE BELOW!! #endif
Expert Solution
steps

Step by step

Solved in 3 steps with 3 images

Blurred answer
Knowledge Booster
Array
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
EBK JAVA PROGRAMMING
EBK JAVA PROGRAMMING
Computer Science
ISBN:
9781337671385
Author:
FARRELL
Publisher:
CENGAGE LEARNING - CONSIGNMENT
Programming with Microsoft Visual Basic 2017
Programming with Microsoft Visual Basic 2017
Computer Science
ISBN:
9781337102124
Author:
Diane Zak
Publisher:
Cengage Learning