What is Virtualization?

Virtualization -Virtualization is an abstraction of the computer hardware that permits a single computer to behave as if it where several computers. In virtualization technology a dedicated software called hypervisor is used for connecting hardware and it permits system into virtual machines (VMs).
In without Virtual Machines a single Operating System interact with all hardware devices.Whereas with Virtual Machines several operating systems,every OS running its own virtual machine.Virtualization provide environment for multiple operating systems to run on the same physical platform.
Many IT enterprises follow the virtualization technology. By following virtualization technology efficiency enhanced.

Comments

Post a Comment

Popular posts from this blog

The python program allows the user to enter the Sales amount and Actual cost of a Product. Next, Python calculates the Loss Amount or profit Amount based on those two values using if-elif-else Statement

Image
  Write Pseudocode and draw flow chart of the following problem . The python program allows the user to enter the Sales amount and Actual cost of a Product. Next, Python calculates the Loss Amount or profit Amount based on those two values using if-elif-else Statement. Answer- Pseudocode Input the Actual cost of  Product Input the Sales Amount if(actual_cost > sale_amount):     amount = actual_cost - sale_amount     print("Total Loss Amount") elif(sale_amount > actual_cost):     amount = sale_amount - actual_cost     print("Total Profit ") else:     print("No Profit No Loss!!!") Flow chart- Python Code- #Input Actual cost of  Product actual_cost = float(input(" Please Enter the Actual cost of  Product:")) # Input Sales Amount sale_amount = float(input(" Please Enter the Sales Amount: ")) #calculate Loss Amount if(actual_cost > sale_amount):     amount = actual_cost - sale_amount     print(...
Read more

Mealy and Moore Machine

 Mealy Machine – A mealy machine is defined as 6 tuples (Q, q0, ∑, Δ, δ, λ’)  Q - finite non empty set of states  q0 - initial state  ∑-  input alphabet or terminals  Δ - output alphabet  δ - transition function δ:Q×∑ → Q  λ - output function λ: Q×∑→ O  Moore Machine – A moore machine is defined as 6 tuples (Q, q0, ∑, Δ, δ, λ’)  Q - finite non empty set of states  q0 - initial state  ∑-  input alphabet or terminals  Δ - output alphabet  δ - transition function δ:Q×∑ → Q  λ - output function λ: Q→O  1. Moore Machine is : a) FA without input b) FA with output c) NDFA with input d) None of the above Answer: b Explanation: Finite automaton with an output is  categorized in two parts: Moore M/C and Mealy M/C. 2.Which of the following is uesd as  output alphabet  in moore machine? a) δ b) ∆ c) ∑ d) None of the above Answer-b 3.Which of the following produce output for moore machine?  a) λ:...
Read more

Question Bank of Theory of Automata & Formal Languages

  Long Answer Question Bank Theory of Automata & Formal Languages  UNIT 1 1.       Find closure of each state and give the set of all strings of length 3 or less accepted by automaton. 2.       Define DFA, NFA & Language? 3.       State and prove Myhill Nerode Theorm 4.       Design a DFA to accept string of 0’s & 1’s when interpreted as binary numbers would be multiple of 3 5.       Find closure of each state and give the set of all strings of length 3 or less accepted by automaton. 6.       Convert following NFA to DFA using subset construction method 7.       Write DFA to accept strings of 0’s, 1’s & 2’s beginning with a 0 followed by odd number of 1’s and ending with a 2. 8.       Construct D...
Read more