Programming > QUESTIONS & ANSWERS > socrative programming quizes 2022 (All)

socrative programming quizes 2022

Document Content and Description Below

the depth of recursion is the number of times that a method calls itself the actions that the jvm must perform any time a method is called overhead look at the following psuedocode algo ... rithm Test14(int x) if(x < 8) returns (2*x) else returns (3*Test14(x-8)+8) end Test14 what is the depth of Test14(9) 14 public static int test2(int x, int y) { if (x<y) { return -5 } else { return (test2(x - y, y + 5) + 6); } } what is returned for test2(30, 20)? 1 the bubble sort algorithm works by repeatedly comparing adjacent items and swapping them so smaller values come before larger values a search for an item x in an array starts at the lower end of the array, and then looks for x by comparing array items to x in order of increasing subscript. such a method is called sequential search the addition of two integers is a basic step if there is a fixed bound on the size of the integers if an algorithm makes two separate, unnested passes over an input of size n, the performance of the algorithm will be in the class O(n) a linked list is represented by a reference to the first node in the list, unless the list is empty, in which case the reference is set to null to remove the first node in a nonempty linked list move the head reference one node forward: head = head.next; a recursive method is a method that calls itself like a loop, a recursive method must have some way to control the number of times it repeats itself look at the following psuedocode algorithm Test14(int x) if(x < 8) returns (2*x) else returns (3*Test14(x-8)+8) end Test14 what is the base case for the algorthm? x < 8 [Show More]

Last updated: 3 years ago

Preview 1 out of 4 pages

Buy Now

Instant download

We Accept: