Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by spriti1991
1
answer
1
What will be the O/P of the following C code? Virtual gate
1.2k
views
commented
Apr 5, 2016
Programming in C
algorithms
array
programming-in-c
+
–
3
answers
2
Calculating number of tokens
Given solution: Please explain how the number of tokens are 11.
Given solution:Please explain how the number of tokens are 11.
18.9k
views
commented
Apr 5, 2016
Compiler Design
compiler-tokenization
compiler-design
testbook-test-series
numerical-answers
+
–
2
answers
3
MadeEasy Test Series: Programming & DS - Programming In C
Consider the following program: # define Rec(a) a + a * a int a; a = 20 + Rec(a) * Rec(a + 1); printf(“%d”, a) return 0; } The output of above program for a = 3 is ________.
Consider the following program:# define Rec(a) a + a * aint a;a = 20 + Rec(a) * Rec(a + 1);printf(“%d”, a)return 0;}The output of above program for a = 3 is ________....
457
views
commented
Apr 5, 2016
Programming in C
made-easy-test-series
programming
programming-in-c
macros
+
–
6
answers
4
Why is left recursion not a problem for bottom up parsers?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(0)/LR(1) sets : Eg : S->Sa|a Then in LR(0) set : ... is in front of S , so shouldn't the S production be generated again and again and make it go to an inf. loop?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(...
10.6k
views
answered
Apr 5, 2016
Compiler Design
compiler-design
parsing
lr-parser
+
–
3
answers
5
lexical anayzer
can int a=a 10 is a lexical or not if yes then why ??? if no then give reason?
can int a=a 10 is a lexical or notif yes then why ???if no then give reason?
622
views
answered
Apr 3, 2016
Compiler Design
compiler-design
lexical-analysis
+
–
4
answers
6
GATE CSE 1997 | Question: 3.8
When an interrupt occurs, an operating system ignores the interrupt always changes state of interrupted process after processing the interrupt always resumes execution of interrupted process after processing the interrupt may change state of interrupted process to ‘blocked’ and schedule another process.
When an interrupt occurs, an operating systemignores the interruptalways changes state of interrupted process after processing the interruptalways resumes execution of in...
13.9k
views
answer edited
Apr 2, 2016
Operating System
gate1997
operating-system
interrupts
normal
+
–
1
answer
7
Data model
In a database , the specification of data where individual data item of same type can have different sets of attribute a) True b) false
In a database , the specification of data where individual data item of same type can have different sets of attribute a) True b) false
379
views
asked
Jun 3, 2015
Databases
databases
+
–
2
answers
8
Pointers
Now I suppose if i have a statement like *P++ then it is broken down as first (P++) and then *p (because both are unary operator and associtivity is right to left ) and if we have statement like a=*p++ then it is broken down into a=*p and then p is incremented !! Am i right ?
Now I suppose if i have a statement like *P++ then it is broken down as first (P++) and then *p (because both are unary operator and associtivity is right to left ) and ...
668
views
commented
Jun 1, 2015
Programming in C
pointers
programming-in-c
+
–
3
answers
9
Asymptotic Notation
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly x.
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly ...
2.2k
views
commented
May 27, 2015
Algorithms
asymptotic-notation
algorithms
+
–
1
answer
10
DATA STRUCTURES
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort?
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort ru...
855
views
answered
May 20, 2015
Algorithms
algorithms
sorting
merge-sort
+
–
2
answers
11
SQL
Consider the Following Collection of relational schema Professor( profname , deptname) Department (deptname, building) Committee(commname, Profname) Which of following query finds all the professors who have not offices in any of those buildings that professor Piper has offices in ... d1, professor p1 Where P1.Profname=’Piper’ and p1.deptname=D1.deptname ) D) None of these
Consider the Following Collection of relational schemaProfessor( profname , deptname)Department (deptname, building)Committee(commname, Profname)Which of following query ...
1.1k
views
answered
May 20, 2015
Databases
sql
+
–
2
answers
12
RMo and CMO
Does any one know the formula for Row major order and column major order of symmetric square band matrix
Does any one know the formula for Row major order and column major order of symmetric square band matrix
2.0k
views
answer edited
May 19, 2015
1
answer
13
SQl query
Consider the relation Customers (custid, name , address , city , state , introducer) List all the customers who have introduced at least one other customer 1) Select distinct e.name from Customer e, Customer F where f.introducer =e.ename 2) Select distinct e.name from Customer e, Customer F where f.introducer <>e.name
Consider the relation Customers (custid, name , address , city , state , introducer)List all the customers who have introduced at least one other customer1) Select distin...
956
views
commented
May 19, 2015
Databases
sql
+
–
1
answer
14
SQL query
Consider the relation Emp (SS#, name , age , salary, dno ) Dept(dno, dname, floor , mgrSS#) Retrieve the social security number of those employees who work in both the show and toy department A) Select distinct e.SS# from Emp e , Dept d where e.dno = d.dno and dname= ... .SS# from emp e , dept d where e.dno= d.dno and d.dname='toy' and d.dname='shoe' c) Both a and b
Consider the relation Emp (SS#, name , age , salary, dno )Dept(dno, dname, floor , mgrSS#)Retrieve the social security number of those employees who work in both the show...
1.1k
views
commented
May 19, 2015
Databases
sql
+
–
1
answer
15
SQL
Consider the following Realtion Borrower(borrower no , name , age) Loan (copy no , borrower no , due date ) Retrieve the borrower name and number of books currently on loan for each of the borrower 1) Select borrower.name, count (*) from loan where loan.borrower ... .name, count (*) from loan, borrowe where loan.borrower name= borrower.borrower name group by loan .borrower.no 4) None of these
Consider the following RealtionBorrower(borrower no , name , age)Loan (copy no , borrower no , due date )Retrieve the borrower name and number of books currently on loan ...
472
views
answered
May 19, 2015
Databases
sql
+
–
3
answers
16
which of the following is correct
which of the following is correct?
which of the following is correct?
1.2k
views
commented
May 19, 2015
Algorithms
logarithmic-function
normal
+
–
3
answers
17
Big O
The concept of order (Big O) is important because— (a) it can be used to decide the best algorithm that solves a given problem (b) it determines the maximum size of a problem that can be solved in a given system, in a given amount of time (c) it is the lower bound of the growth rate of the algorithm (d) Both (a) and (b)
The concept of order (Big O) is important because—(a) it can be used to decide the best algorithm that solves a given problem(b) it determines the maximum size of a pro...
17.6k
views
commented
May 16, 2015
Algorithms
algorithms
time-complexity
+
–
4
answers
18
GATE CSE 2015 Set 3 | Question: 17
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
Given that hash table $T$ with $25$ slots that stores $2000$ elements, the load factor $a$ for $T$ is _________.
9.3k
views
commented
May 16, 2015
DS
gatecse-2015-set3
data-structures
hashing
easy
numerical-answers
+
–
4
answers
19
DFA to accept a binary number divisible by 2
Sorry for the bad quality picture. Which of these is correct? (1 or 2)
Sorry for the bad quality picture. Which of these is correct? (1 or 2)
16.5k
views
commented
May 16, 2015
Theory of Computation
finite-automata
+
–
2
answers
20
Concurrency Problems
T1 T2 R(A) R(A) R(B) R(B) W(A) COMMIT R(A) W(A) COMMIT in the above problem identify the concurrency in the following Schedule involving 2 Transaction T1 AND T2 (r: read and w : write ) a) Dirty Read problem b) Unrepeatable Read problem c) Lost update Problem d) Both a and b
T1T2R(A) R(A) R(B) R(B) W(A) COMMIT R(A) W(A) COMMIT in the above problem identify the concurrency in the following Schedule involving 2 Transaction T1 AND T2 (r: r...
1.0k
views
comment edited
May 6, 2015
Databases
concurrency
+
–
3
answers
21
Conflict Equivalent
Consider the following ordering S of transaction T1:R(X),W(Y), T2:R(X),W(Y);T3:R(X),W(Y). how many schedules if any are conflict equivalent to S? 1) 3 2) 5 c) 15 d) 30
Consider the following ordering S of transaction T1:R(X),W(Y), T2:R(X),W(Y);T3:R(X),W(Y). how many schedules if any are conflict equivalent to S?1) 32) 5c) 15d) 30
4.1k
views
commented
May 6, 2015
Databases
databases
+
–
2
answers
22
ACID PROPERTIES
ATOMICITY IS MANAGED BY a) Programmer b) Recovery Management Component c) Concurrency Control Component d) None of it
ATOMICITY IS MANAGED BY a) Programmerb) Recovery Management Component c) Concurrency Control Componentd) None of it
4.0k
views
commented
May 6, 2015
Databases
databases
+
–
2
answers
23
Decoder
Which of following statement is true ? S1. Any boolean function can be realized using decoder s2. One multiplexer can realize 1 function at a time a) S1 is true b) S2 is true 3) Both are true d) none of them
Which of following statement is true ?S1. Any boolean function can be realized using decoders2. One multiplexer can realize 1 function at a timea) S1 is trueb) S2 is true...
1.7k
views
commented
May 4, 2015
2
answers
24
Combinational Circuits
A combinational circuit is to be designed to implement a boolean Function with 3 Boolean Variables which gives output 1 if all the inputs have same value, otherwise give 0 . If only basic gate (AND,OR,NOT) are available and if complimented variable is not available , then determine the minimum no of gates to design the circuit ? 1) 3 2) 4 3) 5 4) 6
A combinational circuit is to be designed to implement a boolean Function with 3 Boolean Variables which gives output 1 if all the inputs have same value, otherwise give ...
2.0k
views
commented
May 4, 2015
1
answer
25
Combinational Circuits
427
views
commented
May 4, 2015
2
answers
26
Combinational Circuits
A combinational circuit is to be designed to implement a boolean Function with 3 Boolean Variables which gives output 1 if all the inputs have same value, otherwise give 0 . If only basic gate (AND,OR,NOT) are available and if complimneted variable is not available , then determine the minimum no of gates to design the circuit ? 1) 3 2) 4 3) 5 4) 6
A combinational circuit is to be designed to implement a boolean Function with 3 Boolean Variables which gives output 1 if all the inputs have same value, otherwise give ...
1.0k
views
asked
May 4, 2015
1
answer
27
BCD Adder
A decimal parallel adder that add n decimal digits needs how many BCD adder stages 1. n 2. 2n 3. 1 4 n^2
A decimal parallel adder that add n decimal digits needs how many BCD adder stages1. n 2. 2n3. 14 n^2
1.8k
views
asked
May 4, 2015
1
answer
28
Three state Buffer
I am just reading that Microperations from Morris mano They have explained the concept of 3 state gate which can be used as a multiplexer which have output 1, 0 and high Impedance. what is used of it (I am not getting )
I am just reading that Microperations from Morris mano They have explained the concept of 3 state gate which can be used as a multiplexer which have output 1, 0 and high ...
811
views
commented
Apr 19, 2015
CO and Architecture
digital-logic
+
–
1
answer
29
normalization
Let R(ABCDE) be a relational schema and F ={AB->CD, ABC->E,C->E} BE A SET OF FUNCTIONAL dependencies. WHAT IS highest normal of R ? 1NF 2NF 3NF BCNF
Let R(ABCDE) be a relational schema and F ={AB->CD, ABC->E,C->E} BE A SET OF FUNCTIONAL dependencies. WHAT IS highest normal of R ?1NF 2NF3NFBCNF
3.2k
views
commented
Apr 18, 2015
Databases
database-normalization
+
–
1
answer
30
normalization
Can you explain me this : A table is in second normal form if every attribute is determined by every candidate key , but is not determined by any pure subset of Candidate key ? True or false
Can you explain me this :A table is in second normal form if every attribute is determined by every candidate key , but is not determined by any pure subset of Candidate ...
1.2k
views
commented
Apr 18, 2015
Databases
database-normalization
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register