The document discusses different types of operating systems. It defines an operating system as software that allows computer hardware and software to communicate and function. It then describes GUI operating systems as using graphics and icons navigated by a mouse. It also covers multi-user systems that allow multiple users to access a computer simultaneously or at different times, as well as multiprocessing systems that support more than one processor, and multitasking and multithreading systems that run multiple processes concurrently. Finally, it mentions embedded systems designed for devices like PDAs with limited resources.
This document provides information about operating system structures. It discusses monolithic, layered, and microkernel structures. A monolithic structure integrates all OS components into a single kernel address space. A layered structure arranges OS components into layers by abstraction, with each layer relying on the layer below. A microkernel structure moves most OS functions out of the kernel into separate servers that communicate via inter-process communication.
The document discusses the history and functions of operating systems. It begins by defining an operating system and describing its key roles like acting as an interface between the user and computer and managing computer resources. It then discusses the goals of operating systems as making computers easier to use and efficiently managing hardware. The main functions of an operating system are then outlined as process management, memory management, I/O management, file management, and more. Finally, the document summarizes the evolution of operating systems through five generations from the earliest vacuum tube computers to modern systems with artificial intelligence.
This PPT is all about the Tree basic on fundamentals of B and B+ Tree with it's Various (Search,Insert and Delete) Operations performed on it and their Examples...
This document defines and explains asymptotic notations used to analyze the time complexity of algorithms. It discusses Big-O, Big-Omega, Theta, Little-o and Little-Omega notations. Big-O notation expresses the upper bound of an algorithm's running time and measures worst case time complexity. Big-Omega notation expresses the lower bound and measures best case time complexity. Theta notation represents both the upper and lower bounds and is used for average case analysis. Examples are provided to demonstrate how functions are bounded using these notations.
This document provides information on data structures using C, focusing on trees. It defines tree terminology like root, parent, child, leaf nodes. It describes different types of binary trees like strictly binary, full, complete, extended trees. It discusses memory representation of binary trees using arrays and linked lists. It explains traversal methods for binary trees like preorder, inorder and postorder in both recursive and non-recursive ways. The document also discusses converting a general tree to a binary tree and provides examples.
The document discusses different types of operating systems. It defines an operating system as software that allows computer hardware and software to communicate and function. It then describes GUI operating systems as using graphics and icons navigated by a mouse. It also covers multi-user systems that allow multiple users to access a computer simultaneously or at different times, as well as multiprocessing systems that support more than one processor, and multitasking and multithreading systems that run multiple processes concurrently. Finally, it mentions embedded systems designed for devices like PDAs with limited resources.
This document provides information about operating system structures. It discusses monolithic, layered, and microkernel structures. A monolithic structure integrates all OS components into a single kernel address space. A layered structure arranges OS components into layers by abstraction, with each layer relying on the layer below. A microkernel structure moves most OS functions out of the kernel into separate servers that communicate via inter-process communication.
The document discusses the history and functions of operating systems. It begins by defining an operating system and describing its key roles like acting as an interface between the user and computer and managing computer resources. It then discusses the goals of operating systems as making computers easier to use and efficiently managing hardware. The main functions of an operating system are then outlined as process management, memory management, I/O management, file management, and more. Finally, the document summarizes the evolution of operating systems through five generations from the earliest vacuum tube computers to modern systems with artificial intelligence.
This PPT is all about the Tree basic on fundamentals of B and B+ Tree with it's Various (Search,Insert and Delete) Operations performed on it and their Examples...
This document defines and explains asymptotic notations used to analyze the time complexity of algorithms. It discusses Big-O, Big-Omega, Theta, Little-o and Little-Omega notations. Big-O notation expresses the upper bound of an algorithm's running time and measures worst case time complexity. Big-Omega notation expresses the lower bound and measures best case time complexity. Theta notation represents both the upper and lower bounds and is used for average case analysis. Examples are provided to demonstrate how functions are bounded using these notations.
This document provides information on data structures using C, focusing on trees. It defines tree terminology like root, parent, child, leaf nodes. It describes different types of binary trees like strictly binary, full, complete, extended trees. It discusses memory representation of binary trees using arrays and linked lists. It explains traversal methods for binary trees like preorder, inorder and postorder in both recursive and non-recursive ways. The document also discusses converting a general tree to a binary tree and provides examples.
The document discusses the analysis of algorithms. It begins by defining an algorithm and describing different types. It then covers analyzing algorithms in terms of correctness, time efficiency, space efficiency, and optimality through theoretical and empirical analysis. The document discusses analyzing time efficiency by determining the number of repetitions of basic operations as a function of input size. It provides examples of input size, basic operations, and formulas for counting operations. It also covers analyzing best, worst, and average cases and establishes asymptotic efficiency classes. The document then analyzes several examples of non-recursive and recursive algorithms.
This document discusses data structures and algorithms. It defines data types and data structures, and provides examples of common data structures like arrays, linked lists, stacks, queues, and trees. It also discusses operations on data structures like traversing, searching, inserting, and deleting. Algorithms are used to manipulate the data in data structures. The time and space complexity of algorithms are also introduced. Overall, the document provides an overview of key concepts related to data structures and algorithms.
This document summarizes graph coloring using backtracking. It defines graph coloring as minimizing the number of colors used to color a graph. The chromatic number is the fewest colors needed. Graph coloring is NP-complete. The document outlines a backtracking algorithm that tries assigning colors to vertices, checks if the assignment is valid (no adjacent vertices have the same color), and backtracks if not. It provides pseudocode for the algorithm and lists applications like scheduling, Sudoku, and map coloring.
This document contains a presentation on Breadth-First Search (BFS) given to students. The presentation includes:
- An introduction to BFS and its inventor Konrad Zuse.
- Definitions of key terms like graph, tree, vertex, level-order traversal.
- An example visualization of BFS on a graph with 14 steps.
- Pseudocode and a Java program implementing BFS.
- Applications of BFS like shortest paths, social networks, web crawlers.
- The time and space complexity of BFS is O(V+E) and O(V).
- A conclusion that BFS is an important algorithm that traverses
This document discusses C-strings in C++. It begins by outlining topics like C-string functions and input/output. It then defines C-strings as null-terminated arrays of characters that can be used to represent strings. It covers declaring, initializing, assigning, comparing and manipulating C-strings using standard string functions from the cstring library like strcpy(), strcmp(), strcat(), and strlen(). It also discusses C-string input/output using stream operators and safer alternatives like strncpy() and strncat().
This document provides an introduction to digital systems and concepts. It defines analog and digital representations, and discusses the advantages and disadvantages of digital techniques compared to analog. It also describes digital number systems like binary and decimal, how binary quantities are represented, and methods for digital data transmission and storage in memory. Finally, it outlines the major components of a digital computer including the arithmetic logic unit, memory, input/output, and control unit.
This document discusses P, NP and NP-complete problems. It begins by introducing tractable and intractable problems, and defines problems that can be solved in polynomial time as tractable, while problems that cannot are intractable. It then discusses the classes P and NP, with P containing problems that can be solved deterministically in polynomial time, and NP containing problems that can be solved non-deterministically in polynomial time. The document concludes by defining NP-complete problems as those in NP that are as hard as any other problem in the class, in that any NP problem can be reduced to an NP-complete problem in polynomial time.
Introduction to digital computers and Number systems.pptxBhawaniShankarSahu1
The document provides an introduction to digital computers and number systems. It discusses computer systems and architecture, decimal and binary number systems, number conversion between systems, and character encoding standards like ASCII, ISCII, and Unicode. It also introduces programming concepts like flowcharts, algorithms, and C/C++ compilers. Key topics covered include data representation, computer components, software types, number bases, programming languages, and applications of C/C++.
Prolog, Prolog Programming IN AI. Prolog is an Artificial Intelligence programming language. Prolog is a logic programming language associated with artificial intelligence and computational linguistics. Its applications include natural language understanding and expert systems. Prolog is notably a so-called nonprocedural, or declarative, language.
Breadth First Search & Depth First SearchKevin Jadiya
The slides attached here describes how Breadth first search and Depth First Search technique is used in Traversing a graph/tree with Algorithm and simple code snippet.
A compiler converts source code into object code, while a linker links programs to necessary libraries. The process of developing a C program involves opening an IDE, editing code, saving the file, compiling for errors, executing if no errors, and repeating the edit-compile cycle until the program runs successfully and outputs results. More information can be found at the provided blog link.
The document provides an overview of compilers by discussing:
1. Compilers translate source code into executable target code by going through several phases including lexical analysis, syntax analysis, semantic analysis, code optimization, and code generation.
2. An interpreter directly executes source code statement by statement while a compiler produces target code as translation. Compiled code generally runs faster than interpreted code.
3. The phases of a compiler include a front end that analyzes the source code and produces intermediate code, and a back end that optimizes and generates the target code.
The document provides an overview of recursive and iterative algorithms. It discusses key differences between recursive and iterative algorithms such as definition, application, termination, usage, code size, and time complexity. Examples of recursive algorithms like recursive sum, factorial, binary search, tower of Hanoi, and permutation generator are presented along with pseudocode. Analysis of recursive algorithms like recursive sum, factorial, binary search, Fibonacci number, and tower of Hanoi is demonstrated to determine their time complexities. The document also discusses iterative algorithms, proving an algorithm's correctness, the brute force approach, and store and reuse methods.
This presentation contains:
1. Introduction
2. Central areas of TOC
3. Complexity theory
4. Computability theory
5. Automata theory
6. Related terminologies
7. Strings
8. Languages
9. Proof, Theorem, Lemma, Corollaries
Introduction to data structures and AlgorithmDhaval Kaneria
This document provides an introduction to algorithms and data structures. It defines algorithms as step-by-step processes to solve problems and discusses their properties, including being unambiguous, composed of a finite number of steps, and terminating. The document outlines the development process for algorithms and discusses their time and space complexity, noting worst-case, average-case, and best-case scenarios. Examples of iterative and recursive algorithms for calculating factorials are provided to illustrate time and space complexity analyses.
This document discusses external sorting algorithms and the polyphase merge sorting algorithm. It begins by explaining that external sorting is needed when data is too large to fit in main memory, and involves initially sorting runs that fit in memory and then merging the runs. The document then provides details on the balanced two-way merge algorithm and multi-way merge algorithm. It proceeds to describe the polyphase merge sorting algorithm, which decreases the number of runs at each iteration by merging runs into larger runs. The document provides pseudocode and an example of the polyphase merge sorting process. It concludes by analyzing the number of comparisons needed for run construction and merging in polyphase merge sorting.
what is Parsing
different types of parsing
what is parser and role of parser
what is top-down parsing and bottom-up parsing
what is the problem in top-down parsing
design of top-down parsing and bottom-up parsing
examples of top-down parsing and bottom-up parsing
This document discusses various techniques for code optimization at the compiler level. It begins by defining code optimization and explaining that it aims to make a program more efficient by reducing resources like time and memory usage. Several common optimization techniques are then described, including common subexpression elimination, dead code elimination, and loop optimization. Common subexpression elimination removes redundant computations. Dead code elimination removes code that does not affect program output. Loop optimization techniques like removing loop invariants and induction variables can improve loop performance. The document provides examples to illustrate how each technique works.
The document discusses algorithms and data structures. It begins with an introduction to merge sort, solving recurrences, and the master theorem for analyzing divide-and-conquer algorithms. It then covers quicksort and heaps. The last part discusses heaps in more detail and provides an example heap representation as a complete binary tree.
Skripte per lenden e mesimit praktik
Temat qe perfshihen:
Mirembajtja e sistemit kompjuterik
Rrjetat kompjuterike dhe
Bazat e te dhenave
arkitektura,atributi,bazat e te dhenave,bios,disku,entiteti,forma e pare normale,ip adresa,kesh memorja,kompjuteri,pllaka ame,procesori,relacione,rrjetat kompjuterike,sql,tabela
The document discusses the analysis of algorithms. It begins by defining an algorithm and describing different types. It then covers analyzing algorithms in terms of correctness, time efficiency, space efficiency, and optimality through theoretical and empirical analysis. The document discusses analyzing time efficiency by determining the number of repetitions of basic operations as a function of input size. It provides examples of input size, basic operations, and formulas for counting operations. It also covers analyzing best, worst, and average cases and establishes asymptotic efficiency classes. The document then analyzes several examples of non-recursive and recursive algorithms.
This document discusses data structures and algorithms. It defines data types and data structures, and provides examples of common data structures like arrays, linked lists, stacks, queues, and trees. It also discusses operations on data structures like traversing, searching, inserting, and deleting. Algorithms are used to manipulate the data in data structures. The time and space complexity of algorithms are also introduced. Overall, the document provides an overview of key concepts related to data structures and algorithms.
This document summarizes graph coloring using backtracking. It defines graph coloring as minimizing the number of colors used to color a graph. The chromatic number is the fewest colors needed. Graph coloring is NP-complete. The document outlines a backtracking algorithm that tries assigning colors to vertices, checks if the assignment is valid (no adjacent vertices have the same color), and backtracks if not. It provides pseudocode for the algorithm and lists applications like scheduling, Sudoku, and map coloring.
This document contains a presentation on Breadth-First Search (BFS) given to students. The presentation includes:
- An introduction to BFS and its inventor Konrad Zuse.
- Definitions of key terms like graph, tree, vertex, level-order traversal.
- An example visualization of BFS on a graph with 14 steps.
- Pseudocode and a Java program implementing BFS.
- Applications of BFS like shortest paths, social networks, web crawlers.
- The time and space complexity of BFS is O(V+E) and O(V).
- A conclusion that BFS is an important algorithm that traverses
This document discusses C-strings in C++. It begins by outlining topics like C-string functions and input/output. It then defines C-strings as null-terminated arrays of characters that can be used to represent strings. It covers declaring, initializing, assigning, comparing and manipulating C-strings using standard string functions from the cstring library like strcpy(), strcmp(), strcat(), and strlen(). It also discusses C-string input/output using stream operators and safer alternatives like strncpy() and strncat().
This document provides an introduction to digital systems and concepts. It defines analog and digital representations, and discusses the advantages and disadvantages of digital techniques compared to analog. It also describes digital number systems like binary and decimal, how binary quantities are represented, and methods for digital data transmission and storage in memory. Finally, it outlines the major components of a digital computer including the arithmetic logic unit, memory, input/output, and control unit.
This document discusses P, NP and NP-complete problems. It begins by introducing tractable and intractable problems, and defines problems that can be solved in polynomial time as tractable, while problems that cannot are intractable. It then discusses the classes P and NP, with P containing problems that can be solved deterministically in polynomial time, and NP containing problems that can be solved non-deterministically in polynomial time. The document concludes by defining NP-complete problems as those in NP that are as hard as any other problem in the class, in that any NP problem can be reduced to an NP-complete problem in polynomial time.
Introduction to digital computers and Number systems.pptxBhawaniShankarSahu1
The document provides an introduction to digital computers and number systems. It discusses computer systems and architecture, decimal and binary number systems, number conversion between systems, and character encoding standards like ASCII, ISCII, and Unicode. It also introduces programming concepts like flowcharts, algorithms, and C/C++ compilers. Key topics covered include data representation, computer components, software types, number bases, programming languages, and applications of C/C++.
Prolog, Prolog Programming IN AI. Prolog is an Artificial Intelligence programming language. Prolog is a logic programming language associated with artificial intelligence and computational linguistics. Its applications include natural language understanding and expert systems. Prolog is notably a so-called nonprocedural, or declarative, language.
Breadth First Search & Depth First SearchKevin Jadiya
The slides attached here describes how Breadth first search and Depth First Search technique is used in Traversing a graph/tree with Algorithm and simple code snippet.
A compiler converts source code into object code, while a linker links programs to necessary libraries. The process of developing a C program involves opening an IDE, editing code, saving the file, compiling for errors, executing if no errors, and repeating the edit-compile cycle until the program runs successfully and outputs results. More information can be found at the provided blog link.
The document provides an overview of compilers by discussing:
1. Compilers translate source code into executable target code by going through several phases including lexical analysis, syntax analysis, semantic analysis, code optimization, and code generation.
2. An interpreter directly executes source code statement by statement while a compiler produces target code as translation. Compiled code generally runs faster than interpreted code.
3. The phases of a compiler include a front end that analyzes the source code and produces intermediate code, and a back end that optimizes and generates the target code.
The document provides an overview of recursive and iterative algorithms. It discusses key differences between recursive and iterative algorithms such as definition, application, termination, usage, code size, and time complexity. Examples of recursive algorithms like recursive sum, factorial, binary search, tower of Hanoi, and permutation generator are presented along with pseudocode. Analysis of recursive algorithms like recursive sum, factorial, binary search, Fibonacci number, and tower of Hanoi is demonstrated to determine their time complexities. The document also discusses iterative algorithms, proving an algorithm's correctness, the brute force approach, and store and reuse methods.
This presentation contains:
1. Introduction
2. Central areas of TOC
3. Complexity theory
4. Computability theory
5. Automata theory
6. Related terminologies
7. Strings
8. Languages
9. Proof, Theorem, Lemma, Corollaries
Introduction to data structures and AlgorithmDhaval Kaneria
This document provides an introduction to algorithms and data structures. It defines algorithms as step-by-step processes to solve problems and discusses their properties, including being unambiguous, composed of a finite number of steps, and terminating. The document outlines the development process for algorithms and discusses their time and space complexity, noting worst-case, average-case, and best-case scenarios. Examples of iterative and recursive algorithms for calculating factorials are provided to illustrate time and space complexity analyses.
This document discusses external sorting algorithms and the polyphase merge sorting algorithm. It begins by explaining that external sorting is needed when data is too large to fit in main memory, and involves initially sorting runs that fit in memory and then merging the runs. The document then provides details on the balanced two-way merge algorithm and multi-way merge algorithm. It proceeds to describe the polyphase merge sorting algorithm, which decreases the number of runs at each iteration by merging runs into larger runs. The document provides pseudocode and an example of the polyphase merge sorting process. It concludes by analyzing the number of comparisons needed for run construction and merging in polyphase merge sorting.
what is Parsing
different types of parsing
what is parser and role of parser
what is top-down parsing and bottom-up parsing
what is the problem in top-down parsing
design of top-down parsing and bottom-up parsing
examples of top-down parsing and bottom-up parsing
This document discusses various techniques for code optimization at the compiler level. It begins by defining code optimization and explaining that it aims to make a program more efficient by reducing resources like time and memory usage. Several common optimization techniques are then described, including common subexpression elimination, dead code elimination, and loop optimization. Common subexpression elimination removes redundant computations. Dead code elimination removes code that does not affect program output. Loop optimization techniques like removing loop invariants and induction variables can improve loop performance. The document provides examples to illustrate how each technique works.
The document discusses algorithms and data structures. It begins with an introduction to merge sort, solving recurrences, and the master theorem for analyzing divide-and-conquer algorithms. It then covers quicksort and heaps. The last part discusses heaps in more detail and provides an example heap representation as a complete binary tree.
Skripte per lenden e mesimit praktik
Temat qe perfshihen:
Mirembajtja e sistemit kompjuterik
Rrjetat kompjuterike dhe
Bazat e te dhenave
arkitektura,atributi,bazat e te dhenave,bios,disku,entiteti,forma e pare normale,ip adresa,kesh memorja,kompjuteri,pllaka ame,procesori,relacione,rrjetat kompjuterike,sql,tabela
The document discusses various topics related to XHTML including:
- The structure of XHTML documents and use of tags, elements, and attributes
- Specific elements like headings, paragraphs, links, images and how to code them in XHTML
- Special characters in XHTML and how they are represented
- The <hr> tag to create a horizontal rule on the page
- Validating XHTML documents to check for errors in syntax
The document provides examples of basic XHTML code for different elements and tags discussed. It aims to introduce foundational concepts for writing XHTML pages and elements.
LimoCars is a Singapore-based limousine service established in 2007 that offers a wide range of luxury vehicles to suit any budget or occasion. They provide comfortable transportation for individuals, groups, and large parties, and their experienced staff aims to ensure a premium limousine experience for all clients. Notable vehicles in their fleet include the Mercedes Benz E-Class, Rolls Royce Phantom, and Bentley Continental.
Specialized Automotive Recruitment provides recruitment, training, and human resources consulting services to automotive clients. They have over 70 years of collective experience in the automotive industry. They specialize in recruiting for a wide range of automotive roles, from executive management to technical positions. Their recruitment process involves identifying, screening, and presenting qualified candidates. They also offer outsourcing support, sourcing services, consulting, and relocation assistance. Their network and infrastructure allows them to source candidates globally and regionally to meet client needs.
The document provides an introduction and instructions for using Transana, a qualitative data analysis software. It explains how to start Transana by creating a database and selecting a series. It also describes how to upload media files, transcribe audio/video data, add time codes to synchronize transcripts with media, and organize clips, episodes, and collections for analysis. The document uses these features to demonstrate how to code data through keyword groups and keywords to identify themes and concepts for building explanations.
Matt lotze is a person with various skills setwatson171
Matt Lotze has extensive experience as an executive and entrepreneur, having served as CEO for three different companies over 20 years. He developed franchise systems, managed multiple locations and over 100 employees as CEO of Cheezy Pizza Company. As CEO of American Fundraisers, he founded and grew a full-scale fundraising company to $3 million in annual sales. As CEO of LiquidationsRus, he executed wholesale liquidations and grew the company to $8 million in annual sales. In addition, Matt Lotze has a variety of skills and has contributed extensively to charitable organizations.
Detyre Kursi - Pjeset fizike te KompjuteritDurim Hysa
Kjo eshte nje detyre kursi, ku shpjegonpjeset e kompjuterit dhe funksionimin e tyre, une po e ngarkoj kete detyre per tju ardhur ne ndihme sado pak studenteve te rinje. Faleminderit.
2. 1. Të tregojmë si realizohet mirëmbajtja e PC.
2. Të përshkruajmë programet që përdorim për
mirëmbajtjen e PC.
3. Të njihemi me defektet e kompjuterit.
3.
4. Kur kompjuteri ndizet ngadalë:
-Një mënyre efiçente për zgjidhjen e këtij problemi është
heqja e programeve që startojnë automatikisht me ndezjen e
kompjuterit.
5. • Ky lloj defekti mund të ketë shumë shkaktarë:
-Problemi mund të jetë software(ndonjë software ose
sistemi i operimit nuk punon në mënyrë të rregullt.
-Problemi mund të jetë hardware:
-Kondensatorët në motherboard nuk punojnë normalisht.
-RAM-i mund të jetë i dëmtuar.
6. o Ftohësit e sistemit nuk po e bëjnë siç duhet punën e tyre.
o Ftohësi i proçesorit nuk arrin ta ftohë atë dhe për të
mbrojtur proçesorin nga djegia,kompjuteri fiket.
7. -Në këto raste driver-i që është i instaluar nuk është i
përshtatshëm për sistemin.Ky defekt haset kryesisht tek
laptopët,menjëherë pasi ndizet kompjuteri ai bllokohet dhe nuk
merr asnjë komandë.
-Në keto raste bateria e laptopit është me defekt.
8. Kur humbet vazhdimisht ora e sistemit.
-Kthehet automatikisht herë pas here ne
1.01.1980.
-Atëherë bateria e BIOS-it nuk punon
normalisht dhe ky lloj defekti shoqërohet
me shumë probleme të tjera gjatë
boot-imit.
9. Kompjuteri ndizet,por restartohet menjëherë
pas boot-imit nga HDD.
o Ky defekt shkaktohet nga një RAM i dëmtuar.
o Sistemi i operimit nuk është instaluar në rregull.
10. Kur kompjuteri ndizet,por nuk ndodh asgjë
brenda tij :
-North Bridge mund të jetë e dëmtuar.
-Proçesori mund të jetë i dëmtuar.
• Kompjuteri ndizet dhe fiket përsëri pas
disa sekondash.
-Ky defekt mund të jetë kudo në
motherboard.
-Blloku i ushqimit mund të jetë i dëmtuar.
11.
12. Advanced Windows Care (Program falas për të
përmirësuar sistemin dhe për të pastruar
kompjuterin)
Enhance My Seven (Program për të
përmirësuar sistemin)
OptimalPC Free Edition (Program për
mirëmbajtjen dhe përmirësimin e sistemin
operativ)
Startup Delayer (Përmirëson shpejtesine boot
të sistemit.
13. Dy nga më të ‘mirët’ :
Iobit Toolbox:është një program për mirëmbajtjen e kompjuterit me një duzinë
funksionesh,duke përfshirë:pastrimin e diksut,fshirjen e sigurtë,përmirësimin e
internetit,menaxhimin e ndezjes,analizim dhe vizualizim i hapësirës se lirë në Hard
Disk,si dhe analizon dhe riparon sistemin operativ.
CCleaner: është një program i sigurt për të pastruar kompjuterin.Me anë të
‘Ccleaner’ korrigjohen qindra gabime të windows,riparohen lidhjet e thyera ose të
ndërprera etj.
Në këtë mënyre pastrohet dhe riparohet regjistri i sistemit,defragmentohet hard
driver,eliminon file të panevojshëm,heq spyware,dhe shumë më tepër.
