Hello,

You are pursuing diploma in electrical engineering. Which is very good subject. You can also go for higher study. Like you can entry as a lateral candidate in any engineering college. Infact if you go for job after completing this course you can get so many opportunities like

1. electricals.

Hello,

You have not mentioned which exam you are referring to, depending upon which the chapter weightage will be different. Without this information we are not in a position to be able to answer your question. So Please provide more information and ask the question and our team will try

There are many topics covered in the algebra matrix. Some Of them are as follows -

• Euclidean vector spaces.
  
• Matrix inverses and determinants.
• Solving systems of equations with matrices .
• Eigenvalues and eigenvectors.
• Mathematical operations with matrices (addition, multiplication )
• Orthogonal matrices .
• Positive definite matrices .
• Linear transformations.

Check

Hello Candidate,

Please mention the exam name in the question. You have not written it in the question, and without knowing the exam name, we are unable to tell you the most scoring topics. So, please post a new question with complete info.

Only then we can help you.

Hope

Hi Aspirant,

I am from electrical engineering background and to solve questions related to electric charges and field you need to have a good hold over the concept of the force effected by the charge particle and also the linear distance.Also understand the topics well and study biot savarts law

Dear Aspirant, the topics of zonal computing Olympiad are not just constraint to the programming. The include the basic topics Such as-

Introduction.

Efficiency.

Searching.

Sorting.

Basic Graph Algorithms.

Dynamic Programming.

Greedy Algorithms.

Computing Shortest Paths.

Heaps, permutations, directed acyclic graphs, sliding window algorithms.

Also advanced topics like dynamic programming

The topics of the Olympiad are divided in 'Basic ' and 'Advanced' categories

Basic Topics :

• Introduction
• Efficiency
• Searching
• Sorting
• Basic Graph Algorithm
• Dynamic Programming
• Greedy Algorithms
• Computing Shortest Paths
• Heaps
• Permutations
• Directed Acyclic Graphs
• Computing Prefix Sums
• Sliding Window Algorithm

Advanced Topics :

• Advanced Graph Algorithms
• Dynamic Programming on

Hello student ,

Yes you can give but you have to do your graduation before that like if you are doing BE or B.tech then you must have 1st class with an aggregate of minimum 65 % marks or CGPA 6.84/10 ( average in all semester ) and your  maximum

Hi there!

Please be specific and write your question again, so that we can help you. Write the question in the comment section.

Thanks