The negation of "Some students like hockey" is:

A relation '𝑅 ' is defined on ordered pairs of integers as: \((𝑥,𝑦)𝑅(𝑢,𝑣)\) if \(𝑥<𝑢\) and \(𝑦>𝑣\). Then \(𝑅\) is

Suppose you are married and you and your partner attend a party with three other married couples. Several handshakes took place. No one shook hands with himself (or herself) or with their partner, and no one shook hands with the same person more than once. After all hand shaking was completed, suppose you asked each person, including your partner, how many hands they had shaken. Each person gave a different answer. How many hands did your spouse shake?

Consider the following conditional code, which returns a Boolean values

if ((𝑥 > 25)&&(𝑦 > 100))
    return 'false';
else iff (𝑥 ≤ 25)&&&(𝑦 ≤ 100))
    return 'true';
else iff (𝑥 > 25) && (𝑦 ≤ 100))
    return 'false';
else
    return 'true';

Simplify it by filling in the following blank with a single Boolean expression without changing the behaviour of the conditional code.

if (_ _ _ _ _ _ _ _ _)
    return 'true';
else
    return 'false';

Which one of the following types of memory is fastest

The memory size for n address lines and m data lines is given by

Simplify the following using K-Map

\(\mathrm{F}(\mathrm{A}, \mathrm{B}, \mathrm{C}, \mathrm{D})=\sum(0,2,5,7,8,10,13,15)\)

Consider an unpipelined machine with 10nsec clock cycles which uses four cycles for ALU operations and branches where as five cycles for memory operation. Assume that the relative frequencies of these operations are: 40%,20% and 40%, respectively. Due to clock skew and setup pipeline let us consider that the machine adds one nsec overhead to the clock. How much speedup is observed in the instruction execution rate when a pipelined machine is considered.

Machine Level Language is a/an

Which of the following is wrong about the data types?

If a constructor 'Date' is declared explicitly and has to be defined outside the class, which of the following is correct?

Which one of the following allows the session to continue?

Overfitting is expected when we observe that?

Identify the incorrect statement(s).

Consider the two relations below. The primary keys are underlined. Identify all possible foreign key(s) from the options based only on the two relations.
EMP (eid, ename, did)
DEPT (did, dname)

Which of the following statement is correct, according to the following instance of the relational schema R(X,Y,Z)?

In Linux Operating System, when ___________is invoked, it is passed a set of flags that determine how much sharing is to take place between the parent and child tasks.

The main function of the microkernel is to provide a communication facility between the program and the various that are also running in user space.

Consider an operating system capable of loading and executing a single sequential user process at a time. The disk head scheduling algorithm used is first come first served (FCFS). If (FCFS) is replaced by shortest seek time first (SSTF) and the vendor claims 50% better benchmark results. What is the expected improvement in the I/O performance of user programs?

For the following set of processes scheduled using FCFS policy, determine the average waiting time. Assume that the processes arrived in the order P1, P2, P3, P4.

Which of the following is not a Non functional requirement?

 COCOMO stands for

Modifying the software to match changes in the ever changing environment is called as

For a function of two variables, boundary value analysis yields,

How many different trees are possible with \(' 𝑛 '\) nodes?

Let \(' 𝑛 '\) denote a positive integer. Suppose a function \(F\) is defined as

\(f(n)=\left\{\begin{aligned} 0, & n=1 \\ f\left(\left\lfloor\frac{n}{2}\right\rfloor+1\right), & n>1\end{aligned}\right.\)

What is \(𝑓(25)\) ? and what does this function find?

Given the FFT we can have time procedure for multiplying two polynomials A(x) and B(x) of degree bound n where input and output representations are in coefficient form, assuming n is a power of 2.

Consider the Graph below:

How many spanning trees can be found?

The transition function ' 𝛿 ' in multi-tape Turing machine is defined as:

In Pumping Lemma for regular languages, to say a language is satisfying pumping lemma, what is the minimum length of ' y ' if you consider the string as ' xyz '.

The item generated by the production \(𝐴 → 𝜀\) is :

In the \(𝜀-NFA, 𝑀=(\{q0,q1,q2,q3\},\{a\},𝛿,q0,\{q3\})\) where \(' 𝛿 '\) is given in the transition table below, what is the minimum length of string to reach to the final state?

Given Ethernet address 010110100001000101010101000110001010101000001111 in binary, what is the address in hexadecimal notation?

A Computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2Mbps. It is initially filled to capacity with 16 megabits. What is the maximum duration for which the computer can transmit at the full 10Mbps?

In the standard Ethernet with transmission rate of 10Mbps, assume that the length of the medium is 2500 m and size of a frame is 512 bytes. The propagation speed of a signal in a cable is normally 2×10⁸ m/s. Calculate Transmission delay and propagation delay.

In CRC coding if the data word is 111111, divisor is 1010 and the remainder is 110. Which of the following code is true?

The A^∗ algorithm is optimal when,

Which Artificial intelligence technique enables the computers to understand the associations and relationships between objects & Events?

Where does the values of alpha-beta search get updated?

A 4-input neuron has weights 1,2,3,4. The transfer function is linear with the constant of proportionality being equal to 3. The inputs are 5,7,10,30, respectively

Then the output will be,

Consider the following statements:

P: There exists no simple, undirected and connected graph with 80 vertices and 77 edges.

Q: All vertices of Euler graph are of even degree.

R: Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one.

S : There exits a bipartite graph with more than ten vertices which is 2-colorable.

What is the number of correct statements among the above statements.

Consider the following statements:

A. There exists a Boolean algebra with ′5′ elements.

B. Every element of Boolean algebra has unique complement.

C. If a Lattice ' L ' is a Boolean algebra then ' L ' is not relatively complemented.

D. The direct product of two Boolean Algebras is also a Boolean algebra

Choose the correct answer about the four statements given above.

Which of the statement is not true in regards to virtual memory?

Which of the following is/are true for Dynamic RAM (DRAM)?

A. It is slower than static RAM(SRAM)

B. Packing Density is higher than Static RAM (SRAM)

C. It is faster than static RAM(SRAM)

D. It requires data refreshing

Choose the correct answer from the options given below:

Which of the following statement is/are false?

A. The processor has direct access to both primary and secondary memory

B. Primary memory stores the active instructions and data for the program being executed on the process

C. Secondary memory is used as a backup memory

D. Memory system is implemented on a single level memory

Choose the correct answer from the options given below:

Given a vector with cartesian components \((x, y)\), if scaling is done with matrix \(\left[\begin{array}{cc}0.5 & 0 \\ 0 & 1.5\end{array}\right]\), which of the following are true.

A. Decreases the vertical by three halves

B. Increases the vertical by three halves

C. Doubles the horizontal

D. Halves the horizontal

Choose the correct answer from the options given below:

Which of the following lists defined in HTML share similar elements?

A. Unordered lists

B. Ordered lists

C. Definition Lists

D. Corelated lists

E. Enumerated lists

Choose the most appropriate answer from the options given below:

What are the drawbacks of using file systems to store data?

A. Data inconsistency

B. Difficulty in accessing data

C. Data isolation

D. Atomicity of updates

Choose the correct answer from the options given below:

Which of the following database model, we have a parent-child relationship

A. hierarchical databases
B. network databases
C. relational databases

Choose the correct answer from the options below:

Identify the correct operation which produces the below given output based on two relations R1 and R2.

R1

R2

Output:

Choose the correct answer from the options below:

Which of the following statements are true?

A. Shortest remaining time first scheduling may cause starvation
B. Preemptive scheduling may cause starvation
C. Round robin is better than FCFS in terms of response time

Choose the correct answer from the options given below:

In design protocol of critical section problem, each process must ask permission to enter critical section in ________ code; it then executes in the critical section; once it finishes executes in the critical section it enters the_________  code. The process then enters the ________ code.

How do you create agile processes to manage unpredictability?

A. Requirements gathering must be conducted very carefully.

B. Risk analysis must be conducted before planning takes place.

C. Software increments must be delivered in short time periods.

D. Software processes must not adapt to changes incrementally.

Choose the correct answer from the options given below:

Software project manager is responsible for the following tasks:

A. Project Planning

B. Project status tracking

C. Resource management

D. Risk management

E. Project delivery within time & budget.

Choose the correct answer from the options given below:

Mr. X designed open source software which must comply with some criteria. Choose the false statement in respect of above.

A. No restriction on redistribution of the software as part or whole.
B. The integrity of the author's source code must be maintained.
C. The software can be sold after distribution.

Choose the correct answer from the options given below:

Circuit satisfiability problem: Given a Boolean combinatorial circuit composed of AND, OR and NOT gates, is it satisfiable? A one output Boolean combinatorial circuit is satisfiable means for the given inputs the output will be 1.

A. The circuit satisfiability problem belongs to class NP

B. The circuit satisfiability problem is at least as hard as any language in NP

C. The circuit satisfiability is NP-Complete

D. The size of the circuit is Θ(K²+1)

E. If P≠NP, this situation would contradict the NP-Completeness of the problem.

Choose the correct answer from the options given below:

Given an expression

(A+B∗D)/(E−F)+G

A. The prefix notation is +/+A∗DB−EFG

B. The prefix expression is the reverse of the postfix expression

C. The order of operands in infix expression and postfix expression are the same.

D. The order of operands in infix expression, prefix expression and postfix expression are the same.

Choose the most appropriate answer from the options given below:

Which of the following is (are) correct about the regular expression?

\(a a^{*} b b^{*} c c^{*} d d^{*}\)

A. The language for the given expression is:

\(\mathrm{L}=\left\{\mathrm{a}^{\mathrm{n}} \mathrm{b}^{\mathrm{n}} \mathrm{c}^{\mathrm{m}} \mathrm{d}^{\mathrm{m}} \mid \mathrm{n} \geq 1, \mathrm{~m} \geq 1\right\} \mathrm{U}\left\{\mathrm{a}^{\mathrm{n}} \mathrm{b}^{\mathrm{m}} \mathrm{c}^{\mathrm{m}} \mathrm{d}^{\mathrm{n}} \mid \mathrm{n} \geq 1, \mathrm{~m} \geq 1\right\}\)

B. The Context Free Language for the given expression is:

\(\begin{array}{l} \mathrm{S} \rightarrow \mathrm{AB} \mid \mathrm{C} \\ \mathrm{A} \rightarrow \mathrm{aAb} \mid \mathrm{ab} \\ \mathrm{B} \rightarrow \mathrm{cBd} \mid \mathrm{cd} \\ \mathrm{C} \rightarrow \mathrm{aCd} \mid \mathrm{aDd} \\ \mathrm{D} \rightarrow \mathrm{bDc} \mid \mathrm{bc} \end{array}\)

C. The language generated by this expression is equal number of \(′𝑎′𝑠\), followed by equal number of \(′𝑏′𝑠\), followed by equal number of \(′𝑐′𝑠\) and followed by equal number of \(′𝑑′𝑠\).

Choose the correct answer from the options given below:

Which of the following statements are correct?

A. The first three-address instruction in the intermediate code is a leader.

B. The instruction which is exactly at the middle of the given three address code is a leader.

C. Any instruction that is the target of a conditional or unconditional jump is a leader.

D. Any instruction that immediately follows a conditional or unconditional jump is a leader.

Choose the correct answer from the options given below:

Which of the following are correct on regular expressions?

A. \(\varphi+\mathrm{L}=\mathrm{L}+\varphi=\mathrm{L}\)

B. \(\varepsilon \mathrm{L}=\mathrm{L} \varepsilon=\mathrm{L}\)

C. \(\varphi \mathrm{L}=\mathrm{L} \varphi=\varphi\)

D. \(\varphi \mathrm{L}=\mathrm{L} \varphi=\mathrm{L}\)

Choose the correct answer from the options given below:

Consider two hosts P and Q are connected through a router R. The maximum transfer unit (MTU) value of the link between P and R is 1500 bytes and between R and Q is 820 bytes. A TCP segment of size of 1400 bytes is transferred from P to Q through R with IP identification value of 0×1234. Assume that IP header size is 20 bytes. Further the packet is allowed to be fragmented that is Don't Fragment (DF) flag in the IP Header is not set by P. which of the following statement is/are true

A. Two fragments are created at R and IP datagram size carrying the second fragment is 620 bytes

B. If the second fragment is lost then R resend the fragment with IP Identification value of 0×1234

C. If the second fragment lost then P required to resend the entire TCP segment

D. TCP destination port can be determined by analyzing the second fragment only

Choose the correct answer from the options given below:

The Solution to Silly Window Syndrome problem is/are:

A. Nagle's Algorithm

B. Clark's Algorithm

C. Jacobson's Algorithm

D. Piggy backing Algorithm

Choose the correct answer from the options given below:

Which AI System mimics the evolutionary process to generate increasingly better solutions to a process to a problem?

A. Self organizing neural network.

B. Back propagation neural network.

C. Genetic algorithm.

D. Forward propagation neural network.

Choose the correct answer from the options given below:

Consider the following Learning algorithms.

A. Logistic regression.

B. Back propagation.

C. Linear regression.

D. Forward propagation.

Which of the following options represents classification algorithm?

Choose the correct answer from the options given below:

Which Boolean operation on two variables can be represented by a single perception layer?

A. X1 AND X2

B. X1 OR X2

C. X1 NOR X2

D. X1 XOR X2

Choose the most appropriate answer from the options given below:

Match List I with List II

Choose the correct answer from the options given below:

Match List I with List II

Choose the correct answer from the options given below:

Match List I with List II

Choose the correct answer from the options given below:

Match List I and List II

Choose the correct answer from the options given below:

Match List I with List II

Choose the correct answer from the options given below:

Match List I with List II

Choose the correct answer from the options given below:

Match List I with List II

Choose the correct answer from the options given below:

Match the following based on the language accepted by using brute force method of parsing.

Choose the correct answer from the options given below:

Match List I with List II

Choose the correct answer from the options given below:

Match List I with List II

Choose the correct answer from the options given below:

Consider the statements:

A. There does not exist a polynomial time algorithm to solve integer linear programming problem.
B. Main focus of PERT is 'minimizing time'.

Choose the correct option about the statements A and B.

The correct sequence in fetch-execute cycle is

A. Decode
B. Fetch
C. Execute

Chose the correct answer from the following

In what sequence the initialization, testing and execution of body is done while using do-while loop?

A. Commenting

B. Execution of the body

C. Initialisation

D. Testing the condition

Choose the correct answer from the following

Select the correct order of DBSCAN algorithm.

A. Find recursively all its density connected points and assign them to the same cluster as the core point.

B. Find all the neighbor points with eps and identify the core points with more than MinPts neighbors.

C. Iterate through the remaining unvisited pointed in the dataset.

D. For each core point if it is not already assigned to a cluster, create a new cluster.

Choose the correct answer from the following :

Select the correct order of events after power is initialized on a system.

A. Bootstrap loader is loaded from the disk
B. Kernel is loaded onto the memory
C. Firmware ROM loads boot block

Choose the correct answer from the options given below:

Given below are two statements: one is labeled as Assertion A and the other is labelled as Reason R.

Assertion A: Cohesion is a qualitative indication of the degree to which a module can be written more compactly and is able to complete its function in a timely manner.

Reason R: Cohesion is a qualitative indication of the degree to which a module is connected to other modules and the outside world.

In the light of the above statements, choose the most appropriate answer from the options given below.

Given the graph below which one of the following edges cannot be added in that order to find a minimum spanning tree uses algorithm.

A. a-b

B. d-f

C. b-f

D. d-c

E. d-e

Choose the correct answer from the options given below:

What is the safest order while simplifying Context Free Grammar?

Rearrange the following sequence in the context of OSI Layers:

A. Transforming the raw bits in the form of frame for transmission

B. Transmission of raw bits over communication channel

C. Handling user interfaces

D. Control and monitoring of subnet

E. Transmission data through connection oriented or connection less using datagrams

Choose the correct answer from the options given below:

Choose the correct option describing the features of Artificial neural network

A. It is essentially machine learning algorithm.

B. It is useful when solving the problems for which the data set is very large.

C. They are able to extract features without input from the programmer.

D. These are systems modeled on the human brain and nervous system

Choose the correct answer from the options given below:

Four persons: P, Q, R and S are in police custody and one of them has committed a crime. They confess as follows:

A. Person P: Q did it.

B. Person Q : S did it.

C. Person R: I did not do it.

D. Person S : Q lied.

If exactly one of the statements is false, which of the following is the guilty person.

Assertion A: A Raster scan device is a CRT graphic device and can use a television monitor for display

Reason R: In Raster scan display the picture is composed of a series of dots. These dots are traced out as a series of horizontal lines. Television works in a similar fashion.

In the light of the above statements, choose the correct answer from the options given below:

An OS follows round-robin scheduling with time quantum of 4 ms. Assuming that the CPU is free now and there are 20 processes waiting in the ready queue, the maximum amount of time that a process waits before getting into the CPU is

Statement 1:
Given a graph G=(V,E) in which each vertex v∈V has an associated positive weight w(v), we can use linear programming to find the lower bound on the weight of the minimum-weight vertex cover.
 

Statement 2:
The lower bound can be found by maximizing the following

\(\sum_{v \in V}^{n} \mathrm{w}(v) \mathrm{x}(v)\)

\(\text { subject to }\)

\(x(u)+x(v) \geq 1 \text { for each }(u, v) \in V\)

\(\quad x(v) \leq 1 \text { for each } v \in V\)

\(\quad x(v) \geq 0 \text { for each } v \in V\)

In the light of the above statements, choose the most appropriate answer from the options given below:

A TCP Server application is programmed to listen on port P on Host S. A TCP Client is connected to the TCP Server over the network. Considered that while TCP Connection is active the server is crashed and rebooted. Assume that the client does not use TCP keepalive timer. Which of the following behaviours is/are possible?

Statement I:
If client is waiting to receive a packet, it may wait indefinitely
 

Statement II:
If the client sends a packet after the server reboot, it will receive the FIN segment
In the light of the above statements, choose the correct answer from the options given below

An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets. 

Find the number of addresses in each subnet

An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets.

Find the subnet prefix.

An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets.

Find first and last addresses of First subnet.

An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets. .

Find first and last addresses of last subnet.

An organization is granted the block 130.56.0.0/16. The administrator wants to create 1024 subnets.

Find subnet mask.

A Turing Machine for the language \(\mathrm{L}=\left\{\mathrm{a}^{\mathrm{n}} \mathrm{b}^{\mathrm{m}} \mathrm{c}^{\mathrm{n}} \mathrm{d}^{\mathrm{m}} \mid \mathrm{n} \geq 1, \mathrm{~m} \geq 1\right\}\) is designed. The resultant model is \(M =\)\(\left(\left\{\mathrm{q}_{0}, \mathrm{q}_{1}, \mathrm{q}_{2}, \mathrm{q}_{3}, \mathrm{q}_{4}, \mathrm{q}_{5}, \mathrm{q}_{6}, \mathrm{q}_{7}, \mathrm{q}_{\mathrm{f}}\right\},\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}\},\left\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}, \mathrm{X}_{1}, \mathrm{X}_{2}, \mathrm{Y}_{1}, \mathrm{Y}_{2}\right\}, \delta, \mathrm{q}_{0}, \mathrm{~B},\left\{\mathrm{q}_{\mathrm{f}}\right\}\right)\) and part of \(' 𝛿 '\) is given in the transition table. You need to write the following questions based on design of Turing Machine for the given language. Note that, while designing the Turing Machine \(X_1\) and \(X_2\) are used to work with \(′𝑎′𝑠\) and \(′𝑐′𝑠\) and \(Y_1\) and \(Y_2\) are used to handle \(′𝑏′𝑠\) and \(′𝑑′𝑠\) of the given string.

\(\begin{array}{|c|c|c|c|c|c|c|c|c|c|} \hline & \mathrm{a} & \mathrm{b} & \mathrm{c} & \mathrm{d} & \mathrm{X}_{1} & \mathrm{X}_{2} & \mathrm{Y}_{1} & \mathrm{Y}_{2} & \mathrm{~B} \\ \hline \mathrm{q}_{0} & \left(\mathrm{q}_{1}, \mathrm{X}_{1}, \mathrm{R}\right) & & & & \mathrm{M} 2 & & & & \\ \hline \mathrm{q}_{1} & \left(\mathrm{q}_{1}, \mathrm{a}, \mathrm{R}\right) & \left(\mathrm{q}_{1}, \mathrm{~b}, \mathrm{R}\right) & \mathrm{M} 1 & & & \left(\mathrm{q}_{1}, \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{2} & \left(\mathrm{q}_{2}, \mathrm{a}, \mathrm{L}\right) & \left(\mathrm{q}_{2}, \mathrm{~b}, \mathrm{~L}\right) & & & \left(\mathrm{q}_{2}, \mathrm{X}_{1}, \mathrm{R}\right) & \left(\mathrm{q}_{2}, \mathrm{X}_{2}, \mathrm{~L}\right) & & & \\ \hline \mathrm{q}_{3} & \mathrm{M} 3 & \left(\mathrm{q}_{4}, \mathrm{Y}_{1}, \mathrm{R}\right) & & & & \left(\mathrm{q}_{6} \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{4} & & \left(\mathrm{q}_{4}, \mathrm{~b}, \mathrm{R}\right) & & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & & \mathrm{M} 5 & & \left(\mathrm{q}_{4}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{5} & & \left(\mathrm{q}_{5}, \mathrm{~b}, \mathrm{~L}\right) & & & & \left(\mathrm{q}_{5}, \mathrm{X}_{2}, \mathrm{~L}\right) & \mathrm{M} 4 & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & \\ \hline \mathrm{q}_{6} & & & & & & \left(\mathrm{q}_{6}, \mathrm{X}_{2}, \mathrm{R}\right) & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{7} & & & & & & & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \left(\mathrm{q}_{6}, \mathrm{~B}, \mathrm{R}\right) \\ \hline \end{array}\)

What is the Move in the cell with number \(' M1 '\) of the resultant Table?

 A Turing Machine for the language \(\mathrm{L}=\left\{\mathrm{a}^{\mathrm{n}} \mathrm{b}^{\mathrm{m}} \mathrm{c}^{\mathrm{n}} \mathrm{d}^{\mathrm{m}} \mid \mathrm{n} \geq 1, \mathrm{~m} \geq 1\right\}\) is designed. The resultant model is \(M =\)\(\left(\left\{\mathrm{q}_{0}, \mathrm{q}_{1}, \mathrm{q}_{2}, \mathrm{q}_{3}, \mathrm{q}_{4}, \mathrm{q}_{5}, \mathrm{q}_{6}, \mathrm{q}_{7}, \mathrm{q}_{\mathrm{f}}\right\},\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}\},\left\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}, \mathrm{X}_{1}, \mathrm{X}_{2}, \mathrm{Y}_{1}, \mathrm{Y}_{2}\right\}, \delta, \mathrm{q}_{0}, \mathrm{~B},\left\{\mathrm{q}_{\mathrm{f}}\right\}\right)\) and part of \(' 𝛿 '\) is given in the transition table. You need to write the following questions based on design of Turing Machine for the given language. Note that, while designing the Turing Machine \(X_1\) and \(X_2\) are used to work with \(′𝑎′𝑠\) and \(′𝑐′𝑠\) and \(Y_1\) and \(Y_2\) are used to handle \(′𝑏′𝑠\) and \(′𝑑′𝑠\) of the given string.

\(\begin{array}{|c|c|c|c|c|c|c|c|c|c|} \hline & \mathrm{a} & \mathrm{b} & \mathrm{c} & \mathrm{d} & \mathrm{X}_{1} & \mathrm{X}_{2} & \mathrm{Y}_{1} & \mathrm{Y}_{2} & \mathrm{~B} \\ \hline \mathrm{q}_{0} & \left(\mathrm{q}_{1}, \mathrm{X}_{1}, \mathrm{R}\right) & & & & \mathrm{M} 2 & & & & \\ \hline \mathrm{q}_{1} & \left(\mathrm{q}_{1}, \mathrm{a}, \mathrm{R}\right) & \left(\mathrm{q}_{1}, \mathrm{~b}, \mathrm{R}\right) & \mathrm{M} 1 & & & \left(\mathrm{q}_{1}, \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{2} & \left(\mathrm{q}_{2}, \mathrm{a}, \mathrm{L}\right) & \left(\mathrm{q}_{2}, \mathrm{~b}, \mathrm{~L}\right) & & & \left(\mathrm{q}_{2}, \mathrm{X}_{1}, \mathrm{R}\right) & \left(\mathrm{q}_{2}, \mathrm{X}_{2}, \mathrm{~L}\right) & & & \\ \hline \mathrm{q}_{3} & \mathrm{M} 3 & \left(\mathrm{q}_{4}, \mathrm{Y}_{1}, \mathrm{R}\right) & & & & \left(\mathrm{q}_{6} \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{4} & & \left(\mathrm{q}_{4}, \mathrm{~b}, \mathrm{R}\right) & & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & & \mathrm{M} 5 & & \left(\mathrm{q}_{4}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{5} & & \left(\mathrm{q}_{5}, \mathrm{~b}, \mathrm{~L}\right) & & & & \left(\mathrm{q}_{5}, \mathrm{X}_{2}, \mathrm{~L}\right) & \mathrm{M} 4 & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & \\ \hline \mathrm{q}_{6} & & & & & & \left(\mathrm{q}_{6}, \mathrm{X}_{2}, \mathrm{R}\right) & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{7} & & & & & & & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \left(\mathrm{q}_{6}, \mathrm{~B}, \mathrm{R}\right) \\ \hline \end{array}\)

What is the Move in the cell with number \('M2'\) of the resultant Table?

 A Turing Machine for the language \(\mathrm{L}=\left\{\mathrm{a}^{\mathrm{n}} \mathrm{b}^{\mathrm{m}} \mathrm{c}^{\mathrm{n}} \mathrm{d}^{\mathrm{m}} \mid \mathrm{n} \geq 1, \mathrm{~m} \geq 1\right\}\) is designed. The resultant model is \(M =\)\(\left(\left\{\mathrm{q}_{0}, \mathrm{q}_{1}, \mathrm{q}_{2}, \mathrm{q}_{3}, \mathrm{q}_{4}, \mathrm{q}_{5}, \mathrm{q}_{6}, \mathrm{q}_{7}, \mathrm{q}_{\mathrm{f}}\right\},\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}\},\left\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}, \mathrm{X}_{1}, \mathrm{X}_{2}, \mathrm{Y}_{1}, \mathrm{Y}_{2}\right\}, \delta, \mathrm{q}_{0}, \mathrm{~B},\left\{\mathrm{q}_{\mathrm{f}}\right\}\right)\) and part of \(' 𝛿 '\) is given in the transition table. You need to write the following questions based on design of Turing Machine for the given language. Note that, while designing the Turing Machine \(X_1\) and \(X_2\) are used to work with \(′𝑎′𝑠\) and \(′𝑐′𝑠\) and \(Y_1\) and \(Y_2\) are used to handle \(′𝑏′𝑠\) and \(′𝑑′𝑠\) of the given string.

\(\begin{array}{|c|c|c|c|c|c|c|c|c|c|} \hline & \mathrm{a} & \mathrm{b} & \mathrm{c} & \mathrm{d} & \mathrm{X}_{1} & \mathrm{X}_{2} & \mathrm{Y}_{1} & \mathrm{Y}_{2} & \mathrm{~B} \\ \hline \mathrm{q}_{0} & \left(\mathrm{q}_{1}, \mathrm{X}_{1}, \mathrm{R}\right) & & & & \mathrm{M} 2 & & & & \\ \hline \mathrm{q}_{1} & \left(\mathrm{q}_{1}, \mathrm{a}, \mathrm{R}\right) & \left(\mathrm{q}_{1}, \mathrm{~b}, \mathrm{R}\right) & \mathrm{M} 1 & & & \left(\mathrm{q}_{1}, \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{2} & \left(\mathrm{q}_{2}, \mathrm{a}, \mathrm{L}\right) & \left(\mathrm{q}_{2}, \mathrm{~b}, \mathrm{~L}\right) & & & \left(\mathrm{q}_{2}, \mathrm{X}_{1}, \mathrm{R}\right) & \left(\mathrm{q}_{2}, \mathrm{X}_{2}, \mathrm{~L}\right) & & & \\ \hline \mathrm{q}_{3} & \mathrm{M} 3 & \left(\mathrm{q}_{4}, \mathrm{Y}_{1}, \mathrm{R}\right) & & & & \left(\mathrm{q}_{6} \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{4} & & \left(\mathrm{q}_{4}, \mathrm{~b}, \mathrm{R}\right) & & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & & \mathrm{M} 5 & & \left(\mathrm{q}_{4}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{5} & & \left(\mathrm{q}_{5}, \mathrm{~b}, \mathrm{~L}\right) & & & & \left(\mathrm{q}_{5}, \mathrm{X}_{2}, \mathrm{~L}\right) & \mathrm{M} 4 & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & \\ \hline \mathrm{q}_{6} & & & & & & \left(\mathrm{q}_{6}, \mathrm{X}_{2}, \mathrm{R}\right) & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{7} & & & & & & & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \left(\mathrm{q}_{6}, \mathrm{~B}, \mathrm{R}\right) \\ \hline \end{array}\)

What is the Move in the cell with number \('M3'\) of the resultant Table?

 A Turing Machine for the language \(\mathrm{L}=\left\{\mathrm{a}^{\mathrm{n}} \mathrm{b}^{\mathrm{m}} \mathrm{c}^{\mathrm{n}} \mathrm{d}^{\mathrm{m}} \mid \mathrm{n} \geq 1, \mathrm{~m} \geq 1\right\}\) is designed. The resultant model is \(M =\)\(\left(\left\{\mathrm{q}_{0}, \mathrm{q}_{1}, \mathrm{q}_{2}, \mathrm{q}_{3}, \mathrm{q}_{4}, \mathrm{q}_{5}, \mathrm{q}_{6}, \mathrm{q}_{7}, \mathrm{q}_{\mathrm{f}}\right\},\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}\},\left\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}, \mathrm{X}_{1}, \mathrm{X}_{2}, \mathrm{Y}_{1}, \mathrm{Y}_{2}\right\}, \delta, \mathrm{q}_{0}, \mathrm{~B},\left\{\mathrm{q}_{\mathrm{f}}\right\}\right)\) and part of \(' 𝛿 '\) is given in the transition table. You need to write the following questions based on design of Turing Machine for the given language. Note that, while designing the Turing Machine \(X_1\) and \(X_2\) are used to work with \(′𝑎′𝑠\) and \(′𝑐′𝑠\) and \(Y_1\) and \(Y_2\) are used to handle \(′𝑏′𝑠\) and \(′𝑑′𝑠\) of the given string.

\(\begin{array}{|c|c|c|c|c|c|c|c|c|c|} \hline & \mathrm{a} & \mathrm{b} & \mathrm{c} & \mathrm{d} & \mathrm{X}_{1} & \mathrm{X}_{2} & \mathrm{Y}_{1} & \mathrm{Y}_{2} & \mathrm{~B} \\ \hline \mathrm{q}_{0} & \left(\mathrm{q}_{1}, \mathrm{X}_{1}, \mathrm{R}\right) & & & & \mathrm{M} 2 & & & & \\ \hline \mathrm{q}_{1} & \left(\mathrm{q}_{1}, \mathrm{a}, \mathrm{R}\right) & \left(\mathrm{q}_{1}, \mathrm{~b}, \mathrm{R}\right) & \mathrm{M} 1 & & & \left(\mathrm{q}_{1}, \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{2} & \left(\mathrm{q}_{2}, \mathrm{a}, \mathrm{L}\right) & \left(\mathrm{q}_{2}, \mathrm{~b}, \mathrm{~L}\right) & & & \left(\mathrm{q}_{2}, \mathrm{X}_{1}, \mathrm{R}\right) & \left(\mathrm{q}_{2}, \mathrm{X}_{2}, \mathrm{~L}\right) & & & \\ \hline \mathrm{q}_{3} & \mathrm{M} 3 & \left(\mathrm{q}_{4}, \mathrm{Y}_{1}, \mathrm{R}\right) & & & & \left(\mathrm{q}_{6} \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{4} & & \left(\mathrm{q}_{4}, \mathrm{~b}, \mathrm{R}\right) & & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & & \mathrm{M} 5 & & \left(\mathrm{q}_{4}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{5} & & \left(\mathrm{q}_{5}, \mathrm{~b}, \mathrm{~L}\right) & & & & \left(\mathrm{q}_{5}, \mathrm{X}_{2}, \mathrm{~L}\right) & \mathrm{M} 4 & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & \\ \hline \mathrm{q}_{6} & & & & & & \left(\mathrm{q}_{6}, \mathrm{X}_{2}, \mathrm{R}\right) & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{7} & & & & & & & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \left(\mathrm{q}_{6}, \mathrm{~B}, \mathrm{R}\right) \\ \hline \end{array}\)

What is the Move in the cell with number \('M4'\) of the resultant Table?

 A Turing Machine for the language \(\mathrm{L}=\left\{\mathrm{a}^{\mathrm{n}} \mathrm{b}^{\mathrm{m}} \mathrm{c}^{\mathrm{n}} \mathrm{d}^{\mathrm{m}} \mid \mathrm{n} \geq 1, \mathrm{~m} \geq 1\right\}\) is designed. The resultant model is \(M =\)\(\left(\left\{\mathrm{q}_{0}, \mathrm{q}_{1}, \mathrm{q}_{2}, \mathrm{q}_{3}, \mathrm{q}_{4}, \mathrm{q}_{5}, \mathrm{q}_{6}, \mathrm{q}_{7}, \mathrm{q}_{\mathrm{f}}\right\},\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}\},\left\{\mathrm{a}, \mathrm{b}, \mathrm{c}, \mathrm{d}, \mathrm{X}_{1}, \mathrm{X}_{2}, \mathrm{Y}_{1}, \mathrm{Y}_{2}\right\}, \delta, \mathrm{q}_{0}, \mathrm{~B},\left\{\mathrm{q}_{\mathrm{f}}\right\}\right)\) and part of \(' 𝛿 '\) is given in the transition table. You need to write the following questions based on design of Turing Machine for the given language. Note that, while designing the Turing Machine \(X_1\) and \(X_2\) are used to work with \(′𝑎′𝑠\) and \(′𝑐′𝑠\) and \(Y_1\) and \(Y_2\) are used to handle \(′𝑏′𝑠\) and \(′𝑑′𝑠\) of the given string.

\(\begin{array}{|c|c|c|c|c|c|c|c|c|c|} \hline & \mathrm{a} & \mathrm{b} & \mathrm{c} & \mathrm{d} & \mathrm{X}_{1} & \mathrm{X}_{2} & \mathrm{Y}_{1} & \mathrm{Y}_{2} & \mathrm{~B} \\ \hline \mathrm{q}_{0} & \left(\mathrm{q}_{1}, \mathrm{X}_{1}, \mathrm{R}\right) & & & & \mathrm{M} 2 & & & & \\ \hline \mathrm{q}_{1} & \left(\mathrm{q}_{1}, \mathrm{a}, \mathrm{R}\right) & \left(\mathrm{q}_{1}, \mathrm{~b}, \mathrm{R}\right) & \mathrm{M} 1 & & & \left(\mathrm{q}_{1}, \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{2} & \left(\mathrm{q}_{2}, \mathrm{a}, \mathrm{L}\right) & \left(\mathrm{q}_{2}, \mathrm{~b}, \mathrm{~L}\right) & & & \left(\mathrm{q}_{2}, \mathrm{X}_{1}, \mathrm{R}\right) & \left(\mathrm{q}_{2}, \mathrm{X}_{2}, \mathrm{~L}\right) & & & \\ \hline \mathrm{q}_{3} & \mathrm{M} 3 & \left(\mathrm{q}_{4}, \mathrm{Y}_{1}, \mathrm{R}\right) & & & & \left(\mathrm{q}_{6} \mathrm{X}_{2}, \mathrm{R}\right) & & & \\ \hline \mathrm{q}_{4} & & \left(\mathrm{q}_{4}, \mathrm{~b}, \mathrm{R}\right) & & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & & \mathrm{M} 5 & & \left(\mathrm{q}_{4}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{5} & & \left(\mathrm{q}_{5}, \mathrm{~b}, \mathrm{~L}\right) & & & & \left(\mathrm{q}_{5}, \mathrm{X}_{2}, \mathrm{~L}\right) & \mathrm{M} 4 & \left(\mathrm{q}_{5}, \mathrm{Y}_{2}, \mathrm{~L}\right) & \\ \hline \mathrm{q}_{6} & & & & & & \left(\mathrm{q}_{6}, \mathrm{X}_{2}, \mathrm{R}\right) & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \\ \hline \mathrm{q}_{7} & & & & & & & & \left(\mathrm{q}_{7}, \mathrm{Y}_{2}, \mathrm{R}\right) & \left(\mathrm{q}_{6}, \mathrm{~B}, \mathrm{R}\right) \\ \hline \end{array}\)

What is the Move in the cell with number \('M5'\) of the resultant Table?