CII – iPATE Exam Syllabus for Computer Engineering

CII – iPATE 2020 Exam Syllabus for Computer Engineering – The latest complete syllabus with exam pattern for Computer Engineering

CII – iPATE is an online exam launched by the confederation by Indian Industry (CII) for engineering students and graduates.

iPATE Exam Syllabus is the first step if we want to crack the iPATE exam. A candidate must know iPATE Syllabus thoroughly while preparing for the iPATE exam.

CII – iPATE 2020 Exam Syllabus for Computer Engineering

iPATE Computer Engineering syllabus is divided into 3 sections

Complete section-wise list of the syllabus for iPATE exam is provided below

Section – I: Cognitive Abilities

Common for all Disciplines – [ 20 Questions, 20 Marks ]

1. Quantitative Aptitude

Allegation or Mixture, Areas and Mensuration, Average, Boats and Streams, Calendar, Chain Rule, Co-ordinate Geometry, Compound Interest, Cryptarithmetic Problems, Height and Distance, LCM and HCF, Number System, Partnership, Percentage, Pipes and Cisterns, Problems on Ages, Problems on Trains, Profit and Loss, Progression, Ratio, and Proportion, Simple Interest, Simplification, Square Roots and Cube Roots, System of Equations, Time and Work, Time, Speed and Distance, Train, Volume and Surface Area.

2. Analytical Reasoning

Analogies, Arguments, Artificial Language, Binary Logic, Blood Relations, Calendars, Cause & Effect, Course of Action, Classification, Clocks, Cubes, Data Sufficiency, Letter Series, Letter Symbol, Logics, Logical Deduction, Logical Connectives, Logical Game, Logical Problems, Logical Sequence and Matching, Number Series, Seating Arrangement, Syllogism, Verification of Truth.

3. Data Interpretation

Bar Graph, Caselet Form, Combined Data Set, Graph, Line Chart, Missing Data Interpretation, Pie Chart, Radar/Web, Tabular Form.

4. English Communication

Change of Voice, Comprehension, Grammar, Idioms & Phrases, Paragraph Formation, Sentence Correction, Sentence Formation, Sentence Ordering, Spotting Errors, Synonym – Antonym, Vocabulary, Words Ordering.

Section – II: Professional Abilities

Common for all Disciplines – [ 20 Questions, 20 Marks ]

1. Project Management

Concept: The Project Plan, Scope, SOW (Statement of Work), Work Definition, Procurement Management.

Tools: WBS (Work Breakdown Structure), Gantt Charts, Activity Charts, Network Diagrams, PERT & CPM, Crashing & Resource Planning.

Planning and Scheduling Charts and Graphs: Milestone, Run Chart, Control Chart, Fishbone Diagram.

2. Health, Safety & Risk Management

Concepts of Occupational Health Hazard and Risks; Principles and Methods of Hazard Identification and Risk Assessment; Human Behavioural Aspects of Risk Management; Safety Provisions as per the Factory Act 1948.

3. Environmental Laws

Ministry of Environment and Forests: Key Functions; Central Pollution Control Board: Key Functions; Environmental Management System (ISO:14001-1996): General Requirements; Environmental Impact Assessment, Kyoto Protocol.

4. Social Responsibility & Ethics

Ethics: Code of Professional Behaviour and Accountability. SA8000 (ILO); Code of Ethics for Professional Engineers – ASME, IEEE, IE(I) etc;

Equal Opportunities, Gender Issues, Professional Obligation of Engineers; Sex and Gender; Family;

Women and Work: Women’s Participation in Development; Concepts of Sexual Harassment; Personal Laws – An Overview (Property Rights / Family 

5. Finance & Accounts

Cost Analysis: Process / Product Marginal Cost – Break-even Costing, Variance Analysis, Make or Buy Decision.

Financial Discipline: Preparation of Different Budgets, Maintaining of Sectional Accounts, Cash Flow Control and Analysis, Working Capital Management, Analysis of Expenditure, Balance Sheet – Basics, Return on Investments.

6. Legal, Contracts & Arbitration

Contracts: Various forms of Contracts — Government, FIDIC, ICE; Legal Basis of Contract – Indian Contract Act and Law of Torts; Provisions regarding Employer, Engineer and Contractor / Supplier – Duties and Responsibilities; General Areas of Dispute; Types of Contract.

Disputes and Arbitration: Contract Provisions – Mutual discussions and amicable settlement as a first step; Dispute Resolution Expert / Board; Arbitration – Location of Arbitration, Single Arbitrator, Two with umpire — Departmental or Independent as provided in the Contract, Speaking Awards.

Section – III (A): Technical Abilities

Common for all Disciplines – [ 10 Questions, 10 Marks ]

1. Physics

Units and Measurements; Kinematics; Laws of Motion; Work, Energy and Power; Motion of System of Particles and Rigid Body; Gravitation; Properties of Bulk Matter; Thermodynamics; Kinetic Theory of Gases. Electrostatics; Current Electricity; Magnetic Effect of Current & Magnetism; Electromagnetic Induction & Alternating Current; Electromagnetic Waves; Optics; Dual Nature of Matter; Atoms & Nuclei; Electronic Devices; Communication Systems.

2. Chemistry

Structure of Atom; Classification of Elements & Periodicity in Properties; Chemical Bonding and Molecular Structure; Gases and Liquids; Thermodynamics; Equilibrium; Organic Chemistry; Hydrocarbons. Solid State; Solutions; Electrochemistry; Chemical Kinetics; Surface Chemistry; Isolation of Elements; Coordination Compounds; Alcohols, Phenols and Ethers; Aldehydes, Ketones and Carboxylic Acids; Biomolecules; Polymers.

Section – III (B): Technical Abilities

Computer Engineering – [ 50 Questions, 50 Marks ]

Digital Logic
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode).
Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths.
Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.
Compiler Design
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.
Operating System
Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.
Computer Networks
Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.
C, C++, Java
Drawings & Diagrams