What are the emerging trends of system analysis and design?
A challenge that is faced in systems analysis and design is that the instructors who are chosen to train in the field are often inexperienced. Older, knowledgeable individuals are often overlooked for instructor positions.
When loops are nested does one loop have to end before the other begins?
If one loop ends before the next begins then they are not nested at all -- they are completely independent. To be nested, one loop must contain the other loop in its entirety. That is, the inner, nested loop must start and end within the outer, containing loop.
Nested loop example (in C++):
for( int x = 0; x < 10; ++x ) // outer loop
{
for( int y = 0; y < 10; ++y ) // inner loop (nested loop)
{
printf( "%d x %d = %d\r\n", x, y, x*y );
} // end of inner loop
} // end of outer loop
How many locations of memory can you address with 16-bit address?
each line can address two bits, so 2^14 = 16384 locations
Write a program to calculate GPA in C plus plus?
#include
#include
using namespace std;
int main ()
{
cout << endl << "Please enter all the grades you wish to use for your GPA." << endl;
cout << endl << "When you have finished, enter N to indicate that you have no more grades." << endl;
cout << endl << "The highest acceptable grade is 100%, if you got higher than this congratulations but please enter only 100 as grade." << endl;
cout << endl;
float Grade = 0;
int NumClass = 0;
const int Stop = -1;
float GPAVal = 0;
float TotGPAVal = 0;
float GPA = 0;
string SemName;
while (SemName != -1)
{
cout << "Please enter name of the semester of grades you want to enter." << endl;
cin >> SemName;
cout << SemName << endl;
do {
cout << endl << "Please enter grade: ";
cin >> Grade;
if ( Grade <=100 && Grade >= 90 )
{
GPAVal = 4.0;
cout << "Grade: " << Grade << "%; GPA Value: 4.0" << endl;
TotGPAVal = TotGPAVal + GPAVal;
}
else if ( Grade < 90 && Grade >= 80 )
{
GPAVal = 3.0;
cout << "Grade: " << Grade << "%; GPA Value: 3.0" << endl;
TotGPAVal = TotGPAVal + GPAVal;
}
else if ( Grade < 80 && Grade >= 70 )
{
GPAVal = 2.0;
cout << "Grade: " << Grade << "%; GPA Value: 2.0" << endl;
TotGPAVal = TotGPAVal + GPAVal;
}
else if ( Grade < 70 && Grade >= 60 )
{
GPAVal = 1.0;
cout << "Grade: " << Grade << "%; GPA Value: 1.0" << endl;
TotGPAVal = TotGPAVal + GPAVal;
}
else if ( Grade < 60 && Grade >= 0 )
{
GPAVal = 0.0;
cout << "Grade: " << Grade << "%; GPA Value: 0.0" << endl;
TotGPAVal = TotGPAVal + GPAVal;
}
else if ( Grade = Stop )
{
GPA = (TotGPAVal / NumClass);
cout << endl<< "Your overall GPA, after " << NumClass << " courses, is " << GPA << "." << endl << endl;
}
NumClass = NumClass + 1;
}
while (( Grade >= 0 ) && ( Grade <=100 ));
if (SemName = -1)
{
cout << "Thank you for using this program!" << endl;
}
}
return (0);
}
What is vulnerability of web based application?
If you are talking about a cloud system type thing, than you should know that many of the algorithims in the security of the system are... faulty at times. If you mean more like a data base, than you've got your normal blue collar hackers, and a few java script geniuses who can cut through your defenses and any security. The issue with .NET programming is more along the lines of people editing your application, putting it back up on the internet, with your name embedded in it, and then having viruses, and mal ware, and issues that fall into your hands eventually. these are NOT huge, but risks
What is software interrupt with examples?
Interrupt generated by executing an instruction is called software interrupt. It's also called 'trap'. Software interrupts are generally used to make system calls i.e. to request operating system to perform an I/O operation or to run a new program.
Examples:
C++:
Assembly IA32:
What is the complexity of insertion sort?
The complexity of Insertion Sort is O(n^2). This is the same complexity as Bubblesort, but is more efficient (quicker). However, it is unsuitable for large data sets which are best handled using an Introsort with O(n log n) complexity.
How do you know if you have malware?
Run an online virus scan like
Trend Micro HouseCall
Kaspersky free online virus scanner
Windows Live OneCare safety scanner
BitDefender Online Scanner
ESET Online Antivirus Scanner
F-Secure Online Virus Scanner
avast! Online Scanner
Binary Codes (0s & 1s) are ways that represent how signals are interpreted on Storage devices.
Therefore Binary codes are different for various types of Media available.
i.e. Magnetic Orientations (North or South Pole) represents binaries on Magnetic Platter based HDDs
Pits & Lands represents binaries on Optical Media (CDs & DVDs)
How do passwords and usernames work and how are they encrypted?
A username is an account set up by a computer administrator. An administrator has full access of the data stored and can do such things as add or remove software. A username is good because it allows multiple people to use the same computer but at the same time restricting access if desired. Passwords are group of characters that are encrypted to prevent or slow down access to unwanted users. Most PC user do not have the software like ophcrack to hack and obtain passwords.
Applications of binary to GRAY code converter?
gray code is one which changes one bit at a time but binary code is one which changes one or more bit at a time. for example three bit binary and gray code the left one is binary and the right one is gray code.
binary gray
000 000
001 001
010 011
011 010
100 110
101 111
110 101
111 100
000 000
What is programming flowchart?
#include<stdio.h>
#include<conio.h>
main()
{
int z[10];
int love;
for(int y=0;y<=9;y++)
{
printf("Input %d:",y+1);
scanf("%d", &z[y]);
}
for(int a=0;a<=9;a++)
for(int b=0;b<a;b++)
for(int d=a;d>b;d--)
if(z[b]>z[d]){
love=z[b];
z[b]=z[d];
z[d]=love;
}
printf("\nResult: ");
for(int c=0;c<=9;c++){
printf("%d\t",z[c]);
}
getch();
}
What is the difference between target code and source code?
Source code and target code are the input and output of programming language translation programs such as assemblers, compilers and interpreters.
An assembler is used to convert low-level assembly instructions into native machine code, thus the source code is assembly language and the target code is native machine code. The target code is typically saved to a file known as an executable. Once converted to native machine code, no further translation is required; the executable can be executed at a later date and as often as required upon any machine of the same type and equivalent system and supporting libraries and software, and with optimal execution speed.
An interpreter is used to convert a high-level language source to machine code while the source code is executing. The source code is executed by the interpreter but, unlike an assembler, the resultant machine code is not saved to a file. As such, the source code must be re-interpreted every time it is executed, thus execution speed is extremely slow. However, the source code is extremely portable and can be executed upon any machine that has a suitable interpreter. The main advantage of interpreted languages is that the source code can be changed while it is executing, so the programmer can see the effect immediately.
A compiler is used to convert source code written in a high-level programming language to that of a lower-level target language. Typically the lower-level language is native machine code and, as with assembly, the target code can be saved and executed at a later date with optimal performance.
However, not all compilers compile to machine code. Some compile to assembly (which requires an assembler to complete the translation) while others convert to an intermediate code known as byte code. Byte code is intended to be interpreted by a virtual machine and can be thought of as being the native language of the virtual machine. As with all interpreted languages, the byte code is extremely portable and can be executed upon any physical machine that supports the appropriate virtual machine implementation. Java is an example of this.
Compilers can also translate code between two high-level languages so long as the target language is a lower level than the source language. The original C++ compiler worked this way, translating the C++ source into a C target which could then be compiled to machine code using the C compiler.
for (int n = 0; n <=100; n++) // you may start n = 1, same result, 1 less iteration
{
if (n % 6) // or, n % 6 != 0
printf(n);
}
What you mean by row major and column major?
its the method for sorting the multidimensional array.
eg:
consider the matrix: 10 1 3
2 7 5
8 6 4
row-major order: 1 3 10
2 5 7
4 6 8
column major order: 2 1 3
8 6 4
10 7 5
What is structure query language?
ADVANTAGES :)-
1.Its a high speed language.
2.There is not much of coding required like codind of programming languages.
3.Its emphasize on the concept of ORDBMS.
Disadvantages:(-
only 1
Its not v.user friendly!!
an assembly language is a computer-oriented language with instruction that are in one-to-one correspondence with machine instruction. In assembly language a symbol is used for each machine instruction, which is subsequently translated into machine language.
Which programming language uses a string of 1s and 0s?
You, as a programmer, can use a string with 1s and and 0s (or any other content) in each and every programming language.
Y2K simple means year 2 thousand.
y=year
2=2
k=1000 (kilo), in the metric system k is representative of 1000. for example, 1 Km is equivalent to 1000m.
When we approached the year 2000, it was thought by many that many of the world's computers would not have the capability to switch over from 1999 to 2000. Many people stocked up on non-perishables in fear of the world shutting down because of this.
However, nothing happened.
Many people believe that it is the year 2001, not 2000, that would create such panic that was created by Y2K, because we started counting (records begin) at year 1, not year '0'.
Again, however, nothing happened.
Where are trees in data structures implemented in the real world?
First off, there are several types of trees in data structures. each with different uses and benefits. The two most common are binary trees and binomial trees.
Binary trees are used most commonly in search algorithms. The benefits of this is that a search can be performed in O(lg(n)) time, instead of the O(n) time that a sequential search takes. An example from the real world of a binary tree in action is in databases, where indexes are organized in a binary tree, thus enabling faster searching.
Binomial trees are usually used in communication, particularly when distributing or aggregating information. A real world example comes from supercomputers, where multiple processors are all working simultaneously. In order to aggregate or distribute data, a binomial tree structure is commonly employed.
Why it is necessary to plan a computer program?
if we do-not plan a program then we are not able to know that what to do next
Deference between classical waterfall model and iterative waterfall model?
Major difference between waterfall and iterative model is that waterfall model has a linear process in which full product is available after the last phase, while incremental model full product is available after several such phases.
Data flow diagram for airline reservation system?
Each airline may have a slightly different diagram available. You can do an image search online to find the diagram that you want.