Dark Mode

Answers by logan1x

0 votes

1

ISI2012-PCB-A-2a
Professor Hijibiji has defined the following Boolean algebra $\mathcal{B} = (B, +, *)$, where $B = \{1, 2, 3, 5, 6, 10, 15, 30\}$, i.e., the set of all eight factors of $30$; the two binary operators $'+'$ ... common multiple) and GCD (greatest common divisor) of two integer operands. Show that the two operations of $\mathcal{B}$ satisfy associativity commutativity distributivity.

answered in Digital Logic Feb 15, 2020

442 views

0 votes

2

Test by Bikram | Mock GATE | Test 4 | Question: 57
Fill in the blanks with meaningful pairs: If there is nothing to absorb the energy of sound, it travels on _________. However, its intensity ______ as it travels away from the source. E steadily, stabilizes forever, increases erratically, mitigates indefinitely, diminishes

answered in GATE Jan 30, 2020

122 views

0 votes

3

ISRO 2017-5
Which of the following concurrency control protocol ensures both conflict and free from deadlock? , Time stamp ordering 2 Phase locking Both (a) and (b) None of the above

answered in Databases Dec 21, 2019

4.6k views

0 votes

4

Test by Bikram | Algorithms | Test 2 | Question: 6
$O(n^k)$ is complexity of the best method that finds longest Palindrome Substring in a word. For example, in the word "Atatb", the longest palindrome string is "tat". Then, the value of $10^*K$ is __________.

answered in Algorithms Dec 1, 2019

416 views

0 votes

5

Test by Bikram | Data Structures | Test 2 | Question: 28
A circular linked list is used to represents a queue. A single variable L is used to access the queue. To which node should L point such that both the operation enqueue and dequeue can be performed in constant time ? node next to front front node not possible with a single node rear node

answered in Programming Nov 16, 2019

539 views

0 votes

6

Test by Bikram | Data Structures | Test 2 | Question: 6
Assume that we have a ternary tree in which each node can have at most $3$ children, namely left, middle and right. Consider the following function to calculate total number of nodes with exactly $3$ children. int func Node *L { int i; if L==NULL return 0 ... -> right ; i+ func L -> left+ func L -> middle ; i + func L -> left ; i ;

answered in Programming Nov 15, 2019

394 views

1 vote

7

Test by Bikram | Compiler Design | Test 1 | Question: 16
Consider the following grammars: $S \rightarrow aS \mid Sa \mid \in$ $E \rightarrow E +E \mid E^*E \mid id$ $A \rightarrow AA \mid (A) \mid a$ $S \rightarrow SS \mid AB, \ A \rightarrow Aa \mid a, \ B \rightarrow Bb \mid b$ These grammars are: Ambiguous Unambiguous Regular Inherently Ambiguous

answered in Compiler Design Nov 14, 2019

266 views

1 vote

8

Test by Bikram | Compiler Design | Test 1 | Question: 15
Which of these is NOT true about Abstract Syntax Tree (AST)? An AST is usually the result of the syntax analysis phase of a compiler. AST has no impact on the final output of the compiler. AST is a tree ... structure of source code written in a programming language. AST is also used in program analysis and program transformation systems.

answered in Compiler Design Nov 14, 2019

381 views

2 votes

9

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 8
Which of the following sentences regarding Viable prefixes is/are CORRECT? Viable prefixes is the set of prefixes of right-sentential forms that can appear on the stack of a shift-reduce parser Viable prefixes is the set of prefixes of right-sentential forms ... using a DFA Only (i) Only (ii) Only (i) and (ii) (i), (ii) and (iii)

answered in Compiler Design Nov 13, 2019

1.4k views

0 votes

10

parser doubt
Consider the statements: (i) Every regular grammar is LL(1) (ii) Every LL(1) grammar is LALR(1) (iii) All LR(0) grammars are LL(k) (iv) A context-free grammar without left factoring and left recursion can be ambiguous Which of the above statement/s is/are TRUE? (i) only (i) and (iii) only (ii) and (iv) only (iv) only

answered in Compiler Design Nov 7, 2019

1.0k views

0 votes

11

LL(1)
Every LL(1) grammar is ______ A.SLR(1) B.LALR(1) C.LR(1) D.Both B & C

answered in Compiler Design Nov 7, 2019

1.3k views

1 vote

12

Ullman (Compiler Design) Edition 2 Exercise 6.1 Question 1 (Page No. 362)
Construct the DAG for the expression $((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$

answered in Compiler Design Nov 7, 2019

1.9k views

1 vote

13

UGC NET CSE | January 2017 | Part 2 | Question: 34
The contents of Register $(BL)$ and Register $(AL)$ of $8085$ microprocessor are $49H$ and $3AH$ respectively. The contents of $AL$, the status of carry flag $(CF)$ and sign flag $(SF)$ after executing $'SUB AL, BL'$ ... $AL =F1H; \: CF = 1; \: SF= 1$ $AL =1FH; \: CF=1; \:SF=1$

answered in CO and Architecture May 22, 2019

2.5k views

1 vote

14

Test by Bikram | Theory of Computation | Test 2 | Question: 11
Consider the grammar given below: $S \rightarrow x \ T \mid y \ Z$ $Z \rightarrow x \mid x \ S \mid y \ Z \ Z$ $T \rightarrow y \mid y \ S \mid y \ T \ T$ Consider the following strings: $xxyyx$ $xxyyxy$ $xyxy$ ... Which of the above strings are generated by the given grammar? i, iv and iii ii, iii and iv ii, v and iv iii, iv and v

answered in Theory of Computation Apr 6, 2019

162 views

1 vote

15

answered in Programming Apr 1, 2019

475 views

0 votes

16

Algorithm :- Hashing
Consider a hash table consisting of M=11 slots, and suppose integer key value are hashed into the table using hash function h1: int h1(int key) { x = (key + 5)*(key + 5); x = x/6; x = x + key; x = x%11; return x; } Suppose that collisions are resolved ... have been inserted in the given order: 43, 23, 1, 0, 15, 31, 4, 7, 11, 3 Source:- http://www.techtud.com/example/hashing

answered in Algorithms Oct 14, 2018

2.4k views

1 vote

17

self doubt
What is the output of the program: extern int a; main() { extern int a; printf(a); }

answered in Programming Oct 3, 2018

279 views