Iraqi Journal for Computers and Informatics

There are some recent arguments in the community of computer enlightenment respecting the Object Oriented Programing (COP). This discussions focucs on one of the major questions that is "are we starting the duration of theory of computer science? How In this short paper we try to answer the most significant question of With the use of OOP, arc we passed Mccartry's theory ?are we starting new theory of computer science ? " We will first look at McCarthy theory, the principles of OOP. then finally we will attempt to answer the question and show our claims.

Many papers have been published about manipulating computer viruses; instructions that impact a computer system and after a period of incubation and reproducion, activate and demonstrate their presence.
mest Viruses were designed to attack microcomputers, sincce microcomputers are widely used nowadays, and have simple operating systems which result in lack of quality of their security systern. Connecting computers with networks and using copies of programs from unreliable sources such as bullet in board systems will increase the :of viral contact and the spread of viruses. Data Encryption disguises data flowing through a network so that it is unintelligible to any one monitor the data, Encryption techniques can also be used to detect file modification which may caused either by unithorized users or by viruses. This paper concern in viruses atracking users on system files (.exe and com) in microcomputer systems, where viruses Types, how they work, and anti-virus strateigies are going o scussed. Finally, a dccction strategy depending on Encryption techniques built the operating systems Suggested to improve PCs Security and preventing unauthorized users from inserting into programs commands that will cause system corruption.

This paper is a description and analysis of of one the data structure types called a B-tree. B-trees are balanced multi-branch tree structures which make it possible to maintain large files with a guaranteed efficiency. A proposed algorithm are presented here to help us to measure the behavior (such as the tree utilization and the leaf node utilization) of this type of data structure.