MediaWiki API result
This is the HTML representation of the JSON format. HTML is good for debugging, but is unsuitable for application use.
Specify the format parameter to change the output format. To see the non-HTML representation of the JSON format, set format=json.
See the complete documentation, or the API help for more information.
{
"batchcomplete": "",
"continue": {
"lecontinue": "20240306151311|71",
"continue": "-||"
},
"query": {
"logevents": [
{
"logid": 81,
"ns": 0,
"title": "Unit test - start of reverse polish notation class",
"pageid": 71,
"logpage": 71,
"revid": 121,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2025-03-24T13:52:16Z",
"comment": "Created page with \"These are the two files, I made in class for unit test demo purposes. My original class in the file: ReversePolishCalc.py <pre> class ReversePolishCalc: def __init__(self): self.stack = list() def _checkstack(self, count): if len(self.stack) < count: raise IndexError(\"Stack does not contain enough elements to perform operaation\") def push(self, vector): if isinstance(vector, (int, float, str)): vector = [...\""
},
{
"logid": 80,
"ns": 0,
"title": "Programme - Spring 2024",
"pageid": 70,
"logpage": 70,
"revid": 106,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2025-01-17T15:12:07Z",
"comment": "Created page with \"'''[[Collection of files]]''' used in the exercises and lessons - all gathered here. * M 29/01 Lesson 1: [[Unix]] * T 01/02 More lecture on [[Unix]] * M 05/02 Lesson 2: [[Python Recap and Objects]] * T 08/02 Official talk about Random numbers * M 12/02 Lesson 3: [[Regular Expressions]] * T 15/02 Continuing lesson * M 19/02 Lesson 4: [[Making Functions]] * T 22/02 Unofficial talk about Garbage Collection in Python * M 26/02 Lesson 5: Advanced Data Structures and New Da...\""
},
{
"logid": 79,
"ns": 0,
"title": "Code construction",
"pageid": 69,
"logpage": 69,
"revid": 74,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-13T14:02:36Z",
"comment": "Created page with \"Learning how to construct good code is a main goal of the course. An important tool to facilitate this is peer evaluation. It is beneficial for you both to evaluate others, seeing other ways of solving the same problem - and to get feedback from other people on your own work. When evaluating you should check the teachers solutions to have some kind of reference apart from your own.<br> Tip: <span style=\"color:red\">If you want your peer to pay specific attention to someth...\""
},
{
"logid": 78,
"ns": 0,
"title": "Shortest path in graph",
"pageid": 68,
"logpage": 68,
"revid": 72,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T16:00:15Z",
"comment": "Created page with \"__NOTOC__ === Description === The program is given as input a file containing connected nodes in a graph and a weight assigned to the edge between the nodes. The program shall answer the questions: Is there a path between two given nodes in the graph? If so, what is the shortest path ?<br> This is useful in a number of situations: Protein interaction, which proteins interact together, thereby discovering f.ex. new pathways. Social networks, who knows who, proving the \"si...\""
},
{
"logid": 77,
"ns": 0,
"title": "Positive proteins",
"pageid": 67,
"logpage": 67,
"revid": 71,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T15:24:30Z",
"comment": "Created page with \"__NOTOC__ === Description === Find the top 1000 most positively charged protein sequences in uniprot and put them in a fasta file. Repeat the search but this time find the most positively charged protein sequences per molecular weight of the sequence and put that into another fasta file. Among the 20 common amino acids, five have a side chain which can be charged. At pH=7, two are negative charged: aspartic acid (D) and glutamic acid (E) (acidic side chains), and three a...\""
},
{
"logid": 76,
"ns": 0,
"title": "Spider toxins",
"pageid": 66,
"logpage": 66,
"revid": 70,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T15:23:14Z",
"comment": "Created page with \"__NOTOC__ === Description === Find all spider toxins in uniprot and output them in a fasta file. Who knows when it will be useful to produce venom? === Input/output === Download the entire [https://teaching.healthtech.dtu.dk/material/22113/uniprot_sprot.dat.gz swissprot database]. This will be your input file to your program.<br> Unpack it yourself with gunzip uniprot_sprot.dat.gz or whatever method you prefer. Careful, it will take up 3 GB.<br> Notice there are many s...\""
},
{
"logid": 75,
"ns": 0,
"title": "Fun with biology - find english words",
"pageid": 65,
"logpage": 65,
"revid": 69,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T15:22:12Z",
"comment": "Created page with \"__NOTOC__ === Description === Parse the entire uniprot database and extract the ID and the sequences. Find English words that are hidden (actually occur randomly) in the sequences. The words must be between 3 and 10 letters long, both inclusive. Display or save in a file the ID together with the words found in the sequence, but only if the total number of letters is 5 or more for that entry. === Input/output === Download the entire [https://teaching.healthtech.dtu.dk/ma...\""
},
{
"logid": 74,
"ns": 0,
"title": "Find short virus genes with disulfid bridges",
"pageid": 64,
"logpage": 64,
"revid": 68,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T15:21:02Z",
"comment": "Created page with \"__NOTOC__ === Description === Find all short (150 or less aa) virus genes in uniprot, that contain intrachain disulfid bridges. Interchain disulfide bonds can produce stable, covalently linked protein dimers, multimers or complexes, whereas intrachain disulfide bonds can contribute to protein folding and stability. === Input/output === Download the entire [https://teaching.healthtech.dtu.dk/material/22113/uniprot_sprot.dat.gz swissprot database]. This will be your input...\""
},
{
"logid": 73,
"ns": 0,
"title": "Find the mature part of human genes with a signal peptide",
"pageid": 63,
"logpage": 63,
"revid": 67,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T15:19:25Z",
"comment": "Created page with \"__NOTOC__ === Description === Find all human genes in uniprot with a signal peptide. Extract the entire sequence and create a fasta file with only the mature proteins. === Input/output === Download the entire [https://teaching.healthtech.dtu.dk/material/22113/uniprot_sprot.dat.gz swissprot database]. This will be your input file to your program.<br> Unpack it yourself with gunzip uniprot_sprot.dat.gz or whatever method you prefer. Careful, it will take up 3 GB.<br> Not...\""
},
{
"logid": 72,
"ns": 0,
"title": "Heuristic methods for fair sharing",
"pageid": 62,
"logpage": 62,
"revid": 66,
"params": {},
"type": "create",
"action": "create",
"user": "WikiSysop",
"timestamp": "2024-03-06T15:18:21Z",
"comment": "Created page with \"__NOTOC__ === Description === Distributing jobs/items to a number of consumers in a fair way has a number of applications. In this project you must implement 5 methods mentioned in the [https://teaching.healthtech.dtu.dk/material/22112/HPCLife-LoadBalancing.ppt powerpoint]: Random Assignment, Round Robin, Max-Min Round Robin, Reverse Round Robin and Least Load. === Input/output === As can be seen from the powerpoint, there is some randomness in the input, i.e. the numb...\""
}
]
}
}