Let Us See C language: 2011

Sunday, 25 December 2011

chapter 2: DOS and WINDOWS

UNIT–II FEATURES OF DOS & WINDOWS

1. Define operating system and list any four operating systems.

2. What is an operating system? Mention the types of operating systems with examples for each.

3. State the functions of operating system.

4. (1) Why do we need of an operating system? (OR) Explain the need of an operating system. (OR) What is the need of operating system?

5. What is MS-DOS?

6. What is meant by booting? List the programs that run when you boot your computer.

7. Define the following terms: (1) file (2) folder (3) directory (4) syntax (5) path (6) drive.

8. Name any four internal commands of DOS.

9. List any four external commands of DOS.

10. What is the use of the CLS command and write the syntax.

11. What is the purpose of the REN command and write the syntax?

12. Write down the commands to display the current date and current time on the screen.

13. Discuss root directory and subdirectory.

14. What is meant by directory? How they are created?

15. List any four DOS internal and external commands.

16. List and explain any six DOS internal and external commands.

17. Explain any six DOS external commands with syntax.

18. Distinguish between internal and external commands with syntax.

19. What are the wild cards? Mention the characters which are used as wild cards. Explain the usage of wild cards in DOS commands with examples.

20. Explain the wild cards with examples.

21. Explain briefly about FORMAT command.

22. Give the use of the commands: MD, CD, and RD.

23. Explain the DIR, COPY, CD, TYPE commands in DOS with syntax.

24. Give the use of the DIR command in DOS.

25. Explain the use of the PROMPT command.

26. Explain the use of the SYS command.

Explain briefly about CONFIG.SYS file.

Tuesday, 20 December 2011

In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.
Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks.
For example, B+ trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
Data structures provide a means to manage huge amounts of data efficiently, such as large databases and internet indexing services.
Usually, efficient data structures are a key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Storing and retrieving can be carried out on data stored in both main memory and in secondary memory. Various Data Structures are available that are needed to be employed based on the need.
The ways in which data is stored is called the structure of data.

Data structures provide a means to manage large amounts of data efficiently, such as large databases and internet indexing services. Usually, efficient data structures are a key in designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Storing and retrieving can be carried out on data stored in both main memory and in secondary memory

What is Linear Data Structure?

Linear data structure is linear if element (data) is adjacent to each other. It has exactly two
neighbors elements to which it is connected as its previous and next member.
A linear data structure traverses the data elements sequentially, in which only one data element can directly be reached. Ex: Arrays, Linked Lists

What is Non-Linear Data Structure?

Non-Linear data structure is that if one element can be connected to more than two
adjacent element then it is known as non-linear data structure.
Every data item is attached to several other data items in a way that is specific for reflecting relationships. The data items are not arranged in a sequential structure. Ex: Trees, Graphs

Operations on Data Structures
The basic operations that are performed on data structures are as follows:
Insertion:

Insertion means addition of a new data element in a data structure.
Deletion:

Deletion means removal of a data element from a data structure if it is found.
Searching:

Searching involves searching for the specified data element in a data structure.
Traversal:

Traversal of a data structure means processing all the data elements present in it.
Sorting:

Arranging data elements of a data structure in a specified order is called sorting.
Merging:

Combining elements of two similar data structures to form a new data structure of the same type, is called merging

1 Linked List.

Linked list using Cpp

Single Linked List

Doubly Linked List
Circular Linked List

Stacks:

Queues:

Sorting

Motivation

Quick sort