Recent questions without answers

0 votes

0 answers

Self-Doubt on Partial dependency
1NF 2NF 3NF BCNF when a non-prime attribute depends on the prime attribute then it becomes a partial dependency My Doubt is: when a non-prime attribute depends on the Primary key itself or any of the candidate key(but not on key attribute), then, in that case, what happens? Will it be partial dependency or not?

asked 4 hours ago in Databases by Rudr Pawan (577 points) | 6 views

0 votes

0 answers

Gatebook Test series: Dbms (Indexing)
Consider the database EMPLOYEE and file parameters given below EMPLOYEE field and sizes 4 B Suppose that the file is not ordered by the key field and we want to construct a access structure (index) on . Let P be the branch-node order, and be the leaf-node order, ... First one or second one? (P-1)(Key+$R_{p}$)+6B$\leqslant$512B P(Key+$R_{p}$)+6B$\leqslant$512B

asked 4 hours ago in Databases by Kushagra गुप्ता (82 points) | 5 views

0 votes

0 answers

Array Multiplier
Could any one please clarify do we have array multiplier in syllabus ?

asked 4 hours ago in CO & Architecture by Shivateja MST (35 points) | 7 views

0 votes

0 answers

NPTEL Assignment: Dbms (Indexing)
Calculate branching factor in case for B- tree index structure, given: page size: 16 kB, key-size: 16 bytes, pointer size = 8 bytes ? 255 256 510 511 (Note: The answer I am getting is 512 but the given answer is 511. Is my answer correct & if not please tell the approach.)

asked 5 hours ago in Databases by Kushagra गुप्ता (82 points) | 3 views

0 votes

0 answers

Self Doubt: Discrete Maths 101
Does Euler graph must contain Euler path? Is the converse true?

asked 8 hours ago in Graph Theory by Debapaul (117 points) | 10 views

0 votes

0 answers

GATE GURU:FUNCTIONS
Can we represent all real numbers by a function? If so, then both are true right?

asked 10 hours ago in Set Theory & Algebra by Debapaul (117 points) | 11 views

0 votes

0 answers

GATE GURU DISCRETE MATHS
Why is $(II)$ not a poset?

asked 11 hours ago in Set Theory & Algebra by Debapaul (117 points) | 16 views

0 votes

0 answers

Discrete Maths : GATE GURU TEST
Ans should be (II) only right? or should it be (II) and (III) According to me only II is correct as in III we are defining another variable altogether, though we know that x is dog. Any help will be highly appreciated.

asked 12 hours ago in Mathematical Logic by Debapaul (117 points) | 5 views

0 votes

0 answers

CO self doubt on logic of DMA
If DMA transfer rate given in clock cycles And Hard disk transfer rate of block is given Then from these two how can we get processor time or CPU time? What is logic behind processor time from DMA?

asked 15 hours ago in CO & Architecture by srestha (315 points) | 8 views

0 votes

0 answers

NPTEL Assignment : DBMS
BCNF 4NF PJNF DKNF

asked 1 day ago in Databases by Kushagra गुप्ता (82 points) | 11 views

0 votes

0 answers

Made Easy test series 2020 computer network question

asked 1 day ago in Computer Networks by vishal burnwal (9 points) | 21 views

0 votes

0 answers

Self doubt ( subnetting)
If we are given number of subnet bits = 3, then number of subnets possible will be 6 or 8? It is very confusing. Somewhere it is given 6 and somewhere it is mentioned that we can use all the 8. Please clarify.

asked 1 day ago in Computer Networks by chandrikabhuyan8 (88 points) | 21 views

0 votes

0 answers

Gatebook : CO
What conclusions can be drawn regarding traffic generated to the main memory for write through and write back if we vary miss rate? Higher miss rate write through is superior (generates less traffic) Higher miss rate write back is superior (generates less traffic) Lower miss rate write ... A). 1, 4 are true (B). 2, 3 are true (C). No conclusions can be drawn (D). Similar performance

asked 2 days ago in CO & Architecture by Sambhrant Maurya (275 points) | 9 views

0 votes

0 answers

Subnetting and classful addressing
What is the subnet address of the IP address 192.168.5.55 with a subnet mask of 255.255.255.224 ? Is it 192.168.5.32 ??

asked 2 days ago in Computer Networks by s_dr_13 (10 points) | 9 views

0 votes

0 answers

Gatebook: CO Basics
A computer uses 8 digit mantissa and 2 digit exponent. If a = 0.052 and b = 28E + 11 then will A. result in underflow B. result in overflow C. 0 D. 5.28 E + 11

asked 2 days ago in CO & Architecture by Sambhrant Maurya (275 points) | 7 views

0 votes

0 answers

Self Doubt : Integer Solution
Find the number of ways 5 dices can be rolled to get a sum of 25. While solving this question, the way we solve it is $x_1+x_2+x_3+x_4+x_5$ $=25$ where $1<=x_i<=6$ So we replace $x_i$ by $y_i =6-x_i$ , which is $x_i=6-y_i$ substituting ... first problem all the dices should have value $>0$ , so why in that case we haven't made $x_i=y_i+1$ for all the cases?

asked 2 days ago in Combinatory by Debapaul (117 points) | 36 views

0 votes

0 answers

Doubt on GATE question(CO)
An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by k. What is the miss ratio if ... least-recently-used replacement policy? Someone explain the line An access sequence of cache block addresses is of length N

asked 3 days ago in CO & Architecture by srestha (315 points) | 16 views

0 votes

0 answers

Gatebook: CO
#include <stdio.h> int main() { unsigned char arr[2] = {0x01, 0x00}; unsigned short int x = *(unsigned short int *) arr; printf("%d", x); getchar(); return 0; } What is the output on little endian and big endian respectively? A. 1, 1 B, 256, 1 C. 1, 256 D. None of above Please explain how the array is stored in memory here and how we are accessing it using x.

asked 3 days ago in CO & Architecture by Sambhrant Maurya (275 points) | 11 views

0 votes

0 answers

Gatebook: Addressing Modes
Consider an instruction of indirect addressing mode. What are the number of memory references by the processor when instruction is a computation that requires a single operand and when it is a unconditional branch instruction respectively ? A. 3, 3 B. 3, 2 C. 2, 2 D. 4, 3

asked 3 days ago in CO & Architecture by Sambhrant Maurya (275 points) | 17 views

0 votes

0 answers

TextBook Test-series Compiler design Topic-test-3
Is it question correctly formed or not? If possible elaborate a little bit.

asked 3 days ago in Compiler Design by Nitesh Singh 2 (7 points) | 10 views

0 votes

0 answers

self doubt- why shift-reduce parser and bottom-up parser works differently on an SDT?

asked 3 days ago in Compiler Design by Nitesh Singh 2 (7 points) | 5 views

0 votes

0 answers

MADE EASY COMPUTER ORGANISATION
A cache memory is 30 times faster than main memory (MM) and 50% of the time cache is referred for the execution of instruction. The performance is gained by introducing this cache is ________. They have solved the question using simultaneous access, why have they not used hierarchical access?

asked 3 days ago in CO & Architecture by Debapaul (117 points) | 3 views

0 votes

0 answers

N ary Relation Table
“For an n-ary relationship set with an arrow on one of its edges, the primary keys of the entitysets not on the “arrow” side of the relationship set serve as the primary key for the schema.” Can anyone please explain the following statement with some example.

asked 3 days ago in Databases by Shivateja MST (35 points) | 6 views

0 votes

0 answers

GATE 2018 interrupt self doubt
Why the answer is NOT B? In my opinion it is not always the case that the processor always completes the execution of current program and then service the interrupt. U can see the TRAP interrupt in INTEL 8085 processor, where the interrupt is services immediately ... u will surely die. But what it does is what is mentioned in option B. So how come option a is right?

asked 3 days ago in Compiler Design by Debapaul (117 points) | 19 views

0 votes

0 answers

Self_Doubt DBMS-decomposition
Consider we have a relation R(ABCD) and FDs AB→C,C→AD. And we decomposed the relation as R1 (ABC) and R2 (CAD) so FD AB→C goes to R1 & C→AD goes to R2. My doubt is do we have FD C→A in relation R1 (after decomposition). C→AD is already in ... we check for highest normal form? For example, if we consider C→A in R1, then R1 is not in BCNF. Otherwise R1 is in BCNF.

asked 3 days ago in Databases by Amal (23 points) | 6 views

0 votes

0 answers

Is this a Regular language or not?
Here ‘w^r’ is the reverse of string ‘w’.

asked 3 days ago in Theory of Computation by luc_Bloodstone (11 points) | 14 views

0 votes

0 answers

TIme complexity Made easy
What is time complexity for this function?

asked 4 days ago in Algorithms by vupadhayayx86 (6 points) | 15 views

0 votes

0 answers

Gatebook : Memory Organization
Consider a cache system organization employing a line size of 64 Bytes and main memory that requires 40 ns to transfer a 2 Byte word. What is the minimum average number of times a cache line must be made dirty for write-back policy to be more efficient than write-through policy, for any line which is written at-least once?

asked 4 days ago in CO & Architecture by Sambhrant Maurya (275 points) | 5 views

0 votes

0 answers

Gatebook: Memory Organization
The designers of a computer must select a cache system. They have two options. Design #1 uses a direct-mapped cache containing 2 words per cache line. It would have an instruction miss rate of 3% and a data miss rate of 8% Design #2 uses a 2-way set associative cache containing 8 words per cache ... . D1 = 0.70, D2 = 0.40 C. D1 = 0.70, D2 = 0.48 D. D1 = 1.10, D2 = 0.40

asked 4 days ago in CO & Architecture by Sambhrant Maurya (275 points) | 17 views

0 votes

0 answers

MADE EASY MULTI SUBJECT COMPILERS

asked 4 days ago in Compiler Design by Debapaul (117 points) | 7 views

0 votes

0 answers

MADE EASY CD 2020-21
S’→ A. A→ .A * B B→ .id None

asked 4 days ago in Compiler Design by Debapaul (117 points) | 10 views

0 votes

0 answers

MADE EASY TOC 2020
L1 CSL, L2 CFL L1 CSL, L2 CSL L1 CFL, L2 CFL L1 CFL, L2 CSL

asked 4 days ago in Theory of Computation by Debapaul (117 points) | 16 views

0 votes

0 answers

nptel assignment
I am getting answer 64 didn’t know how answer is 40

asked 4 days ago in Combinatory by Akanksha Agrawal (6 points) | 16 views

0 votes

0 answers

Database management system 3e by Raghu Ramakrishnan

asked 4 days ago in Databases by Vimal Patel (217 points) | 30 views

0 votes

0 answers

MADE EASY COMPILER DESIGN 2020

asked 4 days ago in Compiler Design by Debapaul (117 points) | 13 views

0 votes

0 answers

Self-Doubt-- Fork Address Printing
MY QUESTION IS 1)WHY PRINTF() PRINT VIRTUAL ADDRESS(MENTIONED IN EXPLANTION) NOT PHYSICAL ADDRESS 2) WHY VIRTUAL ADDRESS(O/P OF PRINTF(&VAR)) OF A VARIABLE CHANGES WHEN WE RUN A PROGRAM MANY TIMES Consider the following code fragment: ... in child process. Therefore, we get same addresses in both parent and child. https://gateoverflow.in/84315/fork-system-call

asked 4 days ago in Operating System by HeartBleed (51 points) | 10 views

0 votes

0 answers

Gatebook: Pipelining
In a certain pipelined processor a branch can cause 2 stalls if it is not dealt properly. We can avoid this penalty if a clever compiler can fill the immediate next 2 slots with independent instructions. Two compilers X and Y generate code for this processor. Compiler A ... improvement in CPI(Clocks Per Instruction) with compiler X over compiler Y? (A) 0 (B) 5 (C) 10 (D) 15

asked 4 days ago in CO & Architecture by Sambhrant Maurya (275 points) | 6 views

0 votes

0 answers

#ProgrammingDoubt
Why f1() prints 15 15 , whereas f2() prints 15 20 , what is the differe void f2(){ static int i = 10 ; i = i+5; printf(“%d” , i ); } void f1(){ static int i ; i = 10 ; i = i+5 ; printf("%d" , i) ; } void main() { f1(); f1(); }

asked 4 days ago in Programming by anurag sharma (10 points) | 9 views

0 votes

0 answers

floor or ceil which to use in the given problem's time complexity #self-doubt (example of Narasimha Karumanchi)

asked 4 days ago in Algorithms by debasree88 (8 points) | 6 views

0 votes

0 answers

CPU Organization
The content of which of the following determines the state of the CPU at the end of the execute cycle Program Counter Processor Register Certain status conditions 1 and 2 2 and 3 1 and 3 1, 2 and 3 Please explain why you chose each one of them.

asked 5 days ago in CO & Architecture by Abhipsa Mishra (6 points) | 10 views