Ans : All decision problems fall into sets of comparable complexity, called complexity classes. The complexity class P is the set of decision problems that can be solved by a deterministic machine in polynomial time. This class corresponds to set Read More …
Blog
Ques : Describe Column Major Representation
Ans : The second method of representing a two-dimensional array in memory is the column major representation. Under this representation, the first column of the array occupies the first set of the memory locations reserved for the array. The second Read More …
Ques : Types of Modems ?
Ans : Internal Modems: Internal Modems plug into expansion slots in your PC. Internal Modems are cheap and efficient. Internal Modems are bus-specific and hence may not fit universally. External Modems: Modems externally connected to PC through a serial or Read More …
Ques : What is LCD Technology ?
Ans : The technology behind LCD is called Nematic Technology because the molecules of the liquid crystals used are nematic i.e. rod-shaped. This liquid is sandwiched between two thin plastic membranes. These crystals have the special property that they can Read More …
Ques : What is Interlacing
Ans : Interlacing is a technique in which instead of scanning the image one-line-at-a-time if is scanned alternately, j.e., alternate lines are scanned at each pass. This achieves a doubling of the frame rate with the same amount of signal Read More …
Ques : What is DPI ?
Ans : DPJ (Dop Per Inch) ie a measure for th~ actual sharpness of the onscre: a image. This depends on bath the resolution and the size of the image. Pyactica1,expeyjence shows that a smaller screen has a sharper image Read More …
Ques : What is a 3-D Accelerator ?
Ans : 3;-D Accelerator is no magic technology. It is simply an accelerator chip that has built-in ability to carry out the mathematics and the algorithms required for 3-D image generation and rendering. A 3-D imaging is simply an illusion, Read More …
Ques : Describe Pseudo – Code Conventions
Ans : The following conventions must be used for pseudo-code. Give a valid name for the pseudo-code procedure. (See sample code for insertion sort at the end). Use the line numbers for each line of code. Use proper Indentation for Read More …
Ques : Describe Pseudo – Code for Algorithm
Ans : Pseudo-code (derived from pseudo-code) is a compact and informal high level description of a computer programming algorithm that uses the structural conventions of some programming language. Unlike actualcomputer language such as C,C++ or JAVA, Pseudo-code typically omits details Read More …
Ques : Describe Basic Techniques for Design of Efficient Algorithm ?
Ans : There are basically 5 fundamental techniques which are used to design an algorithm efficiently: Divide-and-Conquer Greedy method Dynamic Programming Backtracking Branch-and-Bound In this section we will briefly describe these techniques with appropriateexamples. Divide & conquer technique is a Read More …