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
Answers by pankaj_vir
5
votes
61
C Programming
What would be the equivalent pointer expression for referring the array element a[i][j][k][l]? A. ((((a+i)+j)+k)+l) B. *(*(*(*(a+i)+j)+k)+l) C. (((a+i)+j)+k+l) D. ((a+i)+j+k+l)
What would be the equivalent pointer expression for referring the array element a[i][j][k][l]?A. ((((a+i)+j)+k)+l)B. *(*(*(*(a+i)+j)+k)+l)C. (((a+i)+j)+k+l)D. ...
5.4k
views
answered
Apr 10, 2018
Programming in C
programming-in-c
programming
array
pointers
+
–
2
votes
62
GATE CSE 2000 | Question: 1.19, UGCNET-Dec2013-II: 30
Which of the following derivations does a top-down parser use while parsing an input string? The input is scanned from left to right. Leftmost derivation Leftmost derivation traced out in reverse Rightmost derivation Rightmost derivation traced out in reverse
Which of the following derivations does a top-down parser use while parsing an input string? The input is scanned from left to right.Leftmost derivationLeftmost derivatio...
7.8k
views
answered
Apr 10, 2018
Compiler Design
gatecse-2000
compiler-design
parsing
normal
ugcnetcse-dec2013-paper2
+
–
16
votes
63
GATE CSE 2007 | Question: 18
Which one of the following is a top-down parser? Recursive descent parser. Operator precedence parser. An LR(k) parser. An LALR(k) parser.
Which one of the following is a top-down parser?Recursive descent parser.Operator precedence parser.An LR(k) parser.An LALR(k) parser.
9.7k
views
answered
Apr 10, 2018
Compiler Design
gatecse-2007
compiler-design
parsing
normal
+
–
2
votes
64
Generating functions
In generating function i studied from books i didn't understand two things 1. How to apply generating functions for solving recurrence relation 2. Generating functions for solving Permutations Can anybody explain it with an example ?
In generating function i studied from books i didn't understand two things1. How to apply generating functions for solving recurrence relation2. Generating functions for ...
861
views
answered
Apr 10, 2018
Mathematical Logic
discrete-mathematics
generating-functions
kenneth-rosen
combinatory
+
–
11
votes
65
GATE CSE 1987 | Question: 1-xiv
An operator precedence parser is a Bottom-up parser. Top-down parser. Back tracking parser. None of the above.
An operator precedence parser is aBottom-up parser.Top-down parser.Back tracking parser.None of the above.
3.7k
views
answered
Apr 9, 2018
Compiler Design
gate1987
compiler-design
parsing
+
–
2
votes
66
C programming
#include <stdio.h> int main() { //code int x; printf("%d",printf("A")+printf("BC")*printf("DEF")); return 0; } What should be the output of following program? Please explain the concept behind this.
#include <stdio.h int main() { //code int x; printf("%d",printf("A")+printf("BC")*printf("DEF")); return 0; }What should be the output of following program? Please explai...
910
views
answered
Apr 9, 2018
Programming in C
programming-in-c
output
programming
+
–
0
votes
67
ISI-SAMPLE-2014
182
views
answered
Apr 8, 2018
1
votes
68
ISI-SAMPLE-2014-15
442
views
answered
Apr 7, 2018
0
votes
69
ISI-2014-SAMPLE-18
303
views
answered
Apr 7, 2018
16
votes
70
GATE CSE 1998 | Question: 1.4
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function is continuous and differentiable continuous but not differentiable differentiable but not continuous neither continuous nor differentiable
Consider the function $y=|x|$ in the interval $[-1, 1]$. In this interval, the function iscontinuous and differentiablecontinuous but not differentiabledifferentiable but...
5.4k
views
answered
Apr 7, 2018
Calculus
gate1998
calculus
continuity
differentiation
easy
+
–
1
votes
71
UGC NET CSE | November 2017 | Part 3 | Question: 47
A simple stand - alone software utility is to be developed in C' programming by a team of software experts for a computer running Linux and the overall size of this software is estimated to be $20,000$ ... long does the software project take to complete? $10.52$ months $11.52$ months $12.52$ months $14.52$ months
A simple stand – alone software utility is to be developed in ‘C’ programming by a team of software experts for a computer running Linux and the overall size of thi...
1.4k
views
answered
Apr 6, 2018
Unknown Category
ugcnetcse-nov2017-paper3
+
–
2
votes
72
GATE CSE 2010 | Question: 15. PGEE 2018
One of the header fields in an IP datagram is the Time-to-Live (TTL) field. Which of the following statements best explains the need for this field? It can be used to prioritize packets. It can be used to reduce delays. It can be used to optimize throughput. It can be used to prevent packet looping.
One of the header fields in an IP datagram is the Time-to-Live (TTL) field. Which of the following statements best explains the need for this field?It can be used to prio...
9.8k
views
answered
Apr 6, 2018
Computer Networks
gatecse-2010
computer-networks
ip-packet
easy
+
–
6
votes
73
B. S. Grewal Engineering Mathematics- Probability
A student has to answer $9$ out of $12$ questions. How many ways if he has to answer at least $4$ out of first $5$ questions?
A student has to answer $9$ out of $12$ questions. How many ways if he has to answer at least $4$ out of first $5$ questions?
1.8k
views
answered
Apr 6, 2018
Probability
quantitative-aptitude
probability
+
–
3
votes
74
First And Follow
Find First and Follow in the following grammar. $E\rightarrow E+T \mid T$ $T\rightarrow TF \mid F$ $F\rightarrow F^* \mid a \mid b$
Find First and Follow in the following grammar.$E\rightarrow E+T \mid T$$T\rightarrow TF \mid F$$F\rightarrow F^* \mid a \mid b$
877
views
answered
Apr 6, 2018
Compiler Design
compiler-design
grammar
parsing
first-and-follow
+
–
5
votes
75
ISRO-DEC2017-50
The characters of the string $\text{K R P C S N Y T J M}$ are inserted into a hash table of the size of size $10$ using a hash function $h(x)=(ord(x)-ord(A)+1)$ $mod$ $10$ If linear probing is used to resolve collisions, then the following insertion causes the collision $Y$ $C$ $M$ $P$
The characters of the string $\text{K R P C S N Y T J M}$ are inserted into a hash table of the size of size $10$ using a hash function$h(x)=(ord(x)-ord(A)+1)$ $mod$ $10$...
3.3k
views
answered
Apr 6, 2018
Algorithms
isrodec2017
hashing
easy
+
–
2
votes
76
Passing array as function argument
#include<stdio.h> void temp(int a[]); main(){ int a[5]={1,2,3,4,5}; printf("%d", sizeof(a)); temp(a); } void temp(int a[]){ printf(" %d", sizeof(a)); } Output of above code is, given size of int is 4 byte $20$ $20$ $20$ $8$ $8$ $8$ $8$ $20$
#include<stdio.h void temp(int a[]); main(){ int a[5]={1,2,3,4,5}; printf("%d", sizeof(a)); temp(a); } void temp(int a[]){ printf(" %d", sizeof(a)); }Output of above code...
539
views
answered
Apr 5, 2018
Programming in C
programming-in-c
+
–
0
votes
77
oop c++
What are the advantages of scope resolutor & referencing in c++?
What are the advantages of scope resolutor & referencing in c++?
287
views
answered
Apr 5, 2018
Programming in C
programming-in-c
+
–
0
votes
78
Kenneth Rosen Edition 6th Exercise 6.1 Question 9d (Page No. 401)
Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$
Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$
910
views
answered
Apr 4, 2018
Combinatory
kenneth-rosen
discrete-mathematics
combinatory
recurrence-relation
+
–
0
votes
79
Multiplication of two long intergers
954
views
answered
Apr 4, 2018
Algorithms
divide-and-conquer
recurrence-relation
ace-test-series
+
–
0
votes
80
Sorting
1.5k
views
answered
Apr 4, 2018
Algorithms
test-series
sorting
algorithms
heap-sort
radix-sort
+
–
1
votes
81
Ullman exercise 7.2
703
views
answered
Apr 3, 2018
Programming in C
programming
programming-in-c
pointers
functions
+
–
17
votes
82
GATE CSE 1990 | Question: 2-iv
Match the pairs in the following questions: ...
Match the pairs in the following questions:$$\begin{array}{|ll|ll|}\hline (a) & \text{Secondary index} & (p) & \text{Function dependency} \\\hline (b) & \text{Non-proced...
2.6k
views
answered
Apr 3, 2018
Databases
gate1990
match-the-following
database-normalization
databases
+
–
27
votes
83
GATE CSE 1990 | Question: 2-iii
Match the pairs:$\begin{array}{|ll|ll|}\hline (a) & \text{Critical region} & (p) & \text{Hoare's monitor} \\ (b) & \text{Wait/Signal} & (q) & \text{Mutual exclusion} \\ (c) & \text{Working Set} & (r) & \text{Principle of locality} \\ (d) & \text{Deadlock} & (s) & \text{Circular Wait} \\\hline \end{array}$
Match the pairs:$$\begin{array}{|ll|ll|}\hline (a) & \text{Critical region} & (p) & \text{Hoare's monitor} \\ (b) & \text{Wait/Signal} & (q) & \text{Mutual exclusion} \\ ...
6.1k
views
answered
Apr 2, 2018
Operating System
match-the-following
gate1990
operating-system
process-synchronization
+
–
1
votes
84
Kenneth Rosen , Recurrence relation, Exercise 6.1 Qno. - 19
A vending machine dispensing books of stamps accepts only dollar coins, $1 bills,and $5 bills. a) Find a recurrence relation for the number of ways to deposit n dollars in the vending machine, where the order in which the coins ... 10 for a book of stamps ? Plz tell how to approach this question and solve especially with the Bold part.
A vending machine dispensing books of stamps accepts only dollar coins, $1 bills,and $5 bills.a) Find a recurrence relation for the number of ways to deposit n dollars in...
3.9k
views
answered
Apr 2, 2018
1
votes
85
Long integer multiplication
Given 2 long integers having n digits , it is required to multiply them.Assuming the numbers are represented in an array of size n . The time complexity to multiply them using traditional divide and conquer is
Given 2 long integers having n digits , it is required to multiply them.Assuming the numbers are represented in an array of size n . The time complexity to multiply them ...
1.1k
views
answered
Apr 2, 2018
Algorithms
time-complexity
divide-and-conquer
+
–
2
votes
86
C PROGRAMMING
#include<stdio.h> int main() { int a = 12; void *ptr = (int *)&a; printf("%d", *ptr); getchar(); return 0; } A 12 B Compiler Error C Runt Time Error D 0
#include<stdio.h int main() { int a = 12; void *ptr = (int *)&a; printf("%d", *ptr); getchar(); return 0; }A12BCompiler ErrorCRunt Time ErrorD0
816
views
answered
Apr 1, 2018
1
votes
87
Calculus- +2math book
If an = 1000*n /n!, for n = 1, 2, 3, ...., then the sequence {an } (a) doesn't have a maximum (b) attains maximum at exactly one value of n (c) attains maximum at exactly two values of n (d) attains maximum for infinitely many values of n
If an = 1000*n /n!, for n = 1, 2, 3, ...., then the sequence {an }(a) doesn't have a maximum(b) attains maximum at exactly one value of n(c) attains maximum at exactly tw...
320
views
answered
Apr 1, 2018
Calculus
engineering-mathematics
+
–
1
votes
88
Integration
439
views
answered
Apr 1, 2018
5
votes
89
Generating functions
What will be the coefficient of x^17 in the expansion of (x+x^2+x^3+x^4+x^5+x^6)^4?
What will be the coefficient of x^17 in the expansion of (x+x^2+x^3+x^4+x^5+x^6)^4?
1.8k
views
answered
Mar 31, 2018
Combinatory
generating-functions
discrete-mathematics
+
–
Page:
« prev
1
2
3
4
5
6
7
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register