Week 8
Page ! 1 of 34
!
CISC-102
Fall 2017
Week 8
Playing cards.
Some of the following examples make use of the standard
52 deck of playing cards as shown below.
There are 4 suits (clubs, spades, hear
Week 7
page ! 1 of 14
!
CISC-102
Winter 2017
Week 7
We will see two different, yet similar, proofs that there are
infinitely many prime numbers. One proof would surely
suffice. However, seeing two dif
Week 9
Page ! 1 of 10
!
CISC-102
Fall 2017
Week 9
Playing cards.
Some of the following examples make use of the standard
52 deck of playing cards as shown below.
There are 4 suits (clubs, spades, hear
Introduction to AI
1. What is Artificial Intelligence?
Artificial Intelligence involves using methods based on the intelligent behavior of humans and
other animals to solve complex problems.
2. What i
Introduction to AI
1. What is Artificial Intelligence?
2. What is the difference between Strong AI and Weak AI?
3. What is the difference between Strong AI Methods and Week AI Methods?
4. Do AI resear
Name
Degrees
Base Type
Integer
PowerSwitch
String
Type Dictionary
Units
cfw_OFF, HEAT,
COOL
Mode Class Dictionary
Initial Mode
Off
Name
ScreenController
Modes
Off, Standby,
SettingTemp
OutputControlle
CISC 220 Course Notes:
Linux and C
David Alex Lamb
July, 2014
External Technical Report
ISSN-0836-0227-2014-621
School of Computing
Queen's University
Kingston, Ontario, Canada K7L 3N6
Version 1.1
Doc
*Answers are in green*
CISC-221 Computer Architecture Lab
Lab 3 Machine-Level Representation of Programs
January 2017
Instructor: Dave Dove ( [email protected] ).
1
Introduction
The focus of this lab
*Answers are in green*
CISC-221 Computer Architecture Lab
Data Representation Lab 2:
Maskin g , Arithmetic Operations, Expression Evaluation
January, 2017
Instructor: Dave Dove ( [email protected] ).
*Answers are in green*
CISC-221 Computer Architecture Lab
Data Representation Lab 1: Manipulating Bits
January, 2017
Instructor: Dave Dove ( [email protected] ).
Teaching Assistants:
1
Introduction
I
CISC 235 Assignment 3
By: Sam Strike 10152402 14sas5
I confirm that this submission is my own work and is consistent with the Queen's regulations on
Academic Integrity.
Results
Experiment 1 I expected
CISC 235 - Assignment 1
By: Sam Strike 10152402 14sas5
Some Results from my code experimentation(output):
When k = 22
n = 1000
Time for A = 0.00248656596664
Time for B = 0.00255983074756
When k = 24
n
CISC 235 Assignment 3 Results
By: Sam Strike 10152402 14sas5
I confirm that this submission is my own work and is consistent with the Queen's regulations on
Academic Integrity.
From my results I can c
Super smash bros for Wii u is the 4th installment in the smash bros franchise that is a fighting
game in which players get to choose some of their favorite Nintendo characters or characters
from other
"
COMPLETED VERSION OF THE LINKED LIST MODULE
CISC 121, fall 2014
M. Lamb
"
def insertValue(linkedList, index, value):
"
Adds a new element to a list.
Parameters:
value: the value for the new element
Quiz #1
CISC 220, Fall 2015
*Please do NOT turn over this page and begin the quiz
until you are given permission*
STUDENT NUMBER:
Write your student number clearly and legibly in the boxes above and o
CISC 462 Computability and Complexity
Problem Set 3
Solutions
Queens University, Winter 2017
1. Given a DFA A with n states, we want to determine whether L(A) = . We will
use the solution to Question
CISC 462 Computability and Complexity
Problem Set 3
Queens University, Winter 2017
Available February 21, 2017.
Due in class 4:30 PM, March 7, 2017.
1. Show that ALLDF A P.
2. Show that if P = NP, the
CISC 462 Computability and Complexity
Problem Set 5
Queens University, Winter 2017
Available March 21, 2017.
Due in class 4:30 PM, April 4, 2017.
1. What is the relationship between the following pair
CISC 462 Computability and Complexity
Problem Set 2
Queens University, Winter 2017
Available January 24, 2017.
Due in class 4:30 PM, February 7, 2017.
1. Consider the following languages. For each, sh
CISC 462 Computability and Complexity
Problem Set 2
Solutions
Queens University, Winter 2017
1. (a) Rices theorem cannot be used to show that A is decidable since the property
involves the operation o
CISC 462 Computability and Complexity
Problem Set 4
Solutions
Queens University, Winter 2017
1. First, we observe that an NFA with n states has an equivalent DFA with at most 2n
states. Obviously, we
CISC 462 Computability and Complexity
Problem Set 4
Queens University, Winter 2017
Available March 7, 2017.
Due in class 4:30 PM, March 21, 2017.
1. Let EQN F A be the language
EQN F A = cfw_A, B | A,
CISC 462 Computability and Complexity
Problem Set 1
Queens University, Winter 2017
Available January 10, 2017.
Due in class 4:30 PM, January 24, 2017.
1. Consider the following Turing machine, which d