Recent questions without answers

0 votes

0 answers

1

GATE-ECE-2017
answer is D but I'm getting A. pls tell where am I going wrong?

asked 3 minutes ago in Digital Logic by aditi19 Active (1.4k points) | 1 view

0 votes

0 answers

2

Number of packets transmitted
Using GBN-7(go back 7) we send 10 packets and if every 5th packet is lost then total number of transmissions will be_____?

asked 1 hour ago in Computer Networks by Lone Wolf Active (1.1k points) | 15 views

0 votes

0 answers

3

madeeasy test series
please help to solve this.thank you

asked 2 hours ago in Digital Logic by Prateek Raghuvanshi Loyal (7k points) | 21 views

0 votes

0 answers

4

#c book
#include<stdio.h> int main() { int num=10; do { while(num++ <10); }while(num++ <=11); printf(“%d”,num); }

asked 2 hours ago in Programming by amit166 (349 points) | 11 views

0 votes

0 answers

5

#data structure
what is the difference between full binary tree,stricly binary tree,complete tree,perfect tree,alomst complete tree?

asked 2 hours ago in DS by amit166 (349 points) | 4 views

0 votes

0 answers

6

C books
#include<stdio.h> main() { char s[7]="1234",*p; p=s+2; *p=0; printf("%s",s); }

asked 2 hours ago in Programming by amit166 (349 points) | 11 views

0 votes

0 answers

7

#c books
main() { int x=1,y=0,z=5; int a=x&&y&&z++; printf("%d",z); }

asked 2 hours ago in Programming by amit166 (349 points) | 13 views

0 votes

0 answers

8

Self Doubt Token Count
How many tokens are there ? int main() { char name={'A','A','K','A','S','H'}; return 0; } Please give any reference if possible, my doubt is about the characters in the braces, do we count them individually or like a string.

asked 3 hours ago in Compiler Design by Aakash_ Active (1.6k points) | 34 views

0 votes

0 answers

9

Circular Link List Insertion and Deletion

asked 4 hours ago in Programming by srestha Veteran (101k points) | 17 views

0 votes

0 answers

10

DBMS Normlization
Consider the relation R(ABCDEFGHIJ) and the set of dependencies: F={AB->C, BD->EF, AD->GH, A->I, H->J} If we decompose R into 2NF and then to 3NF, the number of decomposed relations are __________ ?

asked 4 hours ago in Databases by ARUN KUMAR 3 (333 points) | 9 views

0 votes

0 answers

11

Karumanchi
There is a singly linked list. We have a pointer to a particular node(it is not tail node). what is the time and space complexity required to delete this node? my approach is... As there is no previous pointer so we traverse the list from the starting to just ... complexity as O(n) and space complexity O(1). but in the book the time complexity is mentioned O(1) where am I going wrong?

asked 4 hours ago in DS by aditi19 Active (1.4k points) | 13 views

0 votes

0 answers

12

prev year question
the eigen values of the following matrix -1 3 5 -3 -1 6 0 0 3

asked 6 hours ago in Mathematical Logic by suneetha (331 points) | 18 views

0 votes

0 answers

13

Made easy

asked 6 hours ago in Computer Networks by abhishekmehta4u Boss (24k points) | 21 views

0 votes

0 answers

14

probability
Consider a hash table with 10 slots. Collisions are resolved using linear probing. The probability that if first 3 slots are unfilled and 4th insertions leads to a collisions ________. (Upto 3 decimal places) // my answer is 7/10 * 6/10 * 5/10 * 3/7 = 90/1000 = 0.09

asked 6 hours ago in Probability by Lone Wolf Active (1.1k points) | 20 views

0 votes

0 answers

15

Self doubt
1) P(A/B) = P(A $\cap$ B) / P(B) 2) P(A/B) = P(B $\cap$ A) / P(B) What is the difference in this equation.. P(A $\cap$ B) and P(B $\cap$ A) are same ???

asked 6 hours ago in Probability by jatin khachane 1 Active (1.9k points) | 6 views

0 votes

0 answers

16

indexing
Consider search field V= 9bytes block size B= 512bytes record pointer Pr=7bytes and block pointer Pb is 6bytes How many children can a node have or order of tree so that each node can come in single block _____________________ answer24???

asked 7 hours ago in Databases by altamash (247 points) | 11 views

0 votes

0 answers

17

serializable
Consider the transactions T1, T2, T3 with the following schedule S: S : T1: Read (x); T2: Read (z); T1:Read(z); T3:Read(x);T3:Read(y); T1:Write(x); T3:Write (y);T2:Read(y); T2:Write(z); T2:Write(y) If the schedule S is serializable, the equivalent serial schedule is ____. iam getting T3-T1-T2 after drawing precendence graph but answer given T3-T2-T1

asked 7 hours ago in Databases by altamash (247 points) | 5 views

0 votes

0 answers

18

Hamacher
what is the approach for this problem? also what will be solution for little endian notation?

asked 8 hours ago in CO & Architecture by aditi19 Active (1.4k points) | 16 views

0 votes

0 answers

19

Modulo Operator
What is −6 mod 18? Please elaborate.

asked 8 hours ago in Numerical Ability by Mizuki Active (1k points) | 17 views

0 votes

0 answers

20

Made easy

asked 9 hours ago in Computer Networks by abhishekmehta4u Boss (24k points) | 22 views

0 votes

0 answers

21

BINARY MIN HEAP MADE EASY TEST
Consider a binary min heap given below containing integer in [1, 15]. The maximum number of node movement on 5 successive removal of element are ________.

asked 9 hours ago in DS by codingo1234 (339 points) | 28 views

0 votes

0 answers

22

Theory of Computation
For a binary string x = a0a1 · · · an−1 define val(x) to be the value of x interpreted as a binary number, where a0 is the most significant bit. More formally, val(x) is given by How many minimum states will be in a finite automaton that accepts exactly the set of binary strings x such that val(x) is divisible by either 4 or 5. i m getting 5 states. ??

asked 9 hours ago in Theory of Computation by Abhisek Tiwari 4 Active (1.5k points) | 8 views

0 votes

0 answers

23

VirtualGate
If L is a CFL and R si regular, then L/R is[/->quotient] (A) Regular (B) CFL but not regular (C) Recursive but not CFL (D) None of the above And Comment on following statements 1.CFL / Regular = CFL 2.CFL / CFL = Recursively Enumerable 3.Recursively Enumerable / Recursively Enumerable = Recursively Enumerable true for both left quotient and right quotient

asked 10 hours ago in Theory of Computation by Abhisek Tiwari 4 Active (1.5k points) | 12 views

0 votes

0 answers

24

Kenneth Rosen 7th Edition, Chapter 1,Section 1.6,Example 6

asked 10 hours ago in Mathematical Logic by ccrjha1 (25 points) | 15 views

0 votes

0 answers

25

IIT-Hyderabad M.Tech. (RA) - Need Interview Preparation Advice

asked 11 hours ago in Interview Questions by intergalactic_ape (19 points) | 31 views

0 votes

0 answers

26

ugc net
Application of data structure is queue is : (A) Level wise printing of tree. (B) Implementation of priority queues. (C) Function call implementation (D) Depth first search in a graph.

asked 12 hours ago in Programming by shruti gupta1 (303 points) | 15 views

0 votes

0 answers

27

Test series
Check please i think it's deadlock

asked 12 hours ago in Operating System by twin_123 (37 points) | 23 views

0 votes

0 answers

28

SELF DOUBT
https://gateoverflow.in/2608/gate1995-1-21 IN THE GRAPH WHY TWO EQUATIONS ARE TAKEN MEANS HOW X=Y AND COSX TWO DIFFERENT THINGS ARE TAKEN TO GET INTERSECTION POINT.

asked 13 hours ago in Calculus by eyeamgj Loyal (5.9k points) | 4 views

0 votes

0 answers

29

Doubt cn
Number of Contention Intervals = (1-1/N)1-N - 1 N = Number stations Can anyone explain how this formula is coming....

asked 14 hours ago in Computer Networks by Ritam Biswas 1 (139 points) | 9 views

0 votes

0 answers

30

Madeeasy Workbook
Consider a device of 1MBPS is operating in a cycle stealing mode of DMA .Whenever 16 B word is available it is transferred into memory in 4 microseconds. What is the % of time the processor is blocked due to DMA? a) 10% b) 20% c) 80% d) 90%

asked 14 hours ago in CO & Architecture by Avir Singh (35 points) | 11 views

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

Recent questions without answers

Recent Posts

Recent Blog Comments