0
Computer Science
Computer Science is the systematic study of algorithmic processes that describe and transform information. It includes the theoretical foundations of information and computation and the practical techniques of applying those foundations to computer systems. Among the many subfields of Computer Science are computer graphics, computer programming, computational complexity theory, and human-computer interaction. Questions about Computer Science, terms such as algorithms and proofs, and methodologies are encouraged in this category.
1,839 Questions
true.
What are the home application of c plus plus programming language?
C++ is useful when you want to write a program which you can use for your home use. For instance, you have a lot of different files. You can use C++ to sort them out using file extensions. Or you can write a program which will keep track of programs and music you download and so on.
Boolean Algebra is a type of math in which the values of the variables are true and false. The algebra is the basis for digital logic, computer programming and mathematical logic.
When data and instructions are not being used where are they kept?
Originally they're kept on the hard drive in the form of a program. Once run, the instructions and data are loaded into main memory until the processor is ready for them. They are then read into the various levels of CPU cache when awaiting execution.
Advantage of high level language?
High level languages are easier to understand and work with, because they are closer to human language. Low level languages are mostly the language of the computer, which is difficult for humans to learn and understand. High level languages are more intuitive.
What should be the last command in any HTML document?
The last command in any HTML document is a closing HTML tag. Just before it is the closing BODY tag.
</BODY>
<HTML>
Is selection sort and tournament sort are same?
No. Tournament sort is a variation of heapsort but is based upon a naive selection sort. Selection sort takes O(n) time to find the largest element and requires n passes, and thus has an average complexity of O(n*n). Tournament sort takes O(n) time to build a priority queue and thus reduces the search time to O(log n) for each selection, and therefore has an average complexity of O(n log n), the same as heapsort.
In process switching the CPU is required to be personally involve with every forwarding decision. Process switching is similar to doing long math versus doing it the quick way.
Why do you need to simplify boolean algebra?
You never need to simplify any type of algebra. It often helps people understand answers better and/or makes working with certain algebraic expressions easier in the future, but always remember that a simplified and unsimplified expression or algebra are both saying the same thing.
yes in the preemptive sjf where every time the system recieve job shorter than the current it stop the current and start the new one
If you do Computer Science for your Bsc can you do software engineering for Msc?
The answer will depend on which schools you go to (and what classes you need to take) for each degree. It's usually possible to get a higher degree in a related field like this.
How can you easily understand c plus plus of XII class?
Yes, I do. But most of my friends didn't. It depends on an individual, on your interest. I studied Class XII C++ CBSE and beyond in my summer vacations of Class XI. I just like programming so i understood it, but i failed in chemistry thrice in 2 years. My minimum was 07/70 in chem.
Dont worry if you find it hard. Just install Turbo C++ in your system and start with real easy programs. Program more than 50 on your systm and it will become really really easy for you and in a month you will start liking it.
Remember, things wont work if you dont try.
What steps would you take if the internet was not working and you were starting work in 3 minutes?
try checking my connection.
How do you differentiate between truncate and delete?
TRUNCATE and DELETE:
It also removes the rows from the specified location in the query like DELETE command, but the only difference is :
1. rows once u truncated cnnot be ROLLBACKED like in DELETE. 2. which ROLLBACK can be possible with delete. 3. Truncate is used for HUGE databases or tables bcz it works efficiently. 4. DELETE will work efficiently on small data(tables).
Now it is vident that the only difference between TRUNCATE and DELETE is efficiency(i.e,Accessing Speed).
Annapurna.
TRUNCATE REMOVES ALL THE ROWS FROM THE TABLE AND CANNOT BE Rollbacked, while delete removes all/specific rows from table and can be rollbacked.
Also truncate resets the high water mark.
A common misconception is that they do the same thing. Not so. In fact, there are many differences between the two. DELETE is a logged operation on a per row basis. This means that the deletion of each row gets logged and physically deleted. You can DELETE any row that will not violate a constraint, while leaving the foreign key or any other contraint in place. TRUNCATE is also a logged operation, but in a different way. TRUNCATE logs the deallocation of the data pages in which the data exists. The deallocation of data pages means that your data rows still actually exist in the data pages, but the extents have been marked as empty for reuse. This is what makes TRUNCATE a faster operation to perform over DELETE. You cannot TRUNCATE a table that has any foreign key constraints. You will have to remove the contraints, TRUNCATE the table, and reapply the contraints.
The difference between the two is that the truncate command is a DDL operation and just moves the high water mark and produces a now rollback. The delete command, on the other hand, is a DML operation, which will produce a rollback and thus take longer to complete.
Truncate can be rollbacked,, basically i see lot of aritcles which says it can rollback,, but the truth is that we can rollback after trancate ,, difference is that in truncate only deallocation of the data page is done, but in delete the it is logged in deleted table and is physically removed from data page,,,
Harishjan
The difference is with operation on memory because if you want to have a place in memory for a later use you should use delete but if you want clear memory you should use truncate - this function clears the value and place where this value was stored.
For more detailed explanation about this topic please read the following article.
http://www.sqlservercentral.com/articles/delete/61387/
How do you overcome limitations of stacks in polygon filling?
You overcome limitations of the stack in polygon filling, or in any other algorithm, far that matter, but using an iterative technique, rather than a recursive technique. Recursion is quite useful, and can simplify algorithm design. Polygon filling, however, is a class of algorithm can potentially have a very deep recursion depth. This causes stress on the stack, hence the need for iteration.
What is wrong with not writing a return statement in value-returning method in java?
It is a syntax error, because a value returning method must return a value, and not writing a return statement with a value is tantamount to returning without a value.
What are the relationships between priority and FCFS of CPU scheduling algorithms?
this is my doubt about the non-preemptive priority scheduling. i m doing bachelor of engineering in IT and this question in end semester exam. the question is as follows:
Assume you have the following jobs to be executed with one processor, with the jobs arriving in the order listed here:
Process Burst Time Priority
P1 80 5
P2 20 1
P3 10 3
P4 20 2
P5 50 4
Suppose the system uses priority scheduling. Draw Gantt chart and calculate average waiting time for the processes.
My doubt is:
suppose if we were to use non-preemptive priority scheduling, the question says the jobs arriving in the order listed, so as per the order P1 will arrive first so it will get the CPU first and in non-preemptive once a job gets CPU it will not leave CPU till the process finishes, then as per the order P2 will come and same thing repeats.... so it acts like FCFS scheduling and priority is of no use here. But my lecturer says we have to follow the priority and P2 will come first, but the line the jobs arriving in the order listed is still not letting me agree with my lecturer. Can anyone help out?
MSc It final year project titles?
i am msc it prefinal year student . choose project title.help me .i am interest visual basic ,c++,dbms,multimedia.
don't have is all the best !
Who is responsible for the programming of multi core CPU and gpu?
- Domain experts.
- HPC software engineers.
- Parallel programming tools.
Both Domain experts and HPC software engineers are playing important roles for the programming of multi core CPU and gpu. However, they often push the responsibility to the others.
Can variable names can have spaces between them?
No.
int my variable; <- not a valid declaration
Java naming conventions say that you should use capital letters to differentiate words in a variable name.
int myVariable; <- valid!
Note that you can use the _ (underscore) character, as well, though some people suggest avoiding this.
int my_variable; <- also valid!
