code with zaheer

What to do next after Btech

What to do after Btech? it's a scary question since it is faced by many engineering students after their final year.

There are many routes you can take after completing your B.Tech. However, with the great number of career options available, it's natural that you may feel confused about which one to choose.

Where Some of them follow their goals, Some of them blindly join with their friend's chosen paths...

Actually, Most students get into engineering without knowing what they like or what they want to do after Btech, which is why India has a huge number of BTech graduates.

These are some routes or options I mentioned below to do after BTech.

PLACEMENTS

On-campus Placements lead you directly to recruiters without a lot of effort and offer you a chance to get a job. And here it is easy to get a job with less competition

HIGHER STUDIES

Yes, in Higher studies you can do MTech programs, MS, MBA courses, INTERNSHIPS, and the last one is CERTIFICATION Courses, etc...

since it is computer science and most of them like coding, and some of them like non-coding courses

and everyone doesn't need to choose coding as a career (technical and non-technical)

there are also non-coding jobs and courses I discussed below as follows

Technical Courses as follows as

Data science
Machine Learning
IoT
Cybersecurity
Artificial intelligence
Blockchain technology
Android development
Front-end development
back-end development
Full-stack developer (java, python)
Tech-stacks such as MERN(Mongodb, Express, React, Node.JS), MEAN(MongoDB, Express,Angular, Node.JS), MEVN(Mongodb, Express,Vue, Node.JS), LAMP(Linux, Apache, MySQL,Php)
Game development
C, C++, Python, Java, JavaScript, Php developers...

etc.. are some of the courses.

Non-technical jobs and courses as follows as

If you feel coding is hard, and you don't like coding even though some of the technologies or roles are mentioned below..

Robotic process automation (RPA)
UI/UX Designing
Network Engineer
Database engineer
Business analyst
Software testing/Quality analyst
Web designer
Design engineer
Computer architect
DevOps
Technical support
Business Analyst
Market Research Analyst
Digital Marketing Strategist
Social Media Manager
Marketing Manager
Business Development Manager
Management Consultant
Advertising and media Professional
Investment Banker
Product Manager
Customer relationship manager
product manager
Technical writer
Graphic designer
Sap BASIS, SD
Manual testing
and alot more...

Etc.. are some of the non-technical jobs for that it requires good analytical and problem-solving skills and spoken English, communication, listening, and creativity.

Note:

If you know the remaining courses and jobs then list them below in the comment section It will helpful.

Like it and Share it if you feel as useful...

daa

Design and analysis of algorithms syllabus

Course Objectives

To analyze performance of algorithms.
To choose the appropriate data structure and algorithm design method for a specified application.
To understand how the choice of data structures and algorithm design methods impacts the performance of programs.
To solve problems using algorithm design methods such as the greedy method, divide and conquer, dynamic programming, backtracking and branch and bound.
To understand the differences between tractable and intractable problems.
To introduce P and NP classes.

syllabus

UNIT - I

Introduction-Algorithm definition, Algorithm Specification, Performance Analysis-Space complexity, Time complexity, Randomized Algorithms. Divide and conquer- General method, applications - Binary search, Merge sort, Quick sort, Strassen’s Matrix Multiplication.

UNIT - II

Disjoint set operations, union and find algorithms, AND/OR graphs, Connected Components and Spanning trees, Bi-connected components Backtracking-General method, applications, The 8-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.

UNIT - III

Greedy method- General method, applications- Knapsack problem, Job sequencing with deadlines, Minimum cost spanning trees, Single source shortest path problem.

UNIT - IV

Dynamic Programming- General Method, applications- Chained matrix multiplication, All pairs shortest path problem, Optimal binary search trees, 0/1 knapsack problem, Reliability design, Traveling sales person problem.

UNIT - V

Branch and Bound- General Method, applications-0/1 Knapsack problem, LC Branch and Bound solution, FIFO Branch and Bound solution, Traveling sales person problem. NP-Hard and NP-Complete problems- Basic concepts, Non-deterministic algorithms, NP - Hard and NP- Complete classes, Cook’s theorem.

To download the materials of all units click the below links...

Material Credits - SIA publications

Unit 1 material Download

Unit 2 material Download

Unit 3 material Download

Unit 4 material Download

Unit 5 material Download

note:

if you have any issues or any queries, please feel free to contact us.

daa