Homework Help for Computer Science

Q4.What do you think about OOAnalysis and Design , write down 10 applications?

Differentiate between manual and computerised information system.

instructions in picture

write a program in C++ language please fast

write a program in C++ language

Use Bst Below As Example feel free to use Whatever Feels Easiest

#include "bst.h"

/**
* This function assumes that the key is allocated on the heap already
*/
node* insert(node *temp_root, char *key, double value) {
if (temp_root == NULL) {
temp_root = malloc(sizeof(node));
temp_root->key = key;
temp_root->value = value;
temp_root->left = NULL;
temp_root->right = NULL;
} else if (strcmp(key, temp_root->key) < 0) {
temp_root->left = insert(temp_root->left, key, value);
} else if (strcmp(key, temp_root->key) > 0) {
temp_root->right = insert(temp_root->right, key, value);
} else {
printf("%s already exists in the tree. No action taken\n", key);
}
return temp_root;
}

/**
* This functions searches for a key in a tree
* Returns the node that has the key or NULL otherwise
*/
node* find(node *temp_root, char *key) {
node *result = NULL;
if (temp_root != NULL) {
if (strcmp(key, temp_root->key) == 0) {
result = temp_root; // I found it
} else if (strcmp(key, temp_root->key) < 0) {
result = find(temp_root->left, key);
} else {
result = find(temp_root->right, key);
}
}
return result;
}

void print_helper(node *tree, FILE *out) {
if (tree != NULL) {
print_helper(tree->left, out);
fprintf(out, "%s\t%f\n", tree->key, tree->value);
print_helper(tree->right, out);
}
}

/**
* Print contents of a tree in order
*/
void tprint(node *tree, char *file_name) {
FILE *out = fopen(file_name, "w");
print_helper(tree, out);
fclose(out);
}

/**
* Reclaim memory on the heap
*/
void clear(node *tree) {
if (tree != NULL) {
clear(tree->left);
clear(tree->right);
free(tree->key);
free(tree);
}
}

Gutenberg:

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>

#include "bst.h"

const char *delim = "&";
// You may want to change the slash if you are working on Windows to '\'
const char slash = '/';

/**
 * Walk the bigram tree and calculate the conditional probability
 */
void print_prob_helper(node *uni_tree, node *bi_tree, FILE *out) {
 if (bi_tree != NULL) {
  // Walk the left sub-tree first
  print_prob_helper(uni_tree, bi_tree->left, out);

  // Process the current node
  char *bigram = bi_tree->key;
  double bi_count = bi_tree->value;
  // Find the delim
  int l1 = strlen(bigram);
  int index = -1;
  for (int i = 0; i < l1; i++) {
   if (bigram[i] == delim[0]) {
    index = i;
    break;
   }
  }
  if (index == -1) {
   fprintf(stderr, "Something wrong with this bigram: %s.\n", bigram);
   fprintf(stderr, "The program terminated abnormally.\n");
   exit(1);
  } else {
   // Extract the first word from the bigram
   char w1[index + 1];
   for (int j = 0; j < index; j++) {
    w1[j] = bigram[j];
   }
   w1[index] = '\0';

   // Extract the second word from the bigram
   int l2 = l1 - index - 1;
   char w2[l2 + 1];
   for (int k = 0; k < l2; k++) {
    w2[k] = bigram[k + index + 1];
   }
   w2[l2] = '\0';

   // Find count of unigram
   node *uni_node = find(uni_tree, w1);
   if (uni_node != NULL) {
    double uni_count = uni_node->value;
    // P(WORD(k)|WORD(k-1)) = p
    fprintf(out, "P(%s|%s) = %f\n", w2, w1, bi_count / uni_count);
   } else {
    fprintf(stderr,
      "Could not find a node for this unigram (extracted from %s): %s.\n",
      bigram, w1);
    fprintf(stderr, "The program terminated abnormally.\n");
    exit(1);
   }
  }
  // Walk the right sub-tree
  print_prob_helper(uni_tree, bi_tree->right, out);
 }
}

/**
 * Print contents of a tree in order
 */
void print_prob(node *uni_tree, node *bi_tree, char *file_name) {
 // Pre-conditions
 if (uni_tree == NULL) {
  
  fprintf(stderr, "Something wrong with the uni tree.\n");
  fprintf(stderr, "The program terminated abnormally.\n");
  exit(1);
 }

 if (bi_tree == NULL) {

  fprintf(stderr, "Something wrong with the bi tree.\n");
  fprintf(stderr, "The program terminated abnormally.\n");
  exit(1);
 }

 FILE *out = fopen(file_name, "w");
 print_prob_helper(uni_tree, bi_tree, out);
 fclose(out);
}

node* update_tree(node *tree, char *w) {
 node *n = find(tree, w);
 if (n == NULL) {
  tree = insert(tree, w, 1);
 } else {
  n->value = n->value + 1;
 }

 return tree;
}

node* update_uni_tree(node *tree, char *w) {
 char *mono;

 mono = strdup(w);

 return update_tree(tree, mono);
}

/**
 * Invalid bigram: ?v@??tremendous&force, w1: tremendous, w2: force
 */
node* update_bi_tree(node *tree, char *w1, char *w2) {
 char *bi;
 int l;

 l = strlen(w1) + 1 + strlen(w2) + 1;
 bi = (char*) malloc(l);

 strcpy(bi, w1);
 strcat(bi, delim);
 strcat(bi, w2);

 return update_tree(tree, bi);
}

void process_file(char *file_name) {
 // Make output file names
 int l = strlen(file_name);
 char uni_file_name[l + 5];
 char bi_file_name[l + 4];
 char cp_file_name[l + 4];

 strcpy(uni_file_name, file_name);
 strcat(uni_file_name, ".uni");

 strcpy(bi_file_name, file_name);
 strcat(bi_file_name, ".bi");

 strcpy(cp_file_name, file_name);
 strcat(cp_file_name, ".cp");

 printf("\nProcessing: %s\n", file_name);
 printf("Results will be written to:\n");
 printf("\t%s\n", uni_file_name);
 printf("\t%s\n", bi_file_name);
 printf("\t%s\n", cp_file_name);

 node *uni_tree = NULL;
 node *bi_tree = NULL;

 FILE *in = fopen(file_name, "r");
 char previous_word[100];
 char current_word[100];
 int index = 0;
 char c;
 bool can_update_bi = false;
 bool is_previous_good = false;
 while ((c = fgetc(in)) != EOF) {
  // A-Z
  if (c >= 65 && c <= 90) {
   c = c + 32; // convert to lower case
   current_word[index] = c;
   index++;
   is_previous_good = true;
  } else if (c >= 97 && c <= 122) {
   current_word[index] = c;
   index++;
   is_previous_good = true;
  } else if (is_previous_good) { // not a letter
   current_word[index] = '\0';
   uni_tree = update_uni_tree(uni_tree, current_word);
   if (can_update_bi) {
    bi_tree = update_bi_tree(bi_tree, previous_word, current_word);
   } else {
    can_update_bi = true;
   }
   // Prepare for next word
   strcpy(previous_word, current_word);
   index = 0;
   // the trees will not be updated if two non-alphabetical letters follow each other
   is_previous_good = false;
  }
 }
 // The input file is no longer needed
 fclose(in);

 // Write results
 tprint(uni_tree, uni_file_name);
 tprint(bi_tree, bi_file_name);
 print_prob(uni_tree, bi_tree, cp_file_name);

 // Reclaim memory occupied by the trees
 clear(uni_tree);
 clear(bi_tree);
}

int main(int argc, char *argv[]) {
 if (argc == 1) {
  printf("Use: %s file_name_1.txt file_name_2.txt\n", argv[0]);
 } else {
  for (int i = 1; i < argc; i++) {
   process_file(argv[i]);
  }
 }
 return 0;
}

gutenberg code below if to difficult feel free to use ANY THING THAT HELPS

http://www.gutenberg.org/ebooks/

You have been given an encrypted copy of the Final exam study guide here, but how do you decrypt and read it???

Along with the encrypted copy, some mysterious person has also given you the following documents:

helloworld.txt -- Maybe this file decrypts to say "Hello world!". Hmmm.

hints.txt -- Seems important.

In a file called pa11.py write a method called decode(inputfile,outputfile).  Decode should take two parameters - both of which are strings.  The first should be the name of an encoded file (either helloworld.txt or superdupertopsecretstudyguide.txt or yet another file that I might use to test your code).  The second should be the name of a file that you will use as an output file.  For example:

    decode("superDuperTopSecretStudyGuide.txt" , "translatedguide.txt")

Your method should read in the contents of the inputfile and, using the scheme described in the hints.txt file above, decode the hidden message, writing to the outputfile as it goes (or all at once when it is done depending on what you decide to use).

Hint: The penny math lecture is here.

Another hint: Don't forget about while loops...

Mac hint: use encoding="utf-8" in your file open functions, like this:

fin = open(input_file,"r",encoding="utf-8")

Submitting your assignment

To upload your homework for grading, submit your program to the homework submission system. It will give partial credit.
Hint: First get capital letters working, then lowercase letters, then numbers, then everything else...

Congrats on submitting the last assignment of the semester!

An embedded system is used to generate a PWM signal through an overflow interrupt signal from 
timer/counter 0. This system uses the ATmega32 microcontroller running a clock frequency of 8MHz and 
a prescaler equals to 64. The output signal has a frequency of 5 Hz at pin 1 from port B. Construct the 
C code needed to design this embedded system. Include all the required calculations

What is computer

please write complete report of 15 to 20 pages

the question has been uncluded in the picture given below.

C++ Problem: Please convert at least some of the code at the link provided from a modular API program to a user-defined class objects program. Any little bit you could do as an example would be helpful :)

Code: https://pastebin.com/G7GhvuVN

Discuss why it is important for Systems Analysts to model the subject-domain of an information system before any attempt at considering implementation issues?