new

Q. Multi Programming System.
Ans: A multiprogramming operating system increase CPU utilization by organizing jobs (code and data) so that the CPU always one to execute.
The OS keeps several jobs in memory simultaneously. This set of jobs can be a subset of the jobs kept in the job pool which contains all jobs that enter the system. Since the number of jobs that can be kept simultaneously in memory is usually smaller then the number job that can be kept in the job pool. The OS picks and begins to execute one of the job in memory. Eventually the job may have to wait for some task, such as an I/O operation to computer.
Multiprogramming system provide an environment in which the various system resource are utilized effectively, but they do not provide for user interaction with the computer system.
1. Uni-processor system.
2. More then one programs runs at a time parallel.
3. FCFS (First come first serve)
4. Multi programming increases utilization by organizing such that the CPU always has one to execute.
5. The OS keeps several jobs in the memory at a time.
Figure of multiprogramming OS structure.



Q. Time sharing OS.
Ans: Time sharing is a logical extension of multiprogramming system. The CPU executes multiple jobs by switching among them but the switches occur so frequently that the user can interact with each program while it is running.
A time shared operating system allows many users to share the computer simultaneously. Each action or command in a time shared system tends to be short, only a little CPU time needed for each user.
A time shared OS uses CPU scheduling and multiprogramming to period each user with a small portion of a time shared computer. Each user has a least one separate program in memory. A program loaded into memory and executing is commonly referred.
When a process executes it typically executes for a short time before it is either finished or need to perform I/O. I.O may be interactive. i.e. output is to display for user and input is from keyboard, mouse or other device.

Answer the questions

Q. 1: Describe different types of string operations.
Ans: String operation:
Sub string: Accessing a substring from a given string requires three pieces of information:
i. The name of the string or the string itself.
ii. The position of the first character of the substr5ing in the given string and
iii. The length of the substring or the position of the last character of the substring.
We call this operation SUBSTRING. Specially, we write
SUBSTRING (String, initial, length)
To denote the substring of a string S beginning in a position K and having a length L.
Example:
SUBSTRING (‘TO BE OR NOT TO BE’, 4, 7) = ‘BE OR N’
Indexing: Indexing also called pattern matching, re4fers to finding the position where a string pattern P first appears in a given text T. We call this operation INDEX and write
INDEX (text, pattern)
If the pattern P does not appear in the text T, then INDEX is assigned the value 0. The argument “text” and “pattern” can be either string constants or string variables.
Example:
T = ‘HIS FATHER IS THE PROFESSIOR’
Then, INDEX (T, ‘THE’), INDEX (T, ‘THEN’)
Have the values 7, 0 respectively.
Concatenation: Let S1 and S2 be strings. Recall that the concatenation of S1 and S2, which we denote by S1//S2, is the string consisting of the characters of S1 followed by the characters of S2.
Example:
Suppose, S1 = ‘MARK’,
And, S2 = ‘TWAIN’
Then, S1//S2 = ‘MARKTWAIN’
But, S1//’ ‘//S2 = ‘MARK TWAIN’
Length: The number of characters in a string is called its length. We will write –
LENGTH (string)
for the length of a given string.
Example:
Thus LENGTH (‘COMPUTER’) = 8
LENGTH (‘ ’) = 0
LENGTH (‘’) = 0
Q. 2: Describe different types of word processing.
Ans: Word processing: The operations usually associated with word processing are the following:
a. Insertion: Inserting a string in the middle of the text. Suppose in given text T, we want to insert a string S, so that S begins in position K. We denote this operation by
INSERT (text, position, string)
For example, INSERT (‘ABCDEFG’, 3, ‘XYZ’) = ‘ABXYZCDEFG’
b. Deletion: Deleting a string from the text. Suppose in a given text T we want to delete the substring which begins in position K and has length L. We denote this operation by
DELETE (text, position, length)
For example, DELETE (‘ABCDEFG’, 4, 2) = ‘ABCFG’
c. Replacement: Replacing one string in the text by another. Suppose in a given text T we want to replace the first occurrence of a pattern P1 by a pattern P2. We will denote this operation by
REPLACE (text, pattern1, pattern2)
For example, REPLACE (‘XABYABZ’, ‘AB’, ‘C’) = ‘XCYABZ’

THE FIRST POST

This Blog is very much helpful for the student who reads in BSC computer science and engineering. This blog will give you all the tutorial of theoretical questions of various questions of different subjects, so keep stay and get the information + hand notes you need.
Please select a category of tutorial you need:
COMPUTER FUNDAMENTALS.
COMPUTER PROGRAMMING.
PROGRAMMING IN ANSII C.
PROGRAMMING IN C++.
HTML AND WEB SITE DESIGN.
COMPUTER ARCHITECTURE.
STATISTICS AND PROBABILITY
DATA STRUCTURE.
DEFERENTIAL AND INTEGRAL CALCULUS
BUSINESS COMMUNICATION
ELECTRONICS.
ALGORITHM DESIGN.
OPERATING SYSTEM.
SYSTEM ANALYSIS AND DESIGN
DATA BASE MANAGEMENT SYSTEM
DISCRETE MATHEMATICS
E-COMMERCE
COMPILER DESIGN
NUMERICAL ANALYSIS
DATA COMMUNICATION
MICROPROCESSORS
COMPUTER NETWORKS
BASIC ACCOUNTING
COMPUTER GRAPHICS
ARTIFICIAL INTELLIGENCE
PERIPHERALS AND INTERFACING
SOFTWARE ENGINEERING
PROGRAMMING ON JAVA
E-COMMERCE MANAGEMENT
ADVANCE DATABASE SYSTEM
PROJECT MANAGEMENT
OOP SOFTWARE ENGINEERING
NETWORK MANAGEMENT
OOP MODELING AND DESIGN
WIRELESS COMMUNICATION
TELECOMMUNICATION.