1. Convert the binary data “110101” into analog waveforms using following modulation techniques: a. Two level Amplitude Shift Keying b. Two level Frequency Shift Keying c. Two level Phase Shift Keying d. Differential Phase shift keying e. Four level Amplitude Shift Keying f. Four level Phase Shift Keying g. Eight level Amplitude Shift Keying

Using Python:

The Fibonacci sequence is a famous series of numbers with the following rules:

The first number in the sequence is 0 -

The second number in the sequence is 1 -

The other numbers in the sequence are composed by adding up the two previous numbers in the sequence. We therefore have the following sequence: 1 st number: 0 2nd number: 1 3 rd number: 0 + 1 = 1 4 th number: 1+1 =2 5 th number: 2+1 = 3 6 th number: 3 + 2 = 5 7 th number: 5 + 3 = 8 and so on….

a. Write a program that takes a value n from the user and , using recursive function, display the first n Fibonacci numbers. (3pts)

b. Then, using List Comprehension, indicate which of the first n Fibonacci numbers are (2pts) : - odd numbers - multiples of 5

Example: How many Fibonacci numbers do you want ? 2 The first Fibonacci numbers are : [0, 1] From this list, the odd numbers are : [1] There is no multiples of 5 in this list How many Fibonacci numbers do you want ? 5 The first Fibonacci numbers are : [0, 1, 1, 2, 3] From this list, the odd numbers are : [1, 1, 3] There is no multiples of 5 in this list How many Fibonacci numbers do you want ? 11 The first Fibonacci numbers are: [0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55] From this list, the odd numbers are : [1, 1, 3, 5, 13, 21, 55] From this list, the multiples of 5 are : [5, 55] Note that 0 is neither an odd number nor multiple of 5

C++ Sort Vector of Strings (case-sensitive)

Without using libraries, how would I arrange a vector like this alphabetically?

vector words {"September", "test" "seven", "apple"}

The output should be: "apple, seven, September, test"

Use a recursive tree method to compute a tight asymptotic upper bound for recurrence function T(n)= 2T(n/5)+3n . then use substitution method to verify your answer.

Write the code that will produce the given "after" result from the given "before" starting point by modifying links between the nodes shown. Assume that the nodes have already been declared and initialized to match the "before" figure below. There may be more than one way to write the code, but do NOT change any existing node's data field value. Do not create any new nodes, you must just rearrange the existing nodes.  

If a variable does not appear in the "after" picture, it doesn't matter what value it has after the changes are made. If a given node object does not appear in the "After" picture, you must free its memory to avoid a memory leak.

You should not be depending on the values of the nodes, the second test case here will test a list1->a->b->c->d (some other list of the values). And it must be re-arranged in the same way.  

list1: 1 -> 2 -> 3 -> 4 /

list1: 3 -> 2 /
list2: 4 -> 1 /

Assume that you are using the following ListNode structure:

struct ListNode {

    int data;        // data stored in this node

    ListNode* next;  // a link to the next node in the list

​};

Edit here:

#pragma once
#include <iostream>
using namespace std;

struct ListNode {
int data;
ListNode* next;
};

void pointerFun(ListNode* &list1, ListNode* &list2) {
// TODO: write your code here
}

Write a program that calculates and prints the bill for a cellular telephone company. The company offers two types of services: regular and premium. Its rates vary depending on the type of service. The rates are computed as follows:

Regular service: $10.00 plus the first 50 minutes are free. Charges for over 50 minutes are $0.20 per minute.

Premium Service:        $25.00 plus

1. For calls made from 6:00 A.M. to 6:00 P.M., the first 75 minutes are free; charges for over 75 minutes are $0.10 per minute.
2. For calls made from 6:00 P.M. to 6:00 A.M., the first 100 minutes are free; charges for over 100 minutes are $0.05 per minute.

Your program should output the type of service, number of minutes the telephone service was used, and the amount due from the user.

For the premium service, the customer may be using the service during the day and night. Therefore, to calculate the bill, you must ask the user to input the number of minutes the service was used during the day and the number of minutes the service used during the night.

IN PYTHON PLEASE

If you are starting a now Online Ecommerce Business, do you think it’s important to run media on TV, Billboard and other offline media channels? Or would you only run media via Online channels?

provide step by step explanation of Man in the Middle attack. Please be very specific (What is shared, what is sent etc).

Convert the following decimal numbers into their 32-bit floating point representation (IEEE single precision). You may use a calculator to do the required multiplications, but you must show your work, not just the solution.

1. -59.75 (ANSW: 11000010011011110000000000000000)

2. 0.3 (ANSW: 00111110100110011001100110011010 (rounded)
00111110100110011001100110011001 (truncated; either answer is fine))

Please show all work

Write a program that simulates flipping a coin repeatedly until three consecutive
       heads are tossed. The program should then display the total number of times the coin was
       flipped. The user does not have to enter any information and we must use a while loop.

What is the list of commands required to upgrade a cisco IOS, ensuring that the system will use the IOS file when booting?

1. This question is related to making an object method call by reference instead of by value. Use the (CallValueTest.java). Convert the calculation method (calc(..) ) in the Test class. You need to modify the Test class attributes and constructor to support this new cal (…) method. Your program should display:

Before call obj.a 15 obj.b is 20

Before call obj.a 30 obj.b is 10

CallValueTest.java

package com.Assignment3.Q1;

class Test {
  
   void calc(int a, int b) {
       a *= 2;
       b /= 2;
       System.out.println(" in calc a = " + a + " b = " + b);
   }
  
}
public class CallByValueTest {
   public static void main (String args[]) {
       Test ob = new Test();
       int a =15, b = 20;
       System.out.println ("Before calc :a = " + a + " b " + b);
      
       ob.calc (a, b );
      
       System.out.println(" After calc: a = " + a + " b " + b);
      
   }
}

Write a C program that calculates the percent saves for a hockey goalie for 4 games and
the overall percentage of saves which is saves divided by the sum of goals plus saves.
input->process->output->repeat
The program should prompt the user to enter the number of goals and the number of
saves for each of the 4 games. The program should then calculate and display the percent
saves obtained for each game. Once processing is complete for the games, the program
will calculate the overall percent saves (total saves / sum of total saves and total goals
and display the results. Then print a friendly exit message as shown below.
Once you create, compile, link and run your program, your program should present the
following input/output dialog to the user:

Welcome to the Goalie Saves Analysis
This program will calculate the percentage of saves for
a hockey goalie for 4 games after you have entered the
games and saves for the goalie.

Enter the number of goals for game #1: 3
Enter the number of saves for game #1: 22
The percent saves for game #1 is 88.0%

Enter the number of goals for game #2: 4
Enter the number of saves for game #2: 33
The percent saves for game #2 is 89.2%

Enter the number of goals for game #3: 1
Enter the number of saves for game #3: 16
The percent saves for game #3 is 94.1%

Enter the number of goals for game #4: 0
Enter the number of saves for game #4: 22

The percent saves for game #4 is 100.0%
The percent saves for 4 games for this goalie is 92.1%

Thanks for using the Bruins Goalie Saves Analysis program.

Explain about the role of "bus" in Von Neumann architecture. Why a slow bus-speed can cause a performance-bottleneck in Von Neumann architecture?