HSST Computer Science Exam 2022 Notification soon..

Quiz Based Learning Programme

റാങ്ക് മേക്കർ:

വിദ്യാർത്ഥികൾക്കായി ഒരു ക്വിസ് അധിഷ്ഠിത പഠന പരിപാടി .

എന്തുകൊണ്ട്  റാങ്ക് മേക്കർ? 

1. പ്രധാനപ്പെട്ട ചോദ്യങ്ങൾ മന: പാഠമാക്കാൻ വിദ്യാർത്ഥികൾക്ക് ഉപയോഗിക്കാൻ കഴിയുന്ന ഒരു സോഫ്റ്റ് വെയർ ആണ്  റാങ്ക് മേക്കർ ..
2.  റാങ്ക്മേക്കർ  ഒരു    ഡെസ്ക്ടോപ്പ് അധിഷ്ഠിത സോഫ്റ്റ്‌വെയർ ആണ് .
3. നേരത്തെ റെക്കോർഡ് ചെയ്തിരിക്കുന്ന ചോദ്യങ്ങൾക്ക് പുറമെ പുതിയ ചോദ്യങ്ങൾ വിദ്യാർത്ഥികൾക്ക് ഈ സോഫ്റ്റ്‌വെയർ ഉപയോഗിച്ച് റെക്കോർഡ് ചെയ്യാം..
4. ഈ സോഫ്റ്റ്‌വെയർ തീർത്തും സൗജന്യമാണ് ....
5. റാങ്ക് മേക്കർ സോഫ്റ്റ്‌വെയർ ഇൻസ്റ്റാൾ ചെയ്യുന്നതിനായി ഒരു വിൻഡോസ് അധിഷ്ഠിത കമ്പ്യൂട്ടർ ആവശ്യമാണ് ..
6. ഇൻസ്റ്റാൾ ചെയ്യുന്നതിനായി ഒരു കോഡ് ( qblp ) ആവശ്യമാണ് ... 

ഡൌൺലോഡ്

MCQ in Computer Science for HSST and Graduate Level Exam 2017

MCQ in Computer Science for HSST and Graduate Level Exam 2017

Unique Features of this Book
* Include More than 1000 Question in Various Topics including Software Engineering, Computer Networks , Digital Electronics , Micro Processor etc...

* Previous PSC Questions with Answers are included.
* Answer keys with Explanations are given.
* Separate Module for IT & Cyber law questions for Graduate Level Exams
Masters Book Points
--------------------------

For Book Enquiry Please Contact 7012853532
Thanks for your support
Masters Publication


Once you order this book , you will get Free eBooklet.

Mock Exam #34

Take Mock Exam #34

Deadlock : OS

1. In this Algorithm, it is assumed that a deadlock will never occur

A.Banker's Algorithm
B.Dijkstra's algorithm
C.Ostrich Algorithm
D.Greedy Algorithm


This approach may be used in dealing with deadlocks in concurrent programming if they are believed to be very rare and the cost of detection or prevention is high. It is named for the ostrich effect which is defined as "to stick one's head in the sand and pretend there is no problem."

2. Resources are allocated to the process on non-sharable basis is

A. mutual exclusion
B. hold and wait
C. no pre-emption
D. circular wait

3. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?

A. resource allocation graph
B. starvation graph
C. inversion graph
D. none of the mentioned

4.Name the situation in which two computer programs sharing the same resource are effectively preventing each other from accessing the resource, resulting in both programs ceasing to function.

A.Starvation
B.Fragmentation
C.Deadlock
D.None of these

5. Banker's algorithm is

A.Deadlock Prevention
B.Deadlock Detection
C.Deadlock Avoidance
D.All of these

HSST Exam Preparation

 

1. Processor manufactured by AMD

1. Sempron.
2. Phenom.
3. Turion.
4. All of these

 

 

2. Which unit is largest

1. Yotta Byte
2. Peta Byte
3. Tera Byte
4. Zeta Byte

 

3. X is an electronic toll collection system by national highway authority of India. It was initially set up in the golden quadrilateral stretch but now is implemented in over 247 toll plaza across national highways. Name this system which uses Radio frequency identification to work

1. Speedtag
2. Fastrack
3. Fastag
4. Speedtrack

 

4.Technique for defeating a cipher or authentication mechanism by trying to determine its decryption key or passphrase by trying hundreds or sometimes millions of likely possibilities

1. Salami Attack
2. Data Diddling
3. Data Mining
4. Dictionary Attack

 

 

5. Characteristics of Salami Attack

1. Small attacks add up to one major attack that can go undetected
2. unauthorized changing of data before or during their input to a computer system
3. process of discovering patterns in large data sets
4. All of these

Answers

HSST COMPUTER SCIENCE ONLINE MODEL TEST

......,,,,,,,,Be prepared for first Online Model Test......,

Test based on our previous sessions

Those who scores below 30 Will be expelled from this group.

Those who don't take the exam also will be removed.

Cut off Marks 30