Recent questions without answers

0 votes

0 answers

1

fork - Calculate the total number of processes created.

asked 44 minutes ago in Programming by aishwarydewangan (37 points) | 5 views

0 votes

0 answers

2

rosen relations closure ex 35
Show that the closure with respect to the property P of the relation R = {(0, 0), (0, 1), (1, 1), (2, 2)} on the set {0, 1, 2} does not exist if P is the property a) is not reflexive. b) has ... since the relation already is reflexive we can't find a closure for "is not reflexive", but what is meant by closure in the 2nd part?

asked 8 hours ago in Others by shraddha priya Active (1.2k points) | 13 views

0 votes

0 answers

3

Aptitude:- Compound Interest
What annual payment will discharge a debt of Rs.7620 due in 3 years at 50/3% per annum compound interest? A. 5430 B. 4430 C. 3430 D. 2430

asked 10 hours ago in Verbal Ability by rahul sharma 5 Boss (6.1k points) | 7 views

0 votes

0 answers

4

What could be some informative topics for a minor project?

asked 12 hours ago in Others by vaibhav101 (57 points) | 6 views

0 votes

0 answers

5

File input output
int main(void) { // your code goes here int main() { FILE *fp; char ch, str[7]; fp=fopen("test.c", "r"); /* file 'try.c' contains "This is manipal" */ fseek(fp, 9L, SEEK_CUR); fgets(str, 5, fp); puts(str); return 0;

asked 15 hours ago in Programming by Purnima Digra (11 points) | 10 views

0 votes

0 answers

6

Rosen: Relations
Draw the Venn Diagram Between Reflexive property, Symmetric property, and Anti-symmetric property?

asked 16 hours ago in Set Theory & Algebra by Shubhanshu Loyal (2.8k points) | 17 views

0 votes

0 answers

7

gate 2004 algorithms
let A[1,2,...n] be an array storing a bit (1 or 0) at each location, and f(m) is a function whose time complexity is ø(m). consider the following program segment in C: counter=0; for(i=1;i<n; i++) {if (A[i] ==1) counter++; else {f(counter); counter=0; } } tge complexity of program segment is:

asked 16 hours ago in Algorithms by mitalitak (11 points) | 20 views

+1 vote

0 answers

8

Interesting C question
#include <stdio.h> #define f(a,b) a##b #define g(a) #a #define h(a) g(a) int main() { printf("%s\n",h(f(1,2))); printf("%s\n",g(f(1,2))); return 0; } Just by looking at the program one "might" ... for both the printf statements. But on running the program you get it as: bash$ ./a.out 12 f(1,2) bash$ Why is it so?

asked 17 hours ago in Programming by srestha Veteran (55.6k points) | 33 views

0 votes

0 answers

9

UGCNET-June2016-III-66
66. A perceptron has input weights W1 = – 3.9 and W2 = 1.1 with threshold value T = 0.3. What output does it give for the input x1 = 1.3 and x2 = 2.2 ? (1) – 2.65 (2) – 2.30 (3) 0 (4) 1

asked 18 hours ago in Others by kavikeve (133 points) | 8 views

0 votes

0 answers

10

soil mechanics
after remoulding a dense soil , the volume of void gets doubled without any change in the water content then the percentage air voids of remoused soil is given by phase diagram

asked 20 hours ago in Others by Naveen Kumar 5 (11 points) | 9 views

0 votes

0 answers

11

What to choose GATE or IIT JAM?

asked 22 hours ago in GATE by Twinkle chopra (11 points) | 11 views

0 votes

0 answers

12

Data modems
Please explain PCM and delta modulation technique.....

asked 1 day ago in Computer Networks by alokraj1142 (235 points) | 4 views

0 votes

0 answers

13

Data modems
Please explain ASK,PSK and FSK keying ....

asked 1 day ago in Computer Networks by alokraj1142 (235 points) | 3 views

0 votes

0 answers

14

Gate Mechanical Aptitude -2017 Set1 [Cones]

asked 1 day ago in Verbal Ability by rahul sharma 5 Boss (6.1k points) | 26 views

0 votes

0 answers

15

#gate
Any good resource on Generating function and recurrrence relations ?

asked 1 day ago in Combinatory by saxena0612 (59 points) | 7 views

0 votes

0 answers

16

Kenneth Rosen ,DM and its Application Exercise 1.5 Qn 35

asked 1 day ago in Mathematical Logic by Ali Jazib Mahmood (39 points) | 29 views

0 votes

0 answers

17

help and doubt
can anyone please teach me how to find where a functional dependencies are dapendencies preserving or not with examples?

asked 1 day ago in Databases by Palash Moon (51 points) | 7 views

0 votes

0 answers

18

algorithm
how is 0/1 knapsack time complexity O(2^n/2) ?

asked 1 day ago in Algorithms by A_i_$_h Active (1.9k points) | 17 views

0 votes

0 answers

19

Does anybody have pdf of Schaum's Outline of Operating System?

asked 1 day ago in Operating System by aishwarydewangan (37 points) | 10 views

0 votes

0 answers

20

What is the minimum space utilization for a B+ tree index.?

asked 2 days ago in Databases by Ankita chhikara (21 points) | 19 views

0 votes

0 answers

21

In a strict 2 phase locking protocol

asked 2 days ago in Databases by Ankita chhikara (21 points) | 19 views

0 votes

0 answers

22

algorithm
consider a problem defined on input of size n, if it is solved usuing greedy strategy then its time complexity is never less than a) O(n^2) b)O(n log n) c)O(logn) d) O(n)

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 19 views

0 votes

0 answers

23

algorithm
time complexity of multiplying two long integers of n - digits each using divide and conquer method is a)O(n^2) b)O(n) c)O(n^3) d)O(n logn)

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 12 views

0 votes

0 answers

24

algorithm
Hash table always generates constant lookup time..............why? and is it the worst case too?

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 5 views

0 votes

0 answers

25

algorithm
when working with powers of base n which sort is used

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 5 views

0 votes

0 answers

26

algorithm
priority queues can be efficiently implemented using binary heaps...why?

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 5 views

0 votes

0 answers

27

general query
In 2017 , how many people are selected in psu through gate ?? what are their rank ??

asked 2 days ago in Job Queries by Rahul Sen (11 points) | 13 views

0 votes

0 answers

28

algorithm
Which is not O(n^2)? a) (15^10) *n +12099 b) n^1.98 c) n^3 / sqrt(n) d) (2^20)*n

asked 2 days ago in Algorithms by A_i_$_h Active (1.9k points) | 14 views

0 votes

0 answers

29

State true/ false (with reason) For Linear Algebra

asked 2 days ago in Linear Algebra by Shubhanshu Loyal (2.8k points) | 14 views

0 votes

0 answers

30

Sql clause
Pls explain "GROUP BY ALL" clause..

asked 3 days ago in Databases by Nils (101 points) | 13 views

Recent questions without answers

Recent Posts

Recent Blog Comments