RECRUITMENT OF PROBATIONARY OFFICERS | Any Degree | 417 Posts

RECRUITMENT OF PROBATIONARY OFFICERS | Any Degree | 417 Posts | Last date: 27 August 2018

RECRUITMENT OF PROBATIONARY OFFICERS - ADMISSION TO POST GRADUATE DIPLOMA IN BANKING & FINANCE COURSE AT INDIAN BANK MANIPAL SCHOOL OF BANKING (IBMSB)

Indian Bank invites application from young and bright graduates who fulfill the eligibility criteria specified and who are interested in Banking career, for admission to the one year Post Graduate Diploma in Banking and Finance (PGDBF) course at Indian Bank Manipal School of Banking (IBMSB), which has been set up jointly by Indian Bank and Manipal Global Education Service Pvt Ltd.

Candidates will be selected through a selection process consisting of online Exam (Preliminary & Main Examination) followed by Personal Interview. Admission to PGDBF at Indian Bank Manipal School of Banking (IBMSB) comes with the assurance of a full-fledged Banking career with Indian Bank as a Probationary Officer on successful completion of the course.

The reservation for Persons with Disabilities (PWD) is on horizontal basis. The selected candidate will be placed in the appropriate category (viz. SC/ST/OBC/UR) to which they belong. The number of vacancies and also the number of reserved vacancies are provisional and may vary according to actual requirement of the Bank. 2 Abbreviations stand for: - SC - Scheduled Castes, ST - Scheduled Tribes, OBC - Other Backward Class, HI – Hearing Impaired, OC – Orthopedically Challenged, VI – Visually Impaired, ID -Intellectual Disability.

CLICK HERE FOR DETAIL ADVERTISEMENT

CLICK HERE TO APPLY

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