Thursday, July 31, 2014

UGC NET Computer Science DEC 2013 Paper - II Solutions



1. When data and acknowledgement are sent in the same frame, this is called as
(A) Piggy packing
(B) Piggy backing
(C) Back packing
(D) Good packing

2. Encryption and Decryption is the responsibility of Layer.
(A) Physical
(B) Network
(C) Application
(D) Datalink

Read More
No comments:

Friday, July 18, 2014

LIST OF THE MOST COMMON HTML TAGS


HTML Tag
Type
Description
<!-- ... -->
 Comment Anything typed in this tag is not displayed

A
<a href ...> </a>
 Hyperlink Link to another page or site
<abbr> </abbr>
 Text format Denotes an abbreviation
<acronym> </acronym>
 Text format Denotes an acronym
<address> </address>
 Text format Address, built in text style (italic)
<area ...>
 Map element Defines a hot spot on an image map

B
<b> </b>
 Text format Makes text bold
<bgsound ...>
 Media Add background sound to a page
<big> </big>
 Text format Makes text one size larger (relative)
<blink> </blink>
 Text format Makes text flash on and off
<body> </body>
 Page element Contains code to be displayed
<br>
 Text format Breaks text without starting a new paragraph

Read More
No comments:

Thursday, July 17, 2014

Windows Programming 1st Part

WinMain

 
Windows functions can be written easily in Unicode or ASCII. Besides the difference in function name, _tWinMain also has different parameters than the standard main function:

int WinMain(HINSTANCE hThisInstance, 
              HINSTANCE hPrevInstance, 
              LPSTR lpszArgument,  // LPWSTR for wWinMain
              int iCmdShow);
 
HINSTANCE objects are references to a program instance. hThisInstance is a reference to the current program, and hPrevInstance is a reference to any previously running versions of this same program. However, in Windows NT, the hPrevInstance data object is always NULL. This means that we can't use the hPrevInstance value to determine if there are other copies of the same program running on your system. There are different ways of checking for other copies of a program running, and we will discuss those methods later.
lpszArgument essentially contains all the information that the argc and argv variables used to show, except that the command-line arguments are not broken up into a vector. This means that if you want to sort individual arguments from the command line, you need to either break them up yourself, or call one of the available functions to break it up for you. We will discuss these functions later.
The last argument, "int iCmdShow" is a data item of type int (integer) that determines whether or not a graphical window should be displayed immediately, or if the program should run minimized.

Read More
No comments:

Tuesday, July 15, 2014

Windows Programming 2nd Part

WNDCLASS

The WNDCLASS structure contains the window class attributes that are registered by the RegisterClass function.
typedef struct _WNDCLASS {
UINT style;
WNDPROC lpfnWndProc;
int cbClsExtra;
int cbWndExtra;
HANDLE hInstance;
HICON hIcon;
HCURSOR hCursor;
HBRUSH hbrBackground;
LPCTSTR lpszMenuName;
LPCTSTR lpszClassName;
} WNDCLASS;

Read More
No comments:

Saturday, July 05, 2014

BSNL Placement-Papers

1. A computer derives its basic strength from
(a) speed

(b) accuracy

(c) memory

(d) all of the above     (Ans)

(e) None of the above. 

2. Modern computers compared to earlier computers are

(a) faster and larger

(b) less reliable

(c) larger and stronger

(d) slower but more reliable

(e) faster and smaller     (Ans)
Read More
No comments:

Wednesday, July 02, 2014

Closure properties of REGULAR Language




  1. The union of two regular languages is regular.
  2. The intersection of two regular languages is regular
  3. The complement of a regular languages is regular
  4. The difference of two regular languages is regular
  5. The reversal of a regular languages is regular
Read More
No comments:

Some Tips about automata


  1. Context –sensitive grammar can be recognized by push down automata.
  2. CSG can be recognized by 2 –way linear bounded automata.
  3. The NDFA is equivalent to DFA.
  4. NPDA is equivalent to DPDA.
  5. Multi tape turning machine are equivalent to single tape-turning machine.
Read More
No comments:

Some tips about Automata



  1. A Turing Machine cannot solve halting problem.
  2. Set of Recursive Enumerable languages are closed under union.
  3. Context Sensitive grammar can be recognized by a linearly bounded memory machine.
  4. Recursive Languages are closed under union.
  5. If a Language & its complement is both regular, then the language must be recursive.
  6. A Language is accepted by Finite Automata if and only if it is recursive.
Read More
No comments:

Tuesday, July 01, 2014

System Software

1. Give difference between assembler, compiler and interpreter. 
Ans:
     An assembler is the translator for an assembly language of a computer. An assembly language is a low-level programming language which is peculiar to a certain computer.
  
      A compiler is a translator for machine independent HLL like say FORTRAN,COBOL etc.

       An interpreter analysis the source program statement by statement and it self carries out the actions implied by each statement.

Read More
No comments:
Subscribe to: Posts (Atom)