User contributions
From EECS 182
Contributions/Aprakash
(Latest | Earliest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 20:13, February 2, 2013 (diff | hist) Main Page (top)
- 20:58, January 24, 2013 (diff | hist) Main Page
- 02:34, January 12, 2013 (diff | hist) Windows: Using VMware Player or Workstation to Install Mint for 182 (→Error Messages) (top)
- 02:25, January 12, 2013 (diff | hist) N File:Binarytranslationerror.png (top)
- 02:24, January 12, 2013 (diff | hist) Windows: Using VMware Player or Workstation to Install Mint for 182
- 21:13, January 8, 2013 (diff | hist) Windows: Using VMware Player or Workstation to Install Mint for 182 (→Downloading VMware Player or VMware Workstation)
- 21:13, January 8, 2013 (diff | hist) Windows: Using VMware Player or Workstation to Install Mint for 182
- 20:27, January 8, 2013 (diff | hist) Mint tips and tricks (top)
- 20:26, January 8, 2013 (diff | hist) Mint tips and tricks
- 20:25, January 8, 2013 (diff | hist) Mint tips and tricks
- 20:25, January 8, 2013 (diff | hist) Mint tips and tricks
- 20:24, January 8, 2013 (diff | hist) Mint tips and tricks
- 20:23, January 8, 2013 (diff | hist) Mint tips and tricks
- 05:35, January 7, 2013 (diff | hist) Mint tips and tricks
- 05:34, January 7, 2013 (diff | hist) N Mint tips and tricks (Created page with "# Your username in Mint is "me". Your password is "eecs182". Occasionally, you may need this, for example, when installing software within Mint. # Mint is a full-fledged Linux s...")
- 05:28, January 7, 2013 (diff | hist) Main Page (→EECS 182 Virtual Machine Installation (Recommended for local software use on your laptop))
- 05:27, January 7, 2013 (diff | hist) Getting a Free Copy of VMware software from UM
- 02:27, December 15, 2012 (diff | hist) G; assign(L, index, val): Returns a new list identical to L, but in which the item at the index position in L is replaced by val. (top)
- 02:22, December 15, 2012 (diff | hist) C. lookup(L, k): return the kth item in the mylist, where indexing starts at 0. (top)
- 02:20, December 15, 2012 (diff | hist) Sample Python Exam Problem Solutions (top)
- 02:20, December 15, 2012 (diff | hist) N File:MYLIST.py (Implements the mylist type in the Sample Exam problem) (top)
- 02:16, December 15, 2012 (diff | hist) N File:Sample.py (top)
- 01:17, December 5, 2012 (diff | hist) Sample Python Exam Problem Solutions
- 12:42, October 4, 2012 (diff | hist) Main Page (→EECS 182 Virtual Machine Installation (Recommended for local software use on your laptop))
- 12:39, October 4, 2012 (diff | hist) N Recovering the password for VMware Download site from UM (Created page with "If you have previously requested access for a free VMware copy from College of Engineering, but are not sure if you were granted access, try recovering the password. Here is how....") (top)
- 12:37, October 4, 2012 (diff | hist) Main Page
- 12:28, October 4, 2012 (diff | hist) Main Page
- 12:28, October 4, 2012 (diff | hist) Main Page
- 17:35, September 28, 2012 (diff | hist) Getting a Free Copy of VMware software from UM
- 03:49, September 21, 2012 (diff | hist) Main Page
- 21:01, September 20, 2012 (diff | hist) N CAEN: Using Linux Machines at CAEN (Created page with "First get a CAEN account. Call 734-764-CAEN (CAEN Hotline) for help in getting an account. Let them know that you are enrolled in EECS 182 (which is cross-listed with SI 182). ...") (top)
- 20:53, September 20, 2012 (diff | hist) Main Page
- 05:03, September 7, 2012 (diff | hist) Windows: Using VMware Player or Workstation to Install Mint for 182
- 05:03, September 7, 2012 (diff | hist) Windows: Using VMware Player or Workstation to Install Mint for 182
- 03:18, September 7, 2012 (diff | hist) Windows: Using VMware Player or Workstation to Install Mint for 182
- 03:15, September 7, 2012 (diff | hist) Mac: Using VMware Fusion to Install Mint for 182 (top)
- 03:14, September 7, 2012 (diff | hist) Mac: Using VMware Fusion to Install Mint for 182
- 03:12, September 7, 2012 (diff | hist) Mac: Using VMware Fusion to Install Mint for 182
- 16:35, September 5, 2012 (diff | hist) Getting a Free Copy of VMware software from UM
- 03:12, December 16, 2011 (diff | hist) F. len(L): returns the number of objects in mylist. (top)
- 03:11, December 16, 2011 (diff | hist) Sample Python Exam Problem Solutions
- 03:07, December 16, 2011 (diff | hist) F. len(L): returns the number of objects in mylist.
- 02:01, December 16, 2011 (diff | hist) G; assign(L, index, val): Returns a new list identical to L, but in which the item at the index position in L is replaced by val.
- 01:59, December 16, 2011 (diff | hist) G; assign(L, index, val): Returns a new list identical to L, but in which the item at the index position in L is replaced by val.
- 17:58, December 15, 2011 (diff | hist) D. concat(L1, L2): returns a mylist that is a concatenation of L1 and L2. (top)
- 17:45, December 15, 2011 (diff | hist) D. concat(L1, L2): returns a mylist that is a concatenation of L1 and L2.
- 14:24, December 15, 2011 (diff | hist) N G; assign(L, index, val): Returns a new list identical to L, but in which the item at the index position in L is replaced by val. (Created page with "# Thinking approach: Don't see an obvious base case. So, probably not a recursive solution. # Think of another way. Slicing is available to us. May be make use of that. Chop into...")
- 14:20, December 15, 2011 (diff | hist) N F. len(L): returns the number of objects in mylist. (Created page with " # best to solve recursively. The answer is trivial if the mylist object is empty. def len(L): if (L.isempty()): return 0 else: return len(L.pop()) + 1")
- 14:19, December 15, 2011 (diff | hist) N E. insert first(item, L): returns a mylist that contains item followed by items in L, in sequence. (Created page with "# Best to solve recursively. Since it is trivial to solve if L1 is empty. def insert_first(item, L1): if (L1.isempty()): return L1.append(item) else: ret...") (top)
- 14:18, December 15, 2011 (diff | hist) N D. concat(L1, L2): returns a mylist that is a concatenation of L1 and L2. (Created page with "# return the concatenation of two lists. Best to solve recursively. Base case: L2 is empty. def concat(L1, L2): if (L2.isempty()): return L1 else: return...")
(Latest | Earliest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
