Build the DOCTIME Knowledge Engine Purpose

Build the DOCTIME Knowledge Engine Purpose. Build the DOCTIME Knowledge Engine Purpose.

Build the DOCTIME Knowledge Engine Purpose: The purpose of this project is to reinforce the knowledge you have gained so far about databases, specifically developing a database from business rules.
InstructionRequired Items: 1. The Business Rules from the Produce an ER Diagram assignment 2. ERD you constructed as result of the Produce an ER Diagram assignment 3. The 3NF Dependency Diagram you produced as part of the Produce a 3NF Dependency Diagram assignmeNT 4. The final result of the ETL: SQL Statements exercise Project deliverables: 1. Use the Steps below to build the database in MariaDB database. 2. You will produce 5 PDF Documents (Use the SAVE AS or EXPORT command to save as PDF) a. The Submission in BB should appear similarly as follows -SUBMISSIONBusinessRules.pdf ERD.pdf 3NF Dependency Diagram.pdf SQL Documentation.pdf Database Construction Screen Captures.pdf 3. The submission in BB should look similar to the example below…
[supanova_question]

Computer Science Question

Search the Internet and list the purpose for each of the following network utilities as well as an example command line. The first one is done for you.

Application
Purpose
Command Line Examples
TRACERT:
To trace the network route from a computer, or other piece hardware, to a certain destination.
TRACERT www.yahoo.com
PING

ARP

NETSTAT

NBTSTAT

IPCONFIG

IFCONFIG

WINIPCFG

NSLOOKUP

done
Seen
7 mins ago[supanova_question]

Lab 4 – Binary Search Trees

Build the DOCTIME Knowledge Engine Purpose professor-instructed-us-to-write-a-paper-about-a-social-program/”>Computer Science Assignment Help Follow all code styling and submission instructions as outlined for previous labs.
Declare and implement a BSTNode ADT with a data attribute and two pointer attributes, one for the left child and the other for the right child. Implement the usual getters/setters for these attributes.
Declare and implement a BST as a link-based ADT whose data will be Dollar objects – the data will be inserted based on the actual money value of your Dollar objects as a combination of the whole value and fractional value attributes.
For the BST, implement the four traversal methods as well as methods for the usual search, insert, delete, print, count, isEmpty, empty operations and any other needed.
Your pgm will use the following 20 Dollar objects to be created in the exact order in your main to seed the tree:$57.12
$23.44
$87.43
$68.99
$111.22
$44.55
$77.77
$18.36
$543.21
$20.21
$345.67
$36.18
$48.48
$101.00
$11.00
$21.00
$51.00
$1.00
$251.00
$151.00

Also, create an output file to write program output as specified in one or more instructions below.
After seeding the data, perform your traversal operations in the specific sequence of breadth-first, in-order, pre-order, post-order, ensuring that output is written out to both screen and file concurrently.
Then provide interactivity for the user to add/search/delete nodes from the console after the data has been seeded into the application.
Perform adequate input data validation when reading data from the user into the tree – if any data item is invalid, ignore the data item and continue to next item but print a message to output (both screen and same output file) to indicate which data items were ignored.
Also, provide the user the option to print output of traversals or exit the program. Once the user selects the option to print data or exits the program, the data in the BST should be printed out to both screen and output file in all four traversal methods in the specific sequence of breadth-first, in-order, pre-order, post-order.
For submission – upload your BST, Dollar/USD and main code files, screenshots of console window and your output files only.
Any other questions or clarifications – ask on the forum first.
Grading:
25 pts – EXE created from your code works from command line.
45 pts – BSTNode and BST ADT
30 pts – Your main
15 pts extra credit – demonstrate use of your Lab 4 queue without any modifications for the tree traversals

done
Seen
4 mins ago[supanova_question]

Webots

Accept only if u know python
Please download webots https://cyberbotics.com/P
C.1 Task 1 – Motion Estimation Motion estimation requires keeping track of robot pose based exclusively on PositionSensors and IMU readings. Use the world from Figure 2(a). Implement two robot controllers: (1) “lab3_task1_basic.py”, without noise. (2) “lab3_task1_noise.py”, with noise. (Extra Credit)
C.2 Task 2 – Measurement Estimation to Unique Landmarks Measurement estimation will be based on robot sensors and camera to recognize and measure distance to the colored cylinders. Use the world from Figure 2(b). You are required to use Triangulation or Trilateration methods to determine robot pose. Note that trilateration methods use relative distance to landmarks, while triangulation methods use both distances and angles relative to landmarks. Implement two robot controllers: (1) “lab3_task2_basic.py”, without noise. (2) “lab3_task2_noise.py”, with noise. (Extra Credit)
[supanova_question]

https://anyessayhelp.com/ Follow all code styling and submission instructions as outlined for previous labs.
Declare and implement a BSTNode ADT with a data attribute and two pointer attributes, one for the left child and the other for the right child. Implement the usual getters/setters for these attributes.
Declare and implement a BST as a link-based ADT whose data will be Dollar objects – the data will be inserted based on the actual money value of your Dollar objects as a combination of the whole value and fractional value attributes.
For the BST, implement the four traversal methods as well as methods for the usual search, insert, delete, print, count, isEmpty, empty operations and any other needed.
Your pgm will use the following 20 Dollar objects to be created in the exact order in your main to seed the tree:$57.12
$23.44
$87.43
$68.99
$111.22
$44.55
$77.77
$18.36
$543.21
$20.21
$345.67
$36.18
$48.48
$101.00
$11.00
$21.00
$51.00
$1.00
$251.00
$151.00

Also, create an output file to write program output as specified in one or more instructions below.
After seeding the data, perform your traversal operations in the specific sequence of breadth-first, in-order, pre-order, post-order, ensuring that output is written out to both screen and file concurrently.
Then provide interactivity for the user to add/search/delete nodes from the console after the data has been seeded into the application.
Perform adequate input data validation when reading data from the user into the tree – if any data item is invalid, ignore the data item and continue to next item but print a message to output (both screen and same output file) to indicate which data items were ignored.
Also, provide the user the option to print output of traversals or exit the program. Once the user selects the option to print data or exits the program, the data in the BST should be printed out to both screen and output file in all four traversal methods in the specific sequence of breadth-first, in-order, pre-order, post-order.
For submission – upload your BST, Dollar/USD and main code files, screenshots of console window and your output files only.
Any other questions or clarifications – ask on the forum first.
Grading:
25 pts – EXE created from your code works from command line.
45 pts – BSTNode and BST ADT
30 pts – Your main
15 pts extra credit – demonstrate use of your Lab 4 queue without any modifications for the tree traversals

done
Seen
4 mins ago[supanova_question]