How many bytes does a common processor require to represent an integer?

In class, we discussed static local variables in C. Answereach question below; if necessary, find and consult a reference on the

alexira [117]

Answer:

(a) scope: function, lifetime: duration of the function

(b) scope: function, lifetime: duration of the program

(c) scope: global (all modules), lifetime: duration of the program

(d) scope: module (file), lifetime: duration of the program

6 0

3 years ago

or each array created, the name of the array becomes the name of the pointer constant created by the compiler for the array, and

JulijaS [17]

Answer:

The answer is "Starting address"

Explanation:

Arrays are a type of data structure that can store a fixed size successive assortment of components of a similar kind. An Array is used to store an assortment of data, yet it is regularly more valuable to consider a cluster an assortment of factors of a similar sort.

Rather than proclaiming singular factors, for example, number0, number1, ..., and number99, you declare one Array variable, for example, numbers and use numbers[0], numbers[1], and ..., numbers[99] to speak to singular factors. A particular component in a cluster is gotten to by a list.

All Arrays comprise of bordering memory areas. The most minimal address compares to the first element and the most highest address to the last element.

4 0

3 years ago

The logical view Select one: a. shows how data are organized and structured on the storage media. b. presents an entry screen to

Nana76 [90]

Answer:

The answer is "Option d'.

Explanation:

The database provides a single graphical view of the data, but it provides the facility to use logical view concept, that uses by view command, that uses the dataset to provide a logical view, that shows data according to user condition, and certain options were incorrect which can be described as follows:

In option a, In logical viewing data, it is not used.
In option b, It doesn't represent entry screen it simply shows detail.
In option c, this command doesn't allow you to create duplicate data.

4 0

3 years ago

Write a function called countstuff () that takes as a parameter a character array, and returns an int. The prototype must be:

PSYCHO15rus [73]

Answer:

Please kindly go to the explanation part.

Explanation:

The required function is written in Raw code below.

Function:

#include<stdio.h>

#include<ctype.h> //including required libraries

int countstuff(char s[]){ //Function countstuff

int cntUp=0,cntLow =0,cntDigits = 0,i=0,value; //declaring required variables

for(i=0;s[i]!='\0';i++){ //loop to iterate over the characters of string

if(isupper(s[i])){

cntUp++; //incrementing count of uppercase if it is uppercase character

}

else if(islower(s[i])){

cntLow++; //incrementing count of lowercase if it is lowercase character

}

else if(isdigit(s[i])){

cntDigits++; //incrementing count of digits if it is digit

}

value = cntUp*1000000 + cntLow*1000 + cntDigits; //counting value using formula given in question

return value; //returning the value

}

void main(){

char string[1000]; //declaring required variables

int value;

printf("Enter a String:");

scanf("%[^\n]s",string); //taking string as input

value = countstuff(string); //calling function

printf("The Value is : %d\n",value); //printing result

}

5 0

3 years ago

what is the largest possible number of internal nodes in a redblack tree with black height k? what is the smallest possiblenumbe

Elina [12.6K]

Answer:

A Red Black Tree is a type of self-balancing(BST) in this tree ,each node is red or black colored. The red black tree meets all the properties of the binary search tree, but some additional properties have been added to a Red Black Tree.

A Red-Black tree's height is O(Logn) where (n is the tree's amount of nodes).

In a red-black tree with black height k

The maximum number of internal nodes is $2^{2k}$ $-1$ .

The smallest possible number is $2^{k}$ $-1$ .

7 0

3 years ago