|
NAR 1
NAR 1 or just NAR ( Serbian Nastavni Računar, en. ''Educational Computer'') was a theoretical model of a computer created by Faculty of Mathematics of University of Belgrade professor Nedeljko Parezanović (In Serbian:Недељко Парезановић). It was used for Assembly language and Computer architecture courses. Specifications NAR 1 processor has a 5-bit address bus (32 bytes of addressable memory) and 8-bit data bus. Machine instructions were single-byte with three most significant bits specifying the opcode and 5 least significant bits the parameter - memory address. A single 8-bit accumulator register was available and there were no flags or flag registers. Only absolute addressing mode was available and all others were achieved by self-modifying code. Even though this is only a theoretical computer the following physical characteristics were given: * Memory cycle: 1μs * Arithmetic operation (SABF) cycle: 0.9μs (900ns) * Control panel facilitates po ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Serbian Language
Serbian (, ) is the standardized variety of the Serbo-Croatian language mainly used by Serbs. It is the official and national language of Serbia, one of the three official languages of Bosnia and Herzegovina and co-official in Montenegro and Kosovo. It is a recognized minority language in Croatia, North Macedonia, Romania, Hungary, Slovakia, and the Czech Republic. Standard Serbian is based on the most widespread dialect of Serbo-Croatian, Shtokavian (more specifically on the dialects of Šumadija-Vojvodina and Eastern Herzegovina), which is also the basis of standard Croatian, Bosnian, and Montenegrin varieties and therefore the Declaration on the Common Language of Croats, Bosniaks, Serbs, and Montenegrins was issued in 2017. The other dialect spoken by Serbs is Torlakian in southeastern Serbia, which is transitional to Macedonian and Bulgarian. Serbian is practically the only European standard language whose speakers are fully functionally digraphic, using both Cyril ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Least Significant Bit
In computing, bit numbering is the convention used to identify the bit positions in a binary number. Bit significance and indexing In computing, the least significant bit (LSB) is the bit position in a binary integer representing the binary 1s place of the integer. Similarly, the most significant bit (MSB) represents the highest-order place of the binary integer. The LSB is sometimes referred to as the ''low-order bit'' or ''right-most bit'', due to the convention in positional notation of writing less significant digits further to the right. The MSB is similarly referred to as the ''high-order bit'' or ''left-most bit''. In both cases, the LSB and MSB correlate directly to the least significant digit and most significant digit of a decimal integer. Bit indexing correlates to the positional notation of the value in base 2. For this reason, bit index is not affected by how the value is stored on the device, such as the value's byte order. Rather, it is a property of the numeri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Serbia
Serbia (, ; Serbian language, Serbian: , , ), officially the Republic of Serbia (Serbian language, Serbian: , , ), is a landlocked country in Southeast Europe, Southeastern and Central Europe, situated at the crossroads of the Pannonian Basin and the Balkans. It shares land borders with Hungary to the north, Romania to the northeast, Bulgaria to the southeast, North Macedonia to the south, Croatia and Bosnia and Herzegovina to the west, and Montenegro to the southwest, and claims a border with Albania through the Political status of Kosovo, disputed territory of Kosovo. Serbia without Kosovo has about 6.7 million inhabitants, about 8.4 million if Kosvo is included. Its capital Belgrade is also the List of cities in Serbia, largest city. Continuously inhabited since the Paleolithic Age, the territory of modern-day Serbia faced Slavs#Migrations, Slavic migrations in the 6th century, establishing several regional Principality of Serbia (early medieval), states in the early Mid ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Plum
A plum is a fruit of some species in ''Prunus'' subg. ''Prunus''''.'' Dried plums are called prunes. History Plums may have been one of the first fruits domesticated by humans. Three of the most abundantly cultivated species are not found in the wild, only around human settlements: ''Prunus domestica'' has been traced to East European and Caucasian mountains, while ''Prunus salicina'' and '' Prunus simonii'' originated in China. Plum remains have been found in Neolithic age archaeological sites along with olives, grapes and figs. According to Ken Albala, plums originated in Iran. They were brought to Britain from Asia. An article on plum tree cultivation in Andalusia (southern Spain) appears in Ibn al-'Awwam's 12th-century agricultural work, ''Book on Agriculture''. Etymology and names The name plum derived from Old English ''plume'' "plum, plum tree", borrowed from Germanic or Middle Dutch, derived from Latin ' and ultimately from Ancient Greek ''proumnon'', itself belie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Teaching Computer Model
Teaching is the practice implemented by a ''teacher'' aimed at transmitting skills (knowledge, know-how, and interpersonal skills) to a learner Learning is the process of acquiring new understanding, knowledge, behaviors, skills, values, attitudes, and preferences. The ability to learn is possessed by humans, animals, and some machines; there is also evidence for some kind of lear ..., a student, or any other audience in the context of an educational institution. Teaching is closely related to '' learning'', the student's activity of appropriating this knowledge. Teaching is part of the broader concept of ''education''.Naïl Ver, Adeline Paul and Farid Malki, ''Professeur des écoles : droits, responsabilités, carrière'', Retz Éditions, 2014, 223 p. Methods Profession Training References {{Authority control Teaching, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Two's Complement
Two's complement is a mathematical operation to reversibly convert a positive binary number into a negative binary number with equivalent (but negative) value, using the binary digit with the greatest place value (the leftmost bit in big- endian numbers, rightmost bit in little-endian numbers) to indicate whether the binary number is positive or negative (the sign). It is used in computer science as the most common method of representing signed (positive, negative, and zero) integers on computers, and more generally, fixed point binary values. When the most significant bit is a one, the number is signed as negative. . Two's complement is executed by 1) inverting (i.e. flipping) all bits, then 2) adding a place value of 1 to the inverted number. For example, say the number −6 is of interest. +6 in binary is 0110 (the leftmost most significant bit is needed for the sign; positive 6 is not 110 because it would be interpreted as -2). Step one is to flip all bits, yielding 1001. St ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jump Instruction
A branch is an instruction in a computer program that can cause a computer to begin executing a different instruction sequence and thus deviate from its default behavior of executing instructions in order. ''Branch'' (or ''branching'', ''branched'') may also refer to the act of switching execution to a different instruction sequence as a result of executing a branch instruction. Branch instructions are used to implement control flow in program loops and conditionals (i.e., executing a particular sequence of instructions only if certain conditions are satisfied). A branch instruction can be either an ''unconditional branch'', which always results in branching, or a ''conditional branch'', which may or may not cause branching depending on some condition. Also, depending on how it specifies the address of the new instruction sequence (the "target" address), a branch instruction is generally classified as ''direct'', ''indirect'' or ''relative'', meaning that the instruction contai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Branch (computer Science)
A branch is an instruction in a computer program that can cause a computer to begin executing a different instruction sequence and thus deviate from its default behavior of executing instructions in order. ''Branch'' (or ''branching'', ''branched'') may also refer to the act of switching execution to a different instruction sequence as a result of executing a branch instruction. Branch instructions are used to implement control flow in program loops and conditionals (i.e., executing a particular sequence of instructions only if certain conditions are satisfied). A branch instruction can be either an ''unconditional branch'', which always results in branching, or a ''conditional branch'', which may or may not cause branching depending on some condition. Also, depending on how it specifies the address of the new instruction sequence (the "target" address), a branch instruction is generally classified as ''direct'', ''indirect'' or ''relative'', meaning that the instruction contai ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Self-modifying Code
In computer science, self-modifying code (SMC) is code that alters its own instructions while it is executing – usually to reduce the instruction path length and improve performance or simply to reduce otherwise repetitively similar code, thus simplifying maintenance. The term is usually only applied to code where the self-modification is intentional, not in situations where code accidentally modifies itself due to an error such as a buffer overflow. Self-modifying code can involve overwriting existing instructions or generating new code at run time and transferring control to that code. Self-modification can be used as an alternative to the method of "flag setting" and conditional program branching, used primarily to reduce the number of times a condition needs to be tested. The method is frequently used for conditionally invoking test/debugging code without requiring additional computational overhead for every input/output cycle. The modifications may be performed: * ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Addressing Mode
Addressing modes are an aspect of the instruction set architecture in most central processing unit (CPU) designs. The various addressing modes that are defined in a given instruction set architecture define how the machine language instructions in that architecture identify the operand(s) of each instruction. An addressing mode specifies how to calculate the effective memory address of an operand by using information held in registers and/or constants contained within a machine instruction or elsewhere. In computer programming, addressing modes are primarily of interest to those who write in assembly languages and to compiler writers. For a related concept see orthogonal instruction set which deals with the ability of any instruction to use any addressing mode. Caveats Note that there is no generally accepted way of naming the various addressing modes. In particular, different authors and computer manufacturers may give different names to the same addressing mode, or the same na ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Flag (computing)
A bit field is a data structure that consists of one or more adjacent bits which have been allocated for specific purposes, so that any single bit or group of bits within the structure can be set or inspected. A bit field is most commonly used to represent integral types of known, fixed bit-width, such as single-bit Booleans. The meaning of the individual bits within the field is determined by the programmer; for example, the first bit in a bit field (located at the field's base address) is sometimes used to determine the state of a particular attribute associated with the bit field. Within CPUs and other logic devices, collections of bit fields called flags are commonly used to control or to indicate the outcome of particular operations. Processors have a status register that is composed of flags. For example if the result of an addition cannot be represented in the destination an arithmetic overflow is set. The flags can be used to decide subsequent operations, such as conditi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Accumulator (computing)
In a computer's central processing unit (CPU), the accumulator is a register in which intermediate arithmetic logic unit results are stored. Without a register like an accumulator, it would be necessary to write the result of each calculation (addition, multiplication, shift, etc.) to main memory, perhaps only to be read right back again for use in the next operation. Access to main memory is slower than access to a register like an accumulator because the technology used for the large main memory is slower (but cheaper) than that used for a register. Early electronic computer systems were often split into two groups, those with accumulators and those without. Modern computer systems often have multiple general-purpose registers that can operate as accumulators, and the term is no longer as common as it once was. However, to simplify their design, a number of special-purpose processors still use a single accumulator. Basic concept Mathematical operations often take place i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
