Rhetorical Strategies and Fallacies Worksheet PHL/320 Version 3 1 University of Phoenix Material Rhetorical Strategies and Fallacies Worksheet The following are some common rhetorical strategies: · Innuendo: a leading suggestion · Stereotype: generalized statements relating to a group of people · Loaded questions: questions based on unjustified assumptions · Hyperbole:an extreme exaggeration Identify the rhetorical strategy in each of the following statements. 1. I did not say the meat was tough. I said I did not see the horse that is usually outside (W. C. Fields). _________________ 2. Have you stopped beating your wife? _____________ 3. The Maserati is the best car in the world! _________________ 4. All men love football; all women love the ballet. ______________ The following are some common rhetorical fallacies: · Slippery slope: If A happens, then B–Z will follow. Therefore, to prevent B–Z from happening, do not allow A to occur. · Hasty generalization: rushing to form a conclusion based on assumptions; not based on clear evidence · Post hoc ergo propter hoc: If A occurs after B, then B caused A. · Either/or: looking at a situation from only two sides, or oversimplifying the situation · Ad hominem: attacking the person rather than attacking the argument · Red herring or smoke screen: introducing an unrelated topic as a diversionary tactic Identify the rhetorical fallacy in each of the following statements. 1. We can either stop using plastic, or destroy the Earth ______________ 2. I ate tuna for lunch and now I do not feel well, so the tuna made me ill. ___________ 3. If you enjoy a social drink, it could lead to you becoming an alcoholic, so you probably should never drink. __________ 4. Even though this is the first week of class, I can tell this is going to be a very easy course. ______________ 5. We know that smoking can affect your health, but how else will tobacco farmers earn a living? ______________ 6. As the candidate for mayor, he has some good ideas, but we know that all politicians are dishonest.___________ COP 3530 Data Structures Summer 2015 ---- Assignment 6---Hashing Total Points: 100 points Due Date: 7/18/2014 at 10:00PM NO LATE ASSIGNMENTS WILL BE ACCEPTED! Name the program for this assignment "hashing.cpp." The purpose of this program is to give you experience implementing a hash table, handling collisions, and using hashing with a linear function. Hashing is a method that enables access to table items (for adding, deleting, searching and so forth) in time that is relatively constant and independent of the items in the table. When we searched lists, implemented using linked lists and arrays, the time required to determine if an item was in the list, in the worst case, was proportional to the number of items in the list. Hashing uses a hash function to determine the location of an item.  A problem with hashing occurs when the hash function returns the same value for two or ...

1. Rhetorical Strategies and Fallacies Worksheet
PHL/320 Version 3
1
University of Phoenix Material
Rhetorical Strategies and Fallacies Worksheet
The following are some common rhetorical strategies:
· Innuendo: a leading suggestion
· Stereotype: generalized statements relating to a group of
people
· Loaded questions: questions based on unjustified assumptions
· Hyperbole:an extreme exaggeration
Identify the rhetorical strategy in each of the following
statements.
1. I did not say the meat was tough. I said I did not see the
horse that is usually outside (W. C. Fields).
_________________
2. Have you stopped beating your wife? _____________
3. The Maserati is the best car in the world!
_________________
4. All men love football; all women love the ballet.
______________
The following are some common rhetorical fallacies:
· Slippery slope: If A happens, then B–Z will follow. Therefore,
to prevent B–Z from happening, do not allow A to occur.

2. · Hasty generalization: rushing to form a conclusion based on
assumptions; not based on clear evidence
· Post hoc ergo propter hoc: If A occurs after B, then B caused
A.
· Either/or: looking at a situation from only two sides, or
oversimplifying the situation
· Ad hominem: attacking the person rather than attacking the
argument
· Red herring or smoke screen: introducing an unrelated topic as
a diversionary tactic
Identify the rhetorical fallacy in each of the following
statements.
1. We can either stop using plastic, or destroy the Earth
______________
2. I ate tuna for lunch and now I do not feel well, so the tuna
made me ill. ___________
3. If you enjoy a social drink, it could lead to you becoming an
alcoholic, so you probably should never drink. __________
4. Even though this is the first week of class, I can tell this is
going to be a very easy course. ______________
5. We know that smoking can affect your health, but how else
will tobacco farmers earn a living? ______________
6. As the candidate for mayor, he has some good ideas, but we
know that all politicians are dishonest.___________
COP 3530 Data Structures Summer 2015 ---- Assignment 6---
Hashing
Total Points: 100 points

3. Due Date: 7/18/2014 at 10:00PM
NO LATE ASSIGNMENTS WILL BE ACCEPTED!
Name the program for this assignment "hashing.cpp." The
purpose of this program is to give you experience implementing
a hash table, handling collisions, and using hashing with a
linear function. Hashing is a method that enables access to table
items (for adding, deleting, searching and so forth) in time that
is relatively constant and independent of the items in the table.
When we searched lists, implemented using linked lists and
arrays, the time required to determine if an item was in the list,
in the worst case, was proportional to the number of items in the
list. Hashing uses a hash function to determine the location of
an item. A problem with hashing occurs when the hash function
returns the same value for two or more items (a hash function is
a function that maps the search key of a table item into a
location that will contain that item). The situation is referred to
as a collision. A collision occurs when a hash function maps
two or more distinct search keys into the same location.
In this assignment you will write a program that maintains the
names (first and last names), addresses and phone numbers in an
address book by using a hash table. Use the data file called
"client_address_data.txt" to help you create the hash table.
Also, you should be able to enter, delete, modify (names,
addresses and phone numbers), or search the data stored in hash
table based on the name. A client’s first and last names should
be the search key. Once the program is finish execution, the
information should be ordered by last name and first name and
printed to a file called "sorted_client_address_bk.txt."
Design a class to represent the hash table. Call this class
"Client_Address_Book". "Client_Address_Book" contains all
the information for each client (first name, last name, address,
and phone number). Use a linear function (eg. h(last
name)=[ascii char value of first letter of lastname]-64) to
determine the location of a key in the hash table. Each cell in

4. the hash table will be a sorted doubly linked list. For example,
you will have a doubly linked list for last names that begin with
'A', there will be one for last names that begin with 'B', and so
forth. The linked lists will also be used to handle collisions
(clients with the same name) within "Client_Address_Book".
Each linked list will be maintained in alphabetical order.
When the clients address book is printed, the list of all the
clients’ information stored in the hash table should be printed in
order according to the last and first names. The information
should be printed out in the following order: last name, first
name, address, and phone number. Also, include column titiles.
Declare and implement the following
classes: Client_Node,Client_Info_List,
and Client_Address_Book. Store the declaration and implement
files in one file callhashing.cpp. You should submit hashing.cpp
to blackboard before due date and time.
Good Luck....
Consider the following skeleton as a hint to help you:
class Client_Node //node in the doubly linked list
{
public:
//data: last name, first name, address, and phone number
Client_Node *prev, *next //pointer information
};
class Clients_Info_List //doubly linked list
{

5. public:
Clients_Info_List();
~Clients_Info_List();
//member functions: Insert, Remove, Search, Update, Print and
so forth.
private:
// Client_Node *front ---state information
};
class Client_Address_Book
{
public:
Client_Address_Book();
~Client_Address_Book();
//member function like your hash function. Also include
other functions like Insert,
//Remove, Search, Print, and so forth.
// Hint: Remember that the insert, remove and search
function for
//Clients_Address_Book will use Client_Info_List’s insert,
remove and search
// respectively.
//
private:
Clients_Info_List hash_table[27] //or 26 or whatever you
like
};

6. COP 3530 Data Structures Summer 2015
----
Assignment 6
--
-
Hashing
Total Points: 100 points
Due Date:
7
/18/2014 at 10:00PM
NO LATE ASSIGNMENTS WILL BE ACCEPTED!
Name the program for this assignment "
hashing.cpp
." The purpose of this
program is to give you experience implementing a hash table,
handling collisions,
and using hashing with a linear function. Hashing is a method
that enables access
to table items (for adding, deleting, searching and so forth) in
time
that is relatively
constant and independent of the items in the table. When we
searched lists,

7. implemented using linked lists and arrays, the time required to
determine if an item
was in the list, in the worst case, was proportional to the
number of items
in the
list. Hashing uses a hash function to determine the location of
an item.
A problem
with hashing occurs when the hash function returns the same
value for two or more
items (a hash function is a function that maps the search key of
a table item into
a
location that will contain that item).
The situation is referred to as a collision. A
collision occurs when a hash function maps two or more distinct
search keys into
the same location.
In this assignment you will write a program that maintains the
nam
es (first and last
names), addresses and phone numbers in an address book by
using a
hash table
.
Use the data file called "
client_address_data.txt
" to help you create the hash

8. table.
Also, you should be able to enter, delete, modify (names,
addresses and
phone numbers), or search the data stored in hash table based on
the name. A
client’s first and last names should be the search key. Once the
program is finish
execution, the information should be ordered by last name and
first name and
printed to a file c
alled "
sorted_client_address_bk.txt
."
COP 3530 Data Structures Summer 2015 ---- Assignment 6--
-Hashing
Total Points: 100 points
Due Date: 7/18/2014 at 10:00PM
NO LATE ASSIGNMENTS WILL BE ACCEPTED!
Name the program for this assignment "hashing.cpp." The
purpose of this
program is to give you experience implementing a hash table,
handling collisions,
and using hashing with a linear function. Hashing is a method
that enables access
to table items (for adding, deleting, searching and so forth) in
time that is relatively
constant and independent of the items in the table. When we
searched lists,
implemented using linked lists and arrays, the time required to

9. determine if an item
was in the list, in the worst case, was proportional to the
number of items in the
list. Hashing uses a hash function to determine the location of
an item. A problem
with hashing occurs when the hash function returns the same
value for two or more
items (a hash function is a function that maps the search key of
a table item into a
location that will contain that item). The situation is referred to
as a collision. A
collision occurs when a hash function maps two or more distinct
search keys into
the same location.
In this assignment you will write a program that maintains the
names (first and last
names), addresses and phone numbers in an address book by
using a hash table.
Use the data file called "client_address_data.txt" to help you
create the hash
table. Also, you should be able to enter, delete, modify (names,
addresses and
phone numbers), or search the data stored in hash table based on
the name. A
client’s first and last names should be the search key. Once the
program is finish
execution, the information should be ordered by last name and
first name and
printed to a file called "sorted_client_address_bk.txt."
client_address_data.txt
Ramos Rafael 220 SW 3rd Street 447-4533
Enirata Jorge 6200 Miami Avenue 446-6666

10. Sexy Lady 400 Street East 555-1212
Smith John 444 SW 2nd Ave 420-6868
Winner Mary 3669 W Citrus Trace Drive 434-1717
Valdez Jorge 11885 SW 13th Court 476-8899
Valdes Abel 3353 Davie Blvd 587-1043
Smith Mary 444 SW 2nd Ave 420-6808
Edn Susan 8881 SW 49th Street 746-6998
Harper Fred 6815 NW 12th Street 572-3326
Tempero Douglas 436 NW 81st Street 462-1478
Utnik Richard 182 SW 51st Street 797-9905
Utich Michael 412 6th Street 556-8200
Lehrer Paul 9660 Sunrise Drive 485-6000
Leger George 811 SW 31st Street 390-7915
Harper Mary 6815 NW 12th Street 572-3326
Quass Claude North Ocean Drive 564-0674
Quinn Medicinewoman 4729 SW 42 Street 316-4455
Harper Jean 6815 NW 12th Street 572-3326
Harper James 6815 NW 12th Street 572-3326

11. Harper Babara 6815 NW 12th Street 572-3326
Edmundson Donald 321 Sunset Drive 745-6666
Ramos Miryam Post Gardens Way 393-6627
Cleary Kay 6250 SW 6th St 584-1023
Cleary Adele 3548 Envioronment Blvd 677-1056
MacDonald John 5601 Dixie Hwy 772-6712
Ilter Mehmet 2173 Bay Court 349-3128
Ilter Kermit 2163 Bay Court 349-3228
Ilter Maha 2163 Bay Court 349-3328
Macci Vicky 3535 Oceana Drive 446-8663
Tann Kyle 3027 N. Oakland Forest Drive 583-3362
Fox Smart 5600 Brian Street East 731-8685
Tanguay Albert 4806 NW 36st Street 731-7686
Tanguay Andre 555 University Drive 741-9728
Bullard Mark 770 SE 2nd Ave 393-7029
Bulldog Fred 555 W. Ocean Drive 737-0824
Bundle Joy 8352 Trent Ct 479-0349
Wickes Helen 1831 NE 38th Street 561-1228

12. Open Wide 5676 Street Avenue 543-0009
Wickham Fred 353 SW 18th Avenue 763-5252
Dunn Carrey 554 St. James Street 663-8900
Dandy Bread 1500 Publix Drive 555-1212
Nay John Eastlake Way 385-9286
Niwn Ni 6626 20th Street 888-0010
Young David 2121 NE 11th Ave 333-8483
Able Scott 9 NE 5th Court 456-0009
Abby Mary 3562 8th Street 492-4545
Young Andy 111 Cow Pen Road 448-8586
Young Celcil 6324 NW 29th Avenue 792-6327
Yau Kouassi 7801 NW 44th Ct 473-5456
Zangwill Andy 5990 Sunrise Lakes Blvd 746-9427
Jackson Jessie 2620 NW 21st Street 760-7511
Jackson Joanna 220 SW 20st Street 761-7211
Jackson Missy 20000 NW 21st Street 760-7111
Zangrille Juilus 2261 NE 67th Street 938-8919
Xyplex Networks 555 Seabreeze Blvd 713-8156

13. Xu Xinyun 4195 SW 67th Avenue 467-6556
Good Boy 1000 Heaven Street 111-1111
Kaiser Moe 1905 NW 46st Street 862-1156
Pretty Girl 19 Stay Home Avenue 234-5409
Tom Cat 111 Fish Avenue 333-3333
Kaiser Ronald 1905 NW 46st Street 422-5151
Kaiser Richard 1905 NW 46st Street 434-1106
cop3530_summer_2014_Program6_Hash_doubliy_linked.htm
COP 3530 Data Structures Summer 2015 ----
Assignment 6---Hashing
Total Points: 100 points
Due Date: 7/18/2014 at 10:00PM
NO LATE ASSIGNMENTS WILL BE
ACCEPTED!
Name the program for this assignment "hashing.cpp." The
purpose of this
program is to give you experience implementing a hash table,
handling
collisions, and using hashing with a linear function. Hashing is
a method that
enables access to table items (for adding, deleting, searching
and so forth) in
time that is relatively constant and independent of the items in
the table.
When we searched lists, implemented using linked lists and
arrays, the time
required to determine if an item was in the list, in the worst
case, was

14. proportional to the number of items in the list. Hashing uses a
hash function
to determine the location of an item. A problem with hashing
occurs when
the hash function returns the same value for two or more items
(a hash function
is a function that maps the search key of a table item into a
location that
will contain that item). The situation is referred to as a
collision. A
collision occurs when a hash function maps two or more distinct
search keys
into the same location.
In this assignment you will write a program
that maintains the names (first and last names), addresses and
phone numbers in
an address book by using a hash table.
Use the data file called "client_address_data.txt" to help you
create
the hash table. Also, you should be able to enter, delete,
modify (names,
addresses and phone numbers), or search the data stored in hash
table based on
the name. A client’s first and last names should be the search
key. Once the
program is finish execution, the information should be ordered
by last name and
first name and printed to a file called
"sorted_client_address_bk.txt."
Design a class to represent the hash table.
Call this class "Client_Address_Book".
"Client_Address_Book" contains all the
information for each client (first name, last name, address, and
phone
number). Use a linear function (eg. h(last name)=[ascii char
value of

15. first letter of lastname]-64) to determine the
location of a key in the hash table. Each cell in the hash table
will be
a sorted doubly linked list. For example, you will have a
doubly linked
list for last names that begin with 'A', there will be one for last
names that
begin with 'B', and so forth. The linked lists will also be used
to
handle collisions (clients with the same name) within
"Client_Address_Book".
Each linked list will be maintained in alphabetical order.
When the clients address book is printed, the
list of all the clients’ information stored in the hash table
should be printed
in order according to the last and first names.
The information should be printed out in the following order:
last name,
first name, address, and phone number.
Also, include column titiles.
Declare and implement the following classes: Client_Node,
Client_Info_List,
and Client_Address_Book. Store
the declaration and implement files in one file call hashing.cpp.
You should submit hashing.cpp to blackboard before due
date and time.
Good Luck....
Consider the following skeleton as a hint to help you:

16. class Client_Node //node in the doubly linked list
{
public:
//data: last name, first
name, address, and phone number
Client_Node *prev,
*next //pointer information
};
class Clients_Info_List
//doubly linked list
{
public:
Clients_Info_List();
~Clients_Info_List();
//member functions: Insert, Remove,
Search, Update, Print and so forth.
private:
// Client_Node *front ---state information
};
class Client_Address_Book
{
public:
Client_Address_Book();
~Client_Address_Book();

17. //member function like your hash function. Also include
other functions like Insert,
//Remove, Search, Print, and so
forth.
// Hint: Remember that the insert, remove and search
function for
//Clients_Address_Book
will use Client_Info_List’s insert, remove and search
// respectively.
//
private:
Clients_Info_List hash_table[27]
//or 26 or whatever you like
};
hashing.cpphashing.cpp#include<iostream>
#include<fstream>
#include<string.h>
#include<cstdlib>
#include<iomanip>
#include<ctype.h>
#define TABLE_SIZE 26
#define DEFAULT_TABLE_SIZE 26
usingnamespace std;
classClient_Node
{
public:
char firstName[50];
char lastName[50];

18. char address[100];
longint phoneNumber;
Client_Node*prev;
Client_Node*next;
Client_Node(char*,char*,char*,longint);
~Client_Node();
void displayNode();
Client_Node* createNewNode(char*,char*,char*,longint);
};
classClients_Info_List
{
public:
Client_Node*front;
Client_Node*end;
int size;
Client_Node* find(char*key);
Clients_Info_List();
~Clients_Info_List();
void insert(Client_Node*);
void remove(Client_Node*);
voidUpdate(Client_Node*);
voidDelete(Client_Node**);
bool isEmpty();
void printList();
};
classClient_Address_Book:publicClients_Info_List
{
public:
int table_size;
Clients_Info_List** hash_table;
int size;
Client_Address_Book(int T = DEFAULT_TABLE_SIZE);

19. ~Client_Address_Book();//destructor
Client_Node* find(char*lname,char*fname);
int hashString(char*);
void createEntry();
void insertClient(Client_Node*);
void updateRecord();
void deleteRecord();
int getSize();
void displayAddressBook();
void searchRecord();
};
Client_Address_Book::Client_Address_Book(int T)
{
size=0;
table_size = T;
hash_table =newClients_Info_List*[table_size];
for(int i=0;i<table_size;i++)
{
hash_table[i]=newClients_Info_List();
}
}
Client_Address_Book::~Client_Address_Book(){}
intClient_Address_Book::hashString(char*key)
{
char ch = toupper(key[0]);
return(ch-
65);//returns index in hash_table where list is present for that al
phabet
}
Client_Node*Client_Address_Book:: find(char*lname,char*fna
me)
{

20. int bucket = hashString(lname);
if(hash_table[bucket]== NULL)
return NULL;
Client_Node*temp = hash_table[bucket]->front;
while(temp)
{
if(strcmp(lname,temp->lastName)==0)
{
if(strcmp(fname,temp->firstName)==0)
return temp;
}
if(temp->next)
temp = temp->next;
else
break;
}
return NULL;
}
voidClient_Address_Book::insertClient(Client_Node*node)
{
int indx = hashString(node->lastName);
hash_table[indx]->insert(node);
size++;
}
intClient_Address_Book::getSize()
{
return size;
}
voidClient_Address_Book::displayAddressBook()
{

21. int i=0;
for(i=0;i<table_size;i++)
{
if(hash_table[i]!= NULL)
{
hash_table[i]->printList();
}
}
}
voidClient_Address_Book::createEntry()
{
char fname[20],lname[20],addr[50];
longint phno;
cout<<"ntEnter Last name : ";
cin>>lname;
cout<<"tEnter First name : ";
cin>>fname;
cout<<"tEnter Address : ";
cin>>addr;
cout<<"tEnter phone number : ";
cin>>phno;
Client_Node* temp =newClient_Node(fname,lname,addr,phno);
insertClient(temp);
cout<<"ttRecord Successfully created!!n";
}
voidClient_Address_Book::updateRecord()
{
char lname[20],fname[20];
cout<<"nttUpdating Record....";
cout<<"nttEnter last name :";
cin>>lname;
cout<<"ttEnter first name :";

22. cin>>fname;
Client_Node*temp = find(lname,fname);
if(temp)
{
cout<<"nttEnter New Last Name :";
cin>>temp->lastName;
cout<<"ttEnter New First Name :";
cin>>temp->firstName;
cout<<"ttEnter New Address :";
cin>>temp->address;
cout<<"ttEnter New Phone Number :";
cin>>temp->phoneNumber;
cout<<"Record Updated Successfully!!n";
}
else
cout<<"nSorry,record not found";
}
voidClient_Address_Book::deleteRecord()
{
char lname[20],fname[20];
cout<<"nttEnter Last Name :";
cin>>lname;
cout<<"ttEnter First Name :";
cin>>fname;
Client_Node*temp = find(lname,fname);
int indx = hashString(lname);
if(temp)
{
char c;
temp->displayNode();
cout<<"nttDelete Record....?(y/n)";
cin>>c;
if(c =='y'|| c =='Y')
{

23. hash_table[indx]->Delete(&temp);
if(hash_table[indx]->isEmpty())
hash_table[indx]= NULL;
size--;
}
}
}
voidClient_Address_Book::searchRecord()
{
char lname[20],fname[20];
cout<<"nttEnter Last Name :";
cin>>lname;
cout<<"ttEnter First Name :";
cin>>fname;
Client_Node*temp = find(lname,fname);
if(temp)
temp->displayNode();
else
cout<<"nNode not found!!";
}
Client_Node::Client_Node(char*fname,char*lname,char*addr,lo
ngint phno)
{
strcpy(firstName,fname);
strcpy(lastName,lname);
strcpy(address,addr);
phoneNumber = phno;
prev = NULL;
next = NULL;
}
Client_Node::~Client_Node(){}

24. Client_Node*Client_Node::createNewNode(char*fname,char*ln
ame,char*addr,longint phno)
{
Client_Node* temp =newClient_Node(fname,lname,addr,phno);
strcpy(temp->firstName,fname);
strcpy(temp->lastName,lname);
strcpy(temp->address,addr);
temp->phoneNumber = phno;
temp->prev = NULL;
temp->next = NULL;
return temp;
}
voidClient_Node::displayNode()
{
cout<<"ntLast Name : "<<lastName;
cout<<"ntFirst Name : "<<firstName;