B.Sc. II and B. Sc. III CBCS Reference Material

B.Sc. II Sem. II

B.Sc. II Sem. III - PHP

B.Sc. II Sem. III - Object Oriented Programming with C++

B.Sc. III Sem. V

B.Sc. III Sem. V - Core Java

B. Sc. III Sem. V - Python Part 1

COVID-19

More information on covid-19 visit following website click here

Quick Sort Algorithm

B. Sc. I Sem II Reference Material

Click here to view Reference Material of  Paper DSC12B - C Programming

Introduction to Data Structures

Concept of Abstract Data Types

Data types: 
A data type is the most basic and the most common classification of data. It is this through   which the compiler gets to know the form or the type of information that will be used throughout the code. So basically data type is a type of information transmitted between the programmer and the compiler where the programmer informs the compiler about what type of data is to be stored and also tells how much space it requires in the memory. Some basic examples are int, float, string etc.

Data Object: 
A data object is a region of storage that contains a value or group of values. Each Value can be accessed using its identifier or a more complex expression that refers to the object. In addition, each object has a unique data type. The data type of an object determines the storage allocation for that object and the interpretation of the values during subsequent access.

Data structure: (D-Data, A-Axioms, O-Operations)
Data structure is the structural representation of logical relationships between elements of data. In other words a data structure is a way of organizing data items by considering its relationship to each other. Data structure mainly specifies the structured organization of data, by providing accessing methods with correct degree of associativity. Data structure affects the design of both the structural and functional aspects of a program.
                            Algorithm + Data Structure = Program
                            Data Structures=Organized Data+ Operations
We can also define data structure as a mathematical of logical model of a particular organization of data items. The representation of particular data structure in the main memory of a computer is called as storage structure. The storage structure representation in auxiliary memory is called as file structure. It is defined as the way of storing and manipulation data in organized form so that it can be used efficiently.

Data structure mainly specifies the following four things

1.      Organization of data

2.      Accessing methods

3.      Degree of associativity

4.      Processing alternatives for information

Data Structure is a systematic way to organize data in order to use it efficiently. Following terms are the foundation terms of a data structure.

Interface

Each data structure has an interface. Interface represents the set of operations that a data structure supports. An interface only provides the list of supported operations, type of parameters they can accept and return type of these operations.

Implementation

Implementation provides the internal representation of a data structure. Implementation also provides the definition of the algorithms used in the operations of the data structure.

Advantages of data structures

1. Promotes re-use of important functions on data.

1. Implementation is hidden from the user to allow concentration on high level solutions of the problem at hand.

1. Prepackaged data structures by third party vendors can be guaranteed to be terribly efficient, probably the best solution for low level data manipulation.  The more optimized libraries that we use in our software, the greater the potential exists for faster, more powerful results with the minimum of coding.

1. A standard set of functions provides a separation from low-level implementation to the high level application, giving room for enhancing/modifying the data structure functions to other methodologies if the need be without touching the application code.

B. Sc. III Sem VI - Reference Material

Paper XIV -  Java Programming

ASP.NET Globalization and Localization

Globalization: -
                 It is the process of developing a program core whose features and code design are not solely based on a single language or locale. It involves writing the executable code for an application in such a way that makes it culture-neutral and language-neutral. While incorporating globalization, you must ensure that the culture-specific details are not hard-coded into the executable code. The primary task in this phase is to identify the various locale-sensitive resources and to isolate these resources from the executable code.
                 It is the process of setting up the infrastructure in your code so that your software behaves properly in different cultures/locales.Setting up the infrastructure means: No hard-coding of labels anywhere in your software. Designing your software in such a way that you pick the appropriate labels when used in different locales/cultures. Coding in such a way that the Date format, Number format changes with culture. If you are dealing or displaying time, it should respect the Time zone.

Localization:-
               The process of adapting a program for a specific local market, which includes translating the user interface, resizing dialog boxes, customizing features (if necessary), and testing results to ensure that the program still works.
              Involves the customization of an application for a specific locale. One major task in this phase is the translation of resources identified during the globalization phase. During this phase, various resources, such as images and text, for the designated locale are created.
             Once the infrastructure is in place, we need to supply appropriate resources for our Globalized software to functional properly in different locales. This process of supplying resources is called localization. For eg: Adding of translations for every label used in the software to support different languages.