Posts

Accreditation of degree programmes

In my first meeting with the academic staff of my new university, the University of Lincoln , there was an exciting discussion about accreditation for our teaching program. Accreditation concerns an official assessment of our teaching program by external institutions with authority. I can think of industry and government. Therefore, when we think of accreditation, we think of making our teaching standards meet agreed-upon requirements. There are several other benefits of accreditation: It is an independent validation that our program attends high standards set for a profession It is a framework for continuous regulation, improvement and comparison to other institutions I've come upon this topic while I was working at Innopolis University. Back then, I wondered about expectations from the industry and our sponsors towards our teaching. For example, since our students would end up working for those companies, which know-how they were expected to know. The first aspect is, therefore, ...

Data Structures and Algorithms - Practice Test Questions

Please find attached some practice questions. This document is under construction. DSA Practice Test Questions (updated on 13/02/2020)

Final of Introduction to Programming I

Click here to download the PDF for the final exam.

Sharing your paper

It's not because you are one of the authors that you can share the PDF of your paper. For checking if you can share the paper or a preprint version of it, consult: http://sherpa.ac.uk/romeo/index.php

Recent positions in academia

This post has a purpose to inspire you about a career in academia. You will be able to observe which topics and research fields are recurrent and where. Faculty Positions in Polytechnic Universities Computerroxy positions

A short discussion on methods for solving Recurrences

Image
This topic is typically addressed during the courses of Discreet Mathematics or Mathematics for Computer Science. I've added here a very generical road map for solving recurrences. First things first. You have a problem to be algorithmically solved. After writing your algorithm, you analyse its complexity. For divide and conquer, for example, we typically have recurrence functions - you express the runtime in terms of the runtime of the subproblems. For brute force, on the other hand, the running time is directly affected by the size search space or the number of all possible solutions. For solving recurrences you can use one (or more than one) of the following approaches: substitution, iteration, iteration with visual trees and master method (this one for the order of growth only). Let's see an example and try to obtain the closed form of a recurrence: A very strict proof would require an informed guess using Iteration, followed by the proof of the obtained cl...

Tutorial of Data Modelling and Databases II on 27/03/2019

Image
Concurrency Control Protocols Strategies for implementing isolation for database items accessed by concurrent transactions. Two sketches from the board.