INDIAN ARMY RECRUITING OFFICE FOR FRESHER

Indian Army Recruitment Rally 2018 | Soldiers/Officers | Last date: 16 August 2018

Eligibility:

Soldier General Duty:

SSLC/Matric with 45% marks in aggregate and 33 % in each subject.

In case candidates have passed class 10th from education board adopting grading system, candidate must have the grade which contains 45% in each subject.

No percentage considered in case candidates has passed with higher qualification. I.e. 10 + 2 and above.

Soldier Clerk /Storekeeper Technical/Inventory Management:

10+2/Intermediate Exam pass in any stream (Arts, Commerce, Science) with 60% marks in aggregate and min 50% marks in each subject.

Should have studied English and Math/Accts/Book Keeping in Class XII or class X and should have secured minimum 50% marks in each of these subjects, whether studied in Class XII or X.

Even if a candidate is Graduate or has a higher qualification, percentage marks scored in Class 12th would be applicable towards his eligibility.

Soldier Technical:

10+2/Intermediate Examination pass in Science with Physics, Chemistry, Maths and English with 50% marks in aggregate and 40% marks in each subject

Soldier Nursing Assistant/Nursing Assistant Veterinary:

10+2/ Intermediate Exam pass in Science with Physics, Chemistry, Biology and English with Minimum 50% marks in aggregate and minimum 40% in each subject. OR

In case the candidate has a BSc Degree with (Botany / Zoology / Bio-Science) and English, the stipulation of percentage in Class 12th is waived off. However, the candidate should have studied all the four specified subjects in Class 12th also.

Soldier Tradesman: 10th/ ITI (Except Mess Keeper and House Keeper who must be 8th pass)

INDIAN ARMY RECRUITING OFFICE, JAIPUR

Comments

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (CSE)

ISL ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester (A & B Sections) –PC 603 CS Academic Year: 2020-21 SHORT ANSWER QUESTIONS UNIT-I 1. Why is an algorithm analysis required? 2. State about UNION & FIND operations. 3. List out the UNION algorithm using weighting rule. 4. Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 5. List and define operations performed on sets? 6. What do you mean by performance analysis of an algorithm? Explain. 7. Explain the significance of input size of a problem. 8. State the weighting, collapsing rules in sets. 9. Explain set representation and write algorithm for FIND. 10. Solve T(n)=3T(n/3)+√n. 11. Define the terms direct recursive and indirect rec

Web Application Development (WAD)

Web Application Development (WAD) WEB APPLICATION AND DEVELOPMENT ( WAD) Notes Unit Wise Unit I INTRODUCTION HTML CSS WEB APPLICATION FUNDAMENTALS Unit II XML Unit III JQuery JSON Java Script Unit IV AngularJS Unit V MEAN Stack SMACK Stack LAB PROGRAMS: Click Here Important Question for MID I : Click here WAD Previous Question : Click Here TEXT BOOK: Click Hear Course Code Course Title Core/Elective PC 601 IT WEB APPLICATION DEVELOPMENT Core Prerequisite Contact hours per week CIE SEE Credits L T D P - 3 1 - - 30 70 3 Course Objective: Ø To develop dynamic web applications using the concepts of HTML 5.0 and CSS Ø To understand the document structure and schemas and represent data in that format Ø To develop applications using Query and represent objects in JSON notation

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (IT)

ISL ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester – PC 602 IT Academic Year: 2020-21 SHORT ANSWER QUESTIONS UNIT-I 1. Explain linear probing in Hashing with an example. 2. Define Heap. 3. List out the collision resolution techniques in hashing. 4. Why is an algorithm analysis required? 5. State about UNION & FIND operations. 6. List out the UNION algorithm using weighting rule. 7. Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 8. List and define operations performed on sets? 9. What do you mean by performance analysis of an algorithm? Explain. 10. Explain the significance of input size of a problem. 11. State the weighting, collapsing rules in sets. 12. Explain set representation and write algorithm for FIND. 17

Best Information for Learners

Search This Blog