Advertisements
Advertisements
State DeMorgan's Laws of Boolean Algebra and verify them using a truth table.
Concept: undefined >> undefined
Hi-Standard Tech Traj.ning Ltd. is a Mumbai based organization which is expanding its office set-up to Chennai. At Chennai office compound, they are planning to have 3 different blocks for Admin, Training and Accounts related activities. Each block has a number of computers, which are required to be connected in a network for communication, data and resource sharing.
As a network consultant, you have to suggest the best network related solutions for them for issues/problems raised by them in (i) to (iv), as per the distances between various blocks/locations and other given parameters.

Shortest differences between various blocks/locations:
| Admin Block to Accounts Block | 300 Metres |
| Accounts Block to Training Block | 150 Metres |
| Admin Block to Training Block | 200 Metres |
| MUMBAI Head Office to CHENNAI Office | 1300 Km |
The number of computers installed at various blocks is as follows:
| Training Block | 150 |
| Accounts Block | 30 |
| Admin Block | 40 |
1) Suggest the most appropriate block/location to house the SERVER in the CHENNAI office (out of the 3 blocks) to get the best and effective connectivity. Justify your answer.
2) Suggest the best-wired medium and draw the cable layout (Block to Block) to efficiently connect various blocks within the CHENNAI office compound.
3) Suggest a device/software and its placement that would provide data security for the entire network of the CHENNAI office.
4) Suggest a device and the protocol that shall be needed to provide wireless Internet access to all smartphone/laptop users in the CHENNAI office
Concept: undefined >> undefined
Advertisements
Differentiate between packet switching over message switching
Concept: undefined >> undefined
Derive a Canonical POS expression for a Boolean function FN, represented by the following truth truth table:
| X | y | z | FN (X, Y, Z) |
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 1 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
Concept: undefined >> undefined
Derive a Canonical POS expression for a Boolean function G, represented by the following truth table:
| X | Y | Z | G(X, Y, Z) |
| 0 | 0 | 0 | 0 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 1 |
| 0 | 1 | 1 | 0 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 1 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
Concept: undefined >> undefined
Derive a Canonical POS expression for a Boolean function F, represented by the following truth table
| P | Q | R | F(P,Q,R) |
| 0 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0 |
| 0 | 1 | 0 | 0 |
| 0 | 1 | 1 | 1 |
| 1 | 0 | 0 | 1 |
| 1 | 0 | 1 | 0 |
| 1 | 1 | 0 | 0 |
| 1 | 1 | 1 | 1 |
Concept: undefined >> undefined
Reduce the following Boolean Expression to its simplest form using K-Map:
`G(U, V,W, Z) = sum(3,5 , 6 , 7 , 11 , 12 ,13, 15)`
Concept: undefined >> undefined
Which function(s) out of the following can be considered as an overloaded function(s) in the same program? Also, write the reason for not considering the other(s) as an overloaded function(s)
void Execute(char A,int B); // Function 1
void Execute(int A,char B); // Function 2
void Execute(int P=10) ; // Function 3
void Execute(); // Function 4
int Execute(int A); // Function 5
void Execute(int &K); // Function 6
Concept: undefined >> undefined
Reduce the following Boolean Expression to its simplest form using K-Map:
`E (U, V, Z, W) = sum (2, 3 , 6, 8, 9, 10, 11 , 12 , 13 )`
Concept: undefined >> undefined
Reduce the following Boolean Expression to its simplest form using K-Map
`F (X, Y, Z, W) = sum (0, 1, 4, 5, 6, 7, 8, 9, 11, 15)`
Concept: undefined >> undefined
Draw the Logic Circuit of the following Boolean Expression
(U' + v).(V' + W')
Concept: undefined >> undefined
Draw the Logic Circuit of the following Boolean Expression using only NOR Gates
(A+B).(C+D)
Concept: undefined >> undefined
What is a copy constructor?
Concept: undefined >> undefined
Draw the Logic Circuit for the following Boolean Expression: (X'+Y).Z + W'
Concept: undefined >> undefined
Draw the Logic Circuit for the following Boolean Expression: (X'+Y).Z + W'
Concept: undefined >> undefined
Janish Khanna used a pen drive to copy files from his friend's laptop to his office computer. Soon his computer started abnormal functioning. Sometimes it would restart by itself and sometimes it would stop different applications running on it. Which of the following options out ·of (i) to (iv), would have caused the malfunctioning of the computer? Justify the reason for your chosen option:
1) Computer Virus
2)Spain Mail
3) Computer Bacteria
4) Trojan Horse
Concept: undefined >> undefined
What is Trojan Horse?
Concept: undefined >> undefined
A text file named MATTER.TXT contains some text which needs to be displayed such that every next character is separated by a symbol '#'.
Write a function definition for HashDisplay() in C++ that would display the entire content of the file MATTER.TXT in the desired format:
Example:
if the file Matter.TXT has the following content stored in it:
THE WORLD IS ROUND
The function HashDisplay() should display the following content:
T#H#E #W#O#R#L#D# #I#S# #R#O#U#N#D#
Concept: undefined >> undefined
Write a definition for a function TotalTeachers( ) in C++ to read each object of a binary file SCHOOLS.DAT, find the total number teachers, whose data is stored in the file and display the same. Assume that the file SCHOOLS.DAT is created with the help objects of class SCHOOLS, which is defined below :
class SCHOOLS
{
int SCode; //School Code
char SName[20]; //School Name
int NOT; // Name of Teachers in the school
public:
void Display()
{
cout<<SCode<<"#"<<SName<<"#" << NOT << endl;
int RNOT() {return NOT;}
};Concept: undefined >> undefined
Find the output of the following C++ code considering that the binary file SCHOOL.DAT exists on the hard disk with the following records of 10 schools of the class SCHOOLS as declared in the previous question(4 b)
| SCode | SName | NOT |
| 1001 | Brains School | 100 |
| 1003 | Child Life School | 115 |
| 1002 | Care Share School | 300 |
| 1006 | Educa t for Life School | 50 |
| 1005 | Guru Shiahya Sadan | 195 |
| 1004 | Holy Education School | 140 |
| 1010 | Play School | 95 |
| 1008 | Innovate Excel School | 300 |
| 1011 | Premier Education School | 200 |
| 1012 | Uplifted Minds School | 100 |
void main()
{
fstream SFIN;
SFIN.open("SCHOOLS.DAT", ios::binary|ios::in) ;
SCHOOLS S;
SFIN.seekg(S*sizeof(S));
SFIN.read((char*)&S, sizeof(S));
S.Display();
cout<<"Record : "<<SFIN.tellg()/sizeof(S) + l <<endl;
SFIN.close();
}Concept: undefined >> undefined
