Question 14 (1 point) Suppose the following function foo was called with a list of size...

Question

Question

Question 14 (1 point) Suppose the following function foo was called with a list of size 5. How many operations on the handler 2 5 112 10 6

engineering Computer-Science

Add a comment Improve this question Transcribed image text

Answer 1

Answer #1

def foo(L):
    r=0
    for x in L:
        try:
            #convert x to int
            s=int[x]
            r=r+s
        except ValueError:
            return 0
    return 0

If we call the function with list size 5. How many operations on the handler stack(push or pop) would result during the execution of the function?

0
2
5
12
10
6

Answer is:0

Add a comment

Answer 2

Similar Homework Help Questions

Question 14 (1 point) Suppose the following function foo was called with a list of size...

Question 14 (1 point) Suppose the following function foo was called with a list of size 5. How many operations on the handler stack (push or pop) would result during the execution of the function? def foo (L) : r = 0 for x in L: try: # convert x to int = int (x]) r = r + S except ValueError: return 0 S return r 0 return r 0 2 5 O 12 10 6
Suppose you were debugging the push() function of your program. Which of the following variables would...

Suppose you were debugging the push() function of your program. Which of the following variables would be accessible to the debugger before the function is called? static struct node *stack; static struct node *new_node() { int size = sizeof(struct node); return malloc(size); void push(void *value) { struct node *n = new_node(); n->value = value; n->next = stack; stack = n; return malloc(size); void push (void *value) { struct node *n = new_node(); n->value = value; n->next = stack; stack =...
Convert following code to implement linked list C++ language #include<iostream> using namespace std; int top =...

Convert following code to implement linked list C++ language #include<iostream> using namespace std; int top = -1; //globally defining the value of top, as the stack is empty void push(int stack[], int x, int n) { if (top == -1) //if top position is the last of posiition of stack,means stack is full { cout << "Stack is full Overflow condition"; } else { top = top + 1; //incrementing top position stack[top] = x; //inserting element on incremented position...

Need help. write a C program stack-ptr.c that implements a stack using a link list. Below...

Need help. write a C program stack-ptr.c that implements a stack using a link list. Below is a skeleton code to start with.Jjust edit to make thread friendly. examplpe: push(5, &top); push(10, &top); push(15, &top); int value = pop(&top); value = pop(&top); value = pop(&top); this program currently has a race condition. use Pthread mutex locks to fix the race conditions. test you now thread safe stack by creating 200 concurrent threads in main() that push and pop values. -use...
i want similar for this code to solve two questions : 1- Write a program to...

i want similar for this code to solve two questions : 1- Write a program to convert a postfix expression to infix expression 2-Write a program to convert an infix expression to prefix expression each question in separate code ( so will be two codes ) #include <iostream> #include <string> #define SIZE 50 using namespace std; // structure to represent a stack struct Stack { char s[SIZE]; int top; }; void push(Stack *st, char c) { st->top++; st->s[st->top] = c;...
Let T(n) be the running time of function foo. Find the equation of T(n) and find...

Let T(n) be the running time of function foo. Find the equation of T(n) and find the complexity of T(n) using big-O notation. def foo(L): s = 0 for x in L: j = len(L) while j > 1: j = j / 2 s = s + x print(s) return s

Given the following C code. Develop a evaluate post fix function that calculates the converted post...

Given the following C code. Develop a evaluate post fix function that calculates the converted post fix. #include <stdio.h> #include <ctype.h> #define max 10 char s[100]; int top=-1; void push(char); char pop(); int precede(char); main(){ char infix[100],postfix[100],ch; int i=0,j=0; // Read infix expression from user printf("Enter infix expression:"); scanf("%s",infix); // evaluate each char in infix expression while((ch=infix[i++])!='\0'){ // if it is number, add it to postfix expression if(isalnum(ch)){ ...
Question 9 (1 point) Suppose the following foo function was called from when the current referencing...

Question 9 (1 point) Suppose the following foo function was called from when the current referencing environment consisted only of the top level frame. If the function was called as shown below, how many reference frames will the referencing environment consist of once the base case is reached? Page 11 (define foo (lambda (n) (if (< n 1) -1 ; base case (let ((m (- n 1)) (if (even? n) (+ n (foo m)) (- n (foo m)) - )...
Name: Each question is worth 1 point. 20 1. In a linked-chain implementation of a Stack...

Name: Each question is worth 1 point. 20 1. In a linked-chain implementation of a Stack ADT, the performance of pushing an entry onto the stack is a. 0(2) b. О(n) С. 0(r) Answer: What is the entry returned by the peek method after the following stack operations. push(A), push(R), pop0. push(D), popO, push(L), pop0, pushJ), push(S), pop). pop 2. b.S c. L d. D Answer: n an efficient array-based chain implementation of a Stack ADT, the entry peek returns...

//stack_exception.h #ifndef STACK_EXCEPTION #define STACK_EXCEPTION #include <string> using namespace std; class Stack_Exception { public: Stack_Exception(string what)...

//stack_exception.h #ifndef STACK_EXCEPTION #define STACK_EXCEPTION #include <string> using namespace std; class Stack_Exception { public: Stack_Exception(string what) : what(what) {} string getWhat() {return what;} private: string what; }; #endif //stack_test_app.cpp #include <iostream> #include <sstream> #include <string> #include "stack.h" using namespace std; /********************************************* * The 'contains' function template goes here * *********************************************/ int main() { cout << boolalpha; cout << "--- stack of int" << endl; Stack<int> si; cout << "si intially " << si << endl; ...

Question 14 (1 point) Suppose the following function foo was called with a list of size...

Homework Answers