EMC Question 2

Yian Effortless question sharing:
1 protected member function can be swollen call
2 "has-a" relationship refers to what, the answer is instance, reference, pointer, etc...
3 bytes of int, char, short, long
4 in C + +, the variable time declaration is why
5 Function of the namespace
6 int a[10][10];
int *b[10];
Which of the following is correct
A[3][4] = 91;
B[3][4] = 91;
A[1] =null;
B[1] = a[2];
7 12&&10, 12| | Ten, 12&10, 3>>1, 3>1 results.
8 Under x86_64 System
struct
{
int i;
char c;
Double D;
};
Union
{
int i;
char c;
Double D;
};
Char s[100];
Long C;
The value of sizeof
Ten. An employee has one or both managers, and one manager manages one or more employees. In database conceptual design, the relationship between entity sets employee and manager are
A one to one
B one to many
C many to one
D many to many
E none of the above
One there is relations R1 (A, B, C) and R2 (b, D, E). Which of following techniques cannot is used to improve the performance of the natural join of the of the relations?
A make use of multiple parallel processes in a multi-core machine to implement the join algorithm
B increase the CPU L2 cache hit ratio of the join algorithm implementation
C partition the relations to different machines by using join attributes and execute the join on many machines in parallel
D when the number of tuples in R2 are large and the number of tuples in R1 are small, build and index on R1 and use index Jo In method
E none of the above
Which of the following statements about checkpoints (with log-based recovery schemes) in databases are/is not correct?
A checkpoints is used to decrease the time used for failure recovery
B checkpoints is done periodically in the database to assure ACID properties of transactions
C periodic checkpoints decreased the number of log entries that need to be redone during recovery
D during checkpointing, updated disk blocks is written to disk
E none of the above
There is a huge relation R (a,b,c) of size M and A are the primary key. The tuples in R was sorted by using A and no index was built for R. Each disk block size of B, and each block read takes N seconds. To find a tuple in R with a =17954 the estimated optimized cost is
A m*n/b
B N*log (m/b)
C m*n/(2b)
D (m+n)/b
E log (m*n)/b
Which of the following descriptions of Reader/writer locks are/is wrong?
A caller cannot upgrade its read lock (already obtained) to write lock
B caller can downgrade its write lock (already obtained) to read lock
C caller can get read lock if there is no write lock held by others
D multiple callers can hold a read lock at the same time
E only one caller can hold a write lock at a time
152 pages of memory, four pages of files, reading order of 1 2 1 3 1 2 4 2 1 3 1 2 4 2 1 2 3 4 3 1,fifo, ask the cache hit ratio how much
16 Threads
Option contained with a process
Share an address space
Share signals
Share errno
Swith faster than process.
Which one is not above IP
DNS, SNMP, HTTP, ARP, NTP
Map-reduce Framework
Buffer Overflow
System Virtualization
VMS, VMM, IO, memory space
21st
#include
Using namespace
void Main ()
{
cout << "Hello World" << Endl;
}
Modify the program so that the main program cannot be modified to output the
Initiate
Hello World
Destroy
Process & Thread
Virtual memory space
Kernel Register, Stack
Fork
Copy-on-write

EMC Question 2