Questions
what is etl?( extract tranform and load basics. what are etl manual processes? discuss stagung and...

what is etl?( extract tranform and load basics.
what are etl manual processes?
discuss stagung and configuration of ataging area.
Also explain about how mapping and operators work in OWB

In: Computer Science

Create a C structure which stores information about a book. Each book should have the following...

Create a C structure which stores information about a book. Each book should have the following data: Author (string), Title (string), Publisher (string), Year (int), ISBN (int), Genre (string), Price (float). Write a C program which creates an array of 100 of these structures, then prompts the user to enter book information to fill the array. The data entry should stop when the array is full, or when the user enters 0 for the ISBN.

In: Computer Science

Wireless Medical Sensor Network (WMSN) What a computer network is and what is the importance of...

Wireless Medical Sensor Network (WMSN)
What a computer network is and what is the importance of the computer network to this topic (Wireless Medical Sensor Network)?.  

Explain how a Wireless Medical Sensor Network (WMSN) differs from a Wireless Sensor Network (WSN). What kind of devices does it consist of? What kind of data do the devices collect? Please include information about authentication, user friendliness and user anonymity.

In: Computer Science

Write a C program that repeatedly prompts the user for input at a simple prompt (see...

Write a C program that repeatedly prompts the user for input at a simple prompt (see the sample output below for details). Your program should parse the input and provide output that describes the input specified. To best explain, here's some sample output:

ibrahim@ibrahim-latech:~$ ./prog1

$ ls -a -l -h

Line read: ls -a -l -h

Token(s):

ls

-a

-l

-h

4 token(s) read

$ ls -alh

Line read: ls -alh

Token(s):

ls

-a

-l

-h

2 token(s) read

$ clear

Line read: clear

Token(s):

clear

1 token(s) read

$ exit ibrahim@ibrahim-latech:~$

Note that the first and last lines are not part of program output (i.e., they are of the terminal session launching the program and after its exit). The program prompts the user (with a simple prompt containing just a $ followed by a space) and accepts user input until the command exit is provided, at which point it exits the program and returns to the terminal. For all other user input, it first outputs the string Line read: followed by the user input provided (on the same line). On the next line, it outputs the string Token(s):. This is followed by a list of the tokens in the input provided, each placed on a separate line and indented by a single space. For our purposes, a token is any string in the user input that is delimited by a space (i.e., basically a word). The string n token(s) read is then outputted on the next line (of course, n is replaced with the actual number of tokens read). Finally, a blank line is outputted before prompting for user input again. The process repeats until the command exit is provided. Hints: (1) An array of 256 characters for the user input should suffice (2) To get user input, fgets is your friend (3) To compare user input, strcmp is your friend (4) To tokenize user input, strtok is your friend Turn in your .c source file only that is compilable as follows (filename doesn't matter): gcc -o prog1 prog1.c Make sure to comment your source code appropriately, and to include a header providing your name.

In: Computer Science

In C++, dealing with Binary Search trees. Implement search, insert, removeLeaf, and removeNodeWithOneChild methods in BST.h....

In C++, dealing with Binary Search trees. Implement search, insert, removeLeaf, and removeNodeWithOneChild methods in BST.h. BST.h code below

#include <iostream>
#include "BSTNode.h"
using namespace std;

#ifndef BST_H_
#define BST_H_

class BST {

public:

        BSTNode *root;
        int size;

        BST() {
                root = NULL;
                size = 0;
        }

        ~BST() {
                if (root != NULL)
                        deepClean(root);
        }

        BSTNode *search(int key) { // complete this method
        }

        BSTNode *insert(int val) { // complete this method
        }

        bool remove(int val) { // complete this method
        }

private:

        void removeLeaf(BSTNode *leaf) { // complete this method
        }

        void removeNodeWithOneChild(BSTNode *node) { // complete this method
        }

        static BSTNode *findMin(BSTNode *node) {
                if (NULL == node)
                        return NULL;
                while (node->left != NULL) {
                        node = node->left;
                }
                return node;
        }

        static BSTNode *findMax(BSTNode *node) {
                if (NULL == node)
                        return NULL;
                while (node->right != NULL) {
                        node = node->right;
                }
                return node;
        }

        void print(BSTNode *node) {
                if (NULL != node) {
                        node->toString();
                        cout << " ";
                        print(node->left);
                        print(node->right);
                }
        }

        static int getHeight(BSTNode *node) {
                if (node == NULL)
                        return 0;
                else
                        return 1 + max(getHeight(node->left), getHeight(node->right));
        }
    
    static void deepClean(BSTNode *node) {
        if (node->left != NULL)
            deepClean(node->left);
        if (node->right != NULL)
            deepClean(node->right);
        delete node;
    }

public:

        int getTreeHeight() {
                return getHeight(root);
        }

        void print() {
                print(root);
        }

        int getSize() {
                return size;
        }
};

#endif

This is the expected output

****************** Test BST Correctness ******************
Inserting the following numbers: [11, 12, 15, 17, 12, 19, 4, 5, 11, 19, 20, 32, 77, 65, 66, 88, 99, 10, 8, 19,
15, 66, 11, 19]
*** BST Structure (after insertion) ***
<11, null> <4, 11> <5, 4> <10, 5> <8, 10> <12, 11> <15, 12> <17, 15> <19, 17> <20, 19> <32, 20> <77,
32> <65, 77> <66, 65> <88, 77> <99, 88>
Size of BST: 16
*** Searching BST ***
Found: [19, 12, 4, 5, 19, 20, 32, 99, 8, 12]
Did not find: [29, 3, 27, 34, 45, 37, 25, 25, 24, 16]
*** Deleting BST ***
Deleted: [12, 15, 5, 17, 19, 4, 20, 32, 99, 10, 8]
Did not find: [16, 5, 19, 17, 19, 39, 19, 15, 21]
*** BST Structure (after deletion) ***
<11, null> <77, 11> <65, 77> <66, 65> <88, 77>
Size of BST: 5
****************** Clean up ******************
Size of hash table: 0
Size of BST: 0

In: Computer Science

Suppose you have the following list of integers to sort: [1, 5, 4, 2, 18, 19]...

Suppose you have the following list of integers to sort:

[1, 5, 4, 2, 18, 19]

which list represents the partially sorted list after three complete passes of insertion sort?

1 2 4 5 18 19

1 4 5 2 18 19

1 4 2 5 18 19

None of the above

In: Computer Science

How does S/4HANAempower digital supply chain? Provide some examples on how this system is benefiting organisations...

How does S/4HANAempower digital supply chain? Provide some examples on how this system is benefiting organisations to compete?

In: Computer Science

Apply the different components of systems thinking on the zillow business scenario. In other words, the...

Apply the different components of systems thinking on the zillow business scenario. In other words, the different components of Zillow as system, the input, the output, and the different feedbacks.

In: Computer Science

C++ please You have been challenged with a menu program before, but this one is a...

C++ please

You have been challenged with a menu program before, but this one is a little more complex. You will use loops and you will use an output file for a receipt.

Using class notes, write an algorithm for a program which uses a loop system to allow customers to select items for purchase from a list on the screen. (List at least 8 items to choose from on your menu. You choose the items to be listed.).

When the user is finished choosing items, display the amount due and then accept the customer's payment. If the customer pays enough, display change due on the screen.

If the customer does not pay enough, use another loop system to get additional payment from the customer until the total due has been paid. When finished, have an output file that lists all items purchased along with prices, the subtotal, the tax amount, the grand total and total paid.

In: Computer Science

Written informative speech on artificial intelligence. Introduction only: attention getter, background, credibility, behavioral objective and thesis...

Written informative speech on artificial intelligence.
Introduction only:
attention getter, background, credibility, behavioral objective and thesis statement.
Cite sources if any are used.

In: Computer Science

Write a python code using a continuous random variable and using uniform distribution to output the...

Write a python code using a continuous random variable and using uniform distribution to output the expected weight of students in a class.

In: Computer Science

Construct a finite-state machine, using combinational logic, which reads in one bit at a time. When...

  1. Construct a finite-state machine, using combinational logic, which reads in one bit at a time. When a nibble (4 bits) are all zeros the output is set to one else the output is zero. The machine continues to read in bits and the output remains a one if zeros are read in. If it reads a one the output is a zero.
    1. What are the machine states?
    2. What are the inputs?
    3. What are the outputs?
    4. Draw state table.
    5. Draw the state diagram.
    6. Define the circuit for the next state and the output with the Boolean equations.
    7. Explain if you built a Mealy or Moore machine.

In: Computer Science

This is JAVA PROGRAMMING Sort the contents of the two files in ascending order and combine...

This is JAVA PROGRAMMING

Sort the contents of the two files in ascending order and combine them into one new file (words.txt).
When comparing string order, you must use the compareTo method and make an exception.The source code below is a code that only combines files. Use the comparedTo method to sort the contents of the two files in ascending order.(ex. if(str1.compareTo(str2)<0) {})

<file1.txt>

at first  
castle  
consider  
considerable  
enlighten  
explain  
explanation  
female  

<file2.txt>

consideration  
considering that  
education  
educational  
endow  
inherit  

<code>

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Lab7_1 {

   public static void main(String[] args) {
       // TODO Auto-generated method stub
      
       fileMerge("file1.txt","file2.txt","words.txt");
   }
   private static void fileMerge(String filename1, String filename2, String filename3) {
       // TODO Auto-generated method stub
       Scanner str1=null;
       Scanner str2=null;
       PrintWriter output=null;
      
       try {
           str1 = new Scanner(new File(filename1));
               str2 = new Scanner(new File(filename2));
               output = new PrintWriter(new File(filename3));
              
               fileWriter(str1,output);
               fileWriter(str2,output);
              
          
      
       } catch (FileNotFoundException e) {
           // TODO Auto-generated catch block
           System.err.println(e.getMessage());
           // e.printStackTrace();
      
       } finally {
           if (str1 != null)
               str1.close();
           if (str2 != null)
               str2.close();
           if (output != null)
               output.close();

       }
   }
       private static void fileWriter(Scanner str1, PrintWriter output) {
           // TODO Auto-generated method stub
           while(str1.hasNextLine()) {
               String str = str1.nextLine();
               output.println(str);
       }

   }

          
   }

In: Computer Science

A new implementation of Merge Sort uses a cutoff variable to use insertion sort for small...

A new implementation of Merge Sort uses a cutoff variable to use insertion sort for small number of items to be merged (Merging single elements is costly).

1. Give the pseudo code for the merge sort algorithm with a cutoff variable set to 4.

2. Show the trace for top-down merge sort using the following array of characters with a cutoff variable set to 4.

E A S Y M E R G E S O R T W I T H I N S E R T I O N

In: Computer Science

Program a math quiz on Python Specifications: - The program should ask the user a question...

Program a math quiz on Python

Specifications:

- The program should ask the user a question and allow the student to enter the answer. If the answer is correct, a message of congratulations should be displayed. If the answer is incorrect, a message showing the correct answer should be displayed.

- the program should use three functions, one function to generate addition questions, one for subtraction questions, and one for multiplication questions.

- the program should store the questions and answers in a dictionary or list.

- the program should keep a count of the number of correct and incorrect responses.

In: Computer Science