Recent questions without answers

0 votes

0 answers

1

Hasse Doubt
what is the least upper bound of {a, b, c}?

asked 8 hours ago in Set Theory & Algebra by aditi19 Active (3.5k points) | 14 views

0 votes

0 answers

2

ACE ACADEMY: DFA
How many 2 state DFA’s with designated initial state can be constructed over the alphabet over the alphabet Σ = {a, b} that accept universal language? (a) 4 (b) 16 (c) 20 (d) 24

asked 1 day ago in Theory of Computation by Hirak Active (2.1k points) | 14 views

0 votes

0 answers

3

ACE ACADEMY: TOC
How many 2 state DFA’s with designated initial state can be constructed over the alphabet Σ = {a, b} that accept empty language ϕ ? (a) 4 (b) 16 (c) 20 (d) 24

asked 1 day ago in Theory of Computation by Hirak Active (2.1k points) | 23 views

0 votes

0 answers

4

Computer Networks -email
How will you send an e-mail to someone when you have neither the recipient's e-mail address nor the e-mail application.

asked 1 day ago in Computer Networks by shraddha priya Active (3.8k points) | 25 views

0 votes

0 answers

5

Self Doubt :automata
Is Mealy machine and Moore Machine in syllabus?

asked 1 day ago in Theory of Computation by Hirak Active (2.1k points) | 11 views

0 votes

0 answers

6

Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________

asked 1 day ago in DS by srestha Veteran (114k points) | 18 views

0 votes

0 answers

7

UGC NET 2015 DEC-III
Consider the following three SQL queries (Assume the data in the people table): (a)Select Name from people where Age > 21; (b)Select Name from people where Height > 180; (c)Select Name from people where (Age > 21) or (Height > 180); If ... 10 rows and 7 rows in the result set respectively, then what is one possible number of rows returned by the SQL query (c) ?

asked 1 day ago in Databases by aditi19 Active (3.5k points) | 7 views

0 votes

0 answers

8

Number System (self doubts)
mam how convert into hexadecimal

asked 1 day ago in CO & Architecture by altamash (499 points) | 9 views

0 votes

0 answers

9

Made Easy Test Series:Databases-Tables
Number of tables required in above ER diagram will be _____________ Is $R_{1}$ create separate table or not?? and $R_{2}$ look like if we remove loop from it?? Answer given for table $E_{1}R_{1}$ Key will be $AC$ , with ... Entities. So, it will add one extra table. I already read https://gateoverflow.in/229580/madeeasy-test-series-number-of-tables-required

asked 1 day ago in Databases by srestha Veteran (114k points) | 9 views

+2 votes

0 answers

10

IISc CSA - Research Interview Question
Prove that the rank of the Adjacency Matrix which is associated with a $k-$ regular graph is $k.$

asked 1 day ago in Graph Theory by ankitgupta.1729 Boss (11.4k points) | 43 views

0 votes

0 answers

11

networks TCP
Calculate the effective throughput for transferring a 1000 KB file assuming TCP using slow start congestion control technique. Given the round trip time 100 ms, and maximum segment size is 1460 bytes. Assume there are no losses and both the bandwidth and the receiver window size is infinite. (A) 5MBPS (B) 10Mbps (C) 1MBPS (D) 1Mbps

asked 1 day ago in Computer Networks by pradeepchaudhary Active (1.2k points) | 25 views

0 votes

0 answers

12

Made Easy Test Series: Stack Address
A stack based CPU executes the instruction. Memory location $500$ contain $0X 88$ and memory location $700$ contain $0X37$. The stack pointer is at $0X003F$ The instruction are as follows: $I_{1}:PUSH$ $500$ $I_{2}:PUSH$. $700$ ... execution of instruction. $C)$ Memory location $600$ contain $0XBF$ after execution of instruction. $D)$ Both $a)$ and $c)$

asked 1 day ago in DS by srestha Veteran (114k points) | 5 views

0 votes

0 answers

13

PIPELINING.
How to find number of stall cycles and branch penalty & CPI in a branched instruction pipelining?

asked 2 days ago in CO & Architecture by Ritabrata Dey (43 points) | 7 views

+1 vote

0 answers

14

Vani Qs Bank Algorithms
.Given an array of distinct integers A[1, 2,…n]. Find the tightest upper bound to check the existence of any index i for which A[i]=i. Ans should be O(log n) right by doing binary search ??

asked 2 days ago in Algorithms by Hirak Active (2.1k points) | 37 views

0 votes

0 answers

15

Sheldon Ross, Chapter #4, Question #13
An airline operates a flight having 50 seats. As they expect some passenger to not show up, they overbook the flight by selling 51 tickets. The probability that an individual passenger will not show up is 0.01, independent of all other ... the airline has to pay a compensation of Rs.1lakh to that passenger. What is the expected revenue of the airline?

asked 2 days ago in Probability by Asim Siddiqui 4 Junior (809 points) | 23 views

+1 vote

0 answers

16

GEEKSFORGEEKS ALGO
What does it mean when we say that an algorithm X is asymptotically more efficient than Y? (A) X will be a better choice for all inputs (B) X will be a better choice for all inputs except small inputs (C) X will be a better choice for all inputs except large ... is it always the case?? At some points it might be true but I do not think this is the case for each and every input..

asked 3 days ago in Algorithms by Hirak Active (2.1k points) | 23 views

0 votes

0 answers

17

Made Easy Test Series:Microprogramming
A hypothetical cpu supports $300$ instructions.each instruction takes $5$ cycle to accomplish the execution. the control unit is designed using vertical programming which has $130$ control signals $,64$ flags and $12$ branch conditions .$X$ and ... register$(CDR)$ respectively.value of $X+Y$ is ______? How to work with branch condition in micro programming :(

asked 3 days ago in CO & Architecture by srestha Veteran (114k points) | 13 views

0 votes

0 answers

18

CCMT Admission doubt
Which one is better among NITW CSIS and NITK CSE? Also please let me know the pros and cons of both. Need to change my willingness accordingly before 22nd May. Help from mentors and admins would be much appreciated. Thanks in advance.

asked 3 days ago in NITs by shraddha priya Active (3.8k points) | 31 views

0 votes

0 answers

19

Made Easy Test Series: Synchronization
Consider the two processes need to access $P_{i}$ and $P_{j}$ need to access the C.S. The following synchronization construct used by both the processes. Process Pi While(true){ j=false; i=true; while(j==true); CRITICAL SECTION i=false; } ... true); CRITICAL SECTION j=false; } I got it is not satisfying M.E., but will it satisfying deadlock too?? Plz explain-

asked 3 days ago in Operating System by srestha Veteran (114k points) | 29 views

0 votes

0 answers

20

Recurrence Relation-Self Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??

asked 4 days ago in Algorithms by srestha Veteran (114k points) | 39 views

0 votes

0 answers

21

ROM(self doubts)
The minimum size of the ROM which maintains truth table of square of 3 bit numbers is __________ (in bits)

asked 4 days ago in CO & Architecture by altamash (499 points) | 10 views

0 votes

0 answers

22

Self doubt Data structures
Implement Linked list using stack.

asked 4 days ago in Programming by shraddha priya Active (3.8k points) | 80 views

0 votes

0 answers

23

Self Doubt:Operating System-Threads
User level threads doesnot require context switching- This is a true statement (Because OS cannot recognize user level threads) Can somebody elaborate more on it?? This given answer is wrong I think:https://gateoverflow.in/290648/made_easy_test_series Plz check

asked 4 days ago in Operating System by srestha Veteran (114k points) | 16 views

0 votes

0 answers

24

Made Easy Test Series: Database-Normalization
Consider the relation $R\left ( A,B,C,D,E \right )$ with functional dependencies $F=${ $A\rightarrow B$ $BC\rightarrow E$ $ED\rightarrow A$ } Number of additional relation required to convert it into lossless , dependency preserving $3NF$ decomposition is _____________ What is meaning of additional relation (Here no table mentioned previously)??

asked 4 days ago in Databases by srestha Veteran (114k points) | 24 views

0 votes

0 answers

25

Mode of OS during page table access
What is the mode(User/Kernel) of the Operating System when a Page Table or TLB are being accessed?

asked 5 days ago in Operating System by !KARAN Active (1.8k points) | 13 views

0 votes

0 answers

26

IIIT-H INTERVIEW
Why does OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?

asked 5 days ago in Databases by shraddha priya Active (3.8k points) | 33 views

0 votes

0 answers

27

Made Easy Test Series:Algorithm-Dijkstra
Which of the following procedure results same output as Dijkstra’s Algo. on unweighted graph on $'n'$ verices? $A)$ BFS $B)$ DFS $C)$Kruskal $D)$ Prims As far I know Dijkstra and Prims both have $T.C.=O(E+VlogV)$ But ans given BFS. How this ans possible??

asked 5 days ago in Algorithms by srestha Veteran (114k points) | 28 views

0 votes

0 answers

28

Admission through ccmt
In second round of ccmt i got nit warangal cs-is and if i float again for third round i can get nit surathakal cs ,so for third round should i float or internal sliding for cs of warangal ??please help

asked 5 days ago in NITs by Prateek Raghuvanshi Boss (10.2k points) | 73 views

0 votes

0 answers

29

CCMT 2019
If Anyone got NIT Rourkela IS/SE or IIIT A in CCMT 2nd Round, then please comment the score along with category so that it will be useful

asked 5 days ago in Written Exam by Ashok (391 points) | 24 views

0 votes

0 answers

30

Made Easy Test Series:Algorithm-Time Complexity
Consider a procedure $find()$ which take array of $n$ integers as input, and produce pair of element of array whose difference is not greater than the difference of any other pair of element of that array. Which of the following represent ... Here we need to sort first and then need to compare adjacent element right?? Then what will be complexity??

asked 5 days ago in Algorithms by srestha Veteran (114k points) | 37 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