main.py x 12345 6 69 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 print ("List of pets") Pets=['dog'cat' 'elephant', 'bird', 'ferret'] Pets.sort (reverse=True) for i in range (len(pets): Print (i+1, pets[i]) Print () Print(*-**50) Count=0 for pet in pets : Count +=1. print(count, pet) pet = input ("Enter a pet type (nothing to stop) :") while pet !="": pets.append (pet) Ctrl Enter pet if pet ==**: break = input ("Enter a pet type (nothing to stop) :") pets.sort() for pet in pets : print (pet) print ("Thère are", len (pets), "pets in the list.")

main.py x 12345 6 69 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 print ("List of pets") Pets=['dog'cat' 'elephant', 'bird', 'ferret'] Pets.sort (reverse=True) for i in range (len(pets): Print (i+1, pets[i]) Print () Print(*-50) Count=0 for pet in pets : Count +=1. print(count, pet) pet = input ("Enter a pet type (nothing to stop) :") while pet !="": pets.append (pet) Ctrl Enter pet if pet ==: break = input ("Enter a pet type (nothing to stop) :") pets.sort() for pet in pets : print (pet) print ("Thère are", len (pets), "pets in the list.")

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

Which code part (A, B, C, or D) is incorrect? Add element in Linked List at particular index: add(int index, T item) void add(int index, int value) { // A. ============================================= if(index < 0 || index > count){ cerr << "Index Out of Bounds"; return; } node *temp = new node; temp->item = value; // A. ============================================= // B. ============================================= if (index == 0) { temp->next = head; head = temp; } // B. ============================================= // C. ============================================= else { node *previous = head; for(int i = 0; i < index - 1; ++i){ previous = previous->next; } // C. ============================================= // D. ============================================= previous->next = temp; temp->next = previous->next; } // D. ============================================= ++count; return; }
Change the insert and _insert methods accordingly to comply with the new format. - If a new word is inserted that has a matching sorted order of its letters as an existing Node, do not insert a new Node. Instead, modify the existing Node and append the inserted word into the list. Starter Code class Node: def __init__(self, value): self.value = value self.left = None self.right = None def __str__(self): return ("Node({})".format(self.value)) __repr__ = __str__ class BinarySearchTree: ''' >>> x=BinarySearchTree() >>> x.insert('mom') >>> x.insert('omm') >>> x.insert('mmo') >>> x.root Node({'mmo': ['mom', 'omm', 'mmo']}) >>> x.insert('sat') >>> x.insert('kind') >>> x.insert('ats') >>> x.root.left Node({'ast': ['sat', 'ats']}) >>> x.root.right is None…
implement this method: numOccurrencesRec(LNode node, int n, int key) – This method takes as parameters a reference to the head of a linked list, a position specified by n, and a key. It returns the number of occurrences of the key in the linked list beginning at the n-th node. If n = 0, it means you should search in the entire linked list. If n = 1, then you should skip the first node in the list.
/ This method takes as parameters a reference to the head of a linked list, a // position specified by n, and a key. It returns the number of occurrences // of the key in the linked list beginning at the n-th node. If n = 0, it means // you should search in the entire linked list. If n = 1, then you should skip // the first node in the list. public int numOccurrencesRec(LNode node, int n, int key) { // TODO: implement this method return 0; // replace this statement with your own return } } LNode Below: public class LNode{ // instance variables private int m_info; private LNode m_link; // constructor public LNode(int info) { m_info = info; m_link = null; } // member methods public void setLink(LNode link) { m_link = link; } public LNode getLink() { return m_link; } public int getInfo() { return m_info; } }
You have two numbers represented by a linked list, where each node contains a singledigit. The digits are stored in reverse order, such that the 1 's digit is at the head of the list. Write afunction that adds the two numbers and returns the sum as a linked list.EXAMPLEInput: (7-> 1 -> 6) + (5 -> 9 -> 2).That is,617 + 295.Output: 2 -> 1 -> 9. That is, 912.FOLLOW UPSuppose the digits are stored in forward order. Repeat the above problem.Input: (6 -> 1 -> 7) + (2 -> 9 -> 5).That is,617 + 295.Output: 9 -> 1 -> 2. That is, 912
You have two numbers represented by a linked list, where each node contains a singledigit. The digits are stored in reverse order, such that the 1 's digit is at the head of the list. Write afunction that adds the two numbers and returns the sum as a linked list.EXAMPLEInput: (7-> 1 -> 6) + (5 -> 9 -> 2).That is,617 + 295.Output: 2 -> 1 -> 9. That is, 912.FOLLOW UPSuppose the digits are stored in forward order. Repeat the above problem.EXAMPLElnput:(6 -> 1 -> 7) + (2 -> 9 -> 5).That is,617 + 295.Output: 9 -> 1 -> 2. That is, 912
Write a Python code using the given function and conditions. Do not use Numpy. Use LinkedList Manipulation. Given function: def insert(self, newElement, index) Pre-condition: The list is not empty. Post-condition: This method inserts newElement at the given index of the list. If an element with the same key as newElement value already exists in the list, then it concludes the key already exists and does not insert the key. [You must also check the validity of the index].
Implement two out of three of the basic sorting algorithms - Bubble Sort, Selection Sort, and Insertion Sort - in a generic List. Initial code to be completed: #include <iostream>#include "linkedlist.h" void bubbleSort(List*);void selectionSort(List*);void insertionSort(List*); /** * This activity is focused on using Arrays and Linked Lists as two different * implementations of List. It follows that you are only to use the methods of * List and not of the specific array or linkedlist. */int main(void) { // WARNING! Do not modify main method! // Doing so will nullify your score for this activity. char li; cin >> li; List* list; if (li == 'A') { list = new ArrayList(); } else { list = new LinkedList(); } int length; cin >> length; int input; for (int i = 0; i < length; i++) { cin >> input; list->add(input); } char sym; cin >> sym; int arg1; switch (sym) {…
Use the standard linked list below to answer True/False statements 9-10: 9) The “head” pointer of this list is pointing to Node 4 10) If we called “insert(5)”, the new node’s “next” pointer will point to Node 8
How to get insert method to accept two values? Right now it accepts one, and ignores the other. class Node: """ Represents a node in a linked list """ def __init__(self, data): self.data = data self.next = None class LinkedList: """ A linked list implementation of the List ADT """ def __init__(self): self._head = None def add(self, val): """ Adds a node containing val to the linked list """ self._head = self.rec_add(self._head, val) def rec_add(self, a_node, val): """ Adds a node containing val to the linked list """ if a_node is None: return Node(val) else: a_node.next = self.rec_add(a_node.next, val) return a_node def insert(self, val, pos): """ Adds a node containing val to the linked list """ self._head = self.insert_add(self._head, val, pos) def insert_add(self, a_node, val, pos): """…
Use the standard linked list below to answer True/False statements 9-12: 9) The “head” pointer of this list is pointing to Node 4 10) If we called “insert(5)”, the new node’s “next” pointer will point to Node 8 11) If we called “delete(10)”, Node 7’s “next” pointer will point to Node 8 12) If we called “search(20)”, the “head” pointer will be at Node 4 after the search function ends
Which of the following is/are not characteristic/s of a LIST? a. An ordered collection of elementsb. Preserves the insertion orderc. Duplicate values are not allowedd. Any number of null values can be storede. ListIterator can be used to traverse the List in any directionf. Doesn’t contains any legacy class