What is big-o notation for describing time complexity of algorithm?
Big O notation allows to specify the complexity of an algorithm in a simple formula, by dismissing lower-order variables and constant factors.
For example, one might say that a sorting algorithm has O(n * lg(n)) complexity, where n is the number of items to sort.
Big O notation is used in Computer Science to describe the performance or complexity of an algorithm. Big O specifically describes the worst-case scenario, and can be used to describe the execution time required or the space used (e.g. in memory or on disk) by an algorithm.
How do you convert an flv to an ntsc?
Wondershare FlashOnTV is a professional Flash to DVD burner designed for users who want to convert FLV to DVD, convert SWF to DVD and put their Flash files on DVD discs. Wondershare FlashOnTV is a very easy to use Flash to DVD converter with powerful DVD editing function, which can convert Flash to DVD with just a few clicks.
which form of organizational change requires business processes to be analyzed, simplified and redesign?
What is random scan and interlacing?
When operated as a random-scan display unit, a CRT has the electron beam directed only to the parts of the screen where a picture is to be drawn. Random-scan monitors draw a picture one line at a time and for this reason are also referred to as vector displays (or stroke-writing or calligraphic displays). The component lines of a picture can be drawn and refreshed by a random-scan system in any specified order (fig). A pen plotter operates in a similar way and is an example of a random-scan, hard-copy device. Refresh rate on a random-scan system depends on the number of lines to be displayed. Picture definition is now stored as a set of line-drawing commands in an area of memory referred to as the refresh display file. Sometimes the refresh display file is called the display list, display program, or simply the refresh buffer. To display a specified picture, the system cycles through the set of commands in the display file, drawing each component line in turn. After all line-drawing commands have been processed, the system cycles back to the first line command in the list. Random-scan displays are designed to draw all the component lines of a picture 30 to 60 times each second. High-quality vector systems are capable of handling approximately 100,000 "short" lines at this refresh rate. When a small set of lines is to be displayed, each refresh cycle is delayed to avoid refresh rates greater than 60 frames per second. Otherwise, faster refreshing of the set of lines could burn out the phosphor. Random-scan systems are designed for line-drawing applications and can-not display realistic shaded scenes. Since picture definition is stored as a Set of line-drawing instructions and not as a set of intensity values for all screen points, vector displays generally have higher resolution than raster systems. Also, vector displays produce smooth line drawings because the CRT beam directly follows the line path. A raster system, in contrast, produces jagged lines that are plotted as discrete point sets. jackson francis malugala
computer engineer
DSM institute of technology
DAR ES SALAAM
TANZANIA
What harmful things could computer viruses do?
■ Slow down email. Viruses that spread by email, such as Sobig, can generate so much email traffic that servers slow down or crash. Even if this doesn't happen, companies may react to the risk by shutting down servers anyway. ■ Steal confidential data. The Bugbear-D worm records the user's keystrokes, including passwords, and gives the virus writer access to them. ■ Use your computer to attack websites. MyDoom used infected computers to flood the SCO software company's website with data, making the site unusable (a denial of service attack). ■ Let other users hijack your computer. Some viruses place "backdoor Trojans" on the computer, allowing the virus writer to connect to your computer and use it for their own purposes. ■ Corrupt data. The Compatable virus makes changes to the data in Excel spreadsheets. ■ Delete data. The Sircam worm may attempt to delete or overwrite the hard disk on a certain day. ■ Disable hardware. CIH, also known as Chernobyl, attempts to overwrite the BIOS chip on April 26, making the computer unusable. ■ Play pranks. The Netsky-D worm made computers beep sporadically for several hours one morning. ■ Display messages. Cone-Fdisplays a political message if the month is May. ■ Damage your credibility. If a virus forwards itself from your computer to your customers and business partners, they may refuse to do business with you, or demand compensation. ■ Cause you embarrassment. For example, PolyPost places your documents and your name on sexrelated newsgroups. source: www.Sophos.com
What is webpage and how to learen?
well the reason people make certain types of webpages is so that people can learn new things.
you learn from webpages by READING THEM AND LOOKING AT THE PICTURES IF EASYER. <(durdurudur EASIER))
- Katie luce
((?? 'learen'??
How much is 1.717986918 raised to the 10th power?
The number 1.717986918 is an approximation of the square root of 2.951479. The 10th power would be approximately 224 (223.9744737)
Write code that prints the values stored in an array called names backwards?
In your main method: // Declare and initialize the array String names[] = {"Ana", "Bertha", "Cecilia", "Dora", "Emily"}; // Print backwards for (int i = names.length - 1; i >= 0; i--) System.out.println(names[i]); If you want to print the individual texts backwards (like "Dora" --> "aroD"), the StringBuffer class offers a method to do precisely that.
What are all the different methods of accessing array elements?
#include<iostream>
#include<cassert>
int main()
{
char str[] = "The quick brown fox jumped over the lazy dog.";
// Access the 5th element ('q' @ index 4) in 6 different ways:
char a = *(str+4);
char b = *(4+str);
char c = str[4];
char d = 4[str];
char e = *(&str[2]+2);
char f = *(2+&str[2]);
// Point to 7th element and access the 5th element:
char* p = &str[6];
char g = *(p-2);
// Test for equality:
assert(a==b);
assert(b==c);
assert(c==d);
assert(d==e);
assert(e==f);
assert(f==g);
assert(g=='q');
}
Explanation:
There is really just one version, a, but just as x+y == y+x, it is commutative thus we get version b as well. Note that the array name alone always returns a reference to the start of the array. Once we factor out all the pointer arithmetic, we are essentially just returning the dereferenced value of an address within the array.
Version c is the conventional notation using the subscript operator. However the subscript operator is merely sugar-coating (a notational convenience). Behind the scenes, we're actually executing a.
Version d is an unusual form that is rarely seen but is perfectly valid. Just as str[4] is functionally equivalent to *(str+4), so 4[str] is functionally equivalent to *(4+str), thus d is the same as b (which is the same as a).
Versions e and f are similar to a and b respectively, but instead of taking the address of the start of the array, we now take the address of the 3rd element (index 2) and then offset by 2 elements to get to the 5th element. In these versions, we can also use a negative offset to move backwards from an element, so long as we remain within the bounds of the array. These versions can also be notated more conventionally using version c; str[2+2] which is the same as a.
Version g is similar to e except we now store the address of the 7th element (index 6) in p and then use pointer arithmetic to obtain the offset of the 5th element. However, this version is not commutative so we cannot use *(2-p), but is functionally the same as a.
There are other variants similar to these 7 but they all ultimately come back to version a once you factor out all the pointer arithmetic. In other words, no method is better or worse than any other method. However version c is favoured for its readability alone, regardless of whether the offset is a compile-time constant or needs to be calculated at runtime. All others are academic but give a better understanding of what's really going on behind the scenes.
malloc/calloc/realloc will return NULL
What are the prime numbers from 1 to 200?
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199
What are the operations take more time in the implementation of list using singly linked list?
Random access is not possible in constant time; it must be done in linear time. This means insertions and extractions are amortized operations unless you currently hold a pointer or reference to the node to be extracted or the node preceding the insertion point, such as the tail node.
Sort of. Triangle is one of the shape that may tessellate(fit tightly). But one may argue that triangle is not a square (for sure), nor a tile (yet I think it may be) to a tessellate.
Decimal numbers into their equivalent binary numbers?
#include
void main()
{
int a[20],b,c,d,i=0;
printf("Enter a decimal no. to convert it into binary no.");
scanf("%d",&b);
c=b;
while(b>0)
{
d[i]=b%2;
i++;
b=b/2;
}
i--;
printf("\nBinary equivalent of decimal no. %d is ",c);
while(i>=0)
{
printf("%d",d[i]);
i--;
}
getch();
}
Vb script to find given number is prime or not?
<SCRIPT LANGUAGE="VBSCRIPT">
DIM i,n,j
n = 100
DOCUMENT.WRITE("Prime nos are")&space(1)&"1"&space(2)&"2"&space(2)
X=0
FOR j = 3 TO n
FOR i = 2 TO (j-1)
IF i MOD j <> 0 THEN
DOCUMENT.WRITE(i)&space(2)
X=1
END IF
NEXT
NEXT
What is PARIAH in prototype the game?
Pariah is the son of Elizabeth Green. When she was infected back in Hope Idaho, she was with child. When Blackwatch caught wind of this, they named the child Pariah after she gave birth. The child showed no signs of infection, but wasn't entirely "normal"
What is asm in sorting algorithms?
'ASM' is sort for Assembly, it has nothing to do with sorting algorithms.
How do you draw a circle in c program?
Here, maybe a few other shapes as well
#include
#include
void main()
{
int gd=DETECT, gm;
int poly[12]={350,450, 350,410, 430,400, 350,350, 300,430, 350,450 };
initgraph(&gd, &gm, "");
circle(100,100,50);
outtextxy(75,170, "Circle");
rectangle(200,50,350,150);
outtextxy(240, 170, "Rectangle");
ellipse(500, 100,0,360, 100,50);
outtextxy(480, 170, "Ellipse");
line(100,250,540,250);
outtextxy(300,260,"Line");
sector(150, 400, 30, 300, 100,50);
outtextxy(120, 460, "Sector");
drawpoly(6, poly);
outtextxy(340, 460, "Polygon");
getch();
closegraph();
}
What are the names of three sided triangles?
All triangles are 3-sided. There are 3 different kinds. One where all 3 sides are equal length and have equal angles is called an Equilateral triangle. A triangle with two sides and angles the same is known as an Isosceles triangle. The last kind of triangle has 3 unequal sides and 3 unequal angles and it is called a Scalene triangle.
C program to remove all comments from a c program?
/ sub.c Copyright 2009 vishnuprathish This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. / #include int main(int argc, char** argv) { FILE *fp; fp=fopen("sub.c","r"); char ch; ch=getc(fp); while(ch!=EOF) { if(ch=='/') { ch=getc(fp); if(ch=='/') { while((ch=getc(fp))!='\n') { getc(fp);//This commment wil be removed } } if(ch=='*')/*This also wil be removed*/ { while(1) { ch=getc(fp); if(ch=='*') { ch=getc(fp); if(ch='/') { break; } } } } } printf("%c",ch); ch=getc(fp); } return 0; }