Skip to main content

RECRUITMENT OF CLERKS IN PARTICIPATING ORGANISATIONS 2018 - 2019


Institute of Banking Personnel Selection COMMON RECRUITMENT PROCESS FOR RECRUITMENT OF CLERKS IN PARTICIPATING ORGANISATIONS 
(CRP CLERKS-VIII for Vacancies of 2019-20 ) Website: www.ibps.in 
In case of queries / complaints please log in to http://cgrs.ibps.in/ 

The online examination (Preliminary and Main) for the next Common Recruitment Process for selection of personnel for Clerical cadre Posts in the Participating Organisations is tentatively scheduled in December 2018 & January 2019.  

A
PARTICIPATING
ORGANISATIONS     





Allahabad Bank
Canara Bank
Indian Overseas Bank
UCO Bank




Andhra Bank
Central Bank of India
Oriental Bank of Commerce
Union Bank of India




Bank of Baroda
Corporation Bank
Punjab National Bank
United Bank of India




Bank of India
Dena Bank
Punjab & Sind Bank
Vijaya Bank




Bank of Maharashtra
Indian Bank
Syndicate Bank


The tentative schedule of events is as follows:
Activity
Tentative Dates


On-line registration including Edit/Modification of Application by candidates
18.09.2018 to 10.10.2018


Payment of Application Fees/Intimation Charges (Online)
18.09.2018 to 10.10.2018


Download of call letters for Pre- Exam Training
November 2018


Conduct of Pre-Exam Training
26.11.2018 to 01.12.2018


Download of call letters for Online examination – Preliminary
November 2018


Online Examination – Preliminary
08.12.2018, 09.12.2018,

15.12.2018 & 16.12.2018


Result of Online exam – Preliminary
December 2018/ January 2019


Download of Call letter for Online exam – Main
January 2019

Online Examination – Main
20.01.2019


Provisional Allotment
April 2019


Click here for Official website

Comments

Post a Comment

Popular posts from this blog

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
Post a Comment
Read more

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    
19 comments
Read more

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
Post a Comment
Read more