CS241 Lecture Notes - Lecture 10: Insert Key, Locality Of Reference, Out-Of-Core Algorithm

20 views2 pages

bingus13

12 Apr 2022

School

University of Waterloo

Department

Computer Science

Course

CS241

Professor

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

Insert key at leaf node returned by search. Middle key in node becomes parent, its children are the left and right half of the node. Goal: reduce the number of blocks read from external memory into main memory. Also: reduce the number of blocks loaded that do not contain desired data. In internal memory: all operations have runtime o(logn) All empty subtrees are at the same level. Inorder successor of key k is the smallest key in the subtree immediately to the right of k. Number of kvp = number of empty subtrees + 1. Each node has between a and b subtrees, unless it is the root. If node has k subtrees, then it stores k-1 kvps. Type of (a, b)-tree tailored to external memory model. B-tree of order b is a (ceiling(b/2), b)-tree. Search, insert, and delete require visiting o(h) nodes.

Related Questions

8. Write a class called WordSet representing a set of String objects which can contain an arbitrary number of strings, limited only by the memory available to the Java Virtual Machine. A set is a collection of elements, however, unlike a list, a set cannot contain duplicate elements. Therefore, as its name implies, a WordSet object cannot contain duplicate Strings that is, if one attempts to da String to a Wordset, and the wordset already contains an element which is equal to this string, the attempt will fail and the state of the Wordset will not change. All String comparisons performed in the methods defined in the Wordset class are done in a Case SENSITIVE manner. Note that in the method descriptions below, the phrase "this Wordset" means "the Wordset on which the method in question is called." Your Wordset class MUST provide the following INSTANCE methods • A constructor, which takes no parameters and initializes the new Wordset ohject so that it contains no elements • A method called add(), which takes as its only parameter a string and returns a value of type boolean. If this Wordset already contains a string which is equal to the parameter string, or the parameter String is null, then the state of this Wordset does not change and the method return false; otherwise, the parameter String is added to this Wordset. and the method returns true. • A method called remove().which takes as its only parameter a string and returns a value of type boolean. If this wordSet contains a string which is equal to the parameter String this string is removed from the WordSet and the method returns true. On the other hand, if the string parameter is null or this Wordset does not contain a string which is equal to the parameter string, then the state of this wordset does not change, and the method return false. • A method called get.size(), which takes no parameters and returns the number of strings currently stored in this Wordset. This method MUST NOT change the state of this Wordset. • A method called isMember(). which takes as its only parameter a string and retumsa value of type boolean which is true if this wordset contains the parameter String false otherwise. If the parameter String is null, this method also return false. This method MUST NOT change the state of this wordset. • A method called computebirrerence().which takes as its only parameter a Wordset and returns a new Wordset representing the difference between this wordset and the parameter Wordset: in other words, the WordSet returned by this method contains all the strings that are in this wordset, but not in the parameter Wordset. If the parameter Wordset contains all the elements of this WordSet or this WordSet contains no elements, then this method returns a new Wordset containing no elements. Finally, if the parameter Wordset is null or contains ne strings, then this method returns a new wordset which contains all the elements of this wordset. This method MUST NOT change the state of this wordset or the parameter Wordset. • A method called tostring , which takes the parameters and turns a string which is the textual representation of this wordset. This textual representation consists of the concatena tion of the following clements - The String - The text representation of each clement in the WordSet; cach pair of adjacent clements is separated by the String", but this String MUST NOT appear before the first clement or after the last element - The String") The order in which the elements of this Wordset appear in the textual representation generated by the tostring() method does not matter. If the WordSet contains to Brings, then the textual representation returned by this method is ". Note that you MUST respect proper encapsulation practices that is, the attributes and methods of your class MUST be declared using the proper visibility modifier NINT Um an array list (of string) to keep track of the string stored in a wordt ob joot Is there a method defined in the Array loist class which determines whether in clementis already wored in an array ist, and which will do a case-sensitive comparison when liked on an Arraylint of strings? See the pages 24-26 of this examination for information about potentially useful methods defined by the ArrayList class WRITE YOUR Wordset CLASS IN THE SPACE BELOW:

A financial institution has several that currently employ the following controls:

* The severs follow a monthly patching cycle.

* All changes must go through a change management process.

* Developers and systems administrators must log into a jumpbox to access the servers hosting the data using two-factor authentication.

* The servers are on an isolated VLAN and cannot be directly accessed from the internal production network.

An outage recently occurred and lasted several days due to an upgrade that circumvented the approval process. Once the security team discovered an unauthorized patch was installed, they were able to resume operations within an hour. Which of the following should the security administrator recommend to reduce the time to resolution if a similar incident occurs in the future?

Options:

A Require more than one approver for all change management requests.
B Implement file integrity monitoring with automated alerts on the servers.
C Disable automatic patch update capabilities on the servers
D Enhanced audit logging on the jump servers and ship the logs to the SIEM.

aminul2005

B or D ?

A financial institution has several that currently employ the following controls:

* The severs follow a monthly patching cycle.

* All changes must go through a change management process.

* Developers and systems administrators must log into a jumpbox to access the servers hosting the data using two-factor authentication.

* The servers are on an isolated VLAN and cannot be directly accessed from the internal production network.

Options:

aminul2005

CS241 Lecture Notes - Lecture 10: Insert Key, Locality Of Reference, Out-Of-Core Algorithm

Document Summary

Get access

Related Documents

01:198:112 Lecture 12: 3/5 - BSTs and AVLs

COMS W3134 Chapter Notes - Chapter 4: Binary Search Algorithm, Hash Table, Rotations In 4-Dimensional Euclidean Space

CS240 Lecture Notes - Binary Search Tree, Avl Tree, Radix Sort

Related Questions