All categories

2 years ago

Write a recursive Python function – recEmptyStack(S) for removing all the elements from a stack S

Computers and Technology

1 answer:

Masteriza [31]2 years ago

6 0

The sample recursive Python Function is given below. See the definition of a Recursive Python Function.

<h3>What is a Recursive Python Function?</h3>

A recursive function is one that defines itself in terms of itself using self-referential phrases.

This signifies that the function will keep calling itself and repeating its action until some condition is fulfilled and a result is returned.

Sample Recursive Python Function is:

def remove_all0(x,s):

while s!=[]:

if x == s[0]:

ss = [s[1]] + remove_all0(x,s[2:])

return ss

else:

s1 = [s[0]] + remove_all0(x, s[1:])

return s1

if s==[]:

return s

print(remove_all0(3,[4,3,5,6,3,2,1]))

Learn more about Recursive Python Functions at;
brainly.com/question/14208577
#SPJ1

You might be interested in

If you have an if/else if/else code sequence with 4 blocks, what is the minimal number of input values that you should use to te

yawa3891 [41]

Answer:

4 is the correct answer for the above question.

Explanation:

If the if-else sequence has 4 blocks then it will be designed like if, else-if, else-if and then else which made 4 blocks which are as follows:-

The first block is an if block.
Then the second block is an else-if block.
The third block is also else-if block and
The fourth block else blocks.

So there is a need of 4 value (one value for each case) to test the application which is defined in the above scenario.
It is because when the first if statement is false then the first else-if statement is executed and when the first else statement is false then the second else-if statement is executed and when it is false then the else statement will executed.

7 0

3 years ago

True / False Bit patterns have no intrinsic meaning.

scoray [572]

Answer:

The given statement is True

Explanation:

Since, a bit pattern is a bit sequence, basically, data which as such has no intrinsic meaning.

Bit pattern is a bit sequence or sequentially arranged binary digits.

It is used to describe bit sequence in communication channels, memory or some other device.

Bit patterns are used to represent instructions, floating point numbers, signed/unsigned integers.

7 0

3 years ago

(a) How many locations of memory can you address with 12-bit memory address? (b) How many bits are required to address a 2-Mega-

I am Lyosha [343]

Answer:

Follows are the solution to this question:

Explanation:

In point a:

Let,

The address of 1-bit memory to add in 2 location:

$\to \frac{0}{1} =2^1 \ (\frac{m}{m} \ location)$

The address of 2-bit memory to add in 4 location:

$\to \frac{\frac{00}{01}}{\frac{10}{11}} =2^2 \ (\frac{m}{m} \ location)$

similarly,

Complete 'n'-bit memory address' location number is = $2^n.$ Here, 12-bit memory address, i.e. n = 12, hence the numeral. of the addressable locations of the memory:

$= 2^n \\\\ = 2^{12} \\\\ = 4096$

In point b:

$\to Let \ Mega= 10^6$

$=10^3\times 10^3\\\\= 2^{10} \times 2^{10}$

So,

$\to 2 \ Mega =2 \times 2^{20}$

$= 2^1 \times 2^{20}\\\\= 2^{21}$

The memory position for ' $2^n$ ' could be 'n' m bits'

It can use $2^{21}$ bits to address the memory location of 21.

That is to say, the 2-mega-location memory needs '21' bits.

Memory Length = 21 bit Address

In point c:

$i^{th}$ element array addresses are given by:

$\to address [i] = B+w \times (i-LB)$

$_{where}, \\\\B = \text {Base address}\\w= \text{size of the element}\\L B = \text{lower array bound}$

$\to B=\$ 52\\\to w= 4 byte\\ \to L B= 0\\\to address = 10$

$\to address [10] = \$ 52 + 4 \times (10-0)\\$

$= \$ 52 + 40 \ bytes\\$

1 term is 4 bytes in 'MIPS,' that is:

$= \$ 52 + 10 \ words\\\\ = \$ 512$

In point d:

$\to base \ address = \$ t 5$

When MIPS is 1 word which equals to 32 bit :

In Unicode, its value is = 2 byte

In ASCII code its value is = 1 byte

both sizes are < 4 byte

Calculating address:

$\to address [5] = \$ t5 + 4 \times (5-0)\\$

$= \$ t5 + 4 \times 5\\ \\ = \$ t5 + 20 \\\\= \$ t5 + 20 \ bytes \\\\= \$ t5 + 5 \ words \\\\= \$ t 10 \ words \\\\$

3 0

3 years ago

You can go back to the previous or next location on the window using the

fenix001 [56]

Alt key and pressing the left or right arrow

3 0

3 years ago

What command is used to locate all occurrences of the word "dog" in a document?

rosijanka [135]

Microsoft Word can easily find text in your document. This search is handled by the Find command. To locate the occurrences of the word dog in a word document, you can either click the find button on the home tab or press the combination keys ctrl+F and type the word dog. You also press ctrl+G. The Find and Replace dial box will pop up, with the Go To tab displayed. You will go ahead and click the Find tab and type the word dog.

3 0

3 years ago

Read 2 more answers