Identify the number of distinct string of length 2 of the combinations of blue and yellow beads. The both ends of the strings are not marked due to this they are indistinguishable if interchanging the ends of one will results other. Denote \(b\) and \(y\) as a blue and yellow beads. Let us consider \(bb\), \(by\), \(yb\) and \(yy\) are the four different strings of length 2 when equivalence between strings is not taken into the consideration. The number of equivalent classes into which the set \(s = (bb, by, yb, yy)\) is divided by equivalent relation induced by the group of permutation \([\{\Pi_{1}, \Pi_{2}\}, 0]\) where : \(\Pi_{1} = \begin{pmatrix} bb & by & yb & yy \\ bb & by & yb & yy \end{pmatrix}\) \(\Pi_{2} = \begin{pmatrix} bb & by & yb & yy \\ bb & yb & by & yy \end{pmatrix}\)
3
The permutation \(\Pi_{1}\) is the identity, which leaves every string unchanged, and \(\Pi_{2}\) reverses each string, so it swaps \(by\) and \(yb\) while keeping \(bb\) and \(yy\) fixed.
By Burnside's lemma, the number of equivalence classes equals the average number of elements fixed by the permutations of the group: \(N = \frac{1}{|G|}\sum_{\pi \in G} \psi(\pi)\).
The identity fixes all four strings, so \(\psi(\Pi_{1}) = 4\). The reversal fixes only \(bb\) and \(yy\), so \(\psi(\Pi_{2}) = 2\).
Therefore \(N = \frac{4 + 2}{2} = 3\).
Check: listing the classes directly gives \(\{bb\}\), \(\{by, yb\}\) and \(\{yy\}\), which is exactly 3 distinct strings of beads.
Hence, 3.
Let \(\varphi, \psi\) be the formula, \(\varphi \models \Psi\), if and only if \(\varphi \models \Psi\) is a :
Which of the following relations defined on X = {1, 2, 3} is an equivalent relation ?
A rod is divided into six segment is to be colored with one or more of 4 different colors. In how many ways can this be done ?
Consider the following linear programming problem : Maximize \(z = 5x_{1} + 2x_{2} + 3x_{3} - x_{4} + x_{5}\) Subject to : \(x_{1} + 2x_{2} + 2x_{3} + x_{4} = 8\), \(3x_{1} + 4x_{2} + x_{3} + x_{5} = 7\), \(x_{1}, x_{2}, x_{3}, x_{4}, x_{5} \geq 0\) What will be the basic feasible solution after iteration 1 ?
The thickness of a graph G is defined as minimum number of (edge-disjoint) planar subgraphs into which G can be decomposed. The thickness of G is defined as \(\theta(G)\). What is the thickness of planar graph ?
A committee is to be selected from 5 candidates a, b, c, d and e. The selection must satisfy all the following conditions :
• Either a or b must be included, but not both
• Either c or e or both must be included
• If d is included then b must be included
• Either a or c are included or neither is included.
• If e is included, then c and d must be included. How should selection be made ?
Let us consider the letters from a through h, and all 5 letters are made using these letters. (words are just strings of letters). How many of these words contain no repeated letters ?
Let us consider the following primal problem : Maximize \(z = 2x_{1} + x_{2}\) Subject to \(x_{1} - x_{2} \leq 4\), \(x_{1} - x_{2} \leq 2\), \(x_{1}, x_{2} \geq 0\) What will be its dual problem ?
Identify an appropriate operation sequence with respect to execution of a machine level language instruction.
The “instruction decode” phase in CPU’s instruction cycle is responsible to _____ .
.................... is a client server application that identifies each host on the internet with a unique user-friendly name.
Every OS has a ................ or .......... which primarily resides in the main memory of the computer to perform some of the basic functions of the OS.
(i) Kernel
(ii) Interface
(iii) Nucleus
(iv) Compiler
Codes:
Which of the following are referred to as low level language?
(i) Machine language
(ii) Assembly language
(iii) High level language
(iv) Natural language
Codes:
Match the following:
| List I | List II |
| (a) New York Public Library | (i) Shelv AR |
| (b) Miami University Augmented Research Group | (ii) Smart library |
| (c) Oula University Library | (iii) Wolf Walk |
| (d) North Carolina State University | (iv) Find the future |
Codes:
Which part of the QR code represents the encoded data?