vu cs507 Mid Term Subjective Solved Past Paper No.5

vu cs507 Information Systems Solved Past Papers

This subjective solved past paper is related to book/course code vu cs507 Information Systems which belongs to vu organization. We have 8 past papers available related to the book/course Information Systems. This past paper has a total of 10 subjective questions belongs to topic Mid Term to get prepared. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to get prepared for exams by learning subjective questions online on NVAEducatio.

NVAEducation also facilitates users to download these solved past papers with an affordable prices. However, users are not enforced to pay for money, rather they can use credits to buy such stuff on NVAEducation. Users can earn credits for doing some little tasks and then you will be able to use that credits to buy solved past papers on NVAEducation.

Question 1: Write valid instruction(s) to perform each function specified below.
a. Provide instruction to jump to label BELOW if AL contains an even number.
b. Provide instruction to move the value at the top of the stack in IP register
c. Provide instruction to move value of flag register in AX.
d. Provide instruction to divide value of AX by 8.
e. Provide instruction to store 0xFFFF into AX.

Answer:

Be the first to post an answer to earn 100 credits.

Question 2: Check the given statements or correct or not if not then correct it.

String in regular language can not be infinite.
Concatenation of finite letters from alphabets called sigma.
There cannot be more then on FA,s for same language.

Answer:

1) True
2) False
3) False

Question 3: Consider the language S*, where S = {ab, ba}, Can any word in this language contain the substrings aaa or bbb. Why or why not?

Answer:

No words can contain aaa or bbb because every a and b is preceded / followed by a different letter, so one letter can never be surrounded on both sides by the same letter.a and b are the smallest words / strings not in S*.

Question 4: Construct a regular expression defining the following language over the alphabet S = {a,b}:
All words that contains at least one of the strings s1, s2, s3 or s4

Answer:

(a+b)*(s1+s2+s3+s4)(a+b)*

Question 5: Describe the method of NFA corresponding to Concatenation of FAs.

Answer:

Introduce additional transitions for each letter connecting each final state of the first FA with the states of second FA that are connected with the initial state of second FA corresponding to each letter of the alphabet. Remove the +ve sign of each of final states of first FA and -ve sign of the initial state of second FA. It will create non-determinism at final states of first FA and hence NFA, thus obtained, will be the required NFA. (Page 48)

Question 6: Differentiate between the following terms:

Mealy and Moore machine.
NFA and FA.

Answer:

Be the first to post an answer to earn 100 credits.

Question 7: Explain mealy machine

Answer:

Be the first to post an answer to earn 100 credits.

Question 8: For proving Kleen's theorm part-II:
"If there are more than one transition edges between two states then we can reduce all these transition edges with a single transition edge"
Explain this statement with the help of an example.

Answer:

Be the first to post an answer to earn 100 credits.

Question 9: Give an example of a set S such that S* only contains all possible string of a's and b's that has length divisible by 3

Answer:

If S contains all possible strings of a & b of length 3, then all the words in S* will have length divisible by 3 and will include any concatenation of a's and b's (because S did).

By the product rule, there are 2*2*2 = 8 possible words of length 3:

S = {aaa aab aba baa abb bba bab bbb}

Question 10: What are the information requirements for operational level in Accounting & financial Information Systems.

Answer:

Operational Level Requirements in Accounting & financial Information Systems