0
Computer Programming
A category for questions about computer programming and programming languages.
10,506 Questions
What kinds of storage devices do large computer systems use?
Large computer systems usually use purpose specific storage based on the requirements of the system. For instance, a large file server would use several racks of simple storage servers usually via something like iSCSI over fiber or Infiniband. A large super computer may not need that much storage, but it would need to be faster, so there would be large RAM requirements with little permanent storage to speak of. A Cray CX1 Supercomputer can have up to 64 Processors interconnected, but while a large computing system, usually has less need for disk space. The HP NonStop OS for highly available "never go offline" kind of systems are used for things like certain stock exchanges, and have both a large number of storage disks and a large amount of RAM in most applications.
Specific Disk types are traditionally SCSI or SAS drives, but the rise of SATA speeds and reliablity, coupled with the much cheaper cost means many storage systems are moving to the new SATA standards. SCSI has higher reliability, but if an SATA drive can store more, and for a fourth of the cost, it's sometimes more cost effective to create a storage array that can stand to lose several drives from a RAID array, and simply have disks on hand to replace them as they go. SCSI is still used in situations where such maintenance is not much of an option.
Can you transfer programs from one partition to another partition on the same hard drive?
Yes. If the program is a standalone program then you can simply copy or move it to the other partition, then update any and all shortcuts accordingly. Otherwise you must un-install the program before re-installing it on the other partition. This ensures that all registry entries are correctly updated. You can do this manually, of course, but it's safer to use the program's own installer.
input number
print number + 1
No.
Conclusive scientific evidence has surfaced which shows that the internet is NOT a big truck.
Is it easy to store data on a data base?
It depends. What kind and how much data?
You can create a simple database in a program like MS Access or you can create a massively complex database system using databases such as Oracle, DB2 or Teradata.
Since this is such a general question, it sounds like you don't have very complex needs for your data tracking. If you just want to keep track of data as in a list, you can use a spreadsheet program such as MS Excel or the free one offered by Google.
How do you calculate loop length?
the multiplication of the number of iterations with the number of statements in that loop is equal to loop length.
Which do you prefer service oriented or batch oriented solutions?
I prefer service-oriented solutions because they offer greater flexibility and scalability. They enable real-time processing and allow for easier integration with other services, enhancing overall responsiveness to user needs. Additionally, service-oriented architectures can adapt more readily to changing requirements compared to batch-oriented solutions, which can be slower and less dynamic.
A merge algorithm which will merge two sorted lists into one sorted list?
You have two options here.
For the first you have to ask yourself, "Is my data continuously sorted by the list itself?" If you answered 'yes' then you can simply add all data from one list to the other and the combined list will be sorted.
If you answered 'no' to the above question, then it means you have two lists which are currently sorted, but which may not remain that way if new elements are added to them.
Let's look at some steps to merge all elements list1 and list2 into a separate list3. (We'll assume data is sorted from least to greatest).
1) Start two index counters (one for each list) which point to the start of the list.
2) Is the element at list1[index1] less than the element at list2[index2]?
- If so, add list1[index1] to the end of list3 and increment index1.
- If not, add list2[index2] to the end of list3 and increment index2.
3) If either index has reached the end of its list, then add the remaining elements from the other list to list3 and we're done.
4) Otherwise, go back to step 2.
Can a processs BSS segment grow during program execution?
No. The size of the data segment (which includes the BSS) is determined at compile time and cannot change at runtime. The data segment stores all the program's constants, global variables and static variables, the total size of which can be determined at compile time and is therefore fixed at that point. BSS is an abbreviation of Block Start by Symbol and is used specifically to allocate all global and static variables that are either in an uninitialised state or are explicitly initialised to zero. Global and static variables initialised with non-zero values are allocated separately from the BSS, as are all the constants.
program relocation is the process which modifies the object program so that it can be loaded at an address different from the location originally specified.
What is Difference between index register and stack pointer?
An index register contains an address that can be used during effective address generation, often along with an offset in the instruction or in another register. This is most useful when accessing elements of arrays or structures. A stack pointer is a specialized index register that points to a region of memory that can store temporary elements, in a last-in-first-out structure, such as return addresses, parameters, and local storage for function calls.
What is the Data structures used for stack?
A stack is a linear last-in first-out list type data structure. Several implementations are possible. Two examples are the array and the linked list.
The array is quick, but is limited in size.
The linked list requires overhead to allocate, link, unlink, and deallocate, but (except for total available memory) is not limited in size.
One compromise might be a linked list of arrays. Another compromise might be to not necessarily unlink and delete when an element is popped off the stack.
hash key is an element in the hash table. it is the data that you will combine (mathematical) with hash function to produce the hash.
Why static variables are initialized to zero?
When a variable is declared, your computer assigns a section of memory to that variable. If the variable isn't initialized, there's no way of knowing what data is already stored in that section of memory, which can cause errors in your programs.
In managed languages, such as C#, this is done automatically at declaration. Although it's still good practice to initialize variables yourself.
A triangle with equal sides and equal angles (=60 degrees).
What are bit fields What is the use of bit fields in a Structure declaration?
Both C and C++ allow integer members to be stored into memory spaces smaller than the compiler would ordinarily allow. These space-saving structure members are called bit fields, and their width in bits can be explicitly declared. Gagandeep Singh Bitfields can only be declared inside a structure or a union, and allow you to specify some very small objects of a given number of bits in length. struct { /* field 4 bits wide */ unsigned field1 :4; /* * unnamed 3 bit field * unnamed fields allow for padding */ unsigned :3; /* * one-bit field * can only be 0 or -1 in two's complement! */ signed field2 :1; /* align next field on a storage unit */ unsigned :0; unsigned field3 :6; }full_of_fields; The main use of bitfields is either to allow tight packing of data or to be able to specify the fields within some externally produced data files.
What is bluetooth 2.1 plus edr?
this is an advanced technology provided by first from nokia... this provides faster service through bluethooth . and edr is enhanced data rate or exchange data rate...
