Solved Objective Questions on Operating System set-8

1. A small program which loads OS into the memory is called as ...........

System management components (Photo credit: Wikipedia)

A) ROM

B) bootstrap loader

C) BIOS

D) RAM



2. Virtual memory is ..............

A) Simple to implement

B) Used by all major commercial OS

C) Less efficient memory utilization

D) Less effective

3. A special purpose register that is set to the highest address occupied by the OS code is ...........

A) fence register

B) general purpose register

C) protection register

D) control register



4. As OS program module that selects the next job to be admitted for execution is called as .....

A) scheduler

B) compiler

C) throughput

D) dispatcher





5. Multiprogramming systems .................

A) are easier to develop than single programming systems.

B) execute each job faster

C) execute more jobs in the same time.

D) are used only on large main frame computers



6. SSTF stands for ........................

A) Small seek Time First

B) Simple Seek Time First

C) Shortest Seek Time First

D) Synchronous Seek Time First



7. The program is known as .................. which interacts with the inner part of called kernel.

A) compiler

B) device driver

C) protocol

D) shell



8. Semaphore can be used for solving ............

A) wait & signal

B) deadlock

C) synchronization

D) priority



9. The number of processes completed per unit time is known as ............

A) output

B) throughput

C) efficiency

D) capacity



10. On what principle does Distributed OS work?

A) File foundation

B) Single system image

C) Multi system image

D) Networking image

Answers:

1. A small program which loads OS into the memory is called as ...........

B) bootstrap loader

2. Virtual memory is ..............

B) Used by all major commercial OS

3. A special purpose register that is set to the highest address occupied by the OS code is ...........

A) fence register

4. As OS program module that selects the next job to be admitted for execution is called as .....

A) scheduler

5. Multiprogramming systems .................

C) execute more jobs in the same time.

6. SSTF stands for ........................

C) Shortest Seek Time First

7. The program is known as .................. which interacts with the inner part of called kernel.

D) shell

8. Semaphore can be used for solving ............

C) synchronization

9. The number of processes completed per unit time is known as ............

B) throughput

10. On what principle does Distributed OS work?

B) Single system image

Related Posts:

• Solved MCQ of Operating System Principles set-1
• Solved MCQ of Operating System Principles set-2
• Solved MCQ of Operating System Theory set-3
• MCQ of Operating System with answer set-4
• Solved MCQ of Operating System Set-5
• Solved MCQ of Operating System Set-6
• Solved MCQ Questions on Operating System set-7

Solved MCQ Questions on Operating System set-7

1. Operating System means ........................

A) a set of programs which controls computer working.

Operating System (Photo credit: Wikipedia)

B) a way of computer drives works

C) a set of devices and programs

D) All of the above



2. The basic types of OS are ...................

A) batch and time sharing

B) sequential and real time

C) direct and interactive

D) batch and interactive



3. The simplest way of deadlock is to ...

A) preempt a resource

B) rollback

C) kill one of the processes

D) lock one of the processes



4. Throughput of a system is

A) Number of programs processed by it per unit time

B) Number of times the program is invoked by the system

C) Number of requests made to a program by the system

D) None of the above



5. Which of the following is not OS layer?

A) Kernel

B) Shell

C) Application Programs

D) Critical Section



6. Round robin scheduling is essentially the preemptive version of ...........

A) first in first out

B) shortest job first

C) shortest remaining

D) longest time first



7. The process that are residing in the main memory and are waiting to execute are kept on a list called the ............

A) job queue

B) ready queue

C) wait queue

D) device queue



8. Which of the following describes the ability of an OS to support multiple, concurrent paths of execution within a single process?

A) Multithreading

B) Multiprocessing

C) Multitasking

D) Multiprogramming



9. Virtual memory is

A) an extremely large main memory

B) an extremely large secondary memory

C) an illusion of extremely large main memory

D) a type of memory used in super computers



10. A thread is a .................... precess.

A) heavy weight

B) multiprocess

C) inter thread

D) light weight

Answers:

1. Operating System means ........................

A) a set of programs which controls computer working.

2. The basic types of OS are ...................

D) batch and interactive

3. The simplest way of deadlock is to ...

C) kill one of the processes

4. Throughput of a system is

A) Number of programs processed by it per unit time

5. Which of the following is not OS layer?

D) Critical Section

6. Round robin scheduling is essentially the preemptive version of ...........

A) first in first out

7. The process that are residing in the main memory and are waiting to execute are kept on a list called the ............

B) ready queue

8. Which of the following describes the ability of an OS to support multiple, concurrent paths of execution within a single process?

A) Multithreading

9. Virtual memory is

C) an illusion of extremely large main memory

10. A thread is a .................... precess.

D) light weight

Related Posts:

• Solved MCQ of Operating System Principles set-1
• Solved MCQ of Operating System Principles set-2
• Solved MCQ of Operating System Theory set-3
• MCQ of Operating System with answer set-4
• Solved MCQ of Operating System Set-5
• Solved MCQ of Operating System Set-6

Solved MCQ of Programming in C++ set-5

1. There is a unique function in C++ program by where all C++ programs start their execution with ........

A) start()

 Class diagram of C++ programming(Photo credit: Wikipedia)

B) begin()

C) main()

D) output()



2. Which of the following is not a jump statement in C++?

A) break

B) Goto

C) Exit

D) Switch



3. The memory address of the first element of an array is called ...................

A) floor address

B) foundation address

C) first address

D) base address



4. C++ exception handling mechanism mainly uses how many keywords?

A) Four

B) Three

C) Two

D) None of the above



5. When an exception is thrown, it needs to be .....................

A) Executed

B) Handled appropriately

C) Resolved

D) None of the above



6. After defining the function template, the next step to call it in another function such as .........

A) int()

B) secondary()

C) template()

D) main()



7. A file stream refers to the flow of data between a ...............

A) Program and object

B) Program and stream

C) Program and file

D) None of the above




8. .................. are one of the attributes of C++ that support run-time polymorphism.

A) Pointers

B) Derived classes

C) Virtual functions

D) Heap tree



9. which of the following header file does not exist?

A) iostream

B) string

C) sstring

D) sstream



10. To increase the value of c by one, which of the following is wrong?

A) c++;

B) c=c+1;

C) c+1=>c;

D) c+=1;

Answers:

1. There is a unique function in C++ program by where all C++ programs start their execution with ........

C) main()

2. Which of the following is not a jump statement in C++?

D) Switch

3. The memory address of the first element of an array is called ...................

D) base address

4. C++ exception handling mechanism mainly uses how many keywords?

B) Three

5. When an exception is thrown, it needs to be .....................

B) Handled appropriately

6. After defining the function template, the next step to call it in another function such as .........

D) main()

7. A file stream refers to the flow of data between a ...............

C) Program and file

8. .................. are one of the attributes of C++ that support run-time polymorphism.

C) Virtual functions

9. which of the following header file does not exist?

C) sstring

10. To increase the value of c by one, which of the following is wrong?

C) c+1=>c;

Related Posts

• Solved MCQ of C set-1
• Objective Questions of C with answer set-2
• Solved MCQ of Programming in C set-3
• Solved MCQ of C++ Set-1
• MCQ of C++ with answer Set-2
• MCQ Questions of C++ With Answers set-3
• Solved Multiple Choice Questions of C++ set-4

Solved MCQ of Programming in C set-3

Dependency graph for tgmath.h header file in C Programming Language (Photo credit: Wikipedia)

1. C language is available for which of the following operating systems?

A) DOS

B) Windows

C) Unix

D) All of the above


2. Which of the following are tokens in C?

A) Keywords

B) Variables

C) Constraints

D) All of the above


3. C was developed in the year .....................

A) 1970

B) 1972

C) 1976

D) 1980


4. Which escape character can be used to beep from speaker in C?

A) \a

B) \b

C) \m

D) \n


5. Which of the following is a keyword is used for storage class?

A) printf

B) external

C) auto

D) scanf


6. Continue statement is used .............

A) to go to the next iteration in a loop

B) come out of a loop

C) exit and return to the main function

D) restarts iteration from beginning of loop


7. File manipulation functions in C are available in which header file?

A) streams.h

B) stdio.h

C) stdlib.h

D) files.h


8. A compiler ................

A) is a computer program

B) translates a high level language into machine language

C) is a part of software

D) editor


9. Explicit type conversion is known as ....................

A) casting

B) conversion

C) disjunction

D) separation


10. A function popularly used C input function

A) scanf

B) printf

C) getch

D) Char

Answers:

1. C language is available for which of the following operating systems?

D) All of the above

2. Which of the following are tokens in C?

D) All of the above

3. C was developed in the year .....................

A) 1970

4. Which escape character can be used to beep from speaker in C?

B) \b

5. Which of the following is a keyword is used for storage class?

C) auto

6. Continue statement is used .............

A) to go to the next iteration in a loop

7. File manipulation functions in C are available in which header file?

B) stdio.h

8. A compiler ................

B) translates a high level language into machine language

9. Explicit type conversion is known as ....................

A) casting

10. A function popularly used C input function

A) scanf

Related Posts

• Solved MCQ of C set-1
• Objective Questions of C with answer set-2
• Solved MCQ of C++ Set-1
• MCQ of C++ with answer Set-2
• MCQ Questions of C++ With Answers set-3
• Solved Multiple Choice Questions of C++ set-4

MCQ of Data Structure and Algorithm with Answer set-5

1. Arrays are best data structures

A) for relatively permanent collections of data

B) for the size of the structure and the data in the structure are constantly changing

C) for both of above situation

A Linked List data structure that starts with a head reference to the first node, and each node contains a 'next' field that points to the next node. The final node has a 'next' value of null. (Photo credit: Wikipedia)

D) for none of above situation


2. Which of the following data structure is not linear data structure?

A) Arrays

B) Linked lists

C) Both of the above

D) None of the above


3. The disadvantage in using a circular linked list is .........................

A) It is possible to get into infinite loop.

B) Last node points to first node.

C) Time consuming

D) Requires more memory space


4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

A) Singly Linked List

B) Circular Linked List

C) Doubly Linked List

D) Linear Linked List


5. A .................... is a linear list in which insertions and deletions are made to from either end of the structure.

A) circular queue

B) random of queue

C) priority

D) dequeue


6. In a priority queue, insertion and deletion takes place at ..................

A) front, rear end

B) only at rear end

C) only at front end

D) any position


7. The time complexity of quick sort is ..............

A) O(n)

B) O(n2)

C) O(n log n)

D) O(log n)


8. Which of the following is an application of stack?

A) finding factorial

B) tower of Hanoi

C) infix to postfix conversion

D) all of the above


9. The data structure which is one ended is ..................

A) queue

B) stack

C) tree

D) graph



10. A list which displays the relationship of adjacency between elements is said to be

A) linear

B) non linear

C) linked list

D) trees

Answers:

1. Arrays are best data structures

A) for relatively permanent collections of data

2. Which of the following data structure is not linear data structure?

D) None of the above


3. The disadvantage in using a circular linked list is .........................

A) It is possible to get into infinite loop.


4. A linear list in which each node has pointers to point to the predecessor and successors nodes is called as ..

C) Doubly Linked List


5. A .................... is a linear list in which insertions and deletions are made to from either end of the structure.

D) dequeue


6. In a priority queue, insertion and deletion takes place at ..................

D) any position


7. The time complexity of quick sort is ..............

C) O(n log n)


8. Which of the following is an application of stack?

D) all of the above


9. The data structure which is one ended is ..................

B) stack


10. A list which displays the relationship of adjacency between elements is said to be

A) linear

Related Posts

• Solved MCQ of Data Structure Set - 1
• Solved MCQ of Data Structure Set - 2
• Solved Objective questions of computer data structure set-3
• Solved MCQ of Data Structure and Algorithm set-4 
• Objective Questions of Data Structure with Answer set-6 
• Solved MCQ on Stack and Queue in Data Structure set-1
• Interview Questions on Stack and Queue in Data Structure set-2
• Solved MCQ on Tree and Graph in Data Structure set-1
• Objective Questions on Tree and Graph in Data Structure set-2

Solved MCQ of Data Structure and Algorithm set-4

Tree-data-structure (Photo credit: Wikipedia)

1. Which of the following data structure is non-linear type?

A) Strings

B) Lists

C) Stacks

D) Tree

2. Which of the following data structure is linear type?

A) Array

B) Tree

C) Graphs

D) Hierarchy

3. The logical or mathematical model of a particular organization of data is called a .........

A) Data structure

B) Data arrangement

C) Data configuration

D) Data formation

4. The simplest type of data structure is ..................

A) Multidimensional array

B) Linear array

C) Two dimensional array

D) Three dimensional array

5. Linear arrays are also called ...................

A) Straight line array

B) One-dimensional array

C) Vertical array

D) Horizontal array

6. Arrays are best data structures ............

A) For relatively permanent collections of data.

B) For the size of the structure and the data in the structure are constantly changing

C) For both of above situation

D) For none of the above

7. Which of the following data structures are indexed structures?

A) Linear arrays

B) Linked lists

C) Graphs

D) Trees

8. Each node in a linked list has two pairs of .............. and ...................

A) Link field and information field

B) Link field and avail field

C) Avail field and information field

D) Address field and link field

9. A ........................ does not keep track of address of every element in the list.

A) Stack

B) String

C) Linear array

D) Queue

10. When does top value of the stack changes?

A) Before deletion

B) While checking underflow

C) At the time of deletion

D) After deletion

Answers:

1. Which of the following data structure is non-linear type?

D) Tree

2. Which of the following data structure is linear type?

A) Array

3. The logical or mathematical model of a particular organization of data is called a .........

A) Data structure

4. The simplest type of data structure is ..................

B) Linear array

5. Linear arrays are also called ...................

B) One-dimensional array

6. Arrays are best data structures ............

B) For the size of the structure and the data in the structure are constantly changing

7. Which of the following data structures are indexed structures?

A) Linear arrays

8. Each node in a linked list has two pairs of .............. and ...................

A) Link field and information field

9. A ........................ does not keep track of address of every element in the list.

C) Linear array

10. When does top value of the stack changes?

D) After deletion

Related Posts

• Solved MCQ of Data Structure Set - 1
• Solved MCQ of Data Structure Set - 2
• Solved Objective questions of computer data structure set-3
• MCQ of Data Structure and Algorithm with Answer set-5
• Objective Questions of Data Structure with Answer set-6 
• Solved MCQ on Stack and Queue in Data Structure set-1
• Interview Questions on Stack and Queue in Data Structure set-2
• Solved MCQ on Tree and Graph in Data Structure set-1
• Objective Questions on Tree and Graph in Data Structure set-2

Factors That Influence Your Websites Rankings

Your websites rankings in the search engine affect the visibility of your site in search results. Higher ranked websites are always appeared on the top of search results, those sites have greater chances of being clicked. As a result those websites can get high volumes of traffic, those visitors which are obtained from search engines are not only visitors for numbers but also highly targeted visitors. There are so many factors that influence your website rankings, some of the most important factors I have described here, may help you to increase your websites rankings and visibility on search engines by implementing those tips for your website.

Factors That Influence Your Websites Rankings

# 1. Textual content on your website

If the webpage does not have text content or have little text content, search engine could not find anything to index or may be ignored by the search engine. The little or no text content webpage does not appear on the search results.

To be more visible to the search engine, the webpage must have text content related to your website. To get good rankings for your website on the search result, you have to add more text content to the webpage.

# 2. Bot permission on robot.txt

The effective implementation of robot.txt file affects the indexing and ranking of web page in the search engines. If the robots.txt file of your website does not allow any bot to index the page or the robots meta tag of the web page does not allow the particular bot or particular page to index the page, the search engines don't show that page in the search results.

To be indexed all the pages or the pages you wanted to be indexed by the search engines, you have to change the robot.txt file of your website, so that search engine index the page.

# 3. Click depth of page from root directory

It is better to make flat file system than creating deep directory structure. The less distance from the root directory increase the web pages importance and rankings. So the web pages that can be reached with the few clicks from your home page, search engines gives higher rankings and the search engines give lower rankings to the page that require a lot of clicks from home page.

# 4. Uniqueness of the page content

Having duplicate contents on the website is not good for search engines. If you have placed same web page twice or more on your website, it may have negative effects on the search engines positions. So do not submit duplicate page on the website as far as possible.

Along with avoiding duplicate web page, you should also avoid from duplicate paragraphs. Those web pages having duplicate contents may be ignored by the search engines. So you have to remove duplicate paragraphs from the page.

# 5. Method used for page redirection

Method of the redirection you have used also affects your websites rankings. If you wanted to redirect the visitors of old URL into new URL, you need to redirect the visitors of old site into new site. A 302 redirect tells the search engines that redirect temporarily and 301 redirect tells the search engines that redirect permanently. So 301 redirection method used in your website increases your websites rankings than 302 redirection method used.

# 6. Number of links on a page

Linking your text on another related website or the pages on the same website is a good idea for making your page more resourceful and also to increase the ranking of your page. But too many links on the web page negatively impacts for rankings of your web page.

If a page contains too many links, search engines might think that the page itself does not contain enough content and does not show pages that have just links to other websites. So try to decrease the outgoing links as far as possible and it is better if number of internal links are greater than number of external links. The total number of link should be less than 200 and it is better if it goes to less than 100. Google prefers less than 100 links on a single page.

# 7. Uses of meta description tag

Effective uses of meta description tag helps to increase the search engine rankings for your webpage. It you don't use meta description tag, search engine do not display your webpage on the search result. So add a unique and descriptive meta description tag on a page.

The too short and too long meta description tag also interrupts negatively by the search engine. So meta description tag should have at least 50 characters and it should not have less than 160 character. The meta description tag also needs to be relevant to the webpage or business and it should not be duplicate.

# 8. Size of web page

Web page loading time is also a factor in search engines ranking factors. If the size of website is very big, it takes longer time to load. The search engine crawlers can not index the web page which takes longer time to load. If your webpage is very big, you have to split your page into smaller pages.

# 9. Tile of the page

Using appropriate title for a web page is also very important for search engine rankings. The title of page should represent the content of the whole page. While creating title for a web page, should use meaningful keywords related to your content and it should not be too long and too short. A short title may not sufficiently describe the page and long title will shorten when displaying in search results. For better rankings, always use short but more descriptive and keyword rich title and also do not use duplicate title tag.

# 10. Format of URL

Format of URL also affects the ranking of a web page. The URL of web page should not use the characters which are not allowed in URL.

The URL should not be too long and should not use too many parameters. Search engine might not look for rankings information for the web pages having long URLs. Along with high ranked by search engines, a short and descriptive URL also shared on social networking sites.

Related Articles

• Easy Methods to Increase Your Website Speed
• Most Effective Tips for Your Link Building Success
• How to Utilize Google Services for effective SEO?
• Top 10 Secrets for Search Engine Optimization (SEO) Success
• List of Best Keyword Research Tools for Better SEO
• List of top 7 Free bulk search engine submission tools
• List of Top 65 Search Engine Submission Add URLs.
• Most Important Tips for Search Engine Optimization (SEO)
• List of Top Social Exchange sites
• List of bad ways for building backlinks
• List of good ways of building quality backlinks