Gravity A 2D board game can be represented by a nested list. Here is an example of a 4x4 board: [[" [" " . ["1", ["1", " [[" [" ["1", H " board = [[" [" " Each cell of our board of size NXN can only contain either an empty space denoted by " " or the string "1". " Write a function gravity (board: List[List[str]]) -> List[List[str]] that moves all the 1's downwards so they are stacked at the bottom of the board. This is like like applying gravity to the board and all the 1's are pulled down. Your gravity function should return a new board representing the input board after applying the gravity. For example, " gravity (board) H " H H " " H . . . " " " ["1"," ["1"," " " " ** " H " "], "], "], 1"]] "1 " ** " " == ** " 1. "], "], " ["1","1","1","1"]] " " " " "], "], "], ,"1"]] . *

Gravity A 2D board game can be represented by a nested list. Here is an example of a 4x4 board: [[" [" " . ["1", ["1", " [[" [" ["1", H " board = [[" [" " Each cell of our board of size NXN can only contain either an empty space denoted by " " or the string "1". " Write a function gravity (board: List[List[str]]) -> List[List[str]] that moves all the 1's downwards so they are stacked at the bottom of the board. This is like like applying gravity to the board and all the 1's are pulled down. Your gravity function should return a new board representing the input board after applying the gravity. For example, " gravity (board) H " H H " " H . . . " " " ["1"," ["1"," " " " " H " "], "], "], 1"]] "1 " " " == ** " 1. "], "], " ["1","1","1","1"]] " " " " "], "], "], ,"1"]] . *

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Computer Science Java Programming ******* Write a Java application that will, given an appropriate data structure, will be able to track the following module and its dependencies as well as implement an appropriate search algorithm to create the correct graph for any given module. The graph will show all the corresponding dependent modules in their correct order of dependency. Must use Stack, either Double ArrayList or Linked List, and simple search to implement this. Module A: Dependencies: B D E K L Module B: Dependencies: F G M Module C: Dependencies: F Module D: Dependencies: G Module E: Dependencies: B A Module F: Dependencies: B Module G: Dependencies: NONE Module K: Dependencies: M Module L: Dependencies: Q Module M: Dependencies: A Module Q: Dependencies: NONE Ensure that dependencies are only visited only once. To test: Input A Your Output: Module A. Dependencies: B F G M D E K M L Q
A list of lists of numbers is a list such that all its elements are lists of numbers. Consider the following examples:• [[3,5], [], [1, 1, 1]] is a list of list of numbers;• [ [ [3,5]]], [], [1]] is not a list of list of numbers due to the first element;• [2, [1]] is not a list of list of numbers due to the first element, but note that the tree that encodes this list also encodes [[0,0],[1]] which is a list of list of numbers. Note that an empty list can always be considered a list of numbers and a list of lists of numbers. Answer for EACH of the given trees (a)–(d) the following question:Does it encode a list of numbers? If it does which is the corresponding list of numbers? USE THE ENCODING OF DATATYPES IN D BELOW (a) ((nil.nil).((nil. (nil.nil)).<<nil.(nil.nil)).nil)))(b) (nil.((nil.nil).(({nil.(nil.nil)).nil).nil)))(c) (((nil.nil).((nil. (nil.nil)).nil)).< (nil.(nil. (nil.nil ))).nil )) (d) ((nil.nil).((nil.nil).<<<<nil.nil).nil).nil).nil)))
A list of lists of numbers is a list such that all its elements are lists of numbers. Consider the following examples:• [[3,5], [], [1, 1, 1]] is a list of list of numbers;• [ [ [3,5]]], [], [1]] is not a list of list of numbers due to the first element;• [2, [1]] is not a list of list of numbers due to the first element, but note that the tree that encodes this list also encodes [[0,0],[1]] which is a list of list of numbers. Note that an empty list can always be considered a list of numbers and a list of lists of numbers. Answer for EACH of the given trees (a)-(d) the following question: Does it encode a list of lists of numbers? If it does which is the corre- sponding list of lists of numbers? USE THE ENCODING OF DATATYPES IN D BELOW(a) ((nil.nil).((nil. (nil.nil)).<<nil.(nil.nil)).nil)))(b) (nil.((nil.nil).(({nil.(nil.nil)).nil).nil)))(c) (((nil.nil).((nil. (nil.nil)).nil)).< (nil.(nil. (nil.nil ))).nil )) (d) ((nil.nil).((nil.nil).<<<<nil.nil).nil).nil).nil)))
Implement a __setitem__ function that also supports negative indices. For example: W = L2(Node(10, Node(20, Node(30))))print W[ 10, 20, 30 ] W[1]=25print W[ 10, 25, 30 ] W[-1]=35print W[ 10, 25, 35 ] Complete the code: def L2(*args,**kwargs): class L2_class(L): def __getitem__(self, idx): <... YOUR CODE HERE ...> def __setitem__(self, idx, value): <... YOUR CODE HERE ...> return L2_class(*args,**kwargs) W = L2(Node(10, Node(20, Node(30))))print(W)W[1]=25print(W)W[-1]=35print(W)
1. A polynomial can be represented as a linked list, where each node called a polyNode contains the coefficient and the exponent of a term of the polynomial. For example, the polynomial 4x³ + 3x² - 5 would be represented as the linked list: 43 3 4x3 I 2 % 3x² Write a Polynomial class that has methods for creating a polynomial, reading and writing a polynomial, and adding a pair of polymomials. -50 -5x° In order to add 2 polynomials, traverse both lists. If a particular exponent value is present in either one, it should also be present in the resulting polynomial unless its coefficient is zero.
2 pts 2/5 Animo Space Support 2D-DP-7 void mysteryFunction(int myList[][5], int r, int c) { int i, j, k, curr, temp; for ( (1) ) for (i = 0; i < c; i++) curr = i; for (j = i; j < c; j++) if(_(2)_) curr = j; temp = myList[k][i]; myList[k][i] = myList[k][curr]; myList[k][curr] = temp; int main() int i,j; int input[2][5] = { {7, 2, 3, 15, 8}, {56, 4, 12, 5, 9}}; mysteryFunction(input, 2, 5); for (i = 0; i < 2; i++) { for (j = 0; j < 5; j++) printf("%d ", input[i][j]); printf("\n"); return 0; Output: 2 378 15 459 12 56 Given the code segment above, what should be the content of _(2)__ in order to achieve the provided output? Assume the necessary libraries and functions are included and implemented.
Write a program that maintains a personal phone book in C. The program allows to:▪ Add and Delete entries from the phone book,▪ Search the phone book for a specific entry by last name or by phone number, and▪ Print out the entire entries in the phone book.The data in the phone book is maintained by storing in memory with the use of a singly linked list, withone list node per entry. Each node contains members for storing a person’s family name, first name, address,and the phone number. Use strings to store this information. The linked list must be kept in increasingalphabetical order, sorted by family name. There are no duplicate entries with the same family nameallowed in the phone book. This program should be menu driven, with the user being offered a choice of the following commandsdescribed below:▪ Insert a new entry into the phone book.The program should prompt the user for a new family name and first name, an address and a phonenumber. This information should be placed in a new…
Write a program that maintains a personal phone book in C. The program allows to:▪ Add and Delete entries from the phone book,▪ Search the phone book for a specific entry by last name or by phone number, and▪ Print out the entire entries in the phone book.The data in the phone book is maintained by storing in memory with the use of a singly linked list, withone list node per entry. Each node contains members for storing a person’s family name, first name, address,and the phone number. Use strings to store this information. The linked list must be kept in increasingalphabetical order, sorted by family name. There are no duplicate entries with the same family nameallowed in the phone book. This program should be menu driven, with the user being offered a choice of the following commandsdescribed below:▪ Insert a new entry into the phone book.The program should prompt the user for a new family name and first name, an address and a phonenumber. This information should be placed in a new…
Introduction For this assignment, you are to write a program which implements a Sorted List data structure using a circular array-based implementation and a driver program that will test this implementation. The Sorted List ADT is a linear collection of data in which all elements are stored in sorted order. Your implementation has to store a single int value as each element of the list and support the following operations: 1. add(x) – adds the integer x to the list. The resulting list should remain sorted in increasing order. The time complexity of this operation should be 0(N), where N is the size of the list. 2. removefirst() - deletes the first integer from the list and returns its value. The remaining list should remain sorted. Time complexity of this operation should be 0(1). 3. removelast() – deletes the last integer from the list and returns its value. The remaining list should remain sorted. Time complexity of this operation should be 0(1). 4. exists(x) – returns true if the…
Q#03: Consider a queue that is a Queue-Type object and the size of the array implementation of aqueue is 200. In addition, consider that the value of Queue-Front is 199 and the value of Queue-Rear is 125. a. After adding an element to queue, what will be the values of Queue-Front and Queue-Rear?b. After removing an element from queue, what will be the values of Queue-Front and Queue-Rear?
python assignment Matrix class Implement a matrix class (in matrix.py). a) The initializer should take a list of lists as an argument, where each outer list is a row, and each value in an inner list is a value in the corresponding row. b) Implement the __str__ method to nicely format the string representation of the matrix: one line per row, two characters per number (%2d) and a space between numbers. For example: m = Matrix([[1,0,0],[0,1,0],[0,0,1]]) print(m)> 1 0 0> 0 1 0> 0 0 1 c) Implement a method scale(factor) that returns a new matrix where each value is multiplied by scale. For example: m = Matrix([[1,2,3],[4,5,6],[7,8,9]])n = m.scale(2)print(n)> 2 4 6> 8 10 12>14 16 18print(m)> 1 2 3> 4 5 6> 7 8 9 d) Implement a method transpose() that returns a new matrix that has been transposed. Transposing flips a matrix over its diagonal: it switches rows and columns. m = Matrix([[1,2,3],[4,5,6],[7,8,9]])print(m)> 1 2 3> 4 5 6> 7 8…
09.Given a linked list of N nodes such that it may contain a loop. A loop here means that the last node of the link list is connected to the node at position X(1-based index). If the link list does not have any loop, X=0. Remove the loop from the linked list, if it is present, i.e. unlink the last node which is forming the loop. Example 1: Input: N = 3 value[] = {1,3,4} X = 2 Output: 1 Explanation: The link list looks like 1 -> 3 -> 4 ^ | |____|