Soumik's Tech Blog

1. What is Software?  C omputer software is all information processed by computer systems, programs, and data. Computer software includes computer programs, libraries and related non-executable data, such as online documentation or digital media. 2.. What is Software Engineering? Software engineering is a detailed study of engineering to the design, development, testing, deployment, and management of software systems. 3.  What is the difference between software and computer programs?   Computer programs are the set of instructions executed on a computer. The software is a broad term. It includes programs, installation manual, documentation.  4. What is SDLC? SDLC stands for Software Development Life Cycle. It is a systematic development process of software by following every stage in the development like: - Requirement gathering - System Analysis - Design - Coding - Testing - Maintenance - Documentation 5. What are the SDLC models? Waterfall-model, Iterative

Refactoring is "the process of changing a software system in such a way that it does not alter the external behavior of the code yet improves its internal structure. If we are making a refactoring, or behavior-preserving code modification: all our unit tests should pass before and after the modification we should not need to modify any tests, or write any new ones we expect cleaner code when we are done we do not expect new behavior

An array is a collection of identical data objects or similar type of data objects stored in consecutive memory locations under a common heading or a variable name. While a linked list is a data structure which contains a sequence of the elements where each element is linked to its next element. There are two fields in an element of a linked list. One is Data filed, and other is link filed, Data field contains the actual value to be stored and processed. Furthermore, the link field contains the address of the next data item in the linked list. In an array, elements are stored in a consecutive manner in memory. In a linked list, elements can be stored at any available place as the address of a node is stored in the previous node. Insertion & deletion takes more time in an array as elements are stored in consecutive memory locations. Insertion & deletion are fast & easy in a linked list as only value of a pointer is needed to change. Array can be single dimensi

Definition: Scheduling a resource among several competing activities. Goal: To select a maximum-size set of mutually compatible activities. For example consider the following problem: Rules to Select the items are: 1. Sort the activities according to thier finish time. 2. Select the first item from the Sorted list. 3. Then for rest of the activities select the items if     Start Time of the current activity > = Finish Time of the previous activity. So if we sort the activities according to their finish time (rule 1) it becomes like below:  Now for the first item select the first activity from above list (rule 2). So, activity A1. Now the current activity is A2 and its Start time 3 > = finish time of prevoius activity is 2. So, A2 is also selected. Now the current activity is A1 and its Start time 0 < = finish time of prevoius activity is 4.  So, A1 is will not be selected. Now the current activity is A5 and its Start time 5 > = finish time of prevoius