Ans: 1391211
Engg.
1. Solve: (A V B) ^ (!A V B) ^ ( A V ! B)
2. If 0 on a sector represents vacant and 1 represents occupied and on a 32 bit area D4FE2003 is written then what % is vacant.
3. A DFA was drawn….for a certain string.
You have to draw a DFA for language from alphabet (a,b)* which does not accept strings containing aabb.
4.create a tree for which inorder and preorder traversal is given
like…Inorder AVBEGHEHNEH
and Preorder VGHWEH…….
Now draw tree for Postorder traversal
5. for 100 sorted elements array
a. what will be avg complexity of searching an element in the array
b. write a code for searching an element
