Career
Success and development of M.I.F. Projects is a result of well-consolidated work. Urge towards professional growth, flexibility in solving difficult tasks make this company strong and stable. If you are responsible, able for self-education, can work in team and want to become a part of it learn our professional requirements and send us your CV into: info@mifprojects.com
Programming
Basic Level
Bit. Byte. The binary representation of integers and real numbers (fixed-point and floating-point) in a computer. The binary representation of negative integers.
The byte order (endianness). The difference between little-endian and big-endian systems.
Literal. Constant. Variable. The lifetime and scope of the variable.
Branching. Cycle. Types of cycles. Expanding cycles. Problems associated with the cycles. Iteration.
Function. Passing parameters to functions. A return value of function. Software stack.
Block diagram. The basic elements of a flowchart: processor, input-output, branching, loop connector.
Entry Level
Procedure-oriented programming. Object-oriented programming.
Link. Index. Passing parameters to a function by reference and by value. Problems associated with links and pointers.
Heap. Creating objects on the heap. Fragmentation of the heap.
Interface. The implementation of the interface.
Class. Abstract class. Object. Class field. Property class. Class method.
Constructor, destructor. They differ from "regular" class methods.
Inheritance, polymorphism. The virtual method. Abstract (pure virtual) method. Method overloading. Concealment method.
Static field, class method.
Encapsulation. Levels of access to fields and methods (private, protected, public).
Exception. The problems that solve the exception. Problems associated with exceptions.
Middle Level
Dynamic programming..
Recursion. Tail recursion. Problems associated with recursion. The implementing rules of recursion. Converting a recursive implementation of iterative.
Garbage Collection. Principles of operation, differences in implementation. Problems associated with garbage collection and how to solve them.
Templates. Template classes. Generics.
Introspection, Reflection.
Lambda functions. Anonymous functions.
Closure.
Currying.
Advanced Level
Imperative programming. Declarative programming. Functional programming.
Lazy evaluation.
English Language
Basic User
Can understand technical language with a dictionary.
Can use Indefinite/Simple tenses:Present/Past/Future Simple/Continuous.
Can form simple declarative sentences.
Can form simple interrogative sentences (General, Special, Alternative and Disjunctive).
Can use instruments of the spelling check.
Main irregular verbs and their formation.
Basic rules of the plural form of the nouns formation.
Main rules of words formation in English language.
Independent User
Can write and read transcription of English words.
Can understand the main ideas of complex text on both concrete and abstract topics, including technical discussions in his/her field of specialisation. Can produce clear, detailed text on a wide range of subjects and explain a viewpoint on a topical issue giving the advantages and disadvantages of various options. Can use Perfect and Perfect Continuous tenses. Passive voice.
Can use and form all types of interrogative sentences.
Can properly use synonyms and antonyms.
Proficient User
Can use both in speaking and writing:
- Perfect and Perfect Continuous tenses;
- Future in the past;
- Sequence of tenses;
- Articles (definite, indefinite, zero);
Can form Complex sentences and use them in his/her speaking and writing.
Can use language flexibly and effectively for social, and professional purposes. Can produce clear, well-structured, detailed text on complex subjects, showing controlled use of organisational patterns, connectors and cohesive devices.
Mathematics
Basic Level
Number systems. Addition, subtraction, multiplication, division in the second, eighth, 10th and 12th systems. Transfer from one system to another.
Logical operators AND, OR, NOT, XOR. Replacing a combination of other operations.
Bitwise operators AND, OR, NOT, XOR.
Entry Level
Estimation of the complexity of the O-notation algorithm.