Sunday 1 December 2013

UGC NET COMPUTER SCIENCE:DISCRETE STRUCTURES,NETWORKS,DIGITAL LOGICS IMPORTANT SOLVED MCQ

 DISCRETE STRUCTURES, NETWORKS, DIGITAL LOGIC FUNDAMENTALS BASICS FOR UGC NET COMPUTER SCIENCE

1. What is a set.
A set can be defined as an unordered collection of distinct objects.

Example: A={3,6,2,8,7} can be called as a "set"

2. What is the difference between a partial order relation and equivalence relation.
A relation that is Reflexive, Antisymmetric, Transitive is said to be a Partial order  relation.
A relation which is Reflexive, Symmetric and Transitive is called as an Equivalence relation.
 Shortcut: RAT=Partial order
                     RST=Equivalence

3. What is meant by negation.
Negation means the opposite of the given preposition.
Example:
The negation of the preposition 'A' is ~A.
The negation of True is False
The negation of False is True





4. What is the difference between Tautology,Contradiction,satisfactory.
Tautology: Tautology means all the resulting outputs are always True.
Contradiction: Contradiction happens when all the results are always False
Satisfactory: Satisfactory means outputs may be True or False

5. What is an Eulerian graph.
An Eulerian graph is one which should be connected and each of its vertices should be of even degree.

6. State the formulas for complete graph and connected graph.
Complete graph=n(n-1)/2
Connected graph=n-1

7. Mention the basic laws of boolean algebra.
1. Commutative law.
2. Associative law.
3. Distributive law.
Let A=1, B=2, C=3

1. Commutative law: 
A+B=B+A
Example: 1+2=2+1
A*B=B*A
Example: 1*2=2*1

2.  Associative law:
A+(B+C)=(A+B)+C
Example: 1+(2+3)=(1+2)+3
A*(B*C)=(A*B)*C
Example: 1*(2*3)=(1*2)*3

3. Distributive law:

A*(B+C)=(A*B)+(A*C)
Example: 1*(2+3)=(1*2)+(1*3)

8. Name the two de-morgan's theorems.
___    _ _
A+B=A.B
___   _  _ 
A.B=A+B

9. What is the difference between a latch and a flipflop
A latch has no clock signal and it is asynchronous.
A flipflop has a clock signal and it is synchronous (it has time frame).
Note: Latches and flipflops are basic building blocks of sequential circuits.

10. What is a register and what is the use of shift register.
A register consists of a set of flipflops used to store binary information.
A register which is able to shift the binary information either to the left or right is alled as shift register.

11. What is the application of Watson-Felix model in software engineering.
It is used to determine the effort, staff size and total cost based on LOC (Lines of Code) needed to develop a software.

12. State the port numbers used in HTTP, FTP, SMTP, POP3, TELNET.
HTTP: 80
FTP: 20 and 21
SMTP: 25
POP3: 110
TELNET: 23

Note: Both SMTP & POP3 are used in email technology but there is a difference between the two.
SMTP is used to send a mail.
POP3 is used to receive the mail.

13. Give two examples of WAN.
Asynchronous Transfer Mode(ATM)
Integrated Services Digital Network(ISDN)

Tip: WAN is based on packet switching technology.

14. How many layers are used in OSI and TCP/IP model.
7 layers in OSI and 4 layers in TCP/IP model.
OSI- Open System Interconnection (7 layers)
Physical layer - Defines physical characterstics of network(ex. electronic circuits)
Data link layer - Data encapsulation (ex. packets)
Network layer - Packet transmission
Transport layer - Delivery of packets from source to destination
Session layer - Manges network access
Presentation layer - Determines format of data (ex. data compress, decompress, encryption,etc.)
Application layer - Consists of the applications used by end user(ex. java, word, notepad,etc)

Shortcut: PDNTSPA 

TCP/IP MODEL (4 Layers)
Network layer - Mapping between IP addresses and network physical address
Internet layer - Makes datagrams and handles data routingm Makes use of IP.
Transport layer - Makes use of TCP and UDP,ensures data delivery services.
Application layer - HTTP,FTP, SMTP, etc are used here.

Shortcut: NITA

15. Explain the truth tables of basic gates.
                                                                                                  AND GATE
A
B
A.B
0
0
0
0
1
0
1
0
0
1
1
1

  

OR GATE
A
B
A+B
0
0
0
0
1
1
1
0
1
1
1
1


NOT GATE

A
_
A
0
1
1
0

NAND GATE

A

B
___
A.B
0
0
1
0
1
1
1
0
1
1
1
0

NOR GATE

A

B
___
A+B
0
0
1
0
1
0
1
0
0
1
1
0 


COMMENTS ARE MOST WELCOME.

No comments:

Post a Comment