1
The following program is stored in the memory unit of the basic computer. Give the content of accumulator register in hexadecimal after the execution of the program. ... $\text{A}1\text{B}4$ $81\text{B}4$ $\text{A}184$ $8184$
2
A rectangle is bound by the lines $x=0; y=0; x=5$ and $y=3$. The line segment joining $(-1, 0)$ and $(4,5)$, if clipped against this window will connect the points __________. $(0,1)$ and $(3,3)$ $(0,1)$ and $(2,3)$ $(0,1)$ and $(4,5)$ $(0,1)$ and $(3,5)$
3
Which of the following algorithms is not used for line clipping? Cohen-Sutherland algorithm Sutherland-Hodgeman algorithm Liang-Barsky algorithm Nicholl-Lee-Nicholl algorithm
4
If we want to resize a $1024 \times 768$ pixels image to one that is $640$ pixels wide with the same aspect ratio, what would be the height of the resized image? $420$ Pixels $460$ Pixels $480$ Pixels $540$ Pixels
5
Suppose a system has $12$ magnetic tape drives and at time $t_0$ ... $\left \langle p_2, p_1, p_0 \right \rangle$ $\left \langle p_0, p_2, p_1 \right \rangle$
6
Which of the following methods are used to pass any number of parameters to the operating system through system calls? Registers Block or table in main memory Stack Block in main memory and stack
7
In a system for a restaurant, the main scenario for placing order is given below: Customer reads menu Customer places order Order is sent to kitchen for preparation Ordered items are served Customer requests for a bill for the order Bill is prepared for this order Customer is given ... for the scenario will have at least how many objects among whom the messages will be exchanged $3$ $4$ $5$ $6$
8
An _______ chart is a project schedule representation that presents project plan as a directed graph. The critical path is the __________ sequence of ________ tasks and it defines project ________. Activity, Shortest, Independent, Cost Activity, Longest, Dependent, Duration Activity, Longest, Independent, Duration Activity, Shortest, Dependent, Duration
9
Let $a^{2c} \text{ mod } n = (a^c)^2 \text{ mod } n$ and $a^{2c+1}\text{ mod } n= a \cdot (a^c)^2\text{ mod }n$. For $a=7$, $b=17$ and $n=561$, What is the value of $a^b( \text{mod } n)$? $160$ $166$ $157$ $67$
10
A clique in an undirected graph $G= \left \langle V, E \right \rangle$ is a subset $V’ \subseteq V$ of vertices, such that If $(u,v) \in E$ then $u \in V’$ and $v \in V’$ If $(u,v) \in E$ then $u \in V’$ or $v \in V’$ Each pair of vertices in $V’$ is connected by an edge All pairs of vertices in $V’$ are not connected by an edge
11
When using Dijkstra's algorithm to find shortest path in a graph, which of the following statement is not true? It can find shortest path within the same graph data structure Every time a new node is visited, we choose the node with smallest known distance/ ... to visit first Shortest path always passes through least number of vertices The graph needs to have a non-negative weight on every edge
12
The time complexity to multiply two polynomials of degree $n$ using Fast Fourier transform method is: $\theta(n \lg n)$ $\theta(n^2)$ $\theta(n)$ $\theta(\lg n)$
13
Consider the following statements with respect to the language $L = \{ a^n b^n \mid n \geq 0 \}$ $S_1 : L^2$ is a context free language $S_2 : L^k$ is context free language for any given $k \geq 1$ $S_3 : \overline{L}$ and $L^\ast$ are context free languages Which one of the following is correct? only $S_1$ and $S_2$ only $S_1$ and $S_3$ only $S_2$ and $S_3$ $S_1$, $S_2$ and $S_3$
14
Consider the following languages: $L_1 = \{ a^nb^nc^m \} \cup \{a^nb^mc^m\}, n, m \geq 0$ $L_2 =\{ww^R \mid w \in\{ a, b \} *\}$ Where $R$ represents reversible operation. Which one of the following is (are) inherently ambiguous languages(s)? Only $L_1$ Only $L_2$ both $L_1$ and $L_2$ neither $L_1$ nor $L_2$
15
Let $G= (V, T, S, P)$ be any context-free grammar without any $\lambda$-productions or unit productions. Let $K$ be the maximum number of symbols on the right of any production in $P$ ... $K \mid P \mid + \mid T \mid$ Where $\mid \cdot \mid$ denotes the cardinality of the set.
16
Consider the following statements: $S_1$: These exists no algorithm for deciding if any two Turing machines $M_1$ and $M_2$ accept the same language $S_2$: Let $M_1$ and $M_2$ be arbitrary Turing machines. The problem to determine $L(M_1) \subseteq L(M_2)$ is undecidable Which of the statements is (are) correct? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
17
Let $A= \{001, 0011, 11, 101\}$ and $B=\{01, 111, 111, 010\}$. Similarly, let $C= \{00, 001, 1000\}$ and $D=\{0, 11, 011\}$. Which of the following pairs have a post-correspondence solution? Only pair $(A, B)$ Only pair $(C, D)$ Both $(A, B)$ and $(C, D)$ Neither $(A, B)$ nor $(C, D)$
18
Consider a subnet with $720$ routers. If a three-level hierarchy is chosen, with eight clusters, each containing $9$ regions of $10$ routers, then total number of entries in hierarchical table of each router is $25$ $27$ $53$ $72$
19
A network with bandwidth of $10 \text{ Mbps}$ can pass only an average of $12, 000$ frames per minute with each frame carrying an average of $10,000$ bits. What is the throughput of this network? $1, 000, 000 \text{ bps}$ $2, 000, 000 \text{ bps}$ $12, 000, 000 \text{ bps}$ $1, 200, 00, 000 \text{ bps}$
20
According to Dempster-Shafer theory for uncertainity management, $\textit{Bel}(A)+\textit{Bel}(\neg A) \leq 1$ $\textit{Bel}(A)+\textit{Bel}(\neg A) \geq 1$ $\textit{Bel}(A)+\textit{Bel}(\neg A) = 1$ $\textit{Bel}(A)+\textit{Bel}(\neg A) =0$ Where $\textit{Bel}(A)$ denotes Belief of event $A$.
1 vote
21
Consider the following statements: $S_1 : \forall x P(x) \vee \forall x Q(x)$ and $\forall x (P(x) \vee Q(x))$ are not logically equivalent. $S_2 : \exists x P(x) \wedge \exists x Q(x)$ and $\exists x (P(x) \wedge Q(x))$ are not logically equivalent Which of the following statements is/are correct? Only $S_1$ Only $S_2$ Both $S_1$ and $S_2$ Neither $S_1$ nor $S_2$
22
Consider the following models: $M_1$: Mamdani model $M_2$: Takagi – Sugeno – Kang model $M_3$: Kosko’s additive model $\text(SAM)$ Which of the following option contains examples of additive rule model? Only $M_1$ and $M_2$ Only $M_2$ and $M_3$ Only $M_1$ and $M_3$ $M_1$, $M_2$ and $M_3$
23
A fuzzy conjuction operators, $t(x,y)$, and a fuzzy disjunction operator, $s(x,y)$, form a pair if they satisfy: $t(x,y)=1-s(1-x,1-y)$. If $t(x,y)= \dfrac{xy}{(x+y-xy)}$ then $s(x,y)$ is given by $\dfrac{x+y}{1-xy} \\$ $\dfrac{x+y-2xy}{1-xy} \\$ $\dfrac{x+y-xy}{1-xy} \\$ $\dfrac{x+y-xy}{1+xy}$
24
Let $\textbf{W}_{ij}$ represents weight between node $i$ at layer $k$ and node $j$ at layer $(k-1)$ ... $\alpha$ and $E$ represents learning rate and Error in the output respectively.
25
Let the population of chromosomes in genetic algorithm is represented in terms of binary number. The strength of fitness of a chromosome in decimal form, $x$, is given by $S f(x) = \dfrac{f(x)}{\Sigma f(x)}$ where $f(x) = x^2$ The population is given by $P$ where: $P=\{(01101, (11000), (01000), (10011)\}$ The strength of fitness of chromosome $(11000)$ is ________ $24$ $576$ $14.4$ $49.2$
26
Consider the following statements with respect to duality in $\text{LPP}$: The final simplex table giving optimal solution of the primal also contains optimal solution of its dual in itself If either the primal or the dual problem has a finite optimal solution, then the other problem also has a finite optimal ... ) correct? Only (a) and (b) Only (a) and (c) only (b) and (c) (a), (b) and (c)
27
Consider the following statements with respect to approaches to fill area on raster systems: $P$: To determine the overlap intervals for scan lines that cross the area $Q$: To start from a given interior position and pain outward from this point until we encounter the specified boundary ... correct answer from the options given below: $P$ only $Q$ only Both $P$ and $Q$ Neither $P$ nor $Q$
Which of the following statements are true regarding $\text{C++}$? Overloading gives the capability to an existing operator to operate on other data types Inheritance in object oriented programming provides support to reusability When object of a derived class is defined, first the constructor of derived class is excecuted ... only (a), (b) and (c) only (a), (b) and (d) only (b), (c) and (d) only
Two concurrent executing transactions $T_1$ and $T_2$ are allowed to update same stock item say $'\textit{A}'$ in an uncontrolled manner. In such scenario, following problems may occur: Dirty read problem Lost update problem Transaction failure Inconsistent database state Which of the following option is correct if ... , (b) and (c) only (c) and (d) only (a) and (b) only (a), (b) and (d) only
Identify the circumstances under which pre-emptive $\text{CPU}$ scheduling is used: A process switches from Running state to Ready state A process switches from Waiting state to Ready state A process completes its execution A process switches from Ready to Waiting state Choose the correct option: (a) and (b) only (a) and (d) only (c) and (d) only (a), (b), (c) only