An AC voltage with an amplitude of 130 V is applied to a series combination of a 224 μF capacitor, a 114 mH inductor, and a 15.7 Ω resistor.

Calculate the power dissipated by the circuit at a frequency of 50.0 Hz.

Calculate the power factor at this frequency.

Calculate the power dissipation at a frequency of 60.0 Hz.Calculate the power factor at this frequency.

Calculate the power factor at this frequency.

• If a block of mass m at speed v collides inelastically with a block of mass M at rest, what is the final velocity of each block? What fraction of the initial energy is lost?

• Two identical circular hockey pucks of radius r traveling towards each other at the same speed v collide elastically. Their centers are separated by a vertical distance d, which is less than r. After the collision, with what angle relative to the initial path of the pucks will each one travel along?

• Explain the physics of Newton’s Cradle.

A capacitor C is connected to a battery of V volts and is fully charged.Keeping the battery connected, the spacing between the capacitor plates is reduced to half.

What happens to the potential difference between the two plates? Why?

What happens to the charge on the capacitor? Why?

What happens to the energy stored in the capacitor? Why?

Now the battery is disconnected, and then the plate spacing is restored to its original value.

What happens to the potential difference between the two plates? Why?   

What happens to the charge on the capacitor? Why?

What happens to the energy stored in the capacitor? Why?

Note: It is not enough if you say

Write a recursive algorithm in pseudo-code to compute the “power list” of a given list of integers. Assume that the List type has members:

int List.length returns the length of the list.
void List.push(T n) pushes an element n to the front of the list
T List.pop() pops an element from the front of the list.
List$$ List$$.concat(List$$ other) returns the concatenation of this list with other.

Explain in plain English the reasoning behind your algorithm.

Power Lists should be able to print ([],[1],[2], [3], [1,2], [1,3], [2,1], [2,3], [3,1],[3,2])
NOTE: [1,2] DOES NOT EQUAL [2,1]

Add the following methods to the singly list implementation below.

int size(); // Returns the number of nodes in the linked list
bool search(string query); // Returns if the query is present in the list
void add(List& l); // // Adds elements of input list to front of "this" list (the list that calls the add method)

#include <string>

#include "slist.h"

using namespace std;

Node::Node(string element) : data{element}, next{nullptr} {}

List::List() : first{nullptr} {}

// Adds to the front of the list

void List::pushFront(string element) {

Node* new_node = new Node(element);

if (first == nullptr) {// List is empty

first = new_node;

} else {

new_node->next = first;

first = new_node;

}

}

Iterator List::begin() {

Iterator iter;

iter.position = first;

iter.container = this;

return iter;

}

Iterator List::end() {

Iterator iter;

iter.position = nullptr;

iter.container = this;

return iter;

}

// Returns number of elements in the list

int List::size() {

// Q1: Your code here

}

// Returns if query is present in list (true/false)

bool List::search(string query) {

// Q2: Your code here

}

// Adds elements of input list to front of "this" list

void List::add(List& l) {

// Q3. Your code here

}

Iterator::Iterator() {

position = nullptr;

container = nullptr;

}

string Iterator::get() const {

return position->data;

}

void Iterator::next() {

position = position->next;

}

bool Iterator::equals(Iterator other) const {

return position == other.position;

}

------------------------------------------------------------------------------------Header File

/* Singly linked list */

#ifndef LIST_H

#define LIST_H

#include <string>

using namespace std;

class List;

class Iterator;

class Node

{

public:

Node(string element);

private:

string data;

Node* previous;

Node* next;

friend class List;

friend class Iterator;

};

class List

{

public:

List();

void pushFront(string element);

Iterator begin();

Iterator end();

int size();

bool search(string query);

void add(List& l);

private:

Node* first;

friend class Iterator;

};

class Iterator

{

public:

Iterator();

string get() const;

void next();

bool equals(Iterator other) const;

private:

Node* position;

List* container;

friend class List;

};

#endif

-------------------------------------------------------------------------------------------------------test file

#include <string>

#include <iostream>

#include "slist.h"

using namespace std;

int main()

{

List names1;

names1.pushFront("Alice");

names1.pushFront("Bob");

names1.pushFront("Carol");

names1.pushFront("David");

// names1 is now - David Carol Bob Alice

int numele = names1.size(); // Q1: TO BE COMPLETED

cout << "Number of elements in the list: " << numele << endl;

string query = "Eve";

bool present = names1.search(query); // Q2: TO BE COMPLETED

if (present) {

cout << query << " is present" << endl;

} else {

cout << query << " is absent" << endl;

}

List names2;

names2.pushFront("Eve");

names2.pushFront("Fred");

// names2 is now - Fred Eve

// Insert each element of input list (names1) to front of calling list (names2)

names2.add(names1); // Q3: TO BE COMPLETED

// Print extended list

// Should print - Alice Bob Carol David Fred Eve

for (Iterator pos = names2.begin(); !pos.equals(names2.end()); pos.next()) {

cout << pos.get() << " ";

}

cout << endl;

return 0;

}

Exercise: Recursive List Processing

Part 1: Write a recursive method that returns the length (an int) of the longest String in a List of Strings. For each recursive call, remove the first String from the list and return the greater of the length of the String you removed or the result of calling the method on the remainder of the list. The base case should be that the size of the list is 0. Write a driver to verify that your code is correct.

Part 2: Write a recursive method that takes a list of Strings as its only parameter and returns a list of Integers, which are the lengths of the Strings in the List. This part of this exercise will be significantly similar to the lecture example in which a list of ints is consumed, producing a list of the squares of the ints. Each recursive call should send the list, but without the first String; as the recursion unwinds, create the list of Integers and add the length of the String your stripped out in the current call to the *beginning* of the list. Write a driver to verify that your code is correct. (language is java for this)

A decrease in money supply (M) or a(n) __________ in velocity (V), will shift the aggregate demand to the left.

A. Increase

B. Decrease

Find five positive natural numbers u, v, w, x, y such that there is no subset with a sum divisible by 5

SQL DBs (structured) v noSQL DBs (unstructured)

Explain difference in details. Provide examples and use cases