Personal tools
You are here: Home Courses Complex Biological Networks assignments

assignments

The assignments due for the classes.

 

The following are the due assignments.

There may be example code relevant to the individual sessions, please check. 

March 4 (practice session)

Reproduce Figure 1 from Ma'ayan. Yup. The network is in the repository. (yeah it's erroneously called ca3).

 

 

 

Feb 18 (practice session)

Use Dijkstra to get diameters of networks. Implement Strogatz-like networks with various densities of long-range connections and compute their diameter.

Familiarize yourself with all the operations in the cheat sheet.

Feb 11 (practice session)

Implement floodfill (nonrecursive) for all components, largest connected component measurement, rearrange matrix so connected components are contiguous and ordered from largest to smallest. If you want to peek, then look at the example code.

Implement a function that will create a Strogatz small-world network. Again, if you want to peek.

Familiarize yourself with Dijkstra. Then go to the code folder and familiarize yourself with Gabo's version.

Feb 4 (practice session)

Implement floodfill.

Implement a function that will create an Erdos-Renyi graph.

Jan 28 (practice session)

More recursive programming: sorting and more sorting.

Jan 21 (practice session)

In this session we need to be comfortable with looping and looping inside looping.

Write the following functions:

  1. easy: given a vector x, compute its (a) maximum (b) minimum (c) variance (three different functions, do NOT use builtins!)
  2. hard: given a vector x, sort it.
  3. harder, optional: sort fast (i.e., in N log N time).

Jan 18

Assigned reading: Sirovich's Rehnquist Court paper.

Assigned general: Review eigentheory in Schaum.

 

 

The following are the past assignments.

Jan 14 (practice session)

Assigned reading: Getting started with MATLAB.

In-class homework: covered basic commands, basic iterators, operators both matrix (*) and pointwise (.*). Plotted functions by definining x to be a fine grid using an iterator, then pointwise functions to get y, then plot(x,y). Edited files and defined difference between scripts and function files. Defined basic logic flow: if statement, for statement.

given a vector x, compute its mean. simple solution on right->

function y=mymean(x)
% this function computes the mean of the entries in vector x
y=0;
for i=1:length(x)
     y=y+x(i);
end
y=y/length(x);

Various issues to note about this: within the function mymean, we do not know anything about the vector x. We only know its elements, x(i), and its length, length(x).

Using the builting function sum() is of course cheating.

Reminder: comments are mandatory! they are your lab notebook!

 

Jan 11

Assigned reading: Strogatz nature insight paper "Exploring Complex Networks" (2001).

Assigned homework: Schaum's Outline on Graph Theory, 1.8 through 1.16, 1.48-1.49, check 1.62 with matlab, 1.63.

Document Actions