1. No class on Wed Oct 27. Pizza party on Nov 03, 2010.
2. Please let me know, what kind of pizza would you like.
If you are fine with vegetarian pizza, you do not have to reply.
3. We will have the pizza party in my lab BYENG 407.
My students (Ph.D., Masters, and Undergraduate researchers) can tell you what they are working on, and you can ask them difficult questions. Bonus marks for stumping them with genuine difficult questions.
-Aviral
Sunday, October 24, 2010
Wednesday, October 20, 2010
20 Oct, 2010: Lecture 9
More on time management, cheating, plagiarism, and academic integrity
Guest Lecture by Mandy Aroz.
Guest Lecture by Mandy Aroz.
Wednesday, October 13, 2010
Homework from the class of Oct 13, 2010
Answer the following questions on your blog.
• Give one example of cheating?
• What is an XE?
• Give an example of a sanction besides an XE?
• Where is the AIP file kept?
• When is the AIP file destroyed?
• Give one reason why a student should not cheat?
Please post your answers by Sunday, Oct 17, 2010.
• Give one example of cheating?
• What is an XE?
• Give an example of a sanction besides an XE?
• Where is the AIP file kept?
• When is the AIP file destroyed?
• Give one reason why a student should not cheat?
Please post your answers by Sunday, Oct 17, 2010.
Wednesday, October 6, 2010
06 Oct, 2010: Lecture 7
Discussed computer architecture trends, and why multi-cores? What do multi-cores mean?
Wednesday, September 29, 2010
Wednesday, September 22, 2010
22 Sept, 2010: Lecture 5
A few tools to navigate through your curriculum, and monitor your progress towards your degree.
1. Presentation on DARS
2. Major Maps
3. Major Search
Although these look like zip files, they are .pptx.
Just open them with Powerpoint.
-Aviral
1. Presentation on DARS
2. Major Maps
3. Major Search
Although these look like zip files, they are .pptx.
Just open them with Powerpoint.
-Aviral
Homework from the class of Sept 22, 2010
Write a routine to test if a given list of numbers is sorted
IsSorted(n, a1, a2, …, an)
{
// return YES if a1, … an is sorted
// else return NO
}
Your algorithm should work for any 'n', any set of numbers, a1, ...., an, and for any permutation of numbers a1,... an, AND should finish in finite time.
Then answer the following questions
–Why will your solution work for any n?
–Why will your solution work for any given set of numbers?
–Why will your solution work for any permutation of those numbers?
–Why will your solution finish in finite time?
Deadline: Sunday, Sept 26, 2010.
IsSorted(n, a1, a2, …, an)
{
// return YES if a1, … an is sorted
// else return NO
}
Your algorithm should work for any 'n', any set of numbers, a1, ...., an, and for any permutation of numbers a1,... an, AND should finish in finite time.
Then answer the following questions
–Why will your solution work for any n?
–Why will your solution work for any given set of numbers?
–Why will your solution work for any permutation of those numbers?
–Why will your solution finish in finite time?
Deadline: Sunday, Sept 26, 2010.
Thursday, September 16, 2010
Homework from the class of Sept 15, 2010
As discussed in the class, here is the homework for this week.
Write an algorithm to search for a number in a list of given numbers.
Write an algorithm to search for a number in a list of given numbers.
–Should take a list of numbers a1, a2, ... an, and a key "k" as input.
–Should return "YES" if the k is the same as one of a1, ... an, else return "NO".
Also write a proof of correctness and proof of finiteness
Deadline: Sunday, Sept 19, 2010.
Monday, September 13, 2010
Comments on homework 2.
Hi all,
I had a look at HW2. Most of you have done it.
I have written some comments. See if you need to do something more.
-Aviral
I had a look at HW2. Most of you have done it.
I have written some comments. See if you need to do something more.
-Aviral
Thursday, September 9, 2010
Homework from the class of Sept 08, 2010
I need you to formally write an algorithm to compute the max. of a given list of numbers.
Also I want you to argue that your algorithm
1. will terminate
2. will produce the correct results for any set of numbers.
Please finish this by Sunday, I will check the blog posts very early on the morning of Monday, and assign grades.
See you in the class, next Wednesday.
- Aviral
Also I want you to argue that your algorithm
1. will terminate
2. will produce the correct results for any set of numbers.
Please finish this by Sunday, I will check the blog posts very early on the morning of Monday, and assign grades.
See you in the class, next Wednesday.
- Aviral
Wednesday, September 8, 2010
08 Sept, 2010: Lecture 3
Lecture Slides http://www.public.asu.edu/~ashriva6/teaching/ASU101/Lect03.ppt
Links to student resources:
Engineering Career Center: http://engineering.asu.edu/career/
Engineering Tutoring Center: http://engineering.asu.edu/students/tutoringcenter
Engineering Scholarships: http://engineering.asu.edu/scholarships
-Aviral
Links to student resources:
Engineering Career Center: http://engineering.asu.edu/career/
Engineering Tutoring Center: http://engineering.asu.edu/students/tutoringcenter
Engineering Scholarships: http://engineering.asu.edu/scholarships
-Aviral
Friday, September 3, 2010
Homework from the class of Sept 01, 2010
We discussed the sorting problem in the class.
Essentially the problem is that given a set of numbers as input, create an arrangement (permutation) of the numbers, so that each number is greater than the one before (to the right of) it.
You need to design an algorithm to do this. You can assume that there are "n" numbers.
Any algorithm is fine. Now remember, what is an algorithm: - a sequence of mechanized steps, that will get the job done for
i) any input, and in
ii) in finite time.
You can simply write down the steps in english, or write it in any programming language of your choice. I would prefer the later.
Please do this in about half a page (definitely less than a page) on your blog.
I will check the blog posts very early on the morning of Wednesday, and give scores.
See you in the class, next Wednesday.
- Aviral
Essentially the problem is that given a set of numbers as input, create an arrangement (permutation) of the numbers, so that each number is greater than the one before (to the right of) it.
You need to design an algorithm to do this. You can assume that there are "n" numbers.
Any algorithm is fine. Now remember, what is an algorithm: - a sequence of mechanized steps, that will get the job done for
i) any input, and in
ii) in finite time.
You can simply write down the steps in english, or write it in any programming language of your choice. I would prefer the later.
Please do this in about half a page (definitely less than a page) on your blog.
I will check the blog posts very early on the morning of Wednesday, and give scores.
See you in the class, next Wednesday.
- Aviral
Wednesday, September 1, 2010
01 Sept, 2010: Lecture 2
Lecture Slides http://www.public.asu.edu/~ashriva6/teaching/ASU101/Lect02.ppt.
Why is ASU a New Amerrican University
http://www.public.asu.edu/~ashriva6/teaching/ASU101/ASU101_NewAmU2.ppt
Why is ASU a New Amerrican University
http://www.public.asu.edu/~ashriva6/teaching/ASU101/ASU101_NewAmU2.ppt
Student blogs
In the order in which I recieved them:
Michael Green: http://asufratboy.blogspot.com/
David Taylor: http://davidjamestaylor.blogspot.com/
Jordan Anderson: http://talkingstickpwnage.blogspot.com/
Austin Rowley: http://austinrowley.blogspot.com/
Justin Lai: http://the-justin-lai.blogspot.com/
Samuel Colvin: http://samasu101.blogspot.com/
Sam Fink: http://finkatasu.blogspot.com/
Jeremy Booker: http://jeremybookerasu101.blogspot.com/
Christopher Conant: http://fall2010-asu101-chrisconant.blogspot.com/
Chibum Kim: http://cbk1990.blogspot.com/
Christopher Norzagaray: http://norzman5.blogspot.com/
Robin Yau: http://ryau-robin.blogspot.com/
Austin Waller: http://awallerasu101.blogspot.com/
Matthew Berk: http://matt-berk.blogspot.com/
Nicolas Moccia: http://nmoccia-asu101.blogspot.com/
Gabe Kishi: http://gabekishi.blogspot.com/
Andrew Wilcox: http://andreww-asu101.blogspot.com/
James Marovich http://jmarovi-asu101.blogspot.com/
Miles P. Barnes http://asutoolate.blogspot.com/
Michael Green: http://asufratboy.blogspot.com/
David Taylor: http://davidjamestaylor.blogspot.com/
Jordan Anderson: http://talkingstickpwnage.blogspot.com/
Austin Rowley: http://austinrowley.blogspot.com/
Justin Lai: http://the-justin-lai.blogspot.com/
Samuel Colvin: http://samasu101.blogspot.com/
Sam Fink: http://finkatasu.blogspot.com/
Jeremy Booker: http://jeremybookerasu101.blogspot.com/
Christopher Conant: http://fall2010-asu101-chrisconant.blogspot.com/
Chibum Kim: http://cbk1990.blogspot.com/
Christopher Norzagaray: http://norzman5.blogspot.com/
Robin Yau: http://ryau-robin.blogspot.com/
Austin Waller: http://awallerasu101.blogspot.com/
Matthew Berk: http://matt-berk.blogspot.com/
Nicolas Moccia: http://nmoccia-asu101.blogspot.com/
Gabe Kishi: http://gabekishi.blogspot.com/
Andrew Wilcox: http://andreww-asu101.blogspot.com/
James Marovich http://jmarovi-asu101.blogspot.com/
Miles P. Barnes http://asutoolate.blogspot.com/
Wednesday, August 25, 2010
Course Syllabus
Course Number ASU 101 (FSE/CSE)
Course Title The ASU Experience/Computer Science and Engineering
Semester Hours 1 Meeting Lecture 50 minutes once per week for 10 weeks and 5 hours of internet coursework
Catalog Description:
ASU 101 (FSE/CSE) is a required, one-credit course offered in sections capped at 19 and designed to introduce students to Computer Systems Engineering and Computer Science as a profession, provide students with the necessary study skills to be successful in engineering and to familiarize students with the opportunities available to them in the engineering school.
Prerequisites:
First year students at ASU in Computer Science and Engineering
Textbook(s) and other materials:
Lecture slides, reading materials, and handouts.
Course learning outcomes:
The course learning outcomes are as follows:
1. Students will be able to identify what it means to be a successful student at ASU and ways in which ASU supports their success
a. Students will be able to provide a broad definition of what it means to be a successful student
b. Students will be able to identify the central role that planning and time management play in student success
c. Students will be able to identify the resources in the Fulton School as well in ASU for student success
2. Students will be able to provide a definition of academic dishonesty and the consequences of that at ASU
a. Students will be able to define the conditions that constitute plagiarism and copyright violations.
b. Students will be able to identify the ramifications of academic dishonesty at ASU
3. Students will recognize computer science and computer systems engineering ideas behind various every day applications that they may have encountered such as cell phones, automobiles, search engines, computer games, blogs and computer viruses.
4. Students will be able to enumerate computer science and computer systems engineering concepts that they will learn in the four year BS (CS) and BSE (CSE) programs.
a. Students will have exposure to the various sub-disciplines in CS and CSE program.
b. Students will be able to select courses that are part of the particular sub-discipline.
Course assessment plan:
Assignments: 75%
Attendance: 25%
Grading plan:
100% - 90% A
89% - 80% B
79% - 70% C
69% - 60% D
59% and below E
Course Title The ASU Experience/Computer Science and Engineering
Semester Hours 1 Meeting Lecture 50 minutes once per week for 10 weeks and 5 hours of internet coursework
Catalog Description:
ASU 101 (FSE/CSE) is a required, one-credit course offered in sections capped at 19 and designed to introduce students to Computer Systems Engineering and Computer Science as a profession, provide students with the necessary study skills to be successful in engineering and to familiarize students with the opportunities available to them in the engineering school.
Prerequisites:
First year students at ASU in Computer Science and Engineering
Textbook(s) and other materials:
Lecture slides, reading materials, and handouts.
Course learning outcomes:
The course learning outcomes are as follows:
1. Students will be able to identify what it means to be a successful student at ASU and ways in which ASU supports their success
a. Students will be able to provide a broad definition of what it means to be a successful student
b. Students will be able to identify the central role that planning and time management play in student success
c. Students will be able to identify the resources in the Fulton School as well in ASU for student success
2. Students will be able to provide a definition of academic dishonesty and the consequences of that at ASU
a. Students will be able to define the conditions that constitute plagiarism and copyright violations.
b. Students will be able to identify the ramifications of academic dishonesty at ASU
3. Students will recognize computer science and computer systems engineering ideas behind various every day applications that they may have encountered such as cell phones, automobiles, search engines, computer games, blogs and computer viruses.
4. Students will be able to enumerate computer science and computer systems engineering concepts that they will learn in the four year BS (CS) and BSE (CSE) programs.
a. Students will have exposure to the various sub-disciplines in CS and CSE program.
b. Students will be able to select courses that are part of the particular sub-discipline.
Course assessment plan:
Assignments: 75%
Attendance: 25%
Grading plan:
100% - 90% A
89% - 80% B
79% - 70% C
69% - 60% D
59% and below E
Welcome to ASU 101
Hi all,
Welcome to ASU 101: The ASU Experience - Computer Science Version
This is a pretty open class, in terms of the learning requirements that we need to fulfill before the semester ends. So I want to keep the agenda of the class pretty open and fluid, so that we can talk more about the interesting things happening around us.
We'll talk more about the class in the lecture.
However, the first assignment is to create a blog of your own and write something about yourself. Especially write about the transition from High School to College, and settling in.
-Aviral
Welcome to ASU 101: The ASU Experience - Computer Science Version
This is a pretty open class, in terms of the learning requirements that we need to fulfill before the semester ends. So I want to keep the agenda of the class pretty open and fluid, so that we can talk more about the interesting things happening around us.
We'll talk more about the class in the lecture.
However, the first assignment is to create a blog of your own and write something about yourself. Especially write about the transition from High School to College, and settling in.
-Aviral
Subscribe to:
Posts (Atom)