SSC Recruitment 2018 for Constable (GD) | 54953 Vacancies

SSC Recruitment 2018 for Constable (GD) | 54953 Vacancies | Last Date: 24 August 2018

Eligibility:

Educational Qualification: Matriculation or 10th class pass from a recognized Board/ University.

Physical Standards:

Height (Male) – 170 Cms

Height (Female) – 157 Cms

Chest (Male) – 80 Cms with 5 Cms expansion

Chest (Female) – N/A

Weight: For male and female candidates: Proportionate to height and age as per medical standards.

Physical Standards Relaxed as per government policy.

Age limit (As on 01.08.2018): 18 to 23 years. Candidates should not have been born earlier than 02.08.1995 and later than 01.08.2000

Dates to Remember:

Online Registration Opening Date: 24.07.2018

Online Registration Closing Date: 24.08.2018

Last date Payment through Online mode: 24.08.2018

Last date Payment through challan of SBI: 24.08.2018

Computer Based Examination date: To be notified later

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