Recent activity

0 votes

1 answer

1

UGCNET-DEC2016-II-12
Which one of the following is correct for overloaded functions in C++? Compiler sets up a separate function for every definition of the function. The compiler does not set up a separate function for every definition of ... Overloaded functions cannot handle different types of objects. Overloaded functions cannot have the a same number of arguments.

answer selected 2 minutes ago in Others by Sankaranarayanan P.N Veteran (11.1k points) | 102 views

0 votes

1 answer

2

UGCNET-DEC2016-II-11
Which of the following cannot be passed to a function in C++? Constant Structure Array Header file

answer selected 4 minutes ago in Others by Sankaranarayanan P.N Veteran (11.1k points) | 74 views

0 votes

1 answer

3

UGCNET-DEC2016-II-10
The hexadecimal equivalent of the octal number 2357 is: 2EE 2FF 4EF 4FE

answer selected 6 minutes ago in Others by Sankaranarayanan P.N Veteran (11.1k points) | 93 views

0 votes

1 answer

4

UGCNET-DEC2016-II-9
Convert the octal number 0.4051 into its equivalent decimal number. 0.5100098 0.2096 0.52 0.4192

answer selected 10 minutes ago in Others by Sankaranarayanan P.N Veteran (11.1k points) | 82 views

0 votes

1 answer

5

question
how we will find 1's complement of -4 is it possible to find it

answered 13 minutes ago in Digital Logic by Tesla! Loyal (4.1k points) | 6 views

+5 votes

3 answers

6

GATE2001-20
Consider a disk with the 100 tracks numbered from 0 to 99 rotating at 3000 rpm. The number of sectors per track is 100 and the time to move the head between two successive tracks is 0.2 millisecond. Consider a set of disk requests to ... 0 and the elevator algorithm is used to schedule disk requests, what is the worse case time to complete all the requests?

commented 36 minutes ago in Operating System by joshi_nitish Loyal (3.3k points) | 815 views

+1 vote

2 answers

7

UGCNET-DEC2016-II-5
Consider a Hamiltonian Graph G with no loops or parallel edges and with |V(G)|=n≥3. Then which of the following is true? deg(v) ≥ n/2 for each vertex v |E(G)| ≥ 1/2(n-1)(n-2)+2 deg(v)+deg(w) ≥ n whenever v and w are not connected by an edge All of the above

commented 48 minutes ago in CBSE/UGC NET by Sankaranarayanan P.N Veteran (11.1k points) | 268 views

0 votes

0 answers

8

fork - Calculate the total number of processes created.

asked 52 minutes ago in Programming by aishwarydewangan (37 points) | 8 views

0 votes

1 answer

9

Cache Memory
Should we have to include tag directory size in cache size or not ?

commented 53 minutes ago in CO & Architecture by ankitgupta.1729 (25 points) | 15 views

0 votes

1 answer

10

When there is a miss in L1 cache and a hit in L2 cache, a block is transferred from L2 cache

answered 1 hour ago in CO & Architecture by learner_geek Junior (605 points) | 15 views

+9 votes

4 answers

11

GATE2002-1.16
Sign extension is a step in floating point multiplication signed 16 bit integer addition arithmetic left shift converting a signed integer from one size to another

commented 1 hour ago in Digital Logic by reena_kandari Loyal (3.2k points) | 562 views

0 votes

1 answer

12

UGCNET-DEC2016-II-3
The functions mapping R into R are defined as: f(x) = x3-4x, g(x)=1/(x2+1) and h(x)=x4 Then find the value of the following composite functions: hog(x) and hogof(x) (x2+1)4 and [(x3-4x)2+1]4 (x2+1)4 and [(x3-4x)2+1]-4 (x2+1)-4 and [(x3-4x)2+1]4 (x2+1)-4 and [(x3-4x)2+1]-4

commented 1 hour ago in CBSE/UGC NET by Sankaranarayanan P.N Veteran (11.1k points) | 213 views

0 votes

1 answer

13

UGCNET-DEC2016-II-2
Match the following: List-I List-II a. Absurd i. Clearly impossible being contrary to some evident truth b. Ambiguous ii. Capable of more than one interpretation or meaning c. Axiom iii. An assertion that is accepted and used without a proof d. Conjecture iv. An opinion Preferably ... ; b-iii; c-iv; d-ii a-ii; b-iii; c-iv; d-i a-ii; b-i; c-iii; d-iv

answer selected 1 hour ago in CBSE/UGC NET by Sankaranarayanan P.N Veteran (11.1k points) | 124 views

0 votes

1 answer

14

UGCNET-DEC2016-II-1
Consider a sequence $F_{00}$ defined as: $F_{00} (0) = 1, \: F_{00}(1)=1$ $F_{00}(n) = \frac{10*F_{00}(n-1)+100}{F_{00}(n-2)} \text{ for } n \geq 2$ Then what shall be the set of values of the sequence $F_{00}$? (1, 110, 1200) (1, 110, 600, 1200) (1, 2, 55, 110, 600, 1200) (1, 55, 110, 600, 1200)

answer selected 1 hour ago in CBSE/UGC NET by Sankaranarayanan P.N Veteran (11.1k points) | 195 views

+2 votes

3 answers

15

GATE2002-1.5
In the worst case, the number of comparisons needed to search a single linked list of length $n$ for a given element is $\log n$ $\frac{n}{2}$ $\log_2 {n} - 1$ $n$

commented 1 hour ago in DS by reena_kandari Loyal (3.2k points) | 370 views

+6 votes

3 answers

16

GATE2000-1.23, ISRO2016-57
Given the relations employee (name, salary, dept-no), and department (dept-no, dept-name,address), Which of the following queries cannot be expressed using the basic relational algebra operations $\left(\sigma, \pi,\times ,\ ... name is the same as their department name The sum of all employees' salaries All employees of a given department

commented 1 hour ago in Databases by reena_kandari Loyal (3.2k points) | 1.4k views

0 votes

1 answer

17

Textbook question:
Let f(N) = 1 + f(logN) then find the upper bound of f(N).What is the intutive way to solve this?

answered 1 hour ago in Algorithms by Habibkhan Veteran (66.7k points) | 24 views

+1 vote

1 answer

18

GBN protocol
Consider the GBN protocol with a sender window size of 4 and a sequence number range of 1,024. Suppose that at time t, the next in-order packet that the receiver is expecting has a sequence number of k. Assume that the medium does not reorder messages. What are all possible ... propagating back to the sender at time t? k-5 → k-1 k-4 → k-1 k-5 → k k-4 → k

commented 1 hour ago in Computer Networks by reena_kandari Loyal (3.2k points) | 292 views

+1 vote

3 answers

19

Go back N (arq) protocol
Q. If maximum sequence number in Go back N ( arq) protocol is 'n' then window size (sender) is ? If your answer is 'n' or 'n'+1' then please design GBN for sender window 5 and 11 .

commented 2 hours ago in Computer Networks by Abhi Som (49 points) | 47 views

+2 votes

2 answers

20

is canonical cover and minimal cover the same thing?

commented 3 hours ago in Databases by Bikram Veteran (33.3k points) | 639 views

+1 vote

2 answers

21

Find minimal cover from given functional dependencies

answer selected 4 hours ago in Databases by Bikram Veteran (33.3k points) | 804 views

0 votes

0 answers

22

Rosen(relations)
Given the directed graphs representing two relations, how can the directed graph of the union, intersection, symmetric difference, difference, and composition of these relations be found?

commented 4 hours ago in Set Theory & Algebra by Bikram Veteran (33.3k points) | 39 views

0 votes

1 answer

23

Relations: Doubt About Composites (Conceptual)

answer edited 4 hours ago in Set Theory & Algebra by Bikram Veteran (33.3k points) | 19 views

0 votes

1 answer

24

dependency preserving
if given depedencies are A->B C->B then how can we prove that these dependency will logically imply AC->B ?

commented 4 hours ago in Databases by Bikram Veteran (33.3k points) | 19 views

0 votes

1 answer

25

computer network
Assume that there are k stations transmitting in an ethernet network using CSMA/CD. Probability that station requires the ethernet in the contention slot with probability P is : A = KP(1-P)^k-1 what is the maximum value of A A) 1/e B) 1/ 2e C) 1/4e D) 0.125e

answered 5 hours ago in Computer Networks by Bikram Veteran (33.3k points) | 19 views

0 votes

2 answers

26

Ethernet
What is the maximum theoretical percent utilization in a 802.3 LAN (that uses 10 base 5 cable) with 128 stations connected to five 500 meter segments. The data rate is 10 Mbps. Assume the frame size is 256 bytes and standard slot time is 51.2 μsec. (A) 70% (B) 90% (C) 80% (D) 60%

commented 5 hours ago in Computer Networks by Bikram Veteran (33.3k points) | 178 views

+4 votes

1 answer

27

channel utilization

answered 6 hours ago in Computer Networks by Bikram Veteran (33.3k points) | 82 views

+2 votes

2 answers

28

#ADDRESS INSTRUCTION
Consider the hypothetical processor is supports both 2 address and one address instructions.It has 128 word memory A 16-bit instruction is placed in the one memory word. Q1.What is the range of two address and one address instructions are ... instructions are already existed.How many one address instructions can be supported ? A)128 B)2 C)256 D)32

answered 7 hours ago in CO & Architecture by Bikram Veteran (33.3k points) | 37 views

+1 vote

2 answers

29

Multidimensional array
int b[10][10]; int *a[10]; //How b[2][3] and a[2][3] will work??

commented 7 hours ago in Programming by Hemant Parihar Loyal (3.5k points) | 198 views

+3 votes

1 answer

30

Q 12 (control unit design) MadeEasy workBook

commented 8 hours ago in CO & Architecture by junaid ahmad Active (2.3k points) | 525 views

+2 votes

7 answers

31

GATE2017-2-14
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking printxy(1,1) is 0, 0 0, 1 1, 0 1, 1

answered 8 hours ago in Programming by Utsav09 (15 points) | 865 views

+1 vote

5 answers

32

GATE2017-2-13
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. ... (I) only. (B) (II) only. (C) Both (I) and (II). (D) Neither (I) nor (II).

commented 8 hours ago in DS by Utsav09 (15 points) | 3k views

0 votes

1 answer

33

Digital electronics : Essential prime implicant

commented 8 hours ago in Digital Logic by Bikram Veteran (33.3k points) | 34 views

0 votes

0 answers

34

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

1 answer

35

GATE 2017 Mock
Consider the Following regular expressions r1 = 1(0 + 1)* r2 = 1(1 + 0)+ r3 = 11*0 What is the relation between the languages generated by the regular expressions above ? a) L (r1) ⊆ L (r2) and L(r1) ⊆ L(r3) b) L (r1) ⊇ L (r2) and L(r2) ⊇ L(r3) c) ... and L(r2) ⊆ L(r3) d) L (r1) ⊇ L (r3) and L(r2) ⊆ L(r1) Also Please tell explain the value of 1(1 + 0)+ .

answered 9 hours ago in Theory of Computation by learner_geek Junior (605 points) | 7 views

0 votes

3 answers

36

Prime Implicants and Essential Prime Impliccants

comment edited 9 hours ago in Digital Logic by Bikram Veteran (33.3k points) | 194 views

0 votes

1 answer

37

How is testbook test series? Is it worth trying?

answered 9 hours ago in Study Resources by Arjun Veteran (288k points) | 14 views

0 votes

1 answer

38

array in cache

answered 9 hours ago in CO & Architecture by learner_geek Junior (605 points) | 25 views

+18 votes

7 answers

39

GATE2014-3-39
Suppose we have a balanced binary search tree $T$ holding $n$ numbers. We are given two numbers $L$ and $H$ and wish to sum up all the numbers in $T$ that lie between $L$ and $H$. Suppose there are $m$ such numbers in $T$. If the tightest upper bound on the time to compute the sum is $O(n^a\log^bn+m^c\log^dn)$, the value of $a+10b+100c+1000d$ is ______.

answer selected 9 hours ago in DS by Arjun Veteran (288k points) | 3k views

0 votes

1 answer

40

#MemoryManagement
suppose we have a memory system with 32 bit virtual addresses and 4KB pages.If the 20 level paging is used and the memory required to store all the page tables if page table entry size is 4bytes is 2^a(2^b-1)bytes then a*b is

answer edited 9 hours ago in Operating System by Bikram Veteran (33.3k points) | 36 views

Recent activity

Recent Posts

Recent Blog Comments