0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
How it work a toaster circuit?
wtc wesley college 10J boii`sz 08 Newja.Fanpi.Talpr.Tosme.Poewi.Pitjo.Robiv.heuhu.Bodna.Ratje.Mathe.Sulin.Talpr.Ofawi.Uiala.Latta
What is Kevin in ASCII values?
Determining the ASCII values for any string of characters is simple, requiring a for loop and an understanding of strings. All a string is in C is an array of characters terminated with ASCII 0 (also known as a zero-terminated string or NUL-terminated string). The following block of code assumes that "sz" is a pointer to your string data and "psz" is a character pointer: for (psz=sz; *psz; psz++) printf("%02X:%03d ", *psz); printf("\n"); Step by step, what this code does is: - Initializes "psz" to the same value as "sz", which means they both point to the address of the first character in the string; - Checks if the character at the address in "psz" is not zero (meaning not at the end of the string) and, if so, breaks out of the loop; - Displays a two-character hexadecimal (base 16) and a three-digit (base 10) ASCII representation of the character followed by a space; - Loops back to the character check - Displays a newline to move the cursor to the beginning of the next line. Before the code, and inside your desired function block, define "psz" and "sz" as char* types, and set "sz" to the string "Kevin". The full listing is as follows: int main() { char *psz, *sz="Kevin"; for (psz=sz; *psz; psz++) printf("%02X:%03d ", *psz); printf("\n"); return 0; } Note that if you're using C++ you'll need to change "char" to "const char".
How do you implement a deque using an array in c language?
A deque (pronounced deck) is a double-ended queue where objects can be efficiently pushed to and popped from either end of the queue.Arrays are not ideally suited to this task because arrays operate more efficiently when used like a stack, pushing and popping elements at the end of the array where the unused elements are. When we run out of unused elements we can reallocate the array creating more space at the end as required (typically doubling the allocation with each reallocation). For this we need to keep track of three pieces of information:The start address of the array.The overall length of the array in elements (size).The number of unused elements at the end of the array (space).A queue differs from a stack in that all insertions occur at the first unused element, while extractions occur at the first used element, which is initially at the start of the array. After an extraction we end up with an unused element at the start of the array. Although we could shunt all used elements by one element to eliminate the gap, it is more efficient to just keep track of the front of the queue. Thus we need 4 pieces of information:The start address of the array.The overall length of the array in elements (size).The total number of unused elements in the array (space).The index of the first element in the queue (start).From this information it is trivial to calculate the length of the queue (size-space) and thus determine where the first unused element is using modulo arithmetic: ((start+(size-space))%size).When we run out of space at the end of the array for an insertion, we simply use the unused elements at the beginning of the array. When we run out of space completely, we normalise the array so that the start of the queue is back at the beginning of the array before reallocating the array, thus placing all the new unused elements at the end of the array (after the last element in the queue). If we don't normalise the array, we will most likely end up with unused elements in the middle of the queue due to the circular nature of the array.To implement a deque we use a similar technique except we can insert and extract from either end of the queue. The following program demonstrates how the major deque operations can be implemented upon an array of unsigned integers.#include#include#include#include// a deque of unsigned integerstypedef struct arraydeque_t {unsigned* arr; // pointer to a variable length array of type unsignedunsigned sz; // overall length of array (in elements)unsigned space; // unused elementsunsigned start; // index of the start of the queue} arraydeque;bool is_empty (arraydeque*);unsigned size (arraydeque*);unsigned back (arraydeque*);unsigned front (arraydeque*);int initialise (arraydeque*);int push_back (arraydeque*, unsigned);int push_front (arraydeque*, unsigned);int expand (arraydeque*);void pop_back (arraydeque*);void pop_front (arraydeque*);void clear (arraydeque*);// calculates and returns the length of the queueunsigned size (arraydeque* deq) {return deq->sz-deq->space;}// returns true if the queue is emptybool is_empty (arraydeque* deq) {return deq->space==deq->sz;}// clear the dequevoid clear (arraydeque* deq) {if (deq->arr) free (deq->arr);memset (deq, 0, sizeof (arraydeque));}// initialise the dequeint initialise (arraydeque* deq) {const unsigned sz = 1; // start with 2 unused elementsmemset (deq, 0, sizeof (arraydeque));deq->arr = (unsigned*) malloc (sz * sizeof (unsigned));if (!deq->arr) return -1; // out of memorydeq->sz = sz;deq->space = sz;return 0;}// increase the size of the deque (create space)int expand (arraydeque* deq) {unsigned space, t, i, *p;if (deq->space) return 0; // no need to expand when we have space// normalise the array (realign the start of the queue with the start of the arraywhile (deq->start) {t = deq->arr[0]; // temporarily store first element valuefor (i=1; isz; ++i) // shunt all other elements forwarddeq->arr[i-1] = deq->arr[i];deq->arr[deq->sz-1] = t; // put temporary value at end of array--deq->start;}// reallocate the array to create space after the queuespace = (unsigned) (0.6 * deq->sz + 1); // optimum growth: 160%p = (unsigned*) realloc (deq->arr, (deq->sz + space) * sizeof(unsigned));if (!p) return -1; // out of memorydeq->arr = p;deq->sz += space;deq->space = space;return 0;}// insert value at the back of the queueint push_back (arraydeque* deq, unsigned val) {if (expand (deq))return -1; // out of memorydeq->arr[(deq->start+size (deq))%deq->sz] = val;--deq->space;return 0;}// insert value at the front of the queueint push_front (arraydeque* deq, unsigned val) {if (expand (deq))return -1; // out of memoryif (!deq->start)deq->start=deq->sz;--deq->start;deq->arr[deq->start] = val;--deq->space;return 0;}// extract the back valuevoid pop_back (arraydeque* deq) {++deq->space;}// extract the front valuevoid pop_front (arraydeque* deq) {++deq->start;deq->start%=deq->sz;++deq->space;}// return the back valueunsigned back (arraydeque* deq) {return deq->arr[((deq->start + size(deq)-1)%deq->sz)];}// return the front valueunsigned front (arraydeque* deq) {return deq->arr[deq->start];}// returns true or false at random (used by test program)bool is_true (void) {return rand() & 0x1;}// prints the content of the deque (used by test program)void print_queue (arraydeque* deq) {unsigned i, sz;printf ("{");sz = size (deq);i = deq->start;while (sz--) {printf ("%u%s", deq->arr[i++], sz?", ":"");if (i==deq->sz) i=0;}printf ("}\n");}// test programint main (void) {unsigned i, loop;srand((unsigned) time(0)); // seed random generatorarraydeque deq;initialise (&deq); // initialise the dequefor (loop=0; loop
How do you write a C program to add 2 matrices using functions?
We'll assume the matrix elements are doubles, but we can easily adapt the code to cater for any numeric data type. First we need a (primitive) function that emulates the += operator for two arrays of doubles: double* add_assign_array (double* a, double* b, size_t sz) { for (size_t i=0; i<sz; ++i) a[i] += b[i]; return a; } Note that we are wholly reliant upon the caller to ensure all arguments are valid. We could test for null pointer arguments, however there's no advantage in doing so when we cannot even guarantee that a and b actually refer to at least sz elements. For efficiency it's better if the caller handles any and all necessary runtime tests and thus keep those tests to a minimum. With this function in place we can now add two matrices, row by row: double* add_assign_matrix (double* a, double* b, size_t rows, size_t cols) { size_t i; for (size_t row=0; row<rows; ++row) { i = row * cols; add_assign_array (a[i], b[i], cols); } return a; } Example usage: // Utility functions: void print_array (double*, size_t); void print_matrix (double*, size_t, size_t); int main (void) { const size_t rows = 3; const size_t cols = 4; double a[rows][cols] = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}}; double b[rows][cols] = {{13, 14, 15, 16}, {17, 18, 19, 20}, {21, 22, 23, 24}}; printf ("Matrix a:\n"); print_matrix (a, rows, cols); printf ("Matrix b:\n"); print_matrix (b, rows, cols); printf ("Matrix a+=b:\n"); add_assign_matrix (a, b, rows, cols); print_matrix (a, rows, cols); return 0; } void print_array (double* a, size_t sz) { for (size_t i=0; i<sz; ++i) printf ("%f\t") a[i]; printf ("\n"); } void print_matrix (double* a, size_t rows, size_t cols) { for (size_t row=0; row<rows; ++row) print_array (a[row * cols], cols); } Note that the add_assign function emulates a += b rather than c = a + b. However, we can easily emulate this by copying one of the matrices and then calling add_assign upon the copy: // e.g., c = a + b; double c[rows][cols]; // uninitialised matrix memcpy (c, a, rows * cols * sizeof (double)); // c is a copy of a add_assign_matrix (c, b, rows, cols); // c += b It's far from intuitive but arrays and matrices are anything but intuitive in C programming.
How do you implement a stack using an array in c plus plus?
An array in C++ is fixed-size and is unsuitable for implementing stacks. You can use a C-style dynamic array, of course, but the C++ method is to use a vector. A vector encapsulates a C-style dynamic array along with its size and greatly simplifies the way you work with arrays. Dynamic arrays are generally the best way to implement a stack, however be aware that when the array is full and you want to add a new element, you must reallocate the array which can occasionally cause the entire array to be moved to new memory. A vector, on the other hand, automatically reserves 1.6 times the consumed memory on each reallocation and thus minimises the need to reallocate. Vectors provide a push_back() and pop_back() method, since these are the fastest methods of inserting and extracting elements from an array (inserting or extracting anywhere else would result in elements being shunted up and down the array, which is inefficient). These two methods alone are all you need to implement a stack. However, vectors also permit random access to any element within the array. To eliminate all unnecessary features, you must encapsulate the vector within an adaptor class (a thin-wrapper) that only exposes the functionality you actually need. A minimal implementation is presented here: #include<vector> template<typename T> class stack { std::vector<T> m_data; public: stack() =default; ~stack() =default; stack(const stack&) =default; stack(stack&&) =default; stack& operator= (const stack&) =default; stack& operator= (stack&&) =default; void push (const T& data) {m_data.push_back (data);} void pop () {m_data.pop_back ();} T& top () {return m_data.back();} const T& top () const {return m_data.back();} }; This is fairly similar to the way a std::stack is implemented in the STL, although it also provides specialisations for pointer types. For more information on the implementation, consult the <stack> header in the standard library.
What is the best team of vivosaurs?
frigi is in AZ compso is in sz and dynal is in sz
When was Alfa Romeo SZ created?
Alfa Romeo SZ was created in 1989.
Is the Olympus SZ a DSLR camera?
Olympus SZ is a digital point and shoot camera, it is not a DSLR camera.
How do you say Miss?
M/ is /sz
What does the medical abbreviation SZ mean?
Seizure
What kids shoe size is equivalent to size 7 in womens shoes?
sz 5.5 is equivalent to a Women's sz 7 .... they both measure at 9.25" :)
What kid's shoe size is equivalent to a size 7 in womens's shoes?
sz 5.5 is equivalent to a Women's sz 7 .... they both measure at 9.25" :)
How do you beat Nevade in fossil fighters?
Use pachy at rank 6 in the az, s-raptor at rank 7 in the sz, and shanshan at rank 4 in the sz
Who was SZ Qasim?
first indian to step on Antarctica
How do you abbreviate the word size?
I would use "sz."
What are the November 2010 army promotion cut off scores for 13B?
556 for PZ 571 for SZ those are for E5 for E6 its 798 for both PZ and SZ
