* 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
* 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
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fac6c0457-7a45-43f2-b38c-64ac65853ed3%2Fdf336e44-7630-4fae-a03f-3a84f731bb46%2Fgoaocl9_processed.jpeg&w=3840&q=75)
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](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fac6c0457-7a45-43f2-b38c-64ac65853ed3%2Fdf336e44-7630-4fae-a03f-3a84f731bb46%2Fumhla7_processed.jpeg&w=3840&q=75)
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
Coding
Step by step
Solved in 3 steps with 3 images
Knowledge Booster
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.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education