Amitabh Bachchan winner of Dadasaheb Phalke Award

Dadasaheb Phalke Award is highest award in cinema given by Government of India.It was started in year 1969. The first  recipient of Dadasaheb Phalke Award was Devika Rani. 66th Dadasaheb Phalke Award 2019 given to Amitabh Bachchan.

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("Total Loss Amount = {0}".for
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) λ: Q→O b) λ: Q×∑→ O c) both a and b d) none of the above 4.The Output of Moore machine depends on a) only
Read more

Context free grammar

  Question: Answer each part for the following context-free grammar G. R → XRX | S S → aT b | bT a T → XT X | X | ε X → a | b very important : if you know how to answer these questions. leave your email and i will contact you or come here at 5 pm (new york time) you will answer similar questions. the point of asking this question is to be able to connect with someone who knows the topic a. What are the variables of G? b. What are the terminals of G? c. Which is the start variable of G? d. Give three strings in L(G). e. Give three strings not in L(G). f. True or False: T ⇒ aba. g. True or False: T ∗⇒ aba. h. True or False: T ⇒ T . i. True or False: T ∗⇒ T . j. True or False: XXX ∗⇒ aba. k. True or False: X ∗⇒ aba. l. True or False: T ∗⇒ XX. m. True or False: T ∗⇒ XXX. n. True or False: S ∗⇒ ε. o. Give a description in English of L(G). Answer Answer-a) Variables of grammar(G)-(R,X,S,T) Answer-b) Terminals of grammar(G)-{a,b} Answer-c) Starting variable of grammar(G)-{R} Answer-d) Three s
Read more