wpe41.gif (23084 bytes)CIS5394: Decision Making and Expert Systems
(Current Issues in CIS)
Spring 2004

Tutorials

This page is intended to add coverage to the material presented in the lectures, lecture slides and otherwise available on this website. It IS NOT intended as a substitute for attending class.

You are all required to write-up one of the available tutorials. A tutorial is available for write-up if there is no link to it or if it is followed by three asterisks (***) (Those without Asterisks are NOT Available). Those topics which are followed by three asterisks have some content, but are NOT considered good tutorials (i.e., you should redo them so that they are 'A' Tutorials).

Please Choose from the Topics below.
  Bits and Bytes
1.1.a What does a BIT stand for? (This is an 'A' Submission)
1.1.b What does a BIT stand for? (This is a 'B' Submission)
1.1.c What does a BIT stand for? (This is a 'C' Submission)
1.1.d What does a BIT stand for? (This is a 'D' Submission)
1.1.f What does a BIT stand for? (This is an Atrocious Submission)
1.10 How many messages we could transmit for a given number of bits?
1.15 How many bits do we need for a given number of messages?
1.20 How does a computer use bits? ***
1.25 How many bits do we need to group together?
1.30 What is a byte, and why does it contain 8-bits? ***
1.35 What is Parity and how does it help in detecting errors?
1.40 What was the problem with coding sequences and how was it resolved?
1.45 What is ASCII?
1.50 What is EBCDIC?
1.55 What is Unicode and Why it is developed? ***
1.60 What are the Problems with Unicode? ***
   

 

 Basic Data Types
2.00 How do you add binary numbers?
2.05 What happens when we add ASCII characters together?
2.10 What are signed/Unsigned Characters?  ***
2.15 How do we convert from decimal to binary?
2.20 How do we convert from binary to decimal?
2.25 What is Octal, and why is it important?
2.30 What is Hexadecimal and why is it important?
2.35 What are signed/Unsigned Shorts/Integers/Longs?  ***
2.40 How do we determine the range of integers?
2.45 How do we store negative integers?  ***
2.50 What is the difference between one's compliment and two's compliment? Why?
2.55 How do we store real numbers?
2.60 What is precision?
2.65 What is Magnitude?
2.70 What is more important: Magnitude or Precision?
2.75 How are bits allocated in terms of precision and magnitude?
2.80 How do we determine the range of real numbers?
2.85 How are real numbers actually stored in a computer?
2.90 How can we summarize all of the basic data types?
RAM Allocation
3.10 How do we know where a piece of datum will be stored in RAM?
3.15 How are characters stored in RAM?
3.20 If I assume that a character is stored in RAM, and I go to the address, what will I find there?
3.25 How are Integers stored in RAM?
3.30 If I assume that an integer is stored in RAM, and I go to the address, what will I find there?
3.35 How are Real Numbers stored in RAM?
Numeric Arrays
4.00 What is an array?
4.10 How arrays declared  and how is that an advantage over scalar variable declarations?  ***
4.15 How are arrays stored in RAM?
4.20 What are offsets and how do they work?
4.25 What Happens if we use 'Illegal' Offsets?
4.30 What are multi-dimensional arrays and how do they work?
4.35 What is the difference between using one 2-dimensional array or two 1-dimensional arrays?
4.40 How do we use offsets to calculate the address of any dimensional array?
4.45 What is a pointer and how does it relate to an array? (NOT Available -- I'll do this one)
4.50 What types of array declarations are there and what do they mean?
Strings
5.10 How are strings numeric arrays alike? ***
5.15 Why are strings different than numeric arrays and how do we deal with them?
5.20 How does 'puts'  statement in c work?
5.25 What happens if we forgot to add a NULL character to a string? ***
5.35 How do we use pointers with strings? (NOT Available -- I'll do this one)
5.45 Why must we convert data entered from the keyboard and how do we do it?
5.55 Why must we convert numeric data to ASCII and how do we do it?
Structured Data Objects
7.10 What is a structured data object and how is it different than an array?
7.15 How do we declare a struct in other languages? How do we declare them in c?
7.20 How many bytes of storage do we need for a struct? ***
7.30 How is a struct stored in RAM and how do we determine the address of each component?
7.40 What is an array of structs and how does it work?
7.60 How do we use pointers with structs? (NOT Available -- I'll do this one)
Searching and Sorting
9.00 What is a sequential Search and what is an example of one?
9.05 What is the maximum/average number of sequential searches needed?
9.10 What is a binary search and what is an example of one?
9.15 What is the maximum/average number of binary searches needed?
9.20 Which search technique is better and why?
9.25 What are the basic categories and types of sorts?
9.30A What is a bubble sort and how does it work?
9.30B What is a bubble sort and how does it work?
9.35 How many swaps are needed? How can we reduce the number?
9.40 How can we refine a bubble sort and what is an example?
9.45 What is a quick sort and how does it work? (NOT Available -- I'll do this one)
Linked Lists
10.10 What is a linked list, why do we use it, and how is it different than a struct?
10.20 How do we declare a linked list and how would it be stored in RAM?
10.25 Conceptually, how would a link list appear?
10.35 How would a link list actually be set-up?
10.40 How would we find an element on a linked list?
10.45 What advantages are there to linked lists?
10.55 How do the different types of linked lists compare?
Dynamic Memory Allocation
11.10 Why do we need to allocate memory dynamically?
11.10B Why do we need to allocate memory dynamically?
11.20 How much memory do we need to allocate dynamically and how do we do it?
11.30 What is an example of a dynamically allocated linked list?
11.40 How do we go about releasing memory that we no longer need?
Binary Trees
12.10 What is a Binary Tree and why do we use it?
12.20 How do we set up a binary tree?
12.30 What constitutes a 'good' versus a binary tree and what are examples of each?
12.40 Given the List 'M', 'D', 'A', 'T', 'F', 'P', how would I set up the (alphabetical) binary tree?

 

This page was last updated on 01/20/04.