4. INPUT PROCESSING USING ID.

 4. INPUT PROCESSING USING ID.

3. MOVES OF TURING MACHINE USING ID.

 3. MOVES OF TURING MACHINE USING ID.

2. REPRESENTATION OF TURING MACHINE.

 

1. DEFINITION TURING MACHINE .

 1. DEFINITION TURING MACHINE . 

question theory of automata from Mishra CHAPTER 9

 1. DEFINITION TURING MACHINE .  ANSWER LINK  + 

2. REPRESENTATION OF TURING MACHINE.  ANSWER LINK

3. MOVES OF TURING MACHINE USING ID.  ANSWER LINK + 

4. INPUT PROCESSING USING ID.  ANSWER LINK

5. DESIGN OF TURING MACHINES - 

         I )  Design a Turing machine to recognize all stlings consisting of an even number

             of 1's. ANSWER LINK + 

        II )  Design a Turing machine over {I. b} which can compute a concatenation

              function over L = {I}. If a pair of words (W1,W2) is the input. the output has

              to be W1.W2. ANSWER LINK

      III )  Design a TM that accepts {0^N1^N: n >=1}. ANSWER LINK

     IV )  Design a Turing machine M to recognize the language  1^N2^N3^N :N>=1

      V)   Construct a TM that accepts the language 0 1* + 1 0*.

     VI)  Design a TM which can multiply two positive integers.

     VII) NONDETERMINISTIC TURING MACHINES . 

 

question theory of automata from Mishra CHAPTER 5

 

question theory of automata from Mishra CHAPTER 5

1. REGULAR EXPRESSIONS

2. IDENTITIES FOR REGULAR EXPRESSIONS

3. NDFAs WITH A-MOVES AND REGULAR EXPRESSIONS

4. Any set L accepted by a finite automaton M is represented by

a regular expression.

5. CONVERSION OF NONDETERMINISTIC SYSTEMS TO

DETERMINISTIC SYSTEMS

6. ALGEBRAIC METHOD USING ARDEN'S THEOREM

7. CONSTRUCTION OF FINITE AUTOMATA EQUIVALENT

TO A REGULAR EXPRESSION.

8. EQUIVALENCE OF Two FINITE AUTOMATA

9. EQUIVALENCE OF Two REGULAR EXPRESSIONS

10. PUMPING LEMMA FOR REGULAR SETS

11. CLOSURE PROPERTIES OF REGULAR SETS

12. REGULAR SETS AND REGULAR GRAMMARS

question theory of automata from Mishra CHAPTER 6

 question theory of automata from Mishra CHAPTER 6

1. Construct a context-free grammar G generating all integers (with sign).

2. DERIVATION TREES

3. leftmost derivation and rightmost derivation.

4. AMBIGUITY IN CONTEXT-FREE GRAMMARS

5. If G is the grammar S -> SbS | a, show that G is ambiguous.

6. CONSTRUCTION OF REDUCED GRAMMARS.

7. ELIMINATION OF NULL PRODUCTIONS

8. ELIMINATION OF UNIT PRODUCTIONS

9. CHOMSKY NORMAL FORM

10. GREIBACH NORMAL FORM

question theory of automata from Mishra CHAPTER 7

 1. Model of a pushdown automaton.  ANSWER LINK + 

2. Definition -  pushdown automaton.  ANSWER LINK+ 

3. instantaneous description (ID) of pushdown automaton. + ANSWER LINK

4. move of  pushdown automaton.  ANSWER LINK

5. deterministic pda ANSWER LINK

6. Construct a pda A accepting L = {WCW^T } by final state. +  - ANSWER LINK

7. Construct a pda A accepting the set of all strings over {a, b} with equal  number of a's and b's. +
ANSWER LINK 

8. If L is a context-free language, then we can construct a pda  A accepting L by empty store, i.e. L = N(A).ANSWER LINK

question theory of automata from Mishra CHAPTER 4

 question theory of automata from Mishra CHAPTER 4 

1. DEFINITION OF A GRAMMAR

2. DERIVATIONS AND THE LANGUAGE GENERATED

BY A GRAMMAR

3. CHOMSKY CLASSIFICATION OF LANGUAGES

4. RECURSIVE AND RECURSIVELY ENUMERABLE SETS

THEORY OF COMPUTATION QUESTION SET:

 CHAPTER 3 : THE THEORY OF AUTOMATA  LINK

 CHAPTER 4 :   FORMAL LANGUAGES LINK

 CHAPTER 5 :  REGULAR SETS AND  REGULAR GRAMMARS LINK

 CHAPTER 6 : CFG LINK

 CHAPTER 7 :  PUSH DOWN AUTOMATA LINK

 CHAPTER 9 : TURING MACHINE  LINK

29. Write a program that will read 10 integers from user and store them in an array. Implement array using pointers. The program will print the array elements in ascending and descending order.

 29. Write a program that will read 10 integers from user and store them in an array. Implement array using pointers. The program will print the array elements in ascending and descending order.

BUBBLE SORT TECHNIQUE:

C++ CODE: 

28. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void.

 28. Write a function that reverses the elements of an array in place. The function must accept only one pointer value and return void.

27. Copy the contents of one text file to another file, after removing all whitespaces.

 27. Copy the contents of one text file to another file, after removing all whitespaces.

26. Write a program to retrieve the student information from file created in previous question and print it in following format: Roll No. Name Marks

 26. Write a program to retrieve the student information from file created in previous question and print it in following format: Roll No. Name Marks

25. Create a structure Student containing fields for Roll No., Name, Class, Year and Total Marks. Create 10 students and store them in a file.

 25. Create a structure Student containing fields for Roll No., Name, Class, Year and Total Marks. Create 10 students and store them in a file.

24. Create a class Box containing length, breath and height. Include following methods in it: a) Calculate surface Area b) Calculate Volume c) Increment, Overload ++ operator (both prefix & postfix) d) Decrement, Overload -- operator (both prefix & postfix) e) Overload operator == (to check equality of two boxes), as a friend function f) Overload Assignment operator g) Check if it is a Cube or cuboid Write a program which takes input from the user for length, breath and height to test the above class.

 24. Create a class Box containing length, breath and height. Include following methods in it:

              a) Calculate surface Area

              b) Calculate Volume

              c) Increment, Overload ++ operator (both prefix & postfix)

              d) Decrement, Overload -- operator (both prefix & postfix)

              e) Overload operator == (to check equality of two boxes), as a friend function

              f) Overload Assignment operator

              g) Check if it is a Cube or cuboid Write a program which takes input from the user for                             length, breath and height to test the above class.

23. Create a class Triangle. Include overloaded functions for calculating area. Overload assignment operator and equality operator.

 23. Create a class Triangle. Include overloaded functions for calculating area. Overload assignment operator and equality operator.

22. Create the Person class. Create some objects of this class (by taking information from the user). Inherit the class Person to create two classes Teacher and Student class. Maintain the respective information in the classes and create, display and delete objects of these two classes (Use Runtime Polymorphism).

 22. Create the Person class. Create some objects of this class (by taking information from the user). Inherit the class Person to create two classes Teacher and Student class. Maintain the respective information in the classes and create, display and delete objects of these two classes (Use Runtime Polymorphism).

21. Create Matrix class using templates. Write a menu-driven program to perform following Matrixoperations (2-D array implementation): a) Sum b) Difference c) Product d) Transpose

 21. Create Matrix class using templates. Write a menu-driven program to perform following Matrixoperations (2-D array implementation): a) Sum b) Difference c) Product d) Transpose

COMPUTER GRAPHICS question set (PAKHIRA)

  CHAPTER 9

1. window and view port

2. clipping

3. Cohen_Sutherland algo

4. Midpoint subdivision'

5. Sutherland-Hodgman algo