Which XXX condition generates the following output Not foun.pdf
•
0 likes•29 views
Which XXX condition generates the following output? Not found #include <stdio.h> int BinarySearch(int numberList[], int element, int lowVal, int highVal) { int midVal; if (XXX) { midVal = (highVal + lowVal) / 2; if (numberList[midVal] == element) { return midVal; } else if (numberList[midVal] > element) { return BinarySearch(numberList, element, lowVal, midVal - 1); } else { return BinarySearch(numberList, element, midVal + 1, highVal); } } else { return -1; } } int main(void) { int size = 10; int numberList[size]; int element = 20; int matchPos; for (int i = 0; i < size; ++i) { numberList[i] = i; } matchPos = BinarySearch(numberList, element, 0, size - 1); if (matchPos >= 0) { printf("Found at position %d.n", matchPos); } else { printf("Not found.n"); } return 0; } options: lowVal >= highVal lowVal == highVal lowVal <= highVal lowVal + highVal == 0.
Report
Share
Report
Share
Download to read offline
![Which XXX condition generates the following output? Not found
#include <stdio.h> int BinarySearch(int numberList[], int element, int lowVal, int highVal) { int
midVal; if (XXX) { midVal = (highVal + lowVal) / 2; if (numberList[midVal] == element) { return
midVal; } else if (numberList[midVal] > element) { return BinarySearch(numberList, element,
lowVal, midVal - 1); } else { return BinarySearch(numberList, element, midVal + 1, highVal); } }
else { return -1; } } int main(void) { int size = 10; int numberList[size]; int element = 20; int
matchPos; for (int i = 0; i < size; ++i) { numberList[i] = i; } matchPos = BinarySearch(numberList,
element, 0, size - 1); if (matchPos >= 0) { printf("Found at position %d.n", matchPos); } else {
printf("Not found.n"); } return 0; }
options:
lowVal >= highVal
lowVal == highVal
lowVal <= highVal
lowVal + highVal == 0](https://image.slidesharecdn.com/whichxxxconditiongeneratesthefollowingoutputnotfoun-230322042931-bc5d98b6/85/Which-XXX-condition-generates-the-following-output-Not-foun-pdf-1-320.jpg)
Recommended
Hitchhiker's Guide to Functional Programming
Refactoring imperative Java code to functional following clean code principles
Questions has 4 parts.1st part Program to implement sorting algor.pdf
Questions has 4 parts.
1st part: Program to implement sorting algorithms:
#include
#include
#include
using namespace std;
void swap(std::vector & data, int i, int j)
{
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
void print(std::vector const & data)
{
std::vector::const_iterator iter = data.begin();
for (; iter != data.end(); ++iter)
{
cout << *iter << \" \";
}
if (data.size() > 0)
{
cout << endl;
}
}
int generateRandom(int low, int high);
void Shuffle(std::vector & data)
{
int length = data.size();
for (int i = 0; i < length-1; ++i)
{
swap(data, i, generateRandom(i+1, length-1));
}
print(data);
}
int generateRandom(int low, int high)
{
srand(low);
int gen = 0;
gen = rand() % (high - low + 1) + low;
return gen;
}
//useful for small lists, and for large lists where data is
//already sorted
void BubbleSort(std::vector & data)
{
int length = data.size();
for (int i = 0; i < length; ++i)
{
bool swapped = false;
for (int j = 0; j < length - (i+1); ++j)
{
if (data[j] > data[j+1])
{
swap(data, j, j+1);
swapped = true;
}
}
if (!swapped) break;
}
}
//useful for small lists and where swapping is expensive
// does at most n swaps
void SelectionSort(std::vector & data)
{
int length = data.size();
for (int i = 0; i < length; ++i)
{
int min = i;
for (int j = i+1; j < length; ++j)
{
if (data[j] < data[min])
{
min = j;
}
}
if (min != i)
{
swap(data, i, min);
}
}
}
//useful for small and mostly sorted lists
//expensive to move array elements
void InsertionSort(std::vector & data)
{
int length = data.size();
for (int i = 1; i < length; ++i)
{
bool inplace = true;
int j = 0;
for (; j < i; ++j)
{
if (data[i] < data[j])
{
inplace = false;
break;
}
}
if (!inplace)
{
int save = data[i];
for (int k = i; k > j; --k)
{
data[k] = data[k-1];
}
data[j] = save;
}
}
}
void Merge(std::vector & data, int lowl, int highl, int lowr, int highr);
void MergeSort(std::vector & data, int low, int high)
{
if (low >= high)
{
return;
}
int mid = low + (high-low)/2;
MergeSort(data, low, mid);
MergeSort(data, mid+1, high);
Merge(data, low, mid, mid+1, high);
}
void Merge(std::vector & data, int lowl, int highl, int lowr, int highr)
{
int tmp_low = lowl;
std::vector tmp;
while (lowl <= highl && lowr <= highr)
{
if (data[lowl] < data[lowr])
{
tmp.push_back(data[lowl++]);
}
else if (data[lowr] < data[lowl])
{
tmp.push_back(data[lowr++]);
}
else
{
tmp.push_back(data[lowl++]);
tmp.push_back(data[lowr++]);
}
}
while (lowl <= highl)
{
tmp.push_back(data[lowl++]);
}
while (lowr <= highr)
{
tmp.push_back(data[lowr++]);
}
std::vector::const_iterator iter = tmp.begin();
for(; iter != tmp.end(); ++iter)
{
data[tmp_low++] = *iter;
}
}
int Partition(std::vector & data, int low, int high);
void QuickSort(std::vector & data, int low, int high)
{
if (low >= high) return;
int p = Partition(data, low, high);
QuickSort(data, low, p-1);
QuickSort(data, p+1, high);
}
int Partition(std::vector & data, int low, int high)
{
int p = low;
for (int i = p+1; i <= high; ++i)
{
if (data[i] < data[p])
{
swap.
Implement the ListArray ADT-Implement the following operations.pdf
Implement the ListArray ADT-
*Implement the following operations:
- constructor, assignment operator, destructor
-insert, remove, replace, clear
-isFull, isEmpty
-gotoBeginning, gotoEnd, gotoNext, gotoPrior, getCursor
#ifndef LISTARRAY_H
#define LISTARRAY_H
#include
#include
using namespace std;
#pragma warning( disable : 4290 )
template < typename DataType >
class List
{
public:
static const int MAX_LIST_SIZE = 10; // Default maximum list size
// Constructors
List ( int maxNumber = MAX_LIST_SIZE ); // Default constructor
List ( const List& source ); // Copy constructor
// Overloaded assignment operator
List& operator= ( const List& source );
// Destructor
virtual ~List ();
// List manipulation operations
virtual void insert ( const DataType& newDataItem ) // Insert after cursor
throw ( logic_error );
void remove () throw ( logic_error ); // Remove data item
virtual void replace ( const DataType& newDataItem ) // Replace data item
throw ( logic_error );
void clear (); // Clear list
// List status operations
bool isEmpty () const; // List is empty
bool isFull () const; // List is full
// List iteration operations
void gotoBeginning () // Go to beginning
throw ( logic_error );
void gotoEnd () // Go to end
throw ( logic_error );
bool gotoNext () // Go to next data item
throw ( logic_error );
bool gotoPrior () // Go to prior data item
throw ( logic_error );
DataType getCursor () const
throw ( logic_error ); // Return data item
// Output the list structure -- used in testing/debugging
virtual void showStructure () const;
// In-lab operations
void moveToNth ( int n ) // Move data item to pos. n
throw ( logic_error );
bool find ( const DataType& searchDataItem ) // Find data item
throw ( logic_error );
protected:
// Data members
int maxSize,
size, // Actual number of data item in the list
cursor; // Cursor array index
DataType *dataItems; // Array containing the list data item
};
#endif
Solution
#include \"ListArray.h\" Struct List List ::List(int maxNumber = MAX_LIST_SIZE) {
size = cursor = 0; maxSize = maxNumber; dataItems = new DataType
[maxNumber]; for(int i = 0; i < maxNumber; i++) dataItems[i] = NULL; }
List ::List(const List& source) { maxSize = MAX_LIST_SIZE;
dataItems = new DataType [MAX_LIST_SIZE]; for(int i = 0; i < MAX_LIST_SIZE;
i++) dataItems[i] = source.dataItems[i]; size = source.size; cursor =
source.cursor; } List ::operator= (const List &source) { this -> clear();
for(int i = 0; i < maxSize; i++) dataItems[i] = source.dataItems[i]; //return
source; } List::~List() { delete [] dataItems; } void List_insert(const
DataType &newDataItem) { if(size == 0) dataItems[cursor] = newDataItem;
else { dataItems[cursor + 1] = newDataItem; } size++;
cursor = size - 1; } void List_remove() { dataItems[cursor] = NULL; size--
; if(dataItems[cursor + 1] == NULL) cursor = 0; else
cursor++; } void List_replace(const DataType &newDataItem) { dataItems[cursor]
= newDataItem; } void List_clear() { for(int i = 0; i < size; i++)
dataItems[i] = NULL; size =.
Mixing functional programming approaches in an object oriented language
My slides from Biz Tech Delhi
An object of class StatCalc can be used to compute several simp.pdf
/*
An object of class StatCalc can be used to compute several simple statistics
for a set of numbers. Numbers are entered into the dataset using
the enter(double) method. Methods are provided to return the following
statistics for the set of numbers that have been entered: The number
of items, the sum of the items, the average, the standard deviation,
the maximum, and the minimum.
*/
public class Stats {
private int count; // Number of numbers that have been entered.
private double sum; // The sum of all the items that have been entered.
private double squareSum; // The sum of the squares of all the items.
private double max = Double.NEGATIVE_INFINITY; // Largest item seen.
private double min = Double.POSITIVE_INFINITY; // Smallest item seen.
int[] myList;
public int getCount() {
System.out.println(myList.size());
count = myList.size().
// Return number of items that have been entered.
return count;
}
public double getSum() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
return sum;
}
public double getMean() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
if(count > 0)
return sum / count;
else
return -1;
}
public double getMin() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return smallest;
}
public double getMax() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return largetst;
}
stats(int [] data)
{
if(data.count <= count)
{
if(myList.size() > 0)
System.arraycopy( myList, 0, data, 0, count );
}
}
stats()
{
Scanner s = new Scanner(System.in);
int count = s.nextInt();
s.nextLine(); // throw away the newline.
int [] numbers = new int[count];
Scanner numScanner = new Scanner(s.nextLine());
for (int i = 0; i < count; i++) {
if (numScanner.hasNextInt()) {
numbers[i] = numScanner.nextInt();
} else {
System.out.println(\"You didn\'t provide enough numbers\");
break;
}
}
System.arraycopy( myList, 0, numbers, 0, count );
}
stats(int size)
{
setValue(size);
}
private void setValue(int size)
{
count = size;
myList = new int[size];
}
} // end class StatCalc
public class SimpleStats {
public static void main(String[] args) {
Stat calc; // Computes stats for numbers entered by user.
calc = new Stat(100);
int arry[] = {20.20.40,30.80,,70,4,5,6,7,10}
calc.setvalue(array);
double item; // One number entered by the user.
TextIO.putln(\"Enter your numbers. Enter 0 to end.\");
TextIO.putln();
do {
TextIO.put(\"? \");
item = TextIO.getlnDouble();
if (item != 0)
calc.enter(item);
} while ( item != 0 );
TextIO.putln(\"\ Statistics about your calc:\ \");
TextIO.putln(\" Count: \" + calc.getCount());
TextIO.putln(\" Sum: \" + calc.getSum());
TextIO.putln(\" Minimum: \" + calc.getMin());
TextIO.putln(\" Maximum: \" + ca.
Recommended
Hitchhiker's Guide to Functional Programming
Refactoring imperative Java code to functional following clean code principles
Questions has 4 parts.1st part Program to implement sorting algor.pdf
Questions has 4 parts.
1st part: Program to implement sorting algorithms:
#include
#include
#include
using namespace std;
void swap(std::vector & data, int i, int j)
{
int tmp = data[i];
data[i] = data[j];
data[j] = tmp;
}
void print(std::vector const & data)
{
std::vector::const_iterator iter = data.begin();
for (; iter != data.end(); ++iter)
{
cout << *iter << \" \";
}
if (data.size() > 0)
{
cout << endl;
}
}
int generateRandom(int low, int high);
void Shuffle(std::vector & data)
{
int length = data.size();
for (int i = 0; i < length-1; ++i)
{
swap(data, i, generateRandom(i+1, length-1));
}
print(data);
}
int generateRandom(int low, int high)
{
srand(low);
int gen = 0;
gen = rand() % (high - low + 1) + low;
return gen;
}
//useful for small lists, and for large lists where data is
//already sorted
void BubbleSort(std::vector & data)
{
int length = data.size();
for (int i = 0; i < length; ++i)
{
bool swapped = false;
for (int j = 0; j < length - (i+1); ++j)
{
if (data[j] > data[j+1])
{
swap(data, j, j+1);
swapped = true;
}
}
if (!swapped) break;
}
}
//useful for small lists and where swapping is expensive
// does at most n swaps
void SelectionSort(std::vector & data)
{
int length = data.size();
for (int i = 0; i < length; ++i)
{
int min = i;
for (int j = i+1; j < length; ++j)
{
if (data[j] < data[min])
{
min = j;
}
}
if (min != i)
{
swap(data, i, min);
}
}
}
//useful for small and mostly sorted lists
//expensive to move array elements
void InsertionSort(std::vector & data)
{
int length = data.size();
for (int i = 1; i < length; ++i)
{
bool inplace = true;
int j = 0;
for (; j < i; ++j)
{
if (data[i] < data[j])
{
inplace = false;
break;
}
}
if (!inplace)
{
int save = data[i];
for (int k = i; k > j; --k)
{
data[k] = data[k-1];
}
data[j] = save;
}
}
}
void Merge(std::vector & data, int lowl, int highl, int lowr, int highr);
void MergeSort(std::vector & data, int low, int high)
{
if (low >= high)
{
return;
}
int mid = low + (high-low)/2;
MergeSort(data, low, mid);
MergeSort(data, mid+1, high);
Merge(data, low, mid, mid+1, high);
}
void Merge(std::vector & data, int lowl, int highl, int lowr, int highr)
{
int tmp_low = lowl;
std::vector tmp;
while (lowl <= highl && lowr <= highr)
{
if (data[lowl] < data[lowr])
{
tmp.push_back(data[lowl++]);
}
else if (data[lowr] < data[lowl])
{
tmp.push_back(data[lowr++]);
}
else
{
tmp.push_back(data[lowl++]);
tmp.push_back(data[lowr++]);
}
}
while (lowl <= highl)
{
tmp.push_back(data[lowl++]);
}
while (lowr <= highr)
{
tmp.push_back(data[lowr++]);
}
std::vector::const_iterator iter = tmp.begin();
for(; iter != tmp.end(); ++iter)
{
data[tmp_low++] = *iter;
}
}
int Partition(std::vector & data, int low, int high);
void QuickSort(std::vector & data, int low, int high)
{
if (low >= high) return;
int p = Partition(data, low, high);
QuickSort(data, low, p-1);
QuickSort(data, p+1, high);
}
int Partition(std::vector & data, int low, int high)
{
int p = low;
for (int i = p+1; i <= high; ++i)
{
if (data[i] < data[p])
{
swap.
Implement the ListArray ADT-Implement the following operations.pdf
Implement the ListArray ADT-
*Implement the following operations:
- constructor, assignment operator, destructor
-insert, remove, replace, clear
-isFull, isEmpty
-gotoBeginning, gotoEnd, gotoNext, gotoPrior, getCursor
#ifndef LISTARRAY_H
#define LISTARRAY_H
#include
#include
using namespace std;
#pragma warning( disable : 4290 )
template < typename DataType >
class List
{
public:
static const int MAX_LIST_SIZE = 10; // Default maximum list size
// Constructors
List ( int maxNumber = MAX_LIST_SIZE ); // Default constructor
List ( const List& source ); // Copy constructor
// Overloaded assignment operator
List& operator= ( const List& source );
// Destructor
virtual ~List ();
// List manipulation operations
virtual void insert ( const DataType& newDataItem ) // Insert after cursor
throw ( logic_error );
void remove () throw ( logic_error ); // Remove data item
virtual void replace ( const DataType& newDataItem ) // Replace data item
throw ( logic_error );
void clear (); // Clear list
// List status operations
bool isEmpty () const; // List is empty
bool isFull () const; // List is full
// List iteration operations
void gotoBeginning () // Go to beginning
throw ( logic_error );
void gotoEnd () // Go to end
throw ( logic_error );
bool gotoNext () // Go to next data item
throw ( logic_error );
bool gotoPrior () // Go to prior data item
throw ( logic_error );
DataType getCursor () const
throw ( logic_error ); // Return data item
// Output the list structure -- used in testing/debugging
virtual void showStructure () const;
// In-lab operations
void moveToNth ( int n ) // Move data item to pos. n
throw ( logic_error );
bool find ( const DataType& searchDataItem ) // Find data item
throw ( logic_error );
protected:
// Data members
int maxSize,
size, // Actual number of data item in the list
cursor; // Cursor array index
DataType *dataItems; // Array containing the list data item
};
#endif
Solution
#include \"ListArray.h\" Struct List List ::List(int maxNumber = MAX_LIST_SIZE) {
size = cursor = 0; maxSize = maxNumber; dataItems = new DataType
[maxNumber]; for(int i = 0; i < maxNumber; i++) dataItems[i] = NULL; }
List ::List(const List& source) { maxSize = MAX_LIST_SIZE;
dataItems = new DataType [MAX_LIST_SIZE]; for(int i = 0; i < MAX_LIST_SIZE;
i++) dataItems[i] = source.dataItems[i]; size = source.size; cursor =
source.cursor; } List ::operator= (const List &source) { this -> clear();
for(int i = 0; i < maxSize; i++) dataItems[i] = source.dataItems[i]; //return
source; } List::~List() { delete [] dataItems; } void List_insert(const
DataType &newDataItem) { if(size == 0) dataItems[cursor] = newDataItem;
else { dataItems[cursor + 1] = newDataItem; } size++;
cursor = size - 1; } void List_remove() { dataItems[cursor] = NULL; size--
; if(dataItems[cursor + 1] == NULL) cursor = 0; else
cursor++; } void List_replace(const DataType &newDataItem) { dataItems[cursor]
= newDataItem; } void List_clear() { for(int i = 0; i < size; i++)
dataItems[i] = NULL; size =.
Mixing functional programming approaches in an object oriented language
My slides from Biz Tech Delhi
An object of class StatCalc can be used to compute several simp.pdf
/*
An object of class StatCalc can be used to compute several simple statistics
for a set of numbers. Numbers are entered into the dataset using
the enter(double) method. Methods are provided to return the following
statistics for the set of numbers that have been entered: The number
of items, the sum of the items, the average, the standard deviation,
the maximum, and the minimum.
*/
public class Stats {
private int count; // Number of numbers that have been entered.
private double sum; // The sum of all the items that have been entered.
private double squareSum; // The sum of the squares of all the items.
private double max = Double.NEGATIVE_INFINITY; // Largest item seen.
private double min = Double.POSITIVE_INFINITY; // Smallest item seen.
int[] myList;
public int getCount() {
System.out.println(myList.size());
count = myList.size().
// Return number of items that have been entered.
return count;
}
public double getSum() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
return sum;
}
public double getMean() {
int sum = 0;
for (int i = 0; i < myList.length; i++)
{
sum +=mylist[i];
}
if(count > 0)
return sum / count;
else
return -1;
}
public double getMin() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return smallest;
}
public double getMax() {
int smallest = myList[0];
int largetst = myList[0];
for(int i=1; i< mylist.length; i++)
{
if(mylist[i] > largetst)
largetst = numbers[i];
else if (mylist[i] < smallest)
smallest = numbers[i];
}
return largetst;
}
stats(int [] data)
{
if(data.count <= count)
{
if(myList.size() > 0)
System.arraycopy( myList, 0, data, 0, count );
}
}
stats()
{
Scanner s = new Scanner(System.in);
int count = s.nextInt();
s.nextLine(); // throw away the newline.
int [] numbers = new int[count];
Scanner numScanner = new Scanner(s.nextLine());
for (int i = 0; i < count; i++) {
if (numScanner.hasNextInt()) {
numbers[i] = numScanner.nextInt();
} else {
System.out.println(\"You didn\'t provide enough numbers\");
break;
}
}
System.arraycopy( myList, 0, numbers, 0, count );
}
stats(int size)
{
setValue(size);
}
private void setValue(int size)
{
count = size;
myList = new int[size];
}
} // end class StatCalc
public class SimpleStats {
public static void main(String[] args) {
Stat calc; // Computes stats for numbers entered by user.
calc = new Stat(100);
int arry[] = {20.20.40,30.80,,70,4,5,6,7,10}
calc.setvalue(array);
double item; // One number entered by the user.
TextIO.putln(\"Enter your numbers. Enter 0 to end.\");
TextIO.putln();
do {
TextIO.put(\"? \");
item = TextIO.getlnDouble();
if (item != 0)
calc.enter(item);
} while ( item != 0 );
TextIO.putln(\"\ Statistics about your calc:\ \");
TextIO.putln(\" Count: \" + calc.getCount());
TextIO.putln(\" Sum: \" + calc.getSum());
TextIO.putln(\" Minimum: \" + calc.getMin());
TextIO.putln(\" Maximum: \" + ca.
Parsing swiftly-Cocoaheads-2015-02-12
Parsing in Swift using established Functional Programming techniques.
search_sort Search sortSearch sortSearch sortSearch sort
Search sort Search sort Search sort Search sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sort
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se
Groovy Refactoring Patterns
Slides from GR8 Conf EU 2019 talk - "Groovy Refactoring Patterns". In this talk, I share the refactoring patterns I observed during Groovy development.
It is the main program that implement the min(), max(), floor(), cei.pdf
It is the main program that implement the min(), max(), floor(), ceiling(), select(), rank(),delete(),
deleteMin(), deleteMax(), keys()
import java.util.NoSuchElementException;
public class BST, Value> {
private Node root;
private class Node {
private Key key;
private Value val;
private Node left, right;
private int size;
public Node(Key key, Value val, int size) {
this.key = key;
this.val = val;
this.size = size;
}
}
public BST() {
}
public boolean isEmpty() {
return size() == 0;
}
public int size() {
return size(root);
}
// return number of key-value pairs in BST rooted at x
private int size(Node x) {
if (x == null) return 0;
else return x.size;
}
public boolean contains(Key key) {
if (key == null) throw new NullPointerException(\"argument to contains() is null\");
return get(key) != null;
}
public Value get(Key key) {
return get(root, key);
}
private Value get(Node x, Key key) {
if (x == null) return null;
int cmp = key.compareTo(x.key);
if (cmp < 0) return get(x.left, key);
else if (cmp > 0) return get(x.right, key);
else return x.val;
}
public void put(Key key, Value val) {
if (key == null) throw new NullPointerException(\"first argument to put() is null\");
if (val == null) {
delete(key);
return;
}
root = put(root, key, val);
assert check();
}
private Node put(Node x, Key key, Value val) {
if (x == null) return new Node(key, val, 1);
int cmp = key.compareTo(x.key);
if (cmp < 0) x.left = put(x.left, key, val);
else if (cmp > 0) x.right = put(x.right, key, val);
else x.val = val;
x.size = 1 + size(x.left) + size(x.right);
return x;
}
public void deleteMax() {
if (isEmpty()) throw new NoSuchElementException(\"Symbol table underflow\");
root = deleteMax(root);
assert check();
}
private Node deleteMax(Node x) {
if (x.right == null) return x.left;
x.right = deleteMax(x.right);
x.size = size(x.left) + size(x.right) + 1;
return x;
}
public void delete(Key key) {
if (key == null) throw new NullPointerException(\"argument to delete() is null\");
root = delete(root, key);
assert check();
}
private Node delete(Node x, Key key) {
if (x == null) return null;
int cmp = key.compareTo(x.key);
if (cmp < 0) x.left = delete(x.left, key);
else if (cmp > 0) x.right = delete(x.right, key);
else {
if (x.right == null) return x.left;
if (x.left == null) return x.right;
Node t = x;
x = min(t.right);
x.right = deleteMin(t.right);
x.left = t.left;
}
x.size = size(x.left) + size(x.right) + 1;
return x;
}
public Key min() {
if (isEmpty()) throw new NoSuchElementException(\"called min() with empty symbol
table\");
return min(root).key;
}
private Node min(Node x) {
if (x.left == null) return x;
else return min(x.left);
}
public Key max() {
if (isEmpty()) throw new NoSuchElementException(\"called max() with empty symbol
table\");
return max(root).key;
}
private Node max(Node x) {
if (x.right == null) return x;
else return max(x.right);
}
public Key floor(Key key) {
if (key == null) throw new NullPointerException(\"argument to floor() is null\");
if (isEmpty()) throw ne.
Mixing Functional and Object Oriented Approaches to Programming in C#
Mixing Functional and Object Oriented Approaches to Programming in C#, Michael Wagg, Mark Needham
I cant figure out why I keep getting an -Exception in thread -main- ja.pdf
I cant figure out why I keep getting an "Exception in thread "main"
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0"
Here is the code after screenshot if needed:
for (int k = 0; k < elements.size(); k += 2) {
int coefficient = coefficients.get(j);
int count = Integer.parseInt(elements.get(k + 1));
balancedEquation.append(elements.get(k));
if (coefficient * count != 1) {
balancedEquation.append(coefficient * count);
}
}
j++;
}
System.out.println(balancedEquation.toString());
}
}
}
} catch (FileNotFoundException e) {
System.out.println("File not found: " + fileName);
}
}
private static Map<String, Integer> parseSide(String side) {
Map<String, Integer> elements = new HashMap<>();
String[] compounds = side.split("\\+");
for (String compound : compounds) {
compound = compound.trim();
int coeff = 1;
int i = 0;
if (Character.isDigit(compound.charAt(0))) {
coeff = compound.charAt(0) - '0';
i++;
}
String element = "";
while (i < compound.length()) {
char c = compound.charAt(i);
if (Character.isUpperCase(c)) {
if (!element.isEmpty()) {
elements.put(element, elements.getOrDefault(element, 0) + coeff);
}
element = "" + c;
i++;
if (i < compound.length() && Character.isLowerCase(compound.charAt(i))) {
element += compound.charAt(i);
i++;
}
} else if (Character.isDigit(c)) {
int j = i;
while (j < compound.length() && Character.isDigit(compound.charAt(j))) {
j++;
}
int num = Integer.parseInt(compound.substring(i, j));
coeff *= num;
i = j;
} else {
i++;
}
}
if (!element.isEmpty()) {
elements.put(element, elements.getOrDefault(element, 0) + coeff);
}
}
return elements;
}
public static List<String> splitCompound(String compound) {
List<String> elements = new ArrayList<>();
int i = 0;
while (i < compound.length()) {
char c = compound.charAt(i);
if (Character.isUpperCase(c)) {
String element = Character.toString(c);
i++;
if (i < compound.length() && Character.isLowerCase(compound.charAt(i))) {
element += compound.charAt(i);
i++;
}
String count = "";
while (i < compound.length() && Character.isDigit(compound.charAt(i)))
{
count += compound.charAt(i);
i++;
}
if (count.equals("")) {
count = "1";
}
elements.add(element);
elements.add(count);
} else if (c == '(') {
i++;
int j = compound.indexOf(')', i);
String subCompound = compound.substring(i, j);
i = j + 1;
String count = "";
while (i < compound.length() && Character.isDigit(compound.charAt(i))) {
count += compound.charAt(i);
i++;
}
if (count.equals("")) {
count = "1";
}
List<String> subElements = splitCompound(subCompound);
for (int k = 0; k < subElements.size(); k += 2) {
String element = subElements.get(k);
int subCount = Integer.parseInt(subElements.get(k + 1));
int total = subCount * Integer.parseInt(count);
if (elements.contains(element)) {
int index = elements.indexOf(element) + 1;
int currentCount = Integer.parseInt(elements.get(index));
elements.set(index, Integer.toString(currentCount + total));
} else {
elements.add(element);
elements.add(Integer.toString(total));
}
}
} else .
Merge sort in CSolution#include-stdio-h- #define MAX 50 void mergeSort.docx
Merge sort in C
Solution
#include<stdio.h>
#define MAX 50
void mergeSort(int arr[],int low,int mid,int high);
void partition(int arr[],int low,int high);
int main(){
int merge[MAX],i,n;
printf(\"Enter the total number of elements: \");
scanf(\"%d\",&n);
printf(\"Enter the elements which to be sort: \");
for(i=0;i<n;i++){
scanf(\"%d\",&merge[i]);
}
partition(merge,0,n-1);
printf(\"After merge sorting elements are: \");
for(i=0;i<n;i++){
printf(\"%d \",merge[i]);
}
return 0;
}
void partition(int arr[],int low,int high){
int mid;
if(low<high){
mid=(low+high)/2;
partition(arr,low,mid);
partition(arr,mid+1,high);
mergeSort(arr,low,mid,high);
}
}
void mergeSort(int arr[],int low,int mid,int high){
int i,m,k,l,temp[MAX];
l=low;
i=low;
m=mid+1;
while((l<=mid)&&(m<=high)){
if(arr[l]<=arr[m]){
temp[i]=arr[l];
l++;
}
else{
temp[i]=arr[m];
m++;
}
i++;
}
if(l>mid){
for(k=m;k<=high;k++){
temp[i]=arr[k];
i++;
}
}
else{
for(k=l;k<=mid;k++){
temp[i]=arr[k];
i++;
}
}
for(k=low;k<=high;k++){
arr[k]=temp[k];
}
}
Sample output:
Enter the total number of elements: 5
Enter the elements which to be sort: 2 5 0 9 1
After merge sorting elements are: 0 1 2 5 9
.
Engineering lecture ppt by venay magen
Venay Magen likes the shading red, particularly on Tuesdays. He cherishes to drink bourbon (on all days). He figured out how to drink whisky from his youth companion Zippo, when they went to class together at Mount Temple Comprehensive School. He is best known as the lead vocalist for the band MN3.
( PLEASE SHOW HOW TO IMPLEMENT THE DELETION FUNCTION )SAMPLE OUTPU.pdf
( PLEASE SHOW HOW TO IMPLEMENT THE DELETION FUNCTION )
SAMPLE OUTPUT: Instead of using a linked list to resolve collisions, as in separate chaining,
use a binary search tree. That is, create a hash table that is an array of trees. You could use H(X)
= X % arraysize as the hash function in your hash table implementation. The arraySize needs to
be an input parameter from users. Your solution should support the basic hash table inserting,
searching, and displaying functions. To display a small tree-based hash table, you could use an
in-order traversal of each tree. The advantage of a tree over a linked list is that it can be searched
in O(logN) instead of O(N) time. Checking 15 items takes a maximum of 15 comparisons in a
list but only 4 in a tree. Duplicates can present problems in both trees and hash tables, so add
some code that prevents a duplicate key from being inserted in the hash table. To shorten the
listing for this program, you can forget about deletion, which for trees requires a lot of code. [ten
bonus points will be given to those who implement the deletion function.]
Solution
import java.util.Scanner;
class BinaryNode
{
BinaryNode lchild, rchild;
int data;
public BinaryNode(int d)
{
data = d;
lchild = null;
rchild = null;
}
}
class HashTableusingBinaryTree
{
private BinaryNode[] t;
private int size ;
public HashTableusingBinaryTree(int tableSize)
{
t = new BinaryNode[ nextPosition(tableSize) ];
size = 0;
}
public boolean isEmpty()
{
return size == 0;
}
public void Empty()
{
int l = t.length;
t = new BinaryNode[l];
size = 0;
}
public int sizeofht()
{
return size;
}
public void insert(int val)
{
size++;
int pos = myhashtable(val);
BinaryNode head = t[pos];
head = insert(head, val);
t[pos] = head;
}
private BinaryNode insert(BinaryNode node, int data)
{
if (node == null)
node = new BinaryNode(data);
else
{
if (data <= node.data)
node.lchild = insert(node.lchild, data);
else
node.rchild = insert(node.rchild, data);
}
return node;
}
public void remove(int val)
{
int pos = myhashtable(val);
BinaryNode head = t[pos];
try
{
head = delete(head, val);
size--;
}
catch (Exception e)
{
System.out.println(\"\ Element not present\ \");
}
t[pos] = head;
}
private BinaryNode delete(BinaryNode head, int k)
{
BinaryNode a, b, n;
if (head.data == k)
{
BinaryNode lt, rt;
lt = head.lchild;
rt = head.rchild;
if (lt == null && rt == null)
return null;
else if (lt == null)
{
a = rt;
return a;
}
else if (rt == null)
{
a = lt;
return a;
}
else
{
b = rt;
a = rt;
while (a.lchild != null)
a = a.lchild;
a.lchild = lt;
return b;
}
}
if (k < head.data)
{
n = delete(head.lchild, k);
head.lchild = n;
}
else
{
n = delete(head.rchild, k);
head.rchild = n;
}
return head;
}
private int myhashtable(Integer x )
{
int hashVal = x.hashCode( );
hashVal %= t.length;
if (hashVal < 0)
hashVal += t.length;
return hashVal;
}
private static int nextPosition( int r )
{
if (r % 2 == 0)
r++;
for ( ; !isnext( r ); r += 2);
return r;
}
private static boolean isnext( int r )
{
if (r ==.
Implement a function in c++ which takes in a vector of integers and .pdf
Implement a function in c++ which takes in a vector of integers and also takes in another integer
d which we will refer to as depth. The function will recursively call quicksort while
decrementing depth until the depth has reached 0. Thenpoithe algorithm will switch over to
heapsort to finish the sorting of the vector. For this problem also comment in the code what the
value of d needs to with respect to the size of the vector n for the algorithm to have worst case
run time of O(n log(n)).
#include
#include
using namespace std;
void quicksort(vector & items)
{
if(items.size() > 1)
{
vector small;
vector same;
vector large;
int pivot = items[0];
for(int i = 1; i < items.size(); i++)
{
if(items[i] < pivot)
small.push_back(items[i]);
else if(items[i] > pivot)
large.push_back(items[i]);
else
same.push_back(items[i]);
}
quicksort(small);
quicksort(large);
std::move(begin(small),end(small),begin(items)); //moving the piece of memory that is
small to the items memory
std::move(begin(same),end(same),begin(items) + small.size());
std::move(begin(large),end(large),end(items) - large.size());
}
else
{
//Do nothing
}
}
int leftChild(int i)
{
return 2*i + 1;
}
void percDown(vector & v, int i, int n)
{
int child;
//int leftChild;
int temp;
for(temp = v[i]; leftChild(i) < n; i = child)
{
child = leftChild(i);
if(child != n-1 && v[child] < v[child + 1]) //compare children
{
child++; //We want our right child
}
if(temp < v[child])
{
v[i] = v[child]; //Swapping
v[child] = temp;
}
else
{
break;
}
}
}
void heapsort(vector & v)
{
for(int i = v.size() /2 -1; i >= 0; --i)
{
percDown(v, i, v.size()); //Build Heap
}
for(int j = v.size() - 1; j > 0; --j)
{
swap(v[0],v[j]);
percDown(v, 0, j); //Remove max
}
}
int main()
{
int a[] = {1,10,3,2,5,8};
vector v(a,a + sizeof(a)/sizeof(int));
for(int i = 0; i < v.size(); i++)
{
cout << v[i] << \" \";
}
cout << endl;
cout << \"Sorted \" << endl;
quicksort(v);
for(int i = 0; i < v.size(); i++)
{
cout << v[i] << \" \";
}
cout << endl;
heapsort(v);
for(int i = 0; i < v.size(); i++)
{
cout << v[i] << endl;
}
mixSort(v)
for(int i = 0 i < v.size(); i++)
{
cout < }
int x;
cin >> x;
}
Solution
#include
#include
using namespace std;
void quicksort(vector & items)
{
if(items.size() > 1)
{
vector small;
vector same;
vector large;
int pivot = items[0];
for(int i = 1; i < items.size(); i++)
{
if(items[i] < pivot)
small.push_back(items[i]);
else if(items[i] > pivot)
large.push_back(items[i]);
else
same.push_back(items[i]);
}
quicksort(small);
quicksort(large);
std::move(begin(small),end(small),begin(items)); //moving the piece of memory that is
small to the items memory
std::move(begin(same),end(same),begin(items) + small.size());
std::move(begin(large),end(large),end(items) - large.size());
}
else
{
//Do nothing
}
}
int leftChild(int i)
{
return 2*i + 1;
}
//comment this method for your solution.....
void percDown(vector & v, int i, int n)
{
int child;
//int leftChild;
int temp;
for(temp = v[i]; leftChild(i) < n; i = child)
{
child = leftC.
Given the following codepackage data1;import java.util.;p.pdf
Given the following code
package data1;
import java.util.*;
/*public class BST> implementing a set ADT and containing the following:
* private inner class BinaryNode representing a node with a (possibly) left child and a (possibly)
right child
** instance fields BinaryNode root, int size
* contains/insert/remove method - w/ O(height) complexity
** size O(1), isEmpty O(1), clear O(1),
*** findMin, findMax, findHeight methods - w/ O(height) complexity
**** toString() method printing set (in-order traversal) and the tree (BFS traversal)
**
*/
publicclass BST> {
private BinaryNode root;
privateint size;
//Search opertion of Set ADT
publicboolean contains(E value) {
return contains(root, value);
}
//Insert opertion of Set ADT
publicvoid insert(E value) {
root = insert(root, value);
size++;
}
//Remove operation of Set ADT
publicvoid remove(E value){
root = remove(root, value);
size--;
}
publicint size(){
return size;
}
publicboolean isEmpty(){
return root == null;
}
publicvoid clear(){
root = null;
size = 0;
}
public E findMin(){
return findMin(root);
}
public E findMax(){
return findMax(root);
}
publicint findHeight(){
return root.height();
}
public String toString(){
if(root == null)
return "set {} stored in an empty tree.\n";
String elements = root.inOrder().toString();
return "set {" + elements.substring(1,elements.length()-1) + "} stored in tree \n" + root;
}
private E findMin(BinaryNode node){
if(node == null)
returnnull;
if(node.left == null)
return node.element;
return findMin(node.left);
}
private E findMax(BinaryNode node){
if(node == null)
returnnull;
if(node.right == null)
return node.element;
return findMax(node.right);
}
privateboolean contains(BinaryNode node, E value) {
if (node == null)//node represents an empty substree
returnfalse;
int comparisonResult = value.compareTo(node.element);
if(comparisonResult < 0)//if value is less than root's value
return contains(node.left, value);
if(comparisonResult > 0)//if value is greater than root's value
return contains(node.right, value);
returntrue;//successful search
}
private BinaryNode insert(BinaryNode node, E value) {
if (node == null)//base case: empty tree
returnnew BinaryNode<>(value);
if (value.compareTo(node.element) < 0)
node.left = insert(node.left, value);//insert recursively to left-subtree
elseif (value.compareTo(node.element) > 0)
node.right = insert(node.right, value);//insert recursively to right-subtree
else {//duplicate value cannot be inserted in a BST implementing the Set ADT
size--;//insertion failed!
//System.out.print("BST.insert: Warning: " + value + " is already stored in the tree \n" + node);
}
return node;
}
private BinaryNode remove(BinaryNode node, E value) {
if (node == null) {//base case: empty tree
System.out.println("BST.remove: Warning: " + value + " doesn't exist in the tree.");
size++;//removal failed!
return node;
}
if (value.compareTo(node.element) < 0)
node.left = remove(node.left, value);
elseif (value.compareTo(node.element) > 0)
node.right = remov.
Use the following data set that compares age to average years lef.docx
Use the following data set that compares age to average "years left to live" to answer the following questions.
Age 10 20 30 40 50 60 70 80 90 100
Years to live 59.2 49.6 40.7 31.9 24.0 17.2 11.6 7.2 4 .4 2.8
a) Show the scatterplot for this data with the least squares regression line. Find R^2. How much of the variation is explained by the regression line?
b) Experiment with the non-linear regressions available on the calculator. Which seem to fit? Show the scatterplot with three different regression curves from the calculator. Label each equation, as well as the applicable R^2.
c) Choose a regression equation to predict how many "years left" a person has if he is now 101 years old. Can he count on celebrating Christmas 2015?
InfoTest.javaInfoTest.javapackage assignment1;
importstatic org.junit.Assert.*;
import org.junit.Test;
publicclassInfoTest{
@Test
publicvoid testInfo(){
Info tempInfo =newInfo();
assertNotNull(tempInfo.tmp);
}
@Test
publicvoid testInsert(){
Info tempInfo =newInfo();
// Insert into an empty list
tempInfo.insert(30);
assertEquals(30, tempInfo.get(0));
// Insert an item to be placed at the beginning of the list
tempInfo.insert(4);
assertEquals(4, tempInfo.get(0));
assertEquals(30, tempInfo.get(1));
// Insert an item to be placed at the end of the list
tempInfo.insert(20);
assertEquals(20, tempInfo.get(1));
assertEquals(30, tempInfo.get(2));
// Insert an which already exists
tempInfo.insert(20);
assertEquals(4, tempInfo.get(0));
assertEquals(20, tempInfo.get(1));
assertEquals(30, tempInfo.get(2));
}
@Test
publicvoid testDelete(){
Info tempInfo =newInfo();
tempInfo.insert(15);
tempInfo.insert(5);
tempInfo.insert(10);
// delete from the middle
tempInfo.delete(10);
assertEquals(5, tempInfo.get(0));
assertEquals(15, tempInfo.get(1));
// delete from the beginning
tempInfo.insert(10);
tempInfo.delete(5);
assertEquals(10, tempInfo.get(0));
assertEquals(15, tempInfo.get(1));
// delete from the end
tempInfo.insert(5);
tempInfo.delete(15);
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
// delete something that does not exist
tempInfo.insert(15);
tempInfo.delete(7);
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
assertEquals(15, tempInfo.get(1));
}
@Test
publicvoid testGet(){
Info tempInfo =newInfo();
tempInfo.insert(15);
tempInfo.insert(5);
tempInfo.insert(10);
// get items at the beginning, middle, and end of the list
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
assertEquals(15, tempInfo.get(2));
// get an unexisting item
assertNull(tempInfo.get(3));
}
@Test
publicvoid testCount(){
Info tempInfo =newInfo();
/ ...
Swift 함수 커링 사용하기
기존에 커링 예제는 너무 간단한것만 있어 실무에 적용할만한 예제들을 보여주지 않아서 커링에 대해 알기가 어려웠다.
그래서 직접 커링이 무엇인지 설명하고, 실무에 적용할만한 예제들을 포함해 발표자료를 만들어보았다.
CBSE Class XII Comp sc practical file
i made this practical file for the final practical of class XII
Which statement is not true about hermaphrodites in C elegan.pdf
Which statement is not true about hermaphrodites in C elegans? They huve both seses in each
indidual. They urdefp sill-fertilimation to produce more hermiphrodtes They underso self-fertifiriton
to produce more males They produce both sperm and eters. Question 20 Butterfly Protenor uses
XX/XO sex determination system. This means Males have one more X chromorome than fomales.
Mules hive one fever thromosome thun females in total number: Males are males beciune they
mins ane Y chromouomo XO eenotype develops into feindes..
While viewing the presentation take notes on the video foc.pdf
While viewing the presentation, take notes on the video, focusing on the reasons a relational
database is important, and selecting the correct primary and foreign keys. Reflect on the
relationships between the tables and inserting, updating and deleting data. What are the problems
if you have not selected the correct keys? What are the concerns if the relationships between the
tables are not correct? For example, you have 1:M and the relationship is 1:1..
More Related Content
Similar to Which XXX condition generates the following output Not foun.pdf
Parsing swiftly-Cocoaheads-2015-02-12
Parsing in Swift using established Functional Programming techniques.
search_sort Search sortSearch sortSearch sortSearch sort
Search sort Search sort Search sort Search sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sortSearch sort
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se
Groovy Refactoring Patterns
Slides from GR8 Conf EU 2019 talk - "Groovy Refactoring Patterns". In this talk, I share the refactoring patterns I observed during Groovy development.
It is the main program that implement the min(), max(), floor(), cei.pdf
It is the main program that implement the min(), max(), floor(), ceiling(), select(), rank(),delete(),
deleteMin(), deleteMax(), keys()
import java.util.NoSuchElementException;
public class BST, Value> {
private Node root;
private class Node {
private Key key;
private Value val;
private Node left, right;
private int size;
public Node(Key key, Value val, int size) {
this.key = key;
this.val = val;
this.size = size;
}
}
public BST() {
}
public boolean isEmpty() {
return size() == 0;
}
public int size() {
return size(root);
}
// return number of key-value pairs in BST rooted at x
private int size(Node x) {
if (x == null) return 0;
else return x.size;
}
public boolean contains(Key key) {
if (key == null) throw new NullPointerException(\"argument to contains() is null\");
return get(key) != null;
}
public Value get(Key key) {
return get(root, key);
}
private Value get(Node x, Key key) {
if (x == null) return null;
int cmp = key.compareTo(x.key);
if (cmp < 0) return get(x.left, key);
else if (cmp > 0) return get(x.right, key);
else return x.val;
}
public void put(Key key, Value val) {
if (key == null) throw new NullPointerException(\"first argument to put() is null\");
if (val == null) {
delete(key);
return;
}
root = put(root, key, val);
assert check();
}
private Node put(Node x, Key key, Value val) {
if (x == null) return new Node(key, val, 1);
int cmp = key.compareTo(x.key);
if (cmp < 0) x.left = put(x.left, key, val);
else if (cmp > 0) x.right = put(x.right, key, val);
else x.val = val;
x.size = 1 + size(x.left) + size(x.right);
return x;
}
public void deleteMax() {
if (isEmpty()) throw new NoSuchElementException(\"Symbol table underflow\");
root = deleteMax(root);
assert check();
}
private Node deleteMax(Node x) {
if (x.right == null) return x.left;
x.right = deleteMax(x.right);
x.size = size(x.left) + size(x.right) + 1;
return x;
}
public void delete(Key key) {
if (key == null) throw new NullPointerException(\"argument to delete() is null\");
root = delete(root, key);
assert check();
}
private Node delete(Node x, Key key) {
if (x == null) return null;
int cmp = key.compareTo(x.key);
if (cmp < 0) x.left = delete(x.left, key);
else if (cmp > 0) x.right = delete(x.right, key);
else {
if (x.right == null) return x.left;
if (x.left == null) return x.right;
Node t = x;
x = min(t.right);
x.right = deleteMin(t.right);
x.left = t.left;
}
x.size = size(x.left) + size(x.right) + 1;
return x;
}
public Key min() {
if (isEmpty()) throw new NoSuchElementException(\"called min() with empty symbol
table\");
return min(root).key;
}
private Node min(Node x) {
if (x.left == null) return x;
else return min(x.left);
}
public Key max() {
if (isEmpty()) throw new NoSuchElementException(\"called max() with empty symbol
table\");
return max(root).key;
}
private Node max(Node x) {
if (x.right == null) return x;
else return max(x.right);
}
public Key floor(Key key) {
if (key == null) throw new NullPointerException(\"argument to floor() is null\");
if (isEmpty()) throw ne.
Mixing Functional and Object Oriented Approaches to Programming in C#
Mixing Functional and Object Oriented Approaches to Programming in C#, Michael Wagg, Mark Needham
I cant figure out why I keep getting an -Exception in thread -main- ja.pdf
I cant figure out why I keep getting an "Exception in thread "main"
java.lang.StringIndexOutOfBoundsException: Index 0 out of bounds for length 0"
Here is the code after screenshot if needed:
for (int k = 0; k < elements.size(); k += 2) {
int coefficient = coefficients.get(j);
int count = Integer.parseInt(elements.get(k + 1));
balancedEquation.append(elements.get(k));
if (coefficient * count != 1) {
balancedEquation.append(coefficient * count);
}
}
j++;
}
System.out.println(balancedEquation.toString());
}
}
}
} catch (FileNotFoundException e) {
System.out.println("File not found: " + fileName);
}
}
private static Map<String, Integer> parseSide(String side) {
Map<String, Integer> elements = new HashMap<>();
String[] compounds = side.split("\\+");
for (String compound : compounds) {
compound = compound.trim();
int coeff = 1;
int i = 0;
if (Character.isDigit(compound.charAt(0))) {
coeff = compound.charAt(0) - '0';
i++;
}
String element = "";
while (i < compound.length()) {
char c = compound.charAt(i);
if (Character.isUpperCase(c)) {
if (!element.isEmpty()) {
elements.put(element, elements.getOrDefault(element, 0) + coeff);
}
element = "" + c;
i++;
if (i < compound.length() && Character.isLowerCase(compound.charAt(i))) {
element += compound.charAt(i);
i++;
}
} else if (Character.isDigit(c)) {
int j = i;
while (j < compound.length() && Character.isDigit(compound.charAt(j))) {
j++;
}
int num = Integer.parseInt(compound.substring(i, j));
coeff *= num;
i = j;
} else {
i++;
}
}
if (!element.isEmpty()) {
elements.put(element, elements.getOrDefault(element, 0) + coeff);
}
}
return elements;
}
public static List<String> splitCompound(String compound) {
List<String> elements = new ArrayList<>();
int i = 0;
while (i < compound.length()) {
char c = compound.charAt(i);
if (Character.isUpperCase(c)) {
String element = Character.toString(c);
i++;
if (i < compound.length() && Character.isLowerCase(compound.charAt(i))) {
element += compound.charAt(i);
i++;
}
String count = "";
while (i < compound.length() && Character.isDigit(compound.charAt(i)))
{
count += compound.charAt(i);
i++;
}
if (count.equals("")) {
count = "1";
}
elements.add(element);
elements.add(count);
} else if (c == '(') {
i++;
int j = compound.indexOf(')', i);
String subCompound = compound.substring(i, j);
i = j + 1;
String count = "";
while (i < compound.length() && Character.isDigit(compound.charAt(i))) {
count += compound.charAt(i);
i++;
}
if (count.equals("")) {
count = "1";
}
List<String> subElements = splitCompound(subCompound);
for (int k = 0; k < subElements.size(); k += 2) {
String element = subElements.get(k);
int subCount = Integer.parseInt(subElements.get(k + 1));
int total = subCount * Integer.parseInt(count);
if (elements.contains(element)) {
int index = elements.indexOf(element) + 1;
int currentCount = Integer.parseInt(elements.get(index));
elements.set(index, Integer.toString(currentCount + total));
} else {
elements.add(element);
elements.add(Integer.toString(total));
}
}
} else .
Merge sort in CSolution#include-stdio-h- #define MAX 50 void mergeSort.docx
Merge sort in C
Solution
#include<stdio.h>
#define MAX 50
void mergeSort(int arr[],int low,int mid,int high);
void partition(int arr[],int low,int high);
int main(){
int merge[MAX],i,n;
printf(\"Enter the total number of elements: \");
scanf(\"%d\",&n);
printf(\"Enter the elements which to be sort: \");
for(i=0;i<n;i++){
scanf(\"%d\",&merge[i]);
}
partition(merge,0,n-1);
printf(\"After merge sorting elements are: \");
for(i=0;i<n;i++){
printf(\"%d \",merge[i]);
}
return 0;
}
void partition(int arr[],int low,int high){
int mid;
if(low<high){
mid=(low+high)/2;
partition(arr,low,mid);
partition(arr,mid+1,high);
mergeSort(arr,low,mid,high);
}
}
void mergeSort(int arr[],int low,int mid,int high){
int i,m,k,l,temp[MAX];
l=low;
i=low;
m=mid+1;
while((l<=mid)&&(m<=high)){
if(arr[l]<=arr[m]){
temp[i]=arr[l];
l++;
}
else{
temp[i]=arr[m];
m++;
}
i++;
}
if(l>mid){
for(k=m;k<=high;k++){
temp[i]=arr[k];
i++;
}
}
else{
for(k=l;k<=mid;k++){
temp[i]=arr[k];
i++;
}
}
for(k=low;k<=high;k++){
arr[k]=temp[k];
}
}
Sample output:
Enter the total number of elements: 5
Enter the elements which to be sort: 2 5 0 9 1
After merge sorting elements are: 0 1 2 5 9
.
Engineering lecture ppt by venay magen
Venay Magen likes the shading red, particularly on Tuesdays. He cherishes to drink bourbon (on all days). He figured out how to drink whisky from his youth companion Zippo, when they went to class together at Mount Temple Comprehensive School. He is best known as the lead vocalist for the band MN3.
( PLEASE SHOW HOW TO IMPLEMENT THE DELETION FUNCTION )SAMPLE OUTPU.pdf
( PLEASE SHOW HOW TO IMPLEMENT THE DELETION FUNCTION )
SAMPLE OUTPUT: Instead of using a linked list to resolve collisions, as in separate chaining,
use a binary search tree. That is, create a hash table that is an array of trees. You could use H(X)
= X % arraysize as the hash function in your hash table implementation. The arraySize needs to
be an input parameter from users. Your solution should support the basic hash table inserting,
searching, and displaying functions. To display a small tree-based hash table, you could use an
in-order traversal of each tree. The advantage of a tree over a linked list is that it can be searched
in O(logN) instead of O(N) time. Checking 15 items takes a maximum of 15 comparisons in a
list but only 4 in a tree. Duplicates can present problems in both trees and hash tables, so add
some code that prevents a duplicate key from being inserted in the hash table. To shorten the
listing for this program, you can forget about deletion, which for trees requires a lot of code. [ten
bonus points will be given to those who implement the deletion function.]
Solution
import java.util.Scanner;
class BinaryNode
{
BinaryNode lchild, rchild;
int data;
public BinaryNode(int d)
{
data = d;
lchild = null;
rchild = null;
}
}
class HashTableusingBinaryTree
{
private BinaryNode[] t;
private int size ;
public HashTableusingBinaryTree(int tableSize)
{
t = new BinaryNode[ nextPosition(tableSize) ];
size = 0;
}
public boolean isEmpty()
{
return size == 0;
}
public void Empty()
{
int l = t.length;
t = new BinaryNode[l];
size = 0;
}
public int sizeofht()
{
return size;
}
public void insert(int val)
{
size++;
int pos = myhashtable(val);
BinaryNode head = t[pos];
head = insert(head, val);
t[pos] = head;
}
private BinaryNode insert(BinaryNode node, int data)
{
if (node == null)
node = new BinaryNode(data);
else
{
if (data <= node.data)
node.lchild = insert(node.lchild, data);
else
node.rchild = insert(node.rchild, data);
}
return node;
}
public void remove(int val)
{
int pos = myhashtable(val);
BinaryNode head = t[pos];
try
{
head = delete(head, val);
size--;
}
catch (Exception e)
{
System.out.println(\"\ Element not present\ \");
}
t[pos] = head;
}
private BinaryNode delete(BinaryNode head, int k)
{
BinaryNode a, b, n;
if (head.data == k)
{
BinaryNode lt, rt;
lt = head.lchild;
rt = head.rchild;
if (lt == null && rt == null)
return null;
else if (lt == null)
{
a = rt;
return a;
}
else if (rt == null)
{
a = lt;
return a;
}
else
{
b = rt;
a = rt;
while (a.lchild != null)
a = a.lchild;
a.lchild = lt;
return b;
}
}
if (k < head.data)
{
n = delete(head.lchild, k);
head.lchild = n;
}
else
{
n = delete(head.rchild, k);
head.rchild = n;
}
return head;
}
private int myhashtable(Integer x )
{
int hashVal = x.hashCode( );
hashVal %= t.length;
if (hashVal < 0)
hashVal += t.length;
return hashVal;
}
private static int nextPosition( int r )
{
if (r % 2 == 0)
r++;
for ( ; !isnext( r ); r += 2);
return r;
}
private static boolean isnext( int r )
{
if (r ==.
Implement a function in c++ which takes in a vector of integers and .pdf
Implement a function in c++ which takes in a vector of integers and also takes in another integer
d which we will refer to as depth. The function will recursively call quicksort while
decrementing depth until the depth has reached 0. Thenpoithe algorithm will switch over to
heapsort to finish the sorting of the vector. For this problem also comment in the code what the
value of d needs to with respect to the size of the vector n for the algorithm to have worst case
run time of O(n log(n)).
#include
#include
using namespace std;
void quicksort(vector & items)
{
if(items.size() > 1)
{
vector small;
vector same;
vector large;
int pivot = items[0];
for(int i = 1; i < items.size(); i++)
{
if(items[i] < pivot)
small.push_back(items[i]);
else if(items[i] > pivot)
large.push_back(items[i]);
else
same.push_back(items[i]);
}
quicksort(small);
quicksort(large);
std::move(begin(small),end(small),begin(items)); //moving the piece of memory that is
small to the items memory
std::move(begin(same),end(same),begin(items) + small.size());
std::move(begin(large),end(large),end(items) - large.size());
}
else
{
//Do nothing
}
}
int leftChild(int i)
{
return 2*i + 1;
}
void percDown(vector & v, int i, int n)
{
int child;
//int leftChild;
int temp;
for(temp = v[i]; leftChild(i) < n; i = child)
{
child = leftChild(i);
if(child != n-1 && v[child] < v[child + 1]) //compare children
{
child++; //We want our right child
}
if(temp < v[child])
{
v[i] = v[child]; //Swapping
v[child] = temp;
}
else
{
break;
}
}
}
void heapsort(vector & v)
{
for(int i = v.size() /2 -1; i >= 0; --i)
{
percDown(v, i, v.size()); //Build Heap
}
for(int j = v.size() - 1; j > 0; --j)
{
swap(v[0],v[j]);
percDown(v, 0, j); //Remove max
}
}
int main()
{
int a[] = {1,10,3,2,5,8};
vector v(a,a + sizeof(a)/sizeof(int));
for(int i = 0; i < v.size(); i++)
{
cout << v[i] << \" \";
}
cout << endl;
cout << \"Sorted \" << endl;
quicksort(v);
for(int i = 0; i < v.size(); i++)
{
cout << v[i] << \" \";
}
cout << endl;
heapsort(v);
for(int i = 0; i < v.size(); i++)
{
cout << v[i] << endl;
}
mixSort(v)
for(int i = 0 i < v.size(); i++)
{
cout < }
int x;
cin >> x;
}
Solution
#include
#include
using namespace std;
void quicksort(vector & items)
{
if(items.size() > 1)
{
vector small;
vector same;
vector large;
int pivot = items[0];
for(int i = 1; i < items.size(); i++)
{
if(items[i] < pivot)
small.push_back(items[i]);
else if(items[i] > pivot)
large.push_back(items[i]);
else
same.push_back(items[i]);
}
quicksort(small);
quicksort(large);
std::move(begin(small),end(small),begin(items)); //moving the piece of memory that is
small to the items memory
std::move(begin(same),end(same),begin(items) + small.size());
std::move(begin(large),end(large),end(items) - large.size());
}
else
{
//Do nothing
}
}
int leftChild(int i)
{
return 2*i + 1;
}
//comment this method for your solution.....
void percDown(vector & v, int i, int n)
{
int child;
//int leftChild;
int temp;
for(temp = v[i]; leftChild(i) < n; i = child)
{
child = leftC.
Given the following codepackage data1;import java.util.;p.pdf
Given the following code
package data1;
import java.util.*;
/*public class BST> implementing a set ADT and containing the following:
* private inner class BinaryNode representing a node with a (possibly) left child and a (possibly)
right child
** instance fields BinaryNode root, int size
* contains/insert/remove method - w/ O(height) complexity
** size O(1), isEmpty O(1), clear O(1),
*** findMin, findMax, findHeight methods - w/ O(height) complexity
**** toString() method printing set (in-order traversal) and the tree (BFS traversal)
**
*/
publicclass BST> {
private BinaryNode root;
privateint size;
//Search opertion of Set ADT
publicboolean contains(E value) {
return contains(root, value);
}
//Insert opertion of Set ADT
publicvoid insert(E value) {
root = insert(root, value);
size++;
}
//Remove operation of Set ADT
publicvoid remove(E value){
root = remove(root, value);
size--;
}
publicint size(){
return size;
}
publicboolean isEmpty(){
return root == null;
}
publicvoid clear(){
root = null;
size = 0;
}
public E findMin(){
return findMin(root);
}
public E findMax(){
return findMax(root);
}
publicint findHeight(){
return root.height();
}
public String toString(){
if(root == null)
return "set {} stored in an empty tree.\n";
String elements = root.inOrder().toString();
return "set {" + elements.substring(1,elements.length()-1) + "} stored in tree \n" + root;
}
private E findMin(BinaryNode node){
if(node == null)
returnnull;
if(node.left == null)
return node.element;
return findMin(node.left);
}
private E findMax(BinaryNode node){
if(node == null)
returnnull;
if(node.right == null)
return node.element;
return findMax(node.right);
}
privateboolean contains(BinaryNode node, E value) {
if (node == null)//node represents an empty substree
returnfalse;
int comparisonResult = value.compareTo(node.element);
if(comparisonResult < 0)//if value is less than root's value
return contains(node.left, value);
if(comparisonResult > 0)//if value is greater than root's value
return contains(node.right, value);
returntrue;//successful search
}
private BinaryNode insert(BinaryNode node, E value) {
if (node == null)//base case: empty tree
returnnew BinaryNode<>(value);
if (value.compareTo(node.element) < 0)
node.left = insert(node.left, value);//insert recursively to left-subtree
elseif (value.compareTo(node.element) > 0)
node.right = insert(node.right, value);//insert recursively to right-subtree
else {//duplicate value cannot be inserted in a BST implementing the Set ADT
size--;//insertion failed!
//System.out.print("BST.insert: Warning: " + value + " is already stored in the tree \n" + node);
}
return node;
}
private BinaryNode remove(BinaryNode node, E value) {
if (node == null) {//base case: empty tree
System.out.println("BST.remove: Warning: " + value + " doesn't exist in the tree.");
size++;//removal failed!
return node;
}
if (value.compareTo(node.element) < 0)
node.left = remove(node.left, value);
elseif (value.compareTo(node.element) > 0)
node.right = remov.
Use the following data set that compares age to average years lef.docx
Use the following data set that compares age to average "years left to live" to answer the following questions.
Age 10 20 30 40 50 60 70 80 90 100
Years to live 59.2 49.6 40.7 31.9 24.0 17.2 11.6 7.2 4 .4 2.8
a) Show the scatterplot for this data with the least squares regression line. Find R^2. How much of the variation is explained by the regression line?
b) Experiment with the non-linear regressions available on the calculator. Which seem to fit? Show the scatterplot with three different regression curves from the calculator. Label each equation, as well as the applicable R^2.
c) Choose a regression equation to predict how many "years left" a person has if he is now 101 years old. Can he count on celebrating Christmas 2015?
InfoTest.javaInfoTest.javapackage assignment1;
importstatic org.junit.Assert.*;
import org.junit.Test;
publicclassInfoTest{
@Test
publicvoid testInfo(){
Info tempInfo =newInfo();
assertNotNull(tempInfo.tmp);
}
@Test
publicvoid testInsert(){
Info tempInfo =newInfo();
// Insert into an empty list
tempInfo.insert(30);
assertEquals(30, tempInfo.get(0));
// Insert an item to be placed at the beginning of the list
tempInfo.insert(4);
assertEquals(4, tempInfo.get(0));
assertEquals(30, tempInfo.get(1));
// Insert an item to be placed at the end of the list
tempInfo.insert(20);
assertEquals(20, tempInfo.get(1));
assertEquals(30, tempInfo.get(2));
// Insert an which already exists
tempInfo.insert(20);
assertEquals(4, tempInfo.get(0));
assertEquals(20, tempInfo.get(1));
assertEquals(30, tempInfo.get(2));
}
@Test
publicvoid testDelete(){
Info tempInfo =newInfo();
tempInfo.insert(15);
tempInfo.insert(5);
tempInfo.insert(10);
// delete from the middle
tempInfo.delete(10);
assertEquals(5, tempInfo.get(0));
assertEquals(15, tempInfo.get(1));
// delete from the beginning
tempInfo.insert(10);
tempInfo.delete(5);
assertEquals(10, tempInfo.get(0));
assertEquals(15, tempInfo.get(1));
// delete from the end
tempInfo.insert(5);
tempInfo.delete(15);
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
// delete something that does not exist
tempInfo.insert(15);
tempInfo.delete(7);
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
assertEquals(15, tempInfo.get(1));
}
@Test
publicvoid testGet(){
Info tempInfo =newInfo();
tempInfo.insert(15);
tempInfo.insert(5);
tempInfo.insert(10);
// get items at the beginning, middle, and end of the list
assertEquals(5, tempInfo.get(0));
assertEquals(10, tempInfo.get(1));
assertEquals(15, tempInfo.get(2));
// get an unexisting item
assertNull(tempInfo.get(3));
}
@Test
publicvoid testCount(){
Info tempInfo =newInfo();
/ ...
Swift 함수 커링 사용하기
기존에 커링 예제는 너무 간단한것만 있어 실무에 적용할만한 예제들을 보여주지 않아서 커링에 대해 알기가 어려웠다.
그래서 직접 커링이 무엇인지 설명하고, 실무에 적용할만한 예제들을 포함해 발표자료를 만들어보았다.
CBSE Class XII Comp sc practical file
i made this practical file for the final practical of class XII
Similar to Which XXX condition generates the following output Not foun.pdf (20)
search_sort Search sortSearch sortSearch sortSearch sort
search_sort Search sortSearch sortSearch sortSearch sort
Write a program to find the number of comparisons using the binary se.docx
Write a program to find the number of comparisons using the binary se.docx
It is the main program that implement the min(), max(), floor(), cei.pdf
It is the main program that implement the min(), max(), floor(), cei.pdf
Mixing Functional and Object Oriented Approaches to Programming in C#
Mixing Functional and Object Oriented Approaches to Programming in C#
Mixing functional and object oriented approaches to programming in C#
Mixing functional and object oriented approaches to programming in C#
I cant figure out why I keep getting an -Exception in thread -main- ja.pdf
I cant figure out why I keep getting an -Exception in thread -main- ja.pdf
Merge sort in CSolution#include-stdio-h- #define MAX 50 void mergeSort.docx
Merge sort in CSolution#include-stdio-h- #define MAX 50 void mergeSort.docx
( PLEASE SHOW HOW TO IMPLEMENT THE DELETION FUNCTION )SAMPLE OUTPU.pdf
( PLEASE SHOW HOW TO IMPLEMENT THE DELETION FUNCTION )SAMPLE OUTPU.pdf
Implement a function in c++ which takes in a vector of integers and .pdf
Implement a function in c++ which takes in a vector of integers and .pdf
Given the following codepackage data1;import java.util.;p.pdf
Given the following codepackage data1;import java.util.;p.pdf
Use the following data set that compares age to average years lef.docx
Use the following data set that compares age to average years lef.docx
More from solutions6
Which statement is not true about hermaphrodites in C elegan.pdf
Which statement is not true about hermaphrodites in C elegans? They huve both seses in each
indidual. They urdefp sill-fertilimation to produce more hermiphrodtes They underso self-fertifiriton
to produce more males They produce both sperm and eters. Question 20 Butterfly Protenor uses
XX/XO sex determination system. This means Males have one more X chromorome than fomales.
Mules hive one fever thromosome thun females in total number: Males are males beciune they
mins ane Y chromouomo XO eenotype develops into feindes..
While viewing the presentation take notes on the video foc.pdf
While viewing the presentation, take notes on the video, focusing on the reasons a relational
database is important, and selecting the correct primary and foreign keys. Reflect on the
relationships between the tables and inserting, updating and deleting data. What are the problems
if you have not selected the correct keys? What are the concerns if the relationships between the
tables are not correct? For example, you have 1:M and the relationship is 1:1..
While students cannot file a private lawsuit for FERPA viola.pdf
While students cannot file a private lawsuit for FERPA violations, they may still pursue a legal
case under common law principles for violation of their privacy rights, though this would not be
based on FERPA provisions specifically. Is this fair, or should this be changed to allow students a
more accessible way to address violations directly?
please answer with intext citation and references
thanks.
While exploring an ancient temple Prof Jones comes across .pdf
While exploring an ancient temple, Prof. Jones comes across a locked door. In front of
this door are two pedestals, and n blocks each labeled with its positive integer weight.
The sum of the weights of the blocks is W. In order to open the door, Prof. Jones needs
to put every block on one of the two pedestals. However, if the difference in the sum of
the weights of the blocks on each pedestal is too large, the door will not open.
Devise an algorithm that Prof. Jones can use to divide the blocks into two piles
whose total weights are as close as possible. To avoid a boulder rolling quickly
toward him, Prof. Jones needs your algorithm to run in pseudo-polynomial time..
Which one of the following statements is valid In a histogr.pdf
Which one of the following statements is valid?
In a histogram, the area of the columns represents frequency
A histogram is used only for discrete data, a bar chart only for continuous data
When grouping data before displaying it in a histogram, all the intervals must have the same width
As more data are collected , the shape of a histogram becomes more symmetric.
Which one of the following would be classified as a long ter.pdf
Which one of the following would be classified as a long term internal source of Question 1
finance? Not yet answared Marked out of 1 Seloct one: Fing question a. Raising additional funds
by delaying trade payables b. Raising additional funds through increased earnings retention c.
Raising additional funds from existing shareholders in the form of a rights issue d. Raising
additional funds through reducing receivable days.
Which two of the following are not true for offshore wind H.pdf
Which two of the following are not true for offshore wind?
High wind speeds.
Well understood environmental impacts.
Benign operating environment.
Can be located near major population centers.
Very large turbines are feasible..
Which tissue is correctly paired with its primary immature c.pdf
Which tissue is correctly paired with its primary immature cell type?
connective tissue proper; chondrocyte
bone; osteoblast
cartilage; fibroblast
bone; fibrocyte.
Which statement regarding extinction on Earth is true a Ma.pdf
Which statement regarding extinction on Earth is true?
a. Many scientists think we are now in the 6th mass extinction.
b. The biodiversity of Earth has remained constant because speciation and extinction rates are
always equal.
c. Extinction occurs only as a result of natural disasters, such as asteroids or volcanic activity, or
climate change..
d. A recent decrease in carbon dioxide in the atmosphere has caused the extinction of.
Which statement is true about the Healthy Reople initiative.pdf
Which statement is true about the Healthy Reople initiative? A program to promote, strengthen,
and evaluate the nation's efforts to improve the health and well-being of all people. A program to
promote healthy development and behaviors for children. The program's goal is to accommodate
for health disparities so minority populations can achieve health equity. A new program for national
public health, disease prevention, and health promotion efforts that launched recently..
Which statement is true regarding the heart The apex of the.pdf
Which statement is true regarding the heart? The apex of the heart is located superiorly to the
base of the heart The epicardium is the inner layer of the heart that is very smooth and lines the
chambers All four valves within the heart contain chordae tendineae The myocardium primarily
receives its blood flow from the coronary arteries and its branches.
Which statements are true about audiovisual training Selec.pdf
Which statements are true about audiovisual training? (Select all that apply.) Multiple select
question. Learners can improve communication and interviewing skills. Learners are not required
to physically attend class. Learners must be physically present in the classroom with instructors.
Learners can work independently..
Which statement is not TRUE regarding MS Office macro 1 M.pdf
Which statement is not TRUE regarding MS Office macro?
1- MS office macro is a way for automating simple tasks such as creating formatted tables or
inserting letterheads.
2- IDA Pro is the macro developer's console. This is where the macro program was developed and
debugged. Thus, to reverse what we are looking for, we can manipulate the source code.
3- MS Office macro makes use of the Visual Basic for Application language, which uses the same
language as Visual Basic scripts.
4- When MS Office macros are used, Microsoft Word shows a security warning about the
document containing code..
Which statement below about gene expression is TRUE The gen.pdf
Which statement below about gene expression is TRUE? The genetic code is specified by a 3
letter code for each amino acid. Some amino acids may have more than one 3 letter code.
Translation initiation begins when RNA polymerase binds to AUG RNA processing or splicing
removes exons, and adds a poly A 5 tail Transcription produces a functional protein.
Which statement best describes the Ecological Perspective A.pdf
Which statement best describes the Ecological Perspective? A. Behaviors are influenced by
interdependent domains that can have a ripple effect across dimensions when change occurs B.
Genetics and the environment are the only variables of interest when developing interventions C.
Social circumstances are the prominent domain that influences health behaviors D. Family
influences are the most important determinant of health. QUESTION 43 Health Belief Model is
based on the belief that individuals: A. Perceive themselves to be susceptible to a health problem
B. See the health problem as serious C. Are convinced they will benefit from treatment or
prevention activities D. All of theseIn the Theory of Planned Behavior, a person's intention
regarding performing a prescribed behavior CANNOT be identified by which of the following? A.
Atitudes toward the behavior B. How difficult it will be for the individual to perform and maintain the
behavior C. If the person thinks it can be attained in a short amount of time -6 weeks or less D.
What significant others will think about the behavior QUESTION 45 The term has been developed
to refer to "the process of gaining an enhanced knowledge, understanding, and acceptance of the
methods of constructive interactions among people of differing cultural backgrounds." A. Pluralism
B. Multicultural education C. Political correctness D. Cultural humility E. None of theseThe primary
goal of is to provide community member(s) with services that (in tum) create hands-on learning
experiences for the volunteer. A. Social change B. Professional development C. Policy
implementation D. Advocacy E. Service leaming QUESTION 47 are considered to be the building
blocks (or bricks) of a a behavior theory. A. Variables B. Constructs c. Concepts D.
ComponentsThe Transtheoretical Model of Behavior Change is based on the assumption that: A.
Behavior change is a process and individuals are at varying levels of motivation or readiness to
change B. Health educators can identify a person's intention C. Behavior change is a concept of
reasoned action D. The emphasis of perceptions is vulnerability to iliness and treatment
QUESTION 49 A theory is a general explanation of: A. Innovations that can be experimented with
before a cornmitment is made B. The extent to which a program can succeed C. A system of
moral principles D. Why people act or do not act to maintain or promote the health of themselves,
their families. orgarizations, and communitiesSocial marketers set an overall goal for their
interventions and is the bottom line objective for social marketers. A. Set objectives for awareness
8. Objectives for increased knowledge C. Impact beliefs D. Behavior change E. None of these
Click Save and Submit to save and submit, Click Saue All Anstzers to save all ansuers..
Which statement is correct regarding the dorsal horn of the .pdf
Which statement is correct regarding the dorsal horn of the spinal cord?
It is composed of white matter I
t provides a pathway for information from the brain to the efferent peripheral nervous system
It receives afferent information from the peripheral nervous system
It contains tracts that send impulses to the brain.
Which species of bacteria produced the enzyme urease Pseudo.pdf
Which species of bacteria produced the enzyme urease? Pseudomonas aeruginosa & Proteus
vulgaris none Enterobacter aerogenes Enterobacter aerogenes and Escherichia coliPseudomonas
aeruginosa is capable of aerobic respiration and anaerobic respiration but not fermentation. It can
produce H2S, does not produce tryptophanase, and is motile by a flagellum. Based on the above
characteristics, describe your expected results for Pseudomonas aeruginosa in a SIM deep. The
media will be black, there should be fuzzy growth throughout the tube, and it'll remain pink
because it'll test negative for tryptophanase. The media will be not black , there should be fuzzy
growth throughout the tube, and it'll remain pink because it'll test negative for tryptophanase. The
media will be black, there should be fuzzy growth throughout the tube, and it'll remain yellow
because it'll test negative for tryptophanase. noneYou inoculated a gelatin deep with a bacteria.
How do you know if the bacteria produce the exoenzyme gelatin hydrolase? Media changes color
Media stays solid Nothing happens Media becomes liquid.
Which properties seemed to make the largest craters Find s.pdf
Which properties seemed to make the largest craters?
Find some impactors, such as a marble, golf ball, ping-pong ball, or anything of a similar size that
you can drop into the surface. Try to find a few impactors with different masses.
1.What is the reason for dropping impactors from the same height, or what varies when you drop
them from different heights?
2.Did the differentiated surface (cocoa powder over flour) produce a radial pattern of debris?.
Which sediments and rocks do I add to these tables Choices .pdf
Which sediments and rocks do I add to these tables? Choices are listed as Breccia,
Conglomerate, Sandstone, Arkose, Shale, Coquina, Limestone, Coal, Chert, Rock Salt, Rock
Gypsum and Rock Calcite.
begin{tabular}{|l|l|l|} hline Event & Sediment & Rock hline 8.Acontinentalcollisionisolates
theareafromtheocean;theseawatertrappedintheareaevaporates. & (threekindsofrockprecipitate
directlyfromthewater) & hline 7.Sealevelfalls;thebeachreturns. & & hline
6.Sealevelcontinuestorise;thebeachissubmergedbyawarm,shallowsea. & & hline
5.Sealevelrises,andtheoceanintrudesthevalleywherethemarshisandformsasandybeach. & & hline
4.Thelakehasfilledtothepointwhereitisamarshagain.Vegetationreturns. & & hline
3.Theearthquakehascausedthevalleyfloortosink,andtheswamphasdeepenedintoalake.Slowly,
thelakefillswithsediment. & & hline 2.Anearthquakecausesalargelandslideintotheswampfroma
nearbyrockyhillside. & & hline 1.Thereisafreshwatermarsh,fullofvegetation,inavalley.Layersof
deadplantsbuilduponthebottom. & & hline end{tabular}.
Which phase of the simplified system development process is .pdf
Which phase of the simplified system development process is described by the specification of a
technical, computer-based solution for identified business requirements? Implementation Design.
Analysis Business Process Reengineering Question 14 The building blocks of information systems
include all of the following EXCEPT for: Communication Partnership Knowledge Processes.
More from solutions6 (20)
Which statement is not true about hermaphrodites in C elegan.pdf
Which statement is not true about hermaphrodites in C elegan.pdf
While viewing the presentation take notes on the video foc.pdf
While viewing the presentation take notes on the video foc.pdf
While students cannot file a private lawsuit for FERPA viola.pdf
While students cannot file a private lawsuit for FERPA viola.pdf
While exploring an ancient temple Prof Jones comes across .pdf
While exploring an ancient temple Prof Jones comes across .pdf
Which one of the following statements is valid In a histogr.pdf
Which one of the following statements is valid In a histogr.pdf
Which one of the following would be classified as a long ter.pdf
Which one of the following would be classified as a long ter.pdf
Which two of the following are not true for offshore wind H.pdf
Which two of the following are not true for offshore wind H.pdf
Which tissue is correctly paired with its primary immature c.pdf
Which tissue is correctly paired with its primary immature c.pdf
Which statement regarding extinction on Earth is true a Ma.pdf
Which statement regarding extinction on Earth is true a Ma.pdf
Which statement is true about the Healthy Reople initiative.pdf
Which statement is true about the Healthy Reople initiative.pdf
Which statement is true regarding the heart The apex of the.pdf
Which statement is true regarding the heart The apex of the.pdf
Which statements are true about audiovisual training Selec.pdf
Which statements are true about audiovisual training Selec.pdf
Which statement is not TRUE regarding MS Office macro 1 M.pdf
Which statement is not TRUE regarding MS Office macro 1 M.pdf
Which statement below about gene expression is TRUE The gen.pdf
Which statement below about gene expression is TRUE The gen.pdf
Which statement best describes the Ecological Perspective A.pdf
Which statement best describes the Ecological Perspective A.pdf
Which statement is correct regarding the dorsal horn of the .pdf
Which statement is correct regarding the dorsal horn of the .pdf
Which species of bacteria produced the enzyme urease Pseudo.pdf
Which species of bacteria produced the enzyme urease Pseudo.pdf
Which properties seemed to make the largest craters Find s.pdf
Which properties seemed to make the largest craters Find s.pdf
Which sediments and rocks do I add to these tables Choices .pdf
Which sediments and rocks do I add to these tables Choices .pdf
Which phase of the simplified system development process is .pdf
Which phase of the simplified system development process is .pdf
Recently uploaded
special B.ed 2nd year old paper_20240531.pdf
Instagram:-
https://instagram.com/special_education_needs_01?igshid=YmMyMTA2M2Y=
WhatsApp:-
https://chat.whatsapp.com/JVakNIYlSV94x7bwunO3Dc
YouTube:-
https://youtube.com/@special_education_needs
Teligram :- https://t.me/special_education_needs
Slide Shere :-
https://www.slideshare.net/shabnambano20?utm_campaign=profiletracking&utm_medium=sssite&utm_source=ssslideview
Biological Screening of Herbal Drugs in detailed.
Biological screening of herbal drugs: Introduction and Need for
Phyto-Pharmacological Screening, New Strategies for evaluating
Natural Products, In vitro evaluation techniques for Antioxidants, Antimicrobial and Anticancer drugs. In vivo evaluation techniques
for Anti-inflammatory, Antiulcer, Anticancer, Wound healing, Antidiabetic, Hepatoprotective, Cardio protective, Diuretics and
Antifertility, Toxicity studies as per OECD guidelines
Thesis Statement for students diagnonsed withADHD.ppt
Presentation required for the master in Education.
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptxMohd Adib Abd Muin, Senior Lecturer at Universiti Utara Malaysia
This slide is prepared for master's students (MIFB & MIBS) UUM. May it be useful to all.Unit 2- Research Aptitude (UGC NET Paper I).pdf
This slide describes the research aptitude of unit 2 in the UGC NET paper I.
Polish students' mobility in the Czech Republic
Polish students mobility to the Czech Republic within eTwinning project "Medieval adventures with Marco Polo"
Operation Blue Star - Saka Neela Tara
Operation “Blue Star” is the only event in the history of Independent India where the state went into war with its own people. Even after about 40 years it is not clear if it was culmination of states anger over people of the region, a political game of power or start of dictatorial chapter in the democratic setup.
The people of Punjab felt alienated from main stream due to denial of their just demands during a long democratic struggle since independence. As it happen all over the word, it led to militant struggle with great loss of lives of military, police and civilian personnel. Killing of Indira Gandhi and massacre of innocent Sikhs in Delhi and other India cities was also associated with this movement.
The Roman Empire A Historical Colossus.pdf
The Roman Empire, a vast and enduring power, stands as one of history's most remarkable civilizations, leaving an indelible imprint on the world. It emerged from the Roman Republic, transitioning into an imperial powerhouse under the leadership of Augustus Caesar in 27 BCE. This transformation marked the beginning of an era defined by unprecedented territorial expansion, architectural marvels, and profound cultural influence.
The empire's roots lie in the city of Rome, founded, according to legend, by Romulus in 753 BCE. Over centuries, Rome evolved from a small settlement to a formidable republic, characterized by a complex political system with elected officials and checks on power. However, internal strife, class conflicts, and military ambitions paved the way for the end of the Republic. Julius Caesar’s dictatorship and subsequent assassination in 44 BCE created a power vacuum, leading to a civil war. Octavian, later Augustus, emerged victorious, heralding the Roman Empire’s birth.
Under Augustus, the empire experienced the Pax Romana, a 200-year period of relative peace and stability. Augustus reformed the military, established efficient administrative systems, and initiated grand construction projects. The empire's borders expanded, encompassing territories from Britain to Egypt and from Spain to the Euphrates. Roman legions, renowned for their discipline and engineering prowess, secured and maintained these vast territories, building roads, fortifications, and cities that facilitated control and integration.
The Roman Empire’s society was hierarchical, with a rigid class system. At the top were the patricians, wealthy elites who held significant political power. Below them were the plebeians, free citizens with limited political influence, and the vast numbers of slaves who formed the backbone of the economy. The family unit was central, governed by the paterfamilias, the male head who held absolute authority.
Culturally, the Romans were eclectic, absorbing and adapting elements from the civilizations they encountered, particularly the Greeks. Roman art, literature, and philosophy reflected this synthesis, creating a rich cultural tapestry. Latin, the Roman language, became the lingua franca of the Western world, influencing numerous modern languages.
Roman architecture and engineering achievements were monumental. They perfected the arch, vault, and dome, constructing enduring structures like the Colosseum, Pantheon, and aqueducts. These engineering marvels not only showcased Roman ingenuity but also served practical purposes, from public entertainment to water supply.
The Challenger.pdf DNHS Official Publication
Read| The latest issue of The Challenger is here! We are thrilled to announce that our school paper has qualified for the NATIONAL SCHOOLS PRESS CONFERENCE (NSPC) 2024. Thank you for your unwavering support and trust. Dive into the stories that made us stand out!
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI funded books
Wednesday 22 May 2024, 14:00-15:00.
Honest Reviews of Tim Han LMA Course Program.pptx
Personal development courses are widely available today, with each one promising life-changing outcomes. Tim Han’s Life Mastery Achievers (LMA) Course has drawn a lot of interest. In addition to offering my frank assessment of Success Insider’s LMA Course, this piece examines the course’s effects via a variety of Tim Han LMA course reviews and Success Insider comments.
The French Revolution Class 9 Study Material pdf free download
The French Revolution, which began in 1789, was a period of radical social and political upheaval in France. It marked the decline of absolute monarchies, the rise of secular and democratic republics, and the eventual rise of Napoleon Bonaparte. This revolutionary period is crucial in understanding the transition from feudalism to modernity in Europe.
For more information, visit-www.vavaclasses.com
Palestine last event orientationfvgnh .pptx
An EFL lesson about the current events in Palestine. It is intended to be for intermediate students who wish to increase their listening skills through a short lesson in power point.
Recently uploaded (20)
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Adversarial Attention Modeling for Multi-dimensional Emotion Regression.pdf
Thesis Statement for students diagnonsed withADHD.ppt
Thesis Statement for students diagnonsed withADHD.ppt
Chapter 3 - Islamic Banking Products and Services.pptx
Chapter 3 - Islamic Banking Products and Services.pptx
How libraries can support authors with open access requirements for UKRI fund...
How libraries can support authors with open access requirements for UKRI fund...
The French Revolution Class 9 Study Material pdf free download
The French Revolution Class 9 Study Material pdf free download
Which XXX condition generates the following output Not foun.pdf
- 1. Which XXX condition generates the following output? Not found #include <stdio.h> int BinarySearch(int numberList[], int element, int lowVal, int highVal) { int midVal; if (XXX) { midVal = (highVal + lowVal) / 2; if (numberList[midVal] == element) { return midVal; } else if (numberList[midVal] > element) { return BinarySearch(numberList, element, lowVal, midVal - 1); } else { return BinarySearch(numberList, element, midVal + 1, highVal); } } else { return -1; } } int main(void) { int size = 10; int numberList[size]; int element = 20; int matchPos; for (int i = 0; i < size; ++i) { numberList[i] = i; } matchPos = BinarySearch(numberList, element, 0, size - 1); if (matchPos >= 0) { printf("Found at position %d.n", matchPos); } else { printf("Not found.n"); } return 0; } options: lowVal >= highVal lowVal == highVal lowVal <= highVal lowVal + highVal == 0