A)
Realized
Adjusted Basis
Section 1231 gain relized
$180,000
$138,000 (200,000-62,000)
$42,000
No gain is captured as income
B)
Wallpaper is considered to be inventory.
$60,000 ordinary loss
C)
Old Truck
Realized
Adjusted Basis
Casualty Gain
Recapture
Se
Com S 311 2016 Thu
Q1) True or False
Last Name_ First Name _
These are questions about the RAM model of computation (as in sec 2.1)
1) Multiplication takes same time as addition: _
2) Cache Memory access does not take any time: _
3) RAM memory access take
goth s_2,l_l,5umgigzq12 _ EXAM-l—_ Paxelﬂm
M:
Ql.l. (5 points) True or False
F; a) 4» is can)
F_ b) n! is can)
—r_c) log; n is 0003. n)
(T: d) log; n is 000g, n)
Fw c) if ﬁn) is {200311) it is also .0 (n) weaker
5; 0 best problem complexity can sometimes
Com S 311 Summer WK2-05
Name_
(a) Given array elements 7, 11, 12, 13, 11, 14, 15, 20, 21, 19, 18, 17, 14, 16, 15
Draw this in tree form (assuming it is a correct min-heap).
(b) Is this really
Com S 311 Summer 2016 wk1-01
Q1) Syllabus
Last Name_ First Name _
a) How many exams will be there? _
b) How many graded programming assignments? _
Q2) Find a solution to Independent Set problem for the following graph.
1
2
3
4
6
5
7
Q3) Given the followin
Com S 311 Summer wk2-04
Last Name_ First Name _
Q1) What are hash tables? What is the main goal of using a hash table?
Q2) What is a collision (when using hash tables)?
Q3) Explaining the "Chaining" approach to handling collisions in hash tables.
Q4) Desc
Com S 311 —Summer—WK2-05 Name
(a) Given array elements 7, 11, 12, 13, 11, 14, 15, 20, 21, 19, 18, 17, 14, 16, 15
Draw this in tree form (assuming it is a correct min-heag). ?
(b) Is this really a min-heap? Either way — explain!
V63 0) 0“ “06m; EDMMCAR “
11/18/2016
app.efcientlearning.com/pv4/cpaexcel/publish?format=lesson&cache_sig=21_reg2013.tax.lk.knd_publish_lesson
LikeKindExchangesandInvoluntaryConversions
TaxFormforthisLesson:Form8824
I. LikeKindExchanges
A. OverviewThedeferralprovisionfordirect(lik
11/18/2016
app.efcientlearning.com/pv4/cpaexcel/publish?format=lesson&cache_sig=21_reg2013.tax.oth.nnrecog_publish_lesson
OtherNonrecognitionTransactions
TaxFormsforthisLesson:Form6252
I. OtherLossDisallowances
A. OverviewTherearethreecommonprovisionsthat
Halting problem
From Wikipedia, the free encyclopedia
Jump to: navigation, search
In computability theory, the halting problem is the problem of determining, from a description of an
arbitrary computer program and an input, whether the program will finish
dont know
know a bit
1
2
OK
3
good! master
4
COMS 311 TOPICS
5 BIG-OH
Basics
Definitions of big-oh, omega, theta c>0, n>=0 (7 things)
big-omega
big-theta
Intuition/understanding (graph)
tighter and weaker bounds
how to prove O/Omega/Thet
Com S 311 Summer 2014
EXAM-4
Department of Computer Science
Algorithm Design CS 311
Summer 2014
Page 1 of 10 pages
Your Name_
Your Student #_
EXAM- 4
This is a closed book, closed notes, no calculat
Presidential Debate E.C.
10/16/12
The Presidential debate between Mitt Romney and Barrack Obama covered eleven
specific topics. The topics were asked in the form of questions from audience members. The
following topics were covered: jobs(unemployment rate
Com S 311 Summer 2013
EXAM-2
Page 1 of 8 pages
Th
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
EXAM- 2
https:/www.coursehero.com/file/11723004/Exam-2-Sample-Solution/
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
Th
ht
Com S 311 Summer 2013
EXAM-3
Page 1 of 8 pages
Th
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
EXAM- 3
https:/www.coursehero.com/file/11723007/Exam-3-Sample-Solution-1/
sh is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
Th
sh
Th
is
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
Scanned by CamScanner
https:/www.coursehero.com/file/11723009/Exam-3-sample-solution/
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
is
sh
Th
https:/www.coursehero.com/file/1172
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
is
sh
Th
https:/www.coursehero.com/file/11723020/Exam-4-sample-solution/
Scanned by CamScanner
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
is
sh
Th
https:/www.coursehero.com/file/1172
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
is
sh
Th
https:/www.coursehero.com/file/11723006/2014-Exam1-solution2/
ar stu
ed d
vi y re
aC s
o
ou urc
rs e
eH w
er as
o.
co
m
is
sh
Th
https:/www.coursehero.com/file/11723006/2014-Exam1-solution
Classes of Problems
Simanta Mitra
com s 311
Simanta Mitra
PROBLEM COMPLEXITY
VS
ALGORITHM COMPLEXITY
com s 311
Simanta Mitra
Problem Complexity
Problem complexity is PROVEN complexity of the
problem itself
Xiang Huang
Solutions for Big-O Section
C OM S 311, June 19, 2016
Before we go into the details of the solutions below, we briefly review how to prove some function f (n)is
O(g(n),(g(n),(g(n).
f (n) = O(g(n). This means g(n) is greater than f (n). We quo
Com S 311 Summer 2014
EXAM-7
Department of Computer Science
Algorithm Design CS 311
Summer 2014
Page 1 of 9 pages
Your Name_
Your Student #_
EXAM- 7
This is a closed book, closed notes, no calculato
Com S 311 Summer 2014
EXAM-5
Department of Computer Science
Algorithm Design CS 311
Summer 2014
Page 1 of 7 pages
Your Name_
Your Student #_
EXAM- 5
This is a closed book, closed notes, no calculato
Com S 311 Summer 2014
EXAM-6
Department of Computer Science
Algorithm Design CS 311
Summer 2014
Page 1 of 6 pages
Your Name_
Your Student #_
EXAM- 6
This is a closed book, closed notes, no calculato