Register
Filter

Recent questions without an upvoted answer

0 votes
1 answer
4
Constructors
A constructor cannot be explicitly called by the client program. true or false?
A constructor cannot be explicitly called by the client program. true or false?
User Avatar
0 votes
0 answers
5

A program that includes the file containing a class declaration is called a ________ program of the class.
A program that includes the file containing a class declaration is called a ________ program of the class.
User Avatar
0 votes
0 answers
6
Arrays
Consider an integer upper triangular 2D array arr[–8 to +7][–8 to +7] having base address 1000. If the size of the integer is 4 bytes, the address of the element present at location arr[–6][4] is- ____________.
Consider an integer upper triangular 2D array arr[–8 to +7][–8 to +7] having base address 1000. If the size of the integer is 4 bytes, the address of the element pres...
User Avatar
0 votes
1 answer
8
FIRST $ FOLLOW
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
0 votes
1 answer
9
FIRST & FOLLOR
S -> A B A -> f S f A -> b b B d B -> Ɛ B -> c First(S) = First(A) = First(B) = Follow(S) = Follow(A) = Follow(B) =
S - A BA - f S fA - b b B dB - ƐB - cFirst(S) =First(A) =First(B) =Follow(S) =Follow(A) =Follow(B) =
User Avatar
0 votes
1 answer
10
Number of Super Keys
R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)
R(A1, A2,A3,A4....AN). How many super keys possible in relation? If (A1 is candidate key, A2 is candidate key, A3 is candidate key)
User Avatar
1 votes
1 answer
11
#TOC regular expression
what will be the regular expression of this DFA using Arden's theorem
what will be the regular expression of this DFA using Arden's theorem
User Avatar
0 votes
2 answers
14
Permutations
In how many ways can four letters from COFFEE be picked considering all permutations?
In how many ways can four letters from COFFEE be picked considering all permutations?
User Avatar
0 votes
1 answer
16
Linear Algebra AX=B
Consider a matrix A (n×m) ,X(m×n) and B(n×n) such that AX=B . If A has k linearly independent columns then what conclusions can we nake about the number of linearly independent columns of B.
Consider a matrix A (n×m) ,X(m×n) and B(n×n) such that AX=B . If A has k linearly independent columns then what conclusions can we nake about the number of linearly in...
User Avatar
0 votes
1 answer
17
ISI kolkata MTech CS 2019
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths from $u$ to $v$ that do not contain the vertex $w$.
Let $K_n$ denote the complete graph on $n$ vertices, with $n ≥ 3$, and let $u$, $v$, $w$ be three distinct vertices of $K_n$. Determine the number of distinct paths fro...
User Avatar
0 votes
0 answers
19
Relational Database
Give an appropriate tree-structure diagram for the following relational database: Employee (person_name, street, city) Works (person_name, company_name, salary) Company (company_name, city) Manages (person_name, manager_name)
Give an appropriate tree-structure diagram for the following relational database:Employee (person_name, street, city)Works (person_name, company_name, salary)Company (com...
User Avatar
0 votes
1 answer
20
question on Supernetting
You have the following four contiguous networks: $10.0.0.0/24$ $10.0.1.0/24$ $10.0.2.0/24$ $10.0.3.0/24$ What is the supernet address that can represent all these networks?
You have the following four contiguous networks:$10.0.0.0/24$$10.0.1.0/24$$10.0.2.0/24$ $10.0.3.0/24$What is the supernet address that can represent all these networks?
User Avatar
0 votes
1 answer
23
self doubt
how to check the validity of an a argument using laws of logics
how to check the validity of an a argument using laws of logics
User Avatar
0 votes
1 answer
26
Minimal Cover
Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies: A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BC Find minimal cover ?
Consider R(A,B,C,D,E,H) be a relational schema with the following functional dependencies:A->BC, CD->E, E->C, D->AEH, ABH->BD, DH->BCFind minimal cover ?
User Avatar
0 votes
0 answers
27
Digital Logic
What is the maximum n-bit number in base x ,when represented in decimal(10)?
What is the maximum n-bit number in base x ,when represented in decimal(10)?
User Avatar
Page: