- The below mentioned code is in which programming language type array-identifier = array[index-type] of element-type;
- Suppose we have a printer shared between various machines in a network, and any machine or computer in a network can send a print request to the printer. B...
- If we want to represent the graph as an______ , then it can be implemented as_______.
- The dynamic memory allocation is the memory allocation done at the _________.
- What this code line say? int (*p )(char *a)
- Which are types of system design
- WI-FI uses
- How many bits are there in Ethernet address
- Which device operates at physical layer
- FAT stands for?
- Which is the first process launched by the LINUX?
- Relational Algebra is
- Which of the following table does not exists physically?
- Join of two table R and S where each has “m” and “n” tuples will be of size?
- The major drawback of RAD model is __________.
- Which of following is /are for strict evaluation?
- An ‘agent’ is anything that,
- Below code will give what result for f(3) f(int x) { If(x Return; f(x-1); printf(“%d”, x); f(n-1); }
- calculate the complexity of the below recursive code Int f(int n) { If(n return 1; return f(n/2)+f(n/2); }
- Which of the following represents the relationship between object and classes?
- Cardinality related to ————–
- How many labeled binary tress can be made with n nodes?
- "Parity bits" are used for which of the following purposes?
- A proxy server is used as the computer?
- Which of the following will occur when we broadcast two packets on the medium at a time?
- SELECTGETDATE(); This query will give
- __________ is capable of taking decisions on its own.
- Which is not a datatype of COBOL language
- COBOL is used in
- SELECT E.EmpFname, E.EmpLname, P.EmpPosition FROM EmployeeInfo E INNER JOIN EmployeePosition P ON E.EmpID = P.EmpID AND P.EmpPosition IN ('Manager'); This...
- Write a query to fetch department-wise count of employees sorted by department’s count in ascending order. EmployeeInfo is the table name. ...
- Which is not true for B-Tree?
- Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?
- A B-tree of order 4 is built from scratch by 10 successive insertions. What is the maximum number of node splitting operations that may take place?
- A is the only candidate key. Then how many superkey possible with R(A,S,C,D)
- AB`->` CD AF`->` D DE`->` F C`->` G F`->` E G`->` A Then which of the following is false?
- Relation R(A,B,C,D,E) has {AB`->` C, C`->` D,B`->` EA} FUNCTIONAL DEPENDENCY Find the candidate key of the relation.
- F={PR`` ST, PSU`` QR} which of the following is trivial functional dependency in F closure?
- relation R(ABCD) has these dependencies {A → B, B → C,C → D} and it is decomposed into three relations R1(AB) , R2(BC), AND R3(CD). State true or fal...
- Identify the highest normal form for the given set of dependencies on relation R R(ABCDE)= {AB → C, C → D, D → E, E → A,D → B} ...

Question Listing

×

×