def selection_mean(numbs): for i in range(len (numbs)-1): # find the index of smalllest reamining element index_smalllest=i for j in range (i + 1, len(numbs)): if numbs [j]< numbs [index_smalllest): index_smalllest = j # swap number [i] and numbs [index_smalllest] temp = numbs [i] numbs [i] = numbs [index_smalllest] numbs [index_smalllest] = temp numbs [10, 2, 78, 45, 32, 7, 11] print('UNSORTED: ', end=¹) for num in numbs: print (str(num), end= ' ') print() # Fix me # complete the code to sort only even numbers in ascending order #input = [10, 2, 78, 45, 32, 7, 11] #output [2, 10, 32, 78]

def selection_mean(numbs): for i in range(len (numbs)-1): # find the index of smalllest reamining element index_smalllest=i for j in range (i + 1, len(numbs)): if numbs [j]< numbs [index_smalllest): index_smalllest = j # swap number [i] and numbs [index_smalllest] temp = numbs [i] numbs [i] = numbs [index_smalllest] numbs [index_smalllest] = temp numbs [10, 2, 78, 45, 32, 7, 11] print('UNSORTED: ', end=¹) for num in numbs: print (str(num), end= ' ') print() # Fix me # complete the code to sort only even numbers in ascending order #input = [10, 2, 78, 45, 32, 7, 11] #output [2, 10, 32, 78]

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

Hef sharks_minnows (minnows, sharks): shark_count = 0 minnow_count = len (minnows) for i in range(minnow_count): curr_shark_height = minnows [i] if curr_shark_height is not None: minnows [i] = None for j in range (i + 1, minnow_count): if minnows [j] == curr_shark_height: minnows [j] = None curr_shark_height -- 1 shark_count += 1 return shark_count <= sharks The provided code is imperfect, in that it sometimes returns True when it should return False, and sometimes returns False when it should return True. (a) Provide an example of a function call where the provided code will correctly return True (i.e. a True Positive) (b) Provide an example of a function call where the provided code will correctly return False (i.e. a True Negative) (c) Provide an example of a function call where the provided code will incorrectly return True (i.e. a False Positive) (d) Provide an example of a function call where the provided code will incorrectly return False (i.e. a False Negative)
T/F Suffix array can be created in O(nlogn) time.
def strPattern(mystr):lenght = len(mystr)mystr1 = ""for i in range(lenght - 1):mystr1 = mystr1 + mystr[i].upper() + str(i + 1)if lenght == 0:return mystr1return mystr1 + mystr[-1].upper()s = input("enter a word: ")print(strPattern(s)) s = input("enter a word: ") EOFError: EOF when reading a line HOW CAN I FIX THIS QUESTION?
ion C Lons Employee -id: int -name String - dob : Date -staff : ArrayList +setid(int): void +getld() : int +setName(String): void +setDob(Date) : void +getDob(): Date +addStaff(Employee) : void +getStaff() : ArrayList
typedef struct node_t node_t; struct node_t { }; int32_t value; node_t* next; node_t* insert (node_t* list, int32_t v, int32_t* flag); 3) As you may have noticed from MT1, Howie is lazy. He wants you to write the interface for the following implementation of function copy_to_linked_list. He really appreciates your help! /* copy_to_linked_list int32_t copy_to_linked_list (int32_t a[], int32_t size, node_t** list_p) { int32_t flag, i; for (i = 0; i < size; ++i) { *list_p = insert (*list_p, a[i], &flag); if (-1== flag) return -1; } return 0;
#include <iostream> using namespace std; int BinSearch(int arr[],int beg, int end, int key){ if(beg > end){ return -1; } else{ int mid = beg + (end - beg) / 2; if(arr[mid] == key){ return mid; } else if(key < arr[mid]){ return BinSearch(arr,beg,mid-1,key); } else{ return BinSearch(arr,mid+1,end,key); } }} int main(){ int arr[] = {1,2,3,4,5,6,7,8}; int n = sizeof(arr)/sizeof(arr[0]); int key; cout << "Enter the key to be searched: " << endl; cin >> key; int res = BinSearch(arr,0,n-1,key); (res == -1) ? cout << "Element is not present in array" : cout << "Element is present at index " << res; return 0;}Q: Remove Function in above algorithm
In C, using malloc to allocate memory for a linked list uses which memory allocation scheme? Heap allocation Static allocation
Direct mapping is set associative mapping with a set size of _____ . 1 2 N / 2 N
Q: Convert this to sorted array #include<iostream> #include"Student.cpp" class StudentList { private: struct ListNode { Student astudent; ListNode *next; }; ListNode *head; public: StudentList(); ~StudentList(); int IsEmpty(); void Add(Student newstudent); void Remove(); void DisplayList(); }; StudentList::StudentList() { head=NULL; }; StudentList::~StudentList() { cout <<"\nDestructing the objects..\n"; while(IsEmpty()!=0) Remove(); if(IsEmpty()==0) cout <<"All students have been deleted from a list\n"; }; int StudentList::IsEmpty() { if(head==NULL) return 0; else return 1; }; void StudentList::Add(Student newstudent) { ListNode *newPtr=new ListNode; if(newPtr==NULL) cout <<"Cannot allocate memory"; else { newPtr->astudent=newstudent; newPtr->next=head; head=newPtr; } }; void StudentList::Remove() { if(IsEmpty()==0) cout <<"List empty on remove"; else { ListNode *temp=head;…
Count dominators def count_dominators(items): An element of items is said to be a dominator if every element to its right (not just the one element that is immediately to its right) is strictly smaller than it. By this definition, the last item of the list is automatically a dominator. This function should count how many elements in items are dominators, and return that count. For example, dominators of [42, 7, 12, 9, 13, 5] would be the elements 42, 13 and 5. Before starting to write code for this function, you should consult the parable of "Shlemiel the painter" and think how this seemingly silly tale from a simpler time relates to today's computational problems performed on lists, strings and other sequences. This problem will be the first of many that you will encounter during and after this course to illustrate the important principle of using only one loop to achieve in a tiny fraction of time the same end result that Shlemiel achieves with two nested loops. Your workload…
remove(x) This operation removes element from the set.If element does not exist, it raises a KeyError.The .remove(x) operation returns None. Example >>> s = set([1, 2, 3, 4, 5, 6, 7, 8, 9]) >>> s.remove(5) >>> print s set([1, 2, 3, 4, 6, 7, 8, 9]) >>> print s.remove(4) None >>> print s set([1, 2, 3, 6, 7, 8, 9]) >>> s.remove(0) KeyError: 0 .discard(x) This operation also removes element from the set.If element does not exist, it does not raise a KeyError.The .discard(x) operation returns None. Example >>> s = set([1, 2, 3, 4, 5, 6, 7, 8, 9]) >>> s.discard(5) >>> print s set([1, 2, 3, 4, 6, 7, 8, 9]) >>> print s.discard(4) None >>> print s set([1, 2, 3, 6, 7, 8, 9]) >>> s.discard(0) >>> print s set([1, 2, 3, 6, 7, 8, 9]) .pop() This operation removes and return an arbitrary element from the set.If there are no elements to remove, it raises a KeyError. Example…
В.width; } { t = B.type; w = { T.type = C.type; T.width = C.width; } T → B C В > int { B.type = integer; B.width 4; } В — foat { B.type = float; B.width = 8; } { C.type = t; C.width = w; } C - [ num] C1 = array(num. value, C1.type); { C.type C.width = num. value x C1. width; }