MINUTES OF THE MEETING FTHE BOARD 0F

CHAMBER OF THE HEAD, DEPARTMENT OF STUDIES HELD ON 18h July

2023 AT 10.30 A.M. IN THE
The Tollowing were present: COMPUTER SCIENCEAND ENGINEERING.
Dr. NCBarwar, Member
2. Dr. AnilGupta. Member
3 Sh. Jai Prakash Jayani. External Membcr
4. Prof. Arvind Kumar Verma.
Internal Member
S. Sh. N.Ram, Special Invitee
6 Dr. Shrwan Ram, Professor & Head, Chairman BoS
The following were discussed and approved:
To discuSS and approve the syllabus, lcaching and
year 2023-24. 1|| Year 2024-2.5. and |V Year examination schemes of BE Computer Science & Engincering I!
2025-26.
RESOLVED to approve the syllabus, tcaching and
year 2023-24, III Year 2024-25. and IV Year 2025-26.cxamination schemes of BE Computer Science & Engincering II
2 To discuss and approve the syllabus, teaching and exanination schemes of BE Artificial Intelligence & Data Science II
year 2023-24. III Year 2024-25. and IV Year 2025-26.

RESOLYED to approve the syllabus. teaching and examination schemes of BE Artificial Intelligence && Data Science
H year 2023-24, 1|I Ycar 2024-25, and IV Year 2025-26.

3
To discuss and approve the syllabus. teaching and examination schemes of BE Information Technology Il year 2023
24. I|| Year 2024-25, and IV Year 2025-26.

RESOLVED t0 approve the syllabus. teaching and examination scheme of BE Information Technology Il year 2023
24. I|| Year 2024-25. and |V Year 2025-26.

4. To discuss and approve the syllabus, teaching and examination schemes of BE Iyear ( I Semester and II Semester)
2023-24.

RESOLVED to approve the syllabus, teaching and examination schemes of BE Iyear (ISemester and II Semester)
2023-24 with no change in existing.

Todiscuss and approve the syllabus, teaching and examination sclhemes of MCA Iyear 2023-24, and MCA II Year
2024-25.

RESOLVED to approve the syllabus, teaching and examination schemes of MCA Iyear 2023-24, and MCAII Year
2024-25.

6 TodiscusS and approve the syllabus. tcaching and examination schemes of ME (CSE) Iyear 2023-24, and ME IIYear
2024-25.
RESOLVED t0 approve the syllabuS, leaching and examination schemes of ME (CSE) Iyear 2023-24. and ME||Year
2024-25.
The meeting ended with a vote of thanks to the Chair.

Dr. N C Barwar Dr. AnilGupta

Member Member

Sh. JAi PrakasB Jayani Prof. Arvnd Kumar Verma

External Member Internal Member

SRr Dr. Shryan Re

Special Invitee Professor & Ugd. Chairnan BoS
 DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
FACULTY OF ENGINEERING & ARCHITECTURE

SYLLABUS

BACHELOR OF ENGINEERING

COMPUTER SCIENCE & ENGINEERING

(Semester Scheme)

FOUR YEAR INTEGRATED COURSE

B.E. Second Year Examination, 2023-24

B.E. Third Year Examination, 2024-25
B.E. Final Year Examination, 2025-26

MBM UNIVERSITY
JODHPUR

1
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 NOTIFICATION
In compliance to decision of the Hon’ble High Court all students are required
to fulfil the 75% attendance in each subject and there must be 75% attendance
of the student before he/she could be permitted to appear in the examination

REGISTRAR (ACADEMIC)

GENERAL INFORMATION FOR STUDENTS

LIST OF TEACHING STAFF

TEACHING AND EXAMINATION SCHEME

B.E. SECOND YEAR : SEMESTER III
: SEMESTER IV

TEACHING AND EXAMINATION SCHEME

B.E. THIRD YEAR : SEMESTER V
: SEMESTER VI

TEACHING AND EXAMINATION SCHEME

B.E. FOURTH YEAR : SEMESTER VII
: SEMESTER VIII

2
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 LIST OF TEACHING STAFF

PROFESSOR
1. Dr. Shrwan Ram (HEAD) B.E., M.E., Ph.D.
2. Dr. N.C. Barwar B.E., M.E., Ph.D., MISTE, MIE
3. Dr. Anil Gupta B.E.(Hons), M.Tech., Ph.D.,
MCSI, MISTE,MIE

ASSISTANT PROFESSORS
1. Dr. Alok Singh Gahlot B.E., M.S., Ph.D.
2. Dr. Simran Choudhary B.Tech., M.E., Ph.D.
3. Shri Abhisek Gour B.Tech.(Hons.), M.E.

3
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 BACHELOR OF ENGINEERING (SEMESTER SCHEME)
FOUR-YEAR INTEGRATED PROGRAMME

ACADEMIC REGULATIONS

1. INTRODUCTION
MBM University hereinafter referred to as the ‘Institute’ was founded as MBM
Engineering College on 15th August 1951. This institute is one of the oldest technical
institutions in the country which became a constituent faculty (Faculty of Engineering and
Architecture) of the Jai Narain Vyas University, Jodhpur in the year 1962. Later, the
Government of Rajasthan upgraded the institute to an independent, autonomous State
University through a Legislative Act (MBM University Act 2021) in September 2021.
Located on a 98-acre academic campus and situated within the 5 km. radius of all major
landmarks of the Jodhpur City, the university is known for its vast campus and geographical
advantage.
With a vision to cater to the growing needs of society and industry, the institute has
always been a pioneer in incorporating the latest domains of engineering education and
research. Currently, the institute offers 15 undergraduate, 25 postgraduate, and 10 doctoral
research programs to aspiring students. Several factors including good infrastructure, cutting-
edge curriculum, reputed faculties, low educational costs, and nourishing environment make
MBM a first choice for students within Rajasthan as well as from other states across the
country. The Institute aims to produce quality engineer-scientist having capabilities to
address wide-ranging societal challenges and contribute towards advancement of science and
technology. The University focuses on delivering high quality education and maintains high
standards of education, prestigious legacy, and a flourishing environment that caters for the
holistic and overall development of the students.
The university is proud of its large alumni base who have always excelled in their
career and are contributing through top positions within industry, governmental bodies, and
academia. Many of them are also working as professors in IITs, IIMs, and other prestigious
technical institutions. The institute strives to maintain a culture and environment that enables
our students to become responsible, ethical, and true professionals.
2. VISION
“To be a leading educational institute that provides quality technical education and
conducts research to produce knowledge-rich professionals for meeting the dynamic needs of
the industry and society”.
3. MISSION
“To impart quality technical education to the students to make them globally competent
engineers, contributing to the development of the nation and world at large”.
4. ADMISSION
MBM University offers undergraduate academic programme for students in different
disciplines. Admission to these programmes is through REAP (Rajasthan Engineering
Admission Process), a coordination body for admission to B.E./B.Tech./B. Arch. in
4
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
Rajasthan. The Class XII pass-out students or Diploma in Engineering and Technology
(10+3) can apply for admission. The diploma pass-out candidates can directly get admission
to II year of B.E. programme in the appropriate discipline. They are required to apply through
LEEP (Lateral Entry in Engineering Program), a body for centralized admission of Diploma
pass-outs. The notification for admission is advertised in the month of June/July every year.
The eligibility conditions and procedure are as laid down by University/State Government
from time to time.
5. DURATION OF A PROGRAMME
The programme of study shall normally extend over a period of four years (eight
semesters as an integrated programme). A student shall follow the prescribed courses as
given in the teaching and examination scheme of the academic program to which he/she is
admitted. The minimum duration of each academic program will be determined in terms of
number of registered regular semester, hereafter called registered semester. At the beginning
of each semester as per his/her eligibility, a student will complete the formalities of
registration for a semester by paying the prescribed fees and by filling the continuity form.
Any semester in which a student has registered for a course will be called a registered
semester subject to the following:-
(i) Only the odd and even semesters of an academic year can be registered semester.
(ii) A semester when a student has been granted semester withdrawal/leave or a semester
when a student is suspended from the institute on disciplinary or any other grounds
will not be counted in the number of registered semesters.
(iii) A semester in which a student is allowed by the institute to undergo semester-long
internship will be counted as a registered semester.
The minimum number of registered semesters for completing all degree requirements
will be eight.
6. ATTENDANCE REQUIREMENT
The attendance requirement of the students shall be as under:-
“In compliance of the decision of the Hon’ble High Court, all students are required to
fulfill the 75% attendance rule in each subject, and there must be 75% attendance of the
student before he/she could be permitted to appear in the end term examination”.
Condonation of shortage of attendance:- The Shortage of attendance up to the limits
specified below may be condoned on valid reasons:-
(i) Up to 6% in each subject plus 5 attendances in all aggregate of subject/ courses may
be condoned by the Vice-Chancellor on the recommendation of the Dean / Director/
Principal for undergraduate students and on the recommendation of the Head of the
Department for the Postgraduate students.
(ii) The N.C.C./ N.S.S. cadets sent out to parades and camps and such students who are
deputed by the University to take part in games, athletics or cultural activities may
for purposes of attendance be treated as present for the days of their absence in
connection with the aforesaid activities and that period shall be added to their subject
5
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 wise attendance.
7. DEPARTMENT
Each program is offered by an academic unit which is called as a department. The name of
the Departments and their codes are given in Table 1.
TABLE 1: ACADEMIC DEPARTMENTS
CODE OF ACADEMIC
NAME OF ACADEMIC DEPARTMENT
DEPARTMENT/SECTION
ARCHITECTURE AND TOWN PLANNING AR
CHEMICAL ENGINEERING CH
CIVIL ENGINEERING CE
COMPUTER SCIENCE AND ENGINEERING CSE
ELECTRICAL ENGINEERING EE
ELECTRONICS AND COMMUNICATION
ECE
ENGINEERING
MECHANICAL ENGINEERING ME
MINING ENGINEERING MI
PETROLEUM ENGINEERING PE
PRODUCTION AND INDUSTRIAL ENGINEERING PI
STRUCTURAL ENGINEERING SE
PHYSICS PHY
CHEMISTRY CHY
MATHEMATICS MA
HUMANITIES AND SOCIAL SCIENCE HSC

8. UNDERGRADUATE PROGRAMS OFFERED

MBM University offers four-year undergraduate academic programmes for students in
different disciplines. Admission to these programmes is based on performance in national-
level tests/entrance examinations and is through REAP (Rajasthan Engineering Admission
Process), a coordination body for admission to B.E./B.Tech. /B. Arch. in Rajasthan.
Various programmes offered by MBM University their codes and the department name
which is running that programme are listed below:-

6
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 TABLE 2: VARIOUS ACADEMIC PROGRAMS
S. Program Name of the Department running the
Academic Program
No. Code program

ARCHITECTURE AND TOWN

1 Bachelor of Architecture AR
PLANNING
2 B.E. (Chemical Engineering) CH CHEMICAL ENGINEERING
3 B.E. (Civil Engineering) CE CIVIL ENGINEERING
B.E. (Computer Science and COMPUTER SCIENCE AND
4 CSE
Engineering) ENGINEERING
B.E. (Artificial Intelligence and COMPUTER SCIENCE AND
5 ADS
Data Science) ENGINEERING
COMPUTER SCIENCE AND
6 B.E. (Information Technology) IT
ENGINEERING
7 B.E. (Electrical Engineering) EE ELECTRICAL ENGINEERING
B.E. (Electronics and ELECTRONICS AND
8 ECE
Communication Engineering) COMMUNICATION ENGINEERING
B.E. (Electronics and Computer ELECTRONICS AND
9 ECC
Engineering) COMMUNICATION ENGINEERING
B.E. (Electronics and Electrical ELECTRONICS AND
10 EEE
Engineering) COMMUNICATION ENGINEERING
11 B.E. (Mechanical Engineering) ME MECHANICAL ENGINEERING
12 B.E. (Mining Engineering) MI MINING ENGINEERING
13 B.E. (Petroleum Engineering) PE PETROLEUM ENGINEERING
B.E. (Production and Industrial PRODUCTION AND INDUSTRIAL
14 PI
Engineering) ENGINEERING
B.E. (Building and Construction
15 BCT STRUCTURAL ENGINEERING
Technology)
16 B.E. First Year CC ––––

9. PROGRAMME STRUCTURE
Every program maintains a teaching schedule for which weekly contact hours are decided
for delivering lectures (L), engaging tutorials (T) and/or performing Practical (P)/Design
classes to make learning more effective. The information regarding number of courses
their credits and contact hours per week are given in the teaching and examination scheme
of the respective program. The associated credits of a course are based on the number of
7
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 contact hours for lectures, tutorials, and practicals. A student on successful completion of
the course with a passing grade will earn an equivalent number of credits. The courses are
categorized into distinct categories as given in Table 3.
TABLE 3: CATEGORY OF COURSES, THEIR ABBREVIATION AND CODES
S.
Category Abbreviation Code
No.
1 Humanities and Social Sciences including Management courses HSMC 1
2 Basic Science courses BSC 2
Engineering Science courses including workshop, drawing, basics
3 ESC 3
of electrical/mechanical/computer etc.
4 Professional core courses PCC 4
Professional Elective courses relevant to chosen specialization/
5 PEC 5
branch
Open Subjects – Electives from other technical and/or emerging
6 OEC 6
subjects
7 Project work, seminar, and internship in industry or PSI 7
8 Co-curricular activity & other non-credit course MNC 8
Each course is identified by a unique code consisting of elements N, P, C, Z, L, and D i.e.,
Course Code is NPCZL(D). The description of the code elements is given in the Table 4.
TABLE 4
Course
Code N P C Z L (D)
Elements
DESCRIPTION OF ELEMENTS OF CODE
ELEMENT DESCRIPTION
Semester Number in numeric single digit i.e., 3 to 8 and F for first year (I&II
N
Semester)
Program Code i.e., CH for B.E. (Chemical Engineering), CE for B.E. (Civil
P
Engineering), and so on as defined in Table 2 earlier.
C Course Category Code from Table 3 i.e., for Professional Core Course (PCC) C= 4.
Z Course Number in numeric single digit i.e., 1,2,3 etc.
L is either A or B it depends upon whether the course is Lecture Based or
L Laboratory Based. For Lecture Base L=A, Laboratory Based L=B and for non-
credit courses L=C
D Department Code from Table 1

8
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 Examples of Course Code:-
Semester Program Course Course Department Course
Course Title L-T-P
Number Code Category Number Code Code

Discrete 4ECC42A
4th ECC PCC 2 3-1-0 ECE
Structures (ECE)
6EE14A
Management 6th EE HSMC 4 3-0-0 EE
(EE)

Control 6EE41B
6th EE PCC 1 0-0-2 EE
System Lab. (EE)
The course code for B.E. first year (I & II Semester) will be as given in Table 5 below.
TABLE 5
Subject Name Subject Code Subject Name Subject Code
FCC21A Civil Engineering FCC31B
Engineering Chemistry
(CHY) Lab. (CE)
FCC31A Engineering FCC32B
Civil & Environment Engineering
(CE) Graphics (CE)
FCC22A Engg. Mechanics FCC33B
Mathematics-I
(MA) Lab. (SE)
FCC32A FCC21B
Engineering Mechanics Chemistry Lab.
(SE) (CHY)
FCC33A Basic Electrical FCC34B
Basic Electrical Engineering
(EE) Lab. (EE)
Introduction to Computer FCC34A Workshop Practice- FCC35B
Programming (CSE) I (ME)
FCC23A FCC36B
Engineering Physics Machine Drawing
(PHY) (ME)
FCC24A FCC22B
Mathematics-II Physics Lab.
(MA) (PHY)
Elements of Mechanical FCC35A FCC37B
Mechanical Lab.
Engineering (ME) (ME)
FCC36A Workshop Practice- FCC38B
Basic Electronics
(ECE) II (ME)
FCC39B
Computer Lab.
(CSE)
Basic Electronics FCC310B
Lab. (ECE)
Humanities & FCC23B
English (HSC)

9
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
10. EVALUATION
The evaluation of students in a course from third semester & onwards will be based on the
performance of the student in the internal assessment (IA) and end-term examination
(ETE). IA will be an ongoing process during the semester and will consist of various
components as detailed below. There shall be End-term examinations (Theory as well as
practical and sessional) at the end of each semester. In Lecture-based courses, the
allocation of marks will be as follows:- 30 percent for IA and 70 percent for the ETE of
the maximum marks specified for the course. For Laboratory-based courses, the marks
will be equally distributed, with 50 percent for IA and 50 percent for the ETE of the
maximum marks specified for that course. The internal assessment (IA) marks for the
lecture-based course will consist of the following components:-
(i) Maximum 10% marks of the total marks specified for the course, each for Mid-Term I
and Mid-Term II. Mid-Term examination will be held as per the schedule specified in the
academic calendar. Answer copies of the Mid-Term examination will be shown to the
students within 15 days after completion of the corresponding Mid-Term examination.
(ii) Remaining 10% marks of the total marks specified for the course to be awarded by the
course instructor based on the attendance of the student and performance of the student
in quizzes, tutorials, assignments, etc. The weightage of each of the above will be
decided by the course instructor and will be notified to the students at the beginning of
the course.
Explanation:- If the total marks specified for the course is 100 then 30 marks will be for
IA & 70 marks will be for ETE. Out of 30 marks of IA, maximum of 10 marks will be
there for each mid-term examination and the remaining 10 marks will be as per (ii)
above.
In case of unforeseen illness or any other valid reason that has prevented a student from
appearing in any of the midterm exams, the concerned instructor, after informing the Head
of the Department, may conduct a special midterm examination. The internal assessment
for Laboratory-based courses will encompass attendance, fieldwork, practical work, viva-
voce examination, and similar components. There will be only end term examination
(ETE) for B.E. first year.
The end-term examination will be held as per the schedule notified by the office of
controller of examination. These examinations will also be called as Main/University
examinations. The title of these examinations will be as follows:-

10
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
At the end of First Semester First B.E., First Semester Examination “Year”
At the end of Second Semester First B.E., Second Semester Examination “Year”
At the end of Third Semester Second B.E. (Program Code) Third Semester Examination “Year”
Second B.E. (Program Code) Fourth Semester Examination
At the end of Fourth Semester
“Year”
At the end of Fifth Semester Third B.E. (Program Code) Fifth Semester Examination “Year”
At the end of Sixth Semester Third B.E. (Program Code) Sixth Semester Examination “Year”
At the end of Seventh
Final B.E. (Program Code) Seventh Semester Examination “Year”
Semester
At the end of Eighth Semester Final B.E. (Program Code) Eighth Semester Examination “Year”
Note:- Year for the session 23-24 will be 2024 and so on.

10.1 First B.E. Examination

(a) A candidate who has attended a regular course of study at this University for the first
semester of the first B.E. shall be eligible to appear at the First B.E. first-semester
Examination. This examination shall be common to all programme.
(b) Every candidate appearing for the First B.E. first-semester Examination shall be required
to show competent knowledge of the subjects as per the examination and teaching
scheme.
(c) A candidate who has attended a regular course of study at this University for the second
semester of the first B.E. shall be eligible to appear at the First B.E. second-semester
Examination. This examination shall be common to all programme.
(d) Every candidate appearing for the First B.E. second-semester Examination shall be
required to show competent knowledge of the subjects as per the examination and
teaching scheme.
10.2 Second B.E. Examination
The course of study for the second B.E. Examination shall be separate for all programmes
of study.
(a) A candidate who has successfully completed the First B.E. I semester and First B.E. II
semester exams and has pursued regular courses in a specific Program of Engineering
during the third semester of the Second B.E. in that Program is eligible to take the
examination for the Second B.E. third semester of that Program of study.
(b) All candidates appearing for the Second B.E. third semester examination must
demonstrate sufficient knowledge of the subjects according to the examination and
teaching scheme.

11
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
(c) A candidate who has completed regular studies in a particular Program of Engineering
during the fourth semester of the Second B.E. in that Program and has also taken the
Second B.E. third semester examination for that Program is eligible to appear for the
Second B.E. fourth semester examination in that Program of study.
(d) Every candidate appearing for the Second B.E. fourth semester examination must exhibit
a proficient understanding of the subjects as per the examination and teaching scheme.
10.3 Third B.E. Examination
(a) A candidate who has successfully completed the Second B.E. III semester and Second
B.E. IV semester exams and has pursued regular courses in a specific Program of
Engineering during the fifth semester of the Third B.E. in that Program is eligible to take
the examination for the Third B.E. fifth semester of that Program of study.
(b) All candidates appearing for the Third B.E. fifth semester examination must demonstrate
sufficient knowledge of the subjects in accordance with the examination and teaching
scheme.
(c) A candidate who has completed regular studies in a particular Program of Engineering
during the fifth semester of the Third B.E. in that Program and has also taken the Third
B.E. fifth semester examination for that Program is eligible to appear for the Third B.E.
sixth semester examination in that Program of study.
(d) Every candidate appearing for the Third B.E. sixth semester examination must exhibit a
proficient understanding of the subjects as per the examination and teaching scheme.
10.4 Final B.E. Examination
(a) A candidate who has successfully completed the Third B.E. V semester and Third B.E.
VI semester exams and has pursued regular courses in a specific Program of Engineering
during the seventh semester of the Final B.E. in that Program is eligible to take the
examination for the Final B.E. seventh semester of that Program of study.
(b) All candidates appearing for the Final B.E. seventh semester examination must
demonstrate sufficient knowledge of the subjects according to the examination and
teaching scheme.
(c) A candidate who has completed regular studies in a particular Program of Engineering
during the seventh semester of the Final B.E. in that Program and has also taken the Final
B.E. seventh semester examination for that Program is eligible to appear for the Final
B.E. eighth semester examination in that Program of study.
(d) Every candidate appearing for the Final B.E. eighth semester examination must exhibit a
proficient understanding of the subjects as per the examination and teaching scheme.
11. CRITERIA TO PASS AND ALLOWED TO KEEP TERM (ATKT)
To pass in any semester, a candidate should obtain at least ‘P’ grade (awarded based on
aggregate marks of IA and ETE of that course) in each lecture-based course, and at least
‘B’ grade (awarded based on aggregate marks of IA and ETE of that course) in each
laboratory-based course of that semester. Furthermore, a candidate should obtain a SGPA

12
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 (Semester Grade Point Average) of at least 5.0 in that semester. After passing a particular
semester the candidate will be allowed to study as a regular candidate in the next higher
semester as per conditions 10.1 to 10.4. Each course (either Lecture-based or Laboratory-
based) hereinafter for this section will be referred to as a unit. Furthermore, in certain
cases even if a candidate has failed in one or more units the candidate will be allowed to
study as a regular candidate in the next higher semester. This condition of allowing a
candidate to pursue regular studies in next higher semester even if the candidate has not
passed in previous semester is termed as allowed to keep term (ATKT). The conditions to
be followed for ATKT are as follows:-
(a) To pass in any lecture-based course a candidate must obtain at least 30% of the
maximum marks allocated for internal assessment (IA) and at least 35% of the total
marks (IA & ETE) prescribed for that course. Furthermore, if a candidate fails to secure
at least 30% of the maximum marks of internal assessment (IA) in a particular course the
candidate will be treated as failed in that course even if the candidate has secured 35% or
more of the total marks (sum of IA & ETE marks) prescribed for that course.
(b) If a candidate fails in not more than 3 units in a semester examination, he/she shall be
allowed to keep term (ATKT) i.e., the candidate will be allowed to study as a regular
candidate in the next higher semester and for passing that semester he/she has to
complete all the formalities of that semester. However, additionally he/ she shall have to
reappear in the end-term examination of those units (s) that the candidate could not pass
earlier along with other regular candidates whenever the examination of that semester is
held and has to pass in the unit (s) in which he/she had failed. For the purpose of this
clause, each lecture-based course and each laboratory-based course shall be counted as a
separate unit. Furthermore, the internal assessment marks obtained by him/her shall be
carried over. If any student wants to improve his/her marks in IA in which the candidate
had failed earlier then that candidate will be required to complete all the formalities of IA
of that course such as appearing in midterm examination, submitting the assignments,
performing the laboratory experiments etc. as the case may be after paying the stipulated
fees and after registration in that course whenever next that course is available for
registration.
(c) HUMANITIES & ENGLISH shall not be counted as a unit while applying (a) above. In
other words, as a special criterion, a candidate shall be allowed to keep term even though
he/she has failed in HUMANITIES & ENGLISH in addition to up to another three units.
(d) Suppose a candidate fails in more than three units (theory & practical) of the prescribed
courses for him/her in that semester or does not secure the prescribed minimum SGPA in
that semester. In that case, he/she shall not be permitted to continue his/her studies in the
next higher semester and shall be treated as an Ex-student. He/she has to reappear in all
the courses of that semester whenever the examination of that semester is held. All the
marks obtained earlier in internal assessment shall be carried over. If any student wants
to improve his/her marks in IA in one or more courses then that candidate will be
required to complete all the formalities of IA of that course such as appearing in midterm
examination, submitting the assignments, performing the laboratory experiments, etc. as

13
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 the case may be after paying the stipulated fees and after registration in that course
whenever next that course(s) is(are) available for registration.
(e) A candidate who has passed all laboratory-based courses of a particular semester but has
failed in more than three lecture-based courses of that semester shall be required to
reappear only in the end-term examination of all lecture-based courses of that semester
examination as Ex-student whenever the examination of that semester is held. All the
marks obtained earlier by the candidate in the laboratory-based courses (i.e., internal
assessment plus the end-term marks) shall be carried over. Also, the marks obtained
earlier in the internal assessment of the lecture-based courses shall be carried over. If any
student wants to improve his/her marks in IA in one or more lecture-based courses then
that candidate will be required to complete all the formalities of IA of that course such as
appearing in midterm examination, submitting the assignments, etc., after registration in
that course whenever next that course(s) is(are) available for registration.
(f) For passing a laboratory-based course there is an additional requirement that a candidate
must obtain at least 50% marks in internal assessment of that course, failing which the
candidate shall not be permitted to appear in end-term examination (ETE) of that course
in that semester. For such cases, a candidate will be declared failed in that course. Those
candidates who have failed in a course have to join as a regular student in that course
whenever it is offered next by the department based on the availability of resources and
suitability of the candidate. The Head of the Department may organize and arrange
special classes for the particular subject to minimize the loss to the student who fails in
VIII semester. In case the course is discontinued in the department, the student can take
up another course in lieu of the course discontinued, subject to approval of the Head of
the Department.
(g) A candidate who fails in any elective subject may be permitted by the Head of the
Department to change the elective subject in a subsequent semester. He/she shall be
required to undergo a regular course of study for the new elective subject.
(h) The candidates who are permitted to appear as ex-students shall be required to pay a
prescribed fee as amended from time to time for doing each practical and sessional
during the semester.
(i) A candidate who is unable to appear at the end-term examination in some/all lecture-
based or Laboratory-based courses due to any reason whatsoever, shall be considered as
having failed in those courses.
12. MANDATORY TRAINING
S. Duration of Exam
Mode of Training After Credit
No. Training Semester
II Year
1 Six weeks In-house/Industry V 1.0
(IV Semester)

2 Six weeks In-house/Industry III Year VII 1.0

14
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 (VI Semester)

TOTAL 2.0

13. CHANGE OF BRANCH IN SECOND YEAR

A candidate, promoted to II year B.E., may be permitted to change his/her branch of study,
from GAS course to GAS Course and from SFS Course to SFS Course only, strictly on the
base of merit secured in B.E. I year examination (First and Second Semester Examination
taken together) depending upon the vacancies available in a particular branch of study
which shall be determined as follows:-
“The maximum strength of branch should not increase by more that 10 percent of the
sanctioned strength and the minimum strength of a branch should not be decreased to less
than 90 percent of the sanctioned strength.”
The sanctioned strength of a branch shall be reckoned to be the intake capacity of that
branch, approved by AICTE.
14. RESULT COMPUTATION (Award of Grade and Grade Point Average)
(a) On the basis of the percentage of obtained marks the process of result computation will
be as follows, and followings will be awarded:-
For every subject: Grade and Score Point
For every semester: Semester Grade Point Average (SGPA) up to a precision of two digits
after the decimal.
For every semester: Cumulative Grade Point Average (CGPA) up to the current semester,
up to a precision of two digits after the decimal.
Step 1:- For each subject the percentage of obtained marks will be converted into Grade as
per Table I.
TABLE I: PERCENTAGE OF OBTAINED MARKS TO GRADE CONVERSION
Percentage of Obtained Marks Percentage of Obtained Marks
Grade
in Theory Subjects in Practical Subjects
Per ≥ 90 Per ≥ 90 O
80≤per<90 80≤per<90 A+
70≤per<80 70≤per<80 A
60≤per<70 60≤per<70 B+
50≤per<60 50≤per<60 B
40≤per<50 NA C
35≤per<40 NA P

15
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 per<35 per<50 F
Absent Absent AB

Step 2:- For each subject convert the Grade to Score Point as per Table II.
Table II: Grade to Score
Performance
Grade Score/Grade Point
O 10 Outstanding
A+ 9 Excellent
A 8 Very Good
B+ 7 Good
B 6 Fair
C 5 Average
P 4 Pass
F 0 Fail
W 0 Withdrawal from Semester
X 0 Debarred
AB 0 Absent

Step 3:- Semester Grade Point Average (SGPA) of kth semester is:-
∑𝒏𝒊=𝟏 𝑷𝒊 ∗ 𝑪𝒊
𝑺𝑮𝑷𝑨 =
∑𝒏𝒊=𝟏 𝑪𝒊
Where Pi is Score Points in ith subject, Ci is Credits of ith subject, and n is total number of
subjects in current kth semester
Step 4:- Cumulative Grade Point Average (CGPA) of kth semester is
∑𝒎
𝒋=𝟏 𝑺𝒊 ∗ 𝑪𝒊
𝑪𝑮𝑷𝑨 =
∑𝒎
𝒋=𝟏 𝑪𝒊

Where Sj is SGPA of jth semester, Cj is total Credits in jth semester, and m is total
number of semesters upto current kth semester.
(b) For determining merit position of the candidates at the final year level the SGPA
obtained by them in III semester to VIII semester shall only be considered, termed as
MGPA (Merit Grade Point Average). MGPA shall be calculated as below:-

16
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 ∑𝟖𝒊=𝟑 𝑺𝒊 ∗ 𝑪𝒊
𝑴𝑮𝑷𝑨 =
∑𝟖𝒊=𝟑 𝑪𝒊
Where Si is SGPA of ith semester, Ci is total Credits in ith semester.
(c) In case a candidate passes any subject in 2nd attempt or later one, the grade awarded
shall not be higher than B+ in that subject.
(d) Awarded SGPA and CGPA shall be recalculated if a candidate passes a subject or all
subjects of any semester in 2nd or later attempt.
(e) To calculate SGPA and CGPA, obtained marks for all subjects shall be considered
irrespective of whether it is F grade (Failed or Absent) or any other grade.
15. CONVERSION OF GRADES
Whenever it is expedient to convert the SGPA/CGPA into percentage of marks the
following formulas to be used:-
Equivalent % of marks from SGPA = (SGPA – 0.5) x 10
Equivalent % of marks from CGPA = (CGPA – 0.5) x 10
A candidate will be awarded the degree with first division if he/she secures 60% or
more by converting the overall CGPA obtained at the end of VIII semester into percentage
using the above formula. Furthermore, a candidate will be awarded the degree with honors
if a candidate secures 70% or more by converting the overall CGPA obtained at the end of
VIII semester into percentage using the above formula.
16. MOOCS (SWAYAM/NPTEL) COURSES
1. The courses being offered by SWAYAM/NPTEL platform will be offered to students of
this University for credit transfer.
2. A student may complete a MOOC (SWAYAM/NPTEL) course and transfer equivalent
credits to partially complete the mandatory credit requirements of the concerned B.E.
program.
3. The HODs will finalize the list of courses which are available and can be offered as self-
paced courses through MOOCS.
4. Respective HODs shall decide upon the course/courses which a department shall allow to
be taken as Massive Open Online Course/s (MOOCS) through SWAYAM/NPTEL and
for credit transfer. While deciding the self-paced courses the HODs shall take following
into consideration:- (a) There is non-availability of suitable teaching staff for running
such a course in the Department/Faculty (b) The facilities for offering elective papers
(Courses) (already specified in the syllabus) sought for by the students are not available
in the department/faculty and this course is available in the list of course specified by the
SWAYAM. (c) The self-paced course offered through SWAYAM would supplement the
teaching-learning process in the Department.
5. While deciding the course/courses which a department shall permit to be taken as an
online course, it should be taken into consideration that any student can take only up to
20% of the total courses in a program in a semester as self-paced course/courses.
17
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
6. Based on the points 3,4,5 and 6 as mentioned above each department on direction of
HODs shall prepare a list of approved MOOC courses. Thereafter, before the
commencement of each semester, the department shall release a list of MOOC courses
approved as Departmental Elective Courses.
7. A student shall enroll only in such notified MOOC (SWAYAM/NPTEL) courses as
published by the concerned department.
8. MOOCS courses will be considered for transfer of credits only if the concerned student
has successfully completed and obtained the MOOC certificate to this effect.
9. Furthermore, each department will appoint a Coordinator to act as single point of contact
(SPOC) for any matters related with these courses. The Coordinator will ensure
enrolment of all the students on the SWAYAM platform as per deadlines. The
Coordinator will also submit a copy of the list of the enrolled students to examination
section through HOD. The Coordinator will act as a facilitator and guide the students to
appear in examination as per the details provided by the Principal Investigator/ Host
Institution.
10. After the conduct of the examination and completion of evaluation process the
Departmental Coordinator will collect the details of grades obtained by each student
along with a copy of their certificates. Based on these details each department will
prepare a consolidated list (subject-wise/course-wise) of the obtained grades by the
students along with their names. The HODs will then send the same to the office of
controller of examination of the University for mobility of the grades.
11. In case of the difficulty the Department SWAYAM coordinator can contact the
University Coordinator for SWAYAM. For this purpose, University will appoint a
University SWAYAM coordinator who shall act as a single point of contact (SPOC) at
the University level. University SWAYAM coordinator shall act as a single point of
contact and shall work as an interface between colleges, departments, and UGC.
12. A student cannot request for transfer of credits for any course not approved by the
Departmental council of the concerned Department.
13. The credit equivalence of the MOOC Course will be as follows: 12 weeks-3 credits, 8
weeks 2 credits, and 4 weeks 1 credit.
14. The grading for the MOOC Course will be as given in the table below:-
Final Score on MOOC Certificate Grade

Per ≥ 90 O
80≤per<90 A+
70≤per<80 A
60≤per<70 B+
50≤per<60 B
40≤per<50 C

18
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 35≤per<40 P
per<35 F
Absent AB
17. MEDIUM OF INSTRUCTION AND EXAMINATION
The medium of Instructions and Examination in all Engineering Examinations of
Theory/Practical and Sessional shall continue to be English as hitherto.

18. MAKE UP EXAMINATION FOR VIII SEMESTER

(a) There shall be a Make up Examination for the VIII Semester only for those candidates,
who are eligible for ATKT in VIII semester, at a suitable interval of time after
declaration of the result of the VIII Semester Examination. Candidates, who fail or are
unable to appear at this examination, shall appear in the immediate corresponding
ensuring Semester Examination.
(b) Candidates who have failed in the Final B.E. Examination but have passed in seminar,
project, practical training, and tour, and obtained SGPA 5.00 or above in corresponding
semester, shall be exempted from re-examination in project, practical training, and tour
and shall be required to pass the examination in rest of the subjects only.
(c) A candidate who passes in a limited number of Theory papers/Practical and Sessional
/Project in VIII Semester Examination shall be awarded division/CGPA with a mention
of “Pass in more than one attempt” on the marksheet with asterisks on the respective
Theory papers/ Practical and Sessional/Project.
19. ON CHANGING TEACHING AND EXAMINATION SCHEME OR CONTENTS
OF THE OFFERED SUBJECTS
(a) In case a candidate fails in any semester, and appears as ex-student, he will be given two
additional attempts to pass through OLD SCHEME. Otherwise, he will be transferred to
NEW SCHEME offered by the department currently.
(b) If a candidate joins any semester as regular student, in all cases he/she has to study as per
the currently offered scheme.
(c) In case a candidate fails in some of the subjects in a semester (ATKT), he will be given
only two chances to pass through OLD SCHEME. Otherwise, he will be transferred to
NEW SCHEME offered by the department currently.
20. RE-EVALUATION RULES
1. Re-evaluation of answer books of End Term Exam shall be permissible in not more than
50% of the lecture-based courses subject to a maximum of three lecture-based courses
where the total number of courses (lecture-based + laboratory-based) are six, and a
maximum of four lecture-based courses where the total number of courses (lecture-based
+ laboratory-based) are more than six. Where the number of courses in which a candidate
appeared at an examination happens to be an odd number, it will be increased by one for

19
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 the purpose of reckoning 50% of courses subject to the limit of courses prescribed as
above.
2. Re-evaluation will not be permitted for the following Examination:-
(a) Practical and Sessional
(b) Internal Assessment (IA)
3. A candidate who wishes to apply for reevaluation of his/her answer books should submit
an application in the prescribed form together with the requisite fee to the Controller of
Examination before the expiry of 07 days from the date of the declaration of his/her
result.
4. No application received without the requisite fee or after the last date determined as in
Clause (3) shall be entertained.
5. If the award of the re-evaluator is more/less than the award of the main examiner and is
subject to a limit of 20% of the maximum marks of the ETE prescribed for the course,
the award re-evaluator shall be taken as the marks obtained in reevaluation. However, if
the award of the re-evaluator is more/less than the award of the main examiner beyond
this limit than the computation of the revised marks shall be as under:-
Marks awarded by the main examiner ± 20% of the maximum marks of ETE of the
course paper.
21. FOR LATERAL ENTRY CANDIDATES ADMITTED TO SECOND B.E. (ALL
BRANCHES)
(a) The diploma-passed candidates admitted in the Second B.E. (all branches) shall be
required to undergo a regular course of study in Special Mathematics III and IV
semesters of II B.E. along with other theory units of the semester examinations. For a
candidate to pass in Special Mathematics examination the combined marks obtained in
III & IV Semester shall be counted. Candidate failing in special mathematics shall be
awarded one additional ATKT.
(b) The B.Sc. Passed candidates admitted to Second B.E. (all branches) will have to clear
deficiencies of engineering subjects (theory and practical of B.E. I year) as decided by
the concerned Dean.
22. CO-CURRICULAR ACTIVITIES
Co-curricular activities marks shall be awarded by the concerned Head for B.E. II Year
and onwards and concerned Dean for B.E. I Year students. Minimum passing marks in Co-
curricular activities shall be 35%. If a candidate fails to obtain at least 35% marks then he/she
shall has to complete the required activities in the next semester.

20
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 SECOND YEAR
(COMPUTER SCIENCE & ENGINEERING)
III-SEMESTER EXAMINATION SCHEME- 2023-24

S. Cate- Course Course title Credits Hrs/week Marks allotted

N. gory Code
L T P L T P Th. Pr. IA
1 ESC 3CSE31A Maths for Computing 3 1 - 3 1 - 70 - 30
(CSE)
2 PCC 3CSE42A Principles of Programming Languages 3 - - 3 - - 70 - 30
(CSE)
3 PCC 3CSE43A Object Oriented Programming 3 1 - 3 1 - 70 - 30
(CSE)
4 PCC 3CSE44A Data Structures and Algorithms 3 1 - 3 1 - 70 - 30
(CSE)
5 PCC 3CSE45A Logic Design 3 1 - 3 1 - 70 - 30
(CSE)
6 HSMC 3CSE16A Professional Practice, Cyber Law 2 1 - 2 1 - 70 - 30
(CSE) and Ethics
7 PCC 3CSE43B Object Oriented Programming - - 1 - - 2 - 50 50
(CSE) Laboratory
8 PCC 3CSE44B Data Structures and Algorithms - - 1 - - 2 - 50 50
(CSE) Laboratory
9 PCC 3CSE45B - - 1 - - 2 - 50 50
Logic Design Laboratory
(CSE)
10 MNC $$ NCC/NSS/NSO/Yoga/Scout - - - - - 2 - - -
3CSE87C
(CSE)
Total 17 5 3 17 5 8 420 150 330
Grand Total 25 30 900

$$ - NCC/NSS/NSO/YOGA/SCOUT is compulsory non-credit course and the student will be assessed

as satisfactory/ unsatisfactory at the end of IV semester.

To pass, a candidate must obtain:

(a) 35 per cent in each written paper,
(b) 50 per cent in each of the practicals and sessionals
(c) 45 per cent in aggregate

21
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 SECOND YEAR
(COMPUTER SCIENCE & ENGINEERING)
IV-SEMESTER EXAMINATION SCHEME- 2023-24

S. Cate- Course Course title Credits Hrs/week Marks allotted

N. gory Code
L T P L T P Th. Pr. IA
1 PCC 4CSE41A Design & Analysis of Algorithms 3 1 - 3 1 - 70 - 30
(CSE)
2 PCC 4CSE42A Web Technologies 3 - - 3 - - 70 - 30
(CSE)
3 PCC 4CSE43A Computer Networks 3 1 - 3 1 - 70 - 30
(CSE)
4 PCC 4CSE44A Database Management Systems 3 1 - 3 1 - 70 - 30
(CSE)
5 PCC 4CSE45A Computer Organization and 3 - - 3 - - 70 - 30
(CSE) Architecture
6 OEC $$$ Open Elective – I 3 - - 3 - - 70 - 30
4xxx6xA
7 PCC 4CSE42B - - 1 - - 2 - 50 50
(CSE) Web Technologies Laboratory

8 PCC 4CSE43B - - 1 - - 2 - 50 50
(CSE) Computer Networks Laboratory

9 PCC 4CSE44B Database Management Systems - - 1 - - 2 - 50 50

(CSE) Laboratory
10 PCC 4CSE45B Computer Organization & - - 1 - - 2 - 50 50
(CSE) Architecture Laboratory
11 MNC $$$ NCC/NSS/NSO/Yoga/Scout - - - - - 2 - - -
4xxx87C
Total 18 3 4 18 3 10 420 200 380
Grand Total 25 31 1000

$$$ - Students can choose open electives of the respective credit from other departments of the
university, NPTEL, MOOCs or similar online platforms and other institute of repute with the prior
permission of the head of the department.
Note: Students have to undergo a Practical Training - I of 45 days (in house/field) at the end of IV
Semester for which assessment will be made at the beginning of next semester.
To pass, a candidate must obtain:
(a) 35 per cent in each written paper,
(b) 50 per cent in each of the practicals and sessionals
(c) 45 per cent in aggregate

22
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 THIRD YEAR
(COMPUTER SCIENCE & ENGINEERING)
V-SEMESTER EXAMINATION SCHEME- 2024-25

S. Cate- Course Course title Credits Hrs/week Marks allotted

N. gory Code
L T P L T P Th. Pr. IA
1 PCC 5CSE41A Software Engineering 3 1 - 3 1 - 70 - 30
(CSE)
2 PCC 5CSE42A Operating Systems 3 1 - 3 1 - 70 - 30
(CSE)
3 PCC 5CSE43A Theory of Computation 3 - - 3 - - 70 - 30
(CSE)
4 PCC 5CSE44A Artificial Intelligence and 3 1 - 3 1 - 70 - 30
(CSE) Machine Learning
5 PEC 5CSE5xA Departmental 3 - - 3 - - 70 - 30
(CSE) Elective - 1
6 OEC $$$ Open-Elective – 2 3 - - 3 - - 70 - 30
5CSE6xA
7 PCC 5CSE42B Operating Systems - - 1 - - 2 - 50 50
(CSE) Laboratory
8 PCC 5CSE44B Artificial Intelligence and - - 1 - - 2 - 50 50
(CSE) Machine Learning Laboratory
9 PEC 5CSE5xB Departmental - - 1 - - 2 - 50 50
(CSE) Elective – 1 Laboratory
10 PSI 5CSE77 Training I 0 0 1 0 0 0 0 100 0
(CSE)
Total 18 3 4 18 3 6 420 250 330
Grand Total 25 27 1000

Students have to choose Departmental Elective - I course from the following list of courses offered by
the Department:
List of Departmental Elective – 1
5CSE51A Microprocessors and Assembly Programming
5CSE52A Computer Graphics
5CSE53A Java Programming
To pass, a candidate must obtain:
(a) 35 per cent in each written paper,
(b) 50 per cent in each of the practicals and sessionals
(c) 45 per cent in aggregate

23
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 THIRD YEAR
(COMPUTER SCIENCE & ENGINEERING)
VI-SEMESTER EXAMINATION SCHEME – 2024-25

S. Cate- Course Code Course title Credits Hrs/week Marks allotted

N. gory
L T P L T P Th. Pr. IA
1 PCC 6CSE41A Robotics and Embedded 3 - - 3 - - 70 - 30
(CSE) System
2 PCC 6CSE42A Principles of Compiler 3 - - 3 - - 70 - 30
(CSE) Design
3 PEC 6CSE5xA Departmental 3 1 - 3 1 - 70 - 30
(CSE) Elective – 2
4 PEC 6CSE5xA Departmental 3 1 - 3 1 - 70 - 30
(CSE) Elective – 3
5 PEC 6CSE5xA Departmental 3 1 - 3 1 - 70 - 30
(CSE) Elective – 4
6 OEC $$$ Open Elective - 3 3 - - 3 - - 70 - 30
6xxx6xA
7 PCC 6CSE41B Robotics and Embedded - - 1 - - 2 - 50 50
(CSE) System Laboratory
8 PEC 6CSE5xB Departmental - - 1 - - 2 - 50 50
(CSE) Elective – 2 Laboratory
9 PEC 6CSE5xB Departmental - - 1 - - 2 - 50 50
(CSE) Elective – 3 Laboratory
10 PEC 6CSE5xB Departmental - - 1 - - 2 - 50 50
(CSE) Elective - 4 Laboratory
Total 18 3 4 18 3 8 420 200 380
Grand Total 25 29 1000
Note: Students have to undergo a Practical Training-II of 45 days (in house/field) at the end of VI
Semester for which assessment will be made at the beginning of next semester.
Students have to choose Departmental Elective – 2, 3 & 4 courses from the following list of courses
offered by the Department respectively:
List of Departmental Electives - 2/3/4
6CSE51A Image Processing 6ADS42A Natural Language Processing
6CSE52A System Programming 6ADS52A E-Commerce & Business Intelligence
6CSE53A Advanced Machine Learning 6IT42A Wireless and Mobile Computing
6CSE54A Graphs & Social Networks 6ITE52A Modern Web Development
To pass, a candidate must obtain:
(a) 35 per cent in each written paper,
(b) 50 per cent in each of the practicals and sessionals
(c) 45 per cent in aggregate

24
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 FINAL YEAR
(COMPUTER SCIENCE & ENGINEERING)
VII-SEMESTER EXAMINATION SCHEME- 2025-26

S. Cate- Course Course title

N gory Code Credits Hrs/ week Marks allotted

L T P L T P Th. Pr. IA
1 PCC 7CSE41A Distributed Computing 3 1 - 3 1 - 70 - 30
(CSE)
2 PCC 7CSE42A Data Science and 3 1 - 3 1 - 70 - 30
(CSE) Analytics
3 PCC 7CSE43A Cryptography and 3 - - 3 - - 70 - 30
(CSE) Network Security
4 PEC 7CSE5xA Departmental 3 1 - 3 1 - 70 - 30
(CSE) Elective - 5
5 PEC 7CSE5xA Departmental 3 1 - 3 1 - 70 - 30
(CSE) Elective – 6
6 PCC 7CSE42B Data Science and - - 1 - - 2 - 50 50
(CSE) Analytics Laboratory
7 PEC 7CSE5xB Departmental - - 1 - - 2 - 50 50
(CSE) Elective – 5 Laboratory

8 PEC 7CSE5xB Departmental - - 1 - - 2 - 50 50

(CSE) Elective – 6 Laboratory
9 PSI 7CSE76 Minor Project - - 2 - - 4 - 50 50
(CSE)
7CSE77
10 PSI Training II 0 0 1 0 0 0 0 100 0
(CSE)
Total 15 4 6 15 4 10 350 300 350

Grand Total 25 29 1000

Students have to choose Departmental Elective – 5&6 courses from the following list of courses
offered by the Department respectively:

List of Departmental Electives – 5/6

7CSE51A(CSE) Blockchain 7ADS42A (CSE) Computer Vision
7CSE52A (CSE) Biometrics and Bio-Signal Processing 7IT42A (CSE) Internet of Things
7CSE53A (CSE) Parallel and GPU Computing 7IT53A (CSE) Information Retrieval and Big Data
7CSE54A (CSE) Deep Learning 7IT53A (CSE) Cyber Security

To pass, a candidate must obtain:

(a) 35 per cent in each written paper,
(b) 50 per cent in each of the practicals and sessionals
(c) 45 per cent in aggregate

25
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 FINAL YEAR
(COMPUTER SCIENCE & ENGINEERING)
VIII-SEMESTER EXAMINATION SCHEME- 2025-26

Cate- Course
Credits Hrs/week Marks allotted
S. gory Code
Course Title
N
L T P L T P Th. Pr. IA

8CSE71
1 PSI Seminar 0 0 3 - - * 0 50 50
(CSE)
8CSE72
2 PSI Project** 0 0 15 - - * 0 300 300
(CSE)

Total 0 0 18 0 0 * 0 350 350

Grand Total 18 * 700

** The project can be done by the student in house or in industry as per the norms and guidelines of
the department/college.
Note: Contact hours will be applicable for students working on project in house only as per the
norms and guidelines of the department/college.

26
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 COURSE CONTENTS
INDEX
SECOND YEAR III-SEMESTER ............................................................................ 29
[ESC] 3CSE31A (CSE) – MATHS FOR COMPUTING .................................................... 29
[PCC] 3CSE42A (CSE) – PRINCIPLES OF PROGRAMMING LANGUAGES .............. 29
[PCC] 3CSE43A (CSE) - OBJECT ORIENTED PROGRAMMING ................................. 30
[PCC] 3CSE44A (CSE) - DATA STRUCTURES AND ALGORITHMS ......................... 30
[PCC] 3CSE45A (CSE) - LOGIC DESIGN ........................................................................ 31
[HSMC] 3CSE16A (CSE) – PROFESSIONAL PRACTICE, CYBER LAW AND ETHICS .... 31
SECOND YEAR IV-SEMESTER............................................................................. 32
[PCC] 4CSE41A (CSE)– DESIGN AND ANALYSIS OF ALGORITHMS ...................... 32
[PCC] 4CSE42 A (CSE) – WEB TECHNOLOGIES .......................................................... 32
[PCC] 4CSE43A (CSE) – COMPUTER NETWORKS ...................................................... 33
[PCC] 4CSE44A (CSE) – DATABASE MANAGEMENT SYSTEMS ............................. 33
[PCC] 4CSE45A (CSE) – COMPUTER ORGANIZATION AND ARCHITECTURE ..... 34
THIRD YEAR V-SEMESTER .................................................................................. 35
[PCC] 5CSE41A (CSE) – SOFTWARE ENGINEERING .................................................. 35
[PCC] 5CSE42A (CSE) – OPERATING SYSTEMS .......................................................... 35
[PCC] 5CSE43A (CSE) – THEORY OF COMPUTATION ............................................... 36
[PEC] 5CSE44A (CSE) – ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING...... 36
LIST OF DEPARTMENTAL ELECTIVES – 1 .................................................................. 37
[PEC] 5CSE51A (CSE) – MICROPROCESSORS AND ASSEMBLY PROGRAMMING .. 37
[PEC] 5CSE52A (CSE) – COMPUTER GRAPHICS ..................................................... 37
[PEC] 5CSE53A (CSE) – JAVA PROGRAMMING ...................................................... 37
THIRD YEAR VI-SEMESTER ................................................................................ 38
[PCC] 6CSE41A (CSE) - ROBOTICS AND EMBEDDED SYSTEM............................... 38
[PCC] 6CSE42A (CSE) - PRINCIPLES OF COMPILER DESIGN ................................... 38
LIST OF DEPARTMENTAL ELECTIVES – 2/3/4............................................................ 39
[PEC] 6CSE51A (CSE) – IMAGE PROCESSING ......................................................... 39
[PEC] 6CSE52A (CSE) – SYSTEM PROGRAMMING ................................................ 39
[PEC] 6CSE53A (CSE) – ADVANCED MACHINE LEARNING ................................ 39
[PEC] 6CSE54A (CSE) – GRAPHS AND SOCIAL NETWORKS ............................... 40
[PEC] 6ADS42A (CSE) – NATURAL LANGUAGE PROCESSING ........................... 40
[PEC] 6ADS52A (CSE) – ECOMMERCE AND BUSINESS INTELLIGENCE .......... 41
[PEC] 6IT42A (CSE) – WIRELESS AND MOBILE COMPUTING ............................ 41
[PEC] 6ITE52A (CSE) - MODERN WEB DEVELOPMENT ....................................... 41

27
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
FINAL YEAR VII-SEMESTER ............................................................................... 43
[PCC] 7CSE41A (CSE) – DISTRIBUTED COMPUTING ................................................ 43
[PCC] 7CSE42A(CSE) – DATA SCIENCE & ANALYTICS ............................................ 43
[PCC] 7CSE43A (CSE) – CRYPTOGRAPHY AND NETWORK SECURITY ................ 44
LIST OF DEPARTMENTAL ELECTIVES – 5/6 ............................................................... 45
[PEC] 7CSE51A (CSE) – BLOCKCHAIN ..................................................................... 45
[PEC] 7CSE52A (CSE) - BIOMETRICS AND BIO-SIGNAL PROCESSING ............. 45
[PEC] 7CSE53A (CSE) – PARALLEL AND GPU COMPUTING ............................... 46
[PEC] 7CSE54A (CSE) – DEEP LEARNING ................................................................ 46
[PEC] 7ADS42A (CSE) - COMPUTER VISION ........................................................... 47
[PEC] 7IT42A (CSE) - INTERNET OF THINGS .......................................................... 47
[PEC] 7IT53A (CSE) - INFORMATION RETRIEVAL AND BIG DATA ................... 48
[PEC] 7IT54A (CSE) - CYBER SECURITY .................................................................. 48

28
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 SECOND YEAR III-SEMESTER

[ESC] 3CSE31A (CSE) – MATHS FOR COMPUTING

3L, 1T 3 Hours, 70 Marks
Set and Sequences: properties, types, operations and ordering. Venn Diagrams. Introduction to
propositional logic – Tautologies, connectives and normal forms. Predicate logic – Well-formed
formula and Quantifiers.
Counting theory: number systems, rules of inference, mathematical induction and formal methods of
proof. Combinatorics: Permutations and Combinations, Pigeonhole Principle, Binomial Theorem.
Relations: Properties of relations and partitions. Types of relations. Relational Algebra, Closures.
Partial orders and Lattices. Equivalence relations, Recurrence relations.
Linear algebra: Definitions and properties of vectors and matrices. Geometrical representation of
vectors. Algebra of matrices, types of matrices, inverse and rank of a matrix, solution of system of
linear equations. Orthogonality, Eigen values and Eigen vectors.
Probability theory and random variables, Random variables, Discrete probability distributions,
Continuous probability distributions, Sampling distributions and Functions of random variables.
* Students are expected to learn the concepts, theories and applications of these topics in computing.

[PCC] 3CSE42A (CSE) – PRINCIPLES OF PROGRAMMING LANGUAGES

3L 3 Hours, 70 Marks
Importance of programming languages, brief history, features of good programming language.
Translators, Syntax, semantics, virtual computers. Hierarchy of Programming Languages. Role of
Assemblers, Loaders & Linkers in program execution. Types of Linkers and Loaders. Binding and
binding time. Case study of GNU Compiler Collection (GCC) library.
Elementary and structured data types, their specifications and implementation. Type checking and
type conversion, vector arrays, records, character string, variable size data structures. Sets, input and
output files.
Evolution of the concept of data type, abstraction, encapsulation and information binding,
subprograms, type definition and abstract data types.
Implicit and explicit sequence control, sequence control within expression and between statements.
Subprogram sequence control, Recursive subprograms, Exception and exception handlers, Coroutines
and scheduled subprograms. Task and concurrency exception.
Names and referencing environments, Static, dynamic and block structure, Local data and local
referencing environments. Dynamic and static scope of shared data, Block structure, parameters and
their transmission. Tasks and shared data. Storage requirement for major run-time elements. Program
and system-controlled storage management. Static and stack-based storage management. Fixed-size
and variable-size heap storage management.

29
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PCC] 3CSE43A (CSE) - OBJECT ORIENTED PROGRAMMING
3L,1T 3 Hours, 70 Marks
Introduction to Programming Paradigms, Object-oriented programming: Need, Evolution, Advantages
and Comparison with Functional and Logical Paradigms. Introduction to object-oriented requirement
analysis and system design. Introduction to C++, History, Difference from C, Data Types, Control
Statements, Code Translation, Common uses, Console I/O operations. Concepts of OOP.
Organization and Maintenance: Encapsulation and Abstraction, Classes & objects, abstract data types,
properties and operations of objects. Protecting objects - access specifiers in C++. Optimization –
inline functions. Sharing data between objects – friend keyword. Classes vs. Data vs. Entities. Special
uses of Classes – Consumer/Producer, Observer, Helper, Controller, Abstract. Objects and Memory –
Construction, Destruction, Garbage Collection, Finalizers, Static vs Dynamic Object Creation,
Cloning. Properties of Classes – static keyword. Concept of pure Object-Oriented Languages – Case
study on Java/Javascript.
Extension and Reuse: Inheritance, Parent and Derived classes, Nested classes, Types of inheritance.
Accessing properties – this, super, protected keywords. Multiple inheritance – issues, solutions. C++
virtual vs Java interface approach. Special provisions – static, virtual, abstract classes. Polymorphism:
Dynamic binding, Overloading and overriding - Operators and Functions. Type Conversion – implicit
and explicit. Compile Time vs Runtime Polymorphism. Use cases for pure virtual functions.
Introduction to Type independence –Templates.
Sharing data and Handling errors: Memory sharing vs message passing between objects, Concept of
coupling and cohesion, Passing objects in C++ - Shallow vs Deep cloning. Serializing objects. Types
of errors, handling exceptions, defining custom exceptions – need and syntax.
Using OOP for building large systems – Namespaces, command line arguments. Overview of
Standard Template Library (C++). Input/Output – Streams. Some special features - Strings,
Reference Variables. Introduction to object-oriented analysis and design patterns.

[PCC] 3CSE44A (CSE) - DATA STRUCTURES AND ALGORITHMS

3L, 1T 3 Hours, 70 Marks
Introduction to Data Structures: Need of data structures, Primitive and Non-primitive data structures.
Linear Data Structures – Arrays, Multidimensional arrays, Storing arrays in memory, applications.
Time and space complexity of the algorithms–Big- -o & Ω, Asymptotic complexity,
Upper and Lower bound time and space tradeoffs.
Stacks - Basic Operations, Representation using Static and Dynamic arrays, Multiple stack
implementation using single array, Applications of stack: Recursion, Reversing lists, Factorial
Calculation, Infix to postfix Transformation, Evaluating Arithmetic Expressions and Towers of
Hanoi. Queues: Basic Operations, Representation using arrays, Applications - Round Robin
Algorithm. Circular Queues, DeQueue, Priority Queues.
Linked Lists - Representation of linked lists in memory, Operations on a Single linked list, Reversing,
Advantages and Disadvantages of single linked list, circular linked list, double linked list. Searching
Techniques - Sequential and binary search. Sorting Techniques - Basic concepts, Bubble Sort,
Insertion sort, Selection sort, Quick sort, Heap sort, Merge sort and Radix sort.
Trees - Definition of tree, Properties of tree, Binary Tree, Representation of Binary trees using arrays
and linked lists, Operations on a Binary Tree, Binary Tree Traversals (recursive), Binary search tree,
B-tree, AVL tree, Threaded binary tree. Representing mathematical expressions using trees. Graphs -
Basic concepts, Different representations of Graphs, Types of Graphs, Walks, paths, cycles and
circuits. Graph Traversals (BFS & DFS).
Hashing: Hash function, Address calculation techniques, Common hashing functions, Collision
resolution: Linear and Quadratic probing, Double hashing. Case study on modelling computing
problems using Graphs for e.g. path planning, hardware design etc.

30
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PCC] 3CSE45A (CSE) - LOGIC DESIGN
3L, 1T 3 Hours, 70 Marks
Introduction to number systems, concept of logic gates, Boolean algebra and signed arithmetic,
Simplification of Boolean expressions - K-maps and tabular method.
Combinational circuits, half adder, full adder, flip flops, transfer circuits, clocks, shift registers and
binary and BCD counters. Parallel full adder. BCD adder.
Multiplexer, demultiplexer, encoder, decoder. Binary multiplication, Booth’s algorithm. Binary
division.
Analysis and design of synchronous sequential systems, finite memory and flow chart method of
design, State assignment, races and hazards. Introduction to threshold logic & relay circuits,
sequential adder.
Introduction to switching devices, positive and negative logic. OR, AND, NOR, NAND, Exclusive
OR and Exclusive NOR gates. RTL, DCL, DCTL, TTL, RCTL, ECL, HTL, MOS AND CMOS logic
circuit and their realization. Fan-in and Fan-out capacity. Speed and delay in logic circuit.

[HSMC] 3CSE16A (CSE) – PROFESSIONAL PRACTICE, CYBER LAW AND ETHICS

2L, 1T 3 Hours, 70 Marks
Introduction to Professional Practice. Graduate Attributes, Expectations and Program Educational
Objectives. Introduction to Professional Bodies & Societies – IEEE, ACM, CSI, IEI, Cert-IN, MeiTy,
DST (Central & State), NASSCOM etc.
Industry Practices – Introduction to Software Documentation & Contracts. Proprietary & Open Source
Licensing Models. Basics of SDLC – Models (Waterfall, Evolutionary, Agile etc.), Requirement
Engineering – Types, Elicitation, Change Management. Modelling software systems – Structural,
Behavioural and Data Modelling, UML. ISO/IEEE standards for SDLC.
Concept of Ethics, Values and Morality. Concept of Harmony, Co-Existence and Social
Responsibility. Ethical Conflicts and Case Studies. Ethics for Students. Sustainable Development and
Environmental Ethics. ACM/IEEE Software Engineering Code of Ethics.
Professional Practice – Concept and case studies for ego management, leadership, Privacy and Digital
Divide at work. Corporate Career vs Entrepreneurship: Basics of design thinking & innovation,
business models, market research, cash flow and funding. A case study on life cycle stages, cost and
pricing factors, GTM & PMF strategy, and legal aspects – for tech products.
Cyber Laws - Cybercrimes and Cyber security, Need of Cyber laws, Introduction to Cyber Safety and
Data Protection Laws in India. Intellectual Property Rights – Patents, Trademarks, Trade Secrets,
Designs, Copyrights. Breach of IPR and remedies. Case Studies on IPR and Cybercrime lawsuits.

31
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 SECOND YEAR IV-SEMESTER

[PCC] 4CSE41A (CSE) – DESIGN AND ANALYSIS OF ALGORITHMS

3L, 1T 3 Hours, 70 Marks
Review of Algorithm and its specification, performance analysis and Randomized Algorithms.
Random access machines (RAM), computational complexity of RAM program. Time and Space
complexity, Asymptotic notations (Big- -o & Ω). Complexity estimation using
Substitution method, Recursion trees and Master Method.
Design of Efficient Algorithms: Divide and conquer: Binary Search, finding maximum and minimum,
Merge Sort, Quick Sort, Matrix Multiplication, Convex Hull. Greedy methods: Knapsack problem,
tree vertex splitting, Minimum Spanning Trees – Prim’s and Kruskal’s Algorithms, Optimal
Reliability Allocation, Knapsack, Single Source Shortest Paths – Dijkstra’s and Bellman Ford
Algorithms.
Design of Efficient Algorithms: Dynamic programming: Matrix Chain Multiplication, Longest
Common Subsequence, Multi Stage Graph and 0/1 Knapsack Problem, all Pair Shortest Paths –
Warshal’s and Floyd’s Algorithms. Backtracking, Branch and Bound: Traveling Salesman Problem
and Lower Bound Theory, Graph Coloring, n-Queens Problem.
Graph Theory Algorithms - Algorithms for problems related to Connectedness, Spanning Trees,
Coloring, Planarity, Shortest Path, Vertex cover, Network Flow. Advanced Trees - Definitions,
Operations on Weight Balanced and Huffman Trees, 2-3 and Red- Black Trees.
Polynomial Time Solvable problems, Reductions and Completeness, Definition and Interpretation of
NP-Completeness, The P vs. NP, NP-Hard problems. Comparative study of Sorting Algorithms -
Radix sort, Heap sort, Merge sort, Quick sort and Topological Sort. Order statistics and expected time
for order statistics.

[PCC] 4CSE42 A (CSE) – WEB TECHNOLOGIES

3L 3 Hours, 70 Marks
Introduction to INTERNET – history, evolution, milestones. Internet infrastructure – Basics of digital
communication, data encoding/decoding, modems and ISPs. Concept of Bandwidth and Bit rate.
Overview of Internet Protocol: Versions, IP classes. Browsers and their evolution.
Finding computers on Internet – Static vs Dynamic IPs: Introduction to DHCP. Domain Names –
DNS Protocol, Nameservers, Zone files and Records, TLDs, Lookups & Reverse Lookups. Overview
of DNS vulnerabilities. Introduction to WWW, IETF, ICANN and WHOIS. Introduction to WWW
and HTTP: Versions, Headers & Status Codes.
Overview of HTML – Tags, Attributes and Styles. Designing webpages with HTML5 – Tags &
Attributes, Forms, Multimedia (Images, Audio, Video), Iframes, Tables. Introduction to character
encoding, compression, MIME types, document standards and meta tags. Introduction to CSS –
Selector Rules, Typography, Layout, Appearance and Animations.
Introduction to Java Script: Evolution, programming basics, functions and dialog boxes. DOM and
Events – Life cycle, Mouse, Keyboard, Value, Forms, Document. Asynchronous Execution –
Promises, async/await, web workers. Web storage and Cookies. Debugging Javascript in browsers.
Introduction to Server-Side applications of Javascript.
Concept of File Transfer Protocol, Remote Login, E-mail Protocols (IMAP, SMTP, POP3).
Introduction to open source web servers – Apache, NGINX. Overview of search engines, browser
extensions and server management tools - cPanel, CWP.

32
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PCC] 4CSE43A (CSE) – COMPUTER NETWORKS
3L, 1T 3 Hours, 70 Marks
Basic Communication Model. Analog and Digital Signals. Need and Advantages of Data
Communications. Network topologies and types of networks. OSI reference model and TCP/IP
Protocol Suite. Layers in TCP/IP. Network Devices – Switch, Hub, Router, Gateway. Circuit and
Packet Switching.
Digital Communication - Transmission of Digital Signals – Encoding, Impairments, Nyquist Bit Rate,
Noise. Performance – Bandwidth, Throughput, Latency, Bandwidth-Delay, Jitter. Multiplexing and
Transmission Media. Error Detection and Correction - Cyclic codes, Checksum, Forward error
correction.
Link control: Services of data link layer, flow and error control, addressing. Media Access control:
Random Access, Controlled Access and Channelization. Wired LANs and Ethernet Protocol.
Network Layer – Packets, Connectionless and Connection-Oriented protocols. Introduction to IPv4 &
IPv6. IPV4 Addressing, Forwarding of Packets. Routing algorithms. Performance – Delay,
Throughput, Packet Loss, Congestion. Introduction to Multicasting – types, addresses, forwarding.
Overview of ICMP.
Transport Layer – Services, Flow and Congestion Control Protocols. Datagrams & UDP – Services &
Applications. TCP – Services, Features, States, Ports and Sockets. Session and Application Layer –
Introduction to FTP, TELNET, SSH and SNMP. Overview of Wireless Communication, Adhoc
Networks and Tethering.

[PCC] 4CSE44A (CSE) – DATABASE MANAGEMENT SYSTEMS

3L, 1T 3 Hours, 70 Marks
Overview and History of DBMS. File System v/s DBMS. Advantages of DBMS Describing and
Storing Data in a DBMS. Queries in DBMS. Structure of a DBMS. Types of Databases. Entity
Relationship model - Sets, Constraints & Hierarchies. Data Design with ER Model. Relational
Algebra and Tuple Calculus – Selection, Projection, Set Operations, Renaming, Joints, Division,
Relation Calculus, Expressive Power of Algebra and Calculus.
Structured Query Language: Union, Intersection, Except, Nested Queries, Set-Comparison, Aggregate
Operators, Null Values. Join Queries, Group & Order Clauses. Key Constraints in SQL, Views &
Triggers. Introduction to Connectors. Accessing Database in Python programs.
Schema & Normalization - Introduction to Schema, Functional Dependencies, Relational Normal
Forms, Need for Normalization, Decomposition into BCNF and 3-NF. Transactions: Transaction
Concept, Transaction States, Atomicity, Consistency, Isolation & Durability.
Concurrency Control - Concurrent Executions, Serializability, Lock-Based Protocols, Timestamp-
Based Protocols, Deadlock Handling. Database Failures – Introduction and Recovery Schemes.
Shadow Paging and Log-based Recovery. Recovery with Concurrent transactions.
Storage and Indexing – Concepts, Organization of Records, Data-Dictionary Storage, Column-
Oriented Storage. Ordered Indices, Hash Indices & Bitmap Indices. B-Trees and B+ Trees. Security
and Integrity – Authorization, Security Specification in SQL, Encryption and Statistics in databases.
Introduction to relational, distributed, centralized and object-oriented databases.

33
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PCC] 4CSE45A (CSE) – COMPUTER ORGANIZATION AND ARCHITECTURE
3L 3 Hours, 70 Marks
Organization of computer system, Basic building blocks of CPU. Construction of ALU - Integer
representation, Floating point number system, Arithmetic operations on floating point numbers, Data-
path and bus design, Logical operations, implementation of logical instructions.
General instruction formats, addressing modes. Concept of control unit, execution of instructions,
Hardwired and Microprogrammed control unit, Microinstructions and Microprogramming. Instruction
execution cycle and instruction set. General and Special Purpose Registers.
Memory element, RAM, Static RAM, Dynamic RAM, dimension of memory access, ROM, PROM,
EPROM, EEPROM, CCD and cache memories. Hierarchy of memories. Magnetic, Optical and Flash
Disks.
Interconnection of computer components, buses, bus formats and operations, isolated and memory-
mapped input-output, interfacing of keyboards and printers. Interrupts in IO systems, DMA. Data
transfer, DMA interrupts, polling, masking, nested interrupts.
Introduction to instruction pipelining, pipeline hazards, and performance.

34
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 THIRD YEAR V-SEMESTER

[PCC] 5CSE41A (CSE) – SOFTWARE ENGINEERING

3L, 1T 3 Hours, 70 Marks
Introduction to Software Engineering – Need, Evolution and Importance. Software Design –
Identifying Actors, Use cases and Activities. Top Down vs Bottom Up. Component Level Design.
Data Flow and Process Specification. Software Design Principles - STUPID, SOLID, KISS, GRASP.
Attributes of a Good Design. Cohesion and Coupling. Prototyping and Scrum terminology – Product
backlog, Increments, ScrumMaster, Sprint, Velocity.
Software Architecture – Importance, styles, description & views. Architectural Styles – Client-Server,
Component Based, Domain Driven, MVC, Layered, N-Tier, Object-Oriented, Service-Oriented,
RESTful and Microservices Architecture. Component and Deployment Diagrams.
Object-Oriented Analysis and Design - Classes, Hierarchies, Aggregation & Relationships. Structure,
Interaction and Behavior design. Implementation Challenges. Reuse - Design Patterns (Bridge,
Adapter, Factory, Decorator, Proxy, Observer etc.).
Software Project Management: Need, Objectives and Resources. Planning and scheduling – W5HH
Model. Software process and project metrics. Software cost estimation, Risk Management. Process
Maturity Models. Case studies of software systems.
Software Quality Assurance. Software Acceptance. Metrics for software quality. Verification and
Validation. Software defect management. Unit Testing. Black & White box testing. Functional Tests.
A/B Testing. Formal Technical Reviews, Test-Driven Development and Test Automation. Overview
of Testing AI Systems.

[PCC] 5CSE42A (CSE) – OPERATING SYSTEMS

3L, 1T 3 Hours, 70 Marks
Overview of System Architecture. Types and Goals of System Software. Operating System:
Overview, Structure and Services, System Calls. Programs, Process and Threads. Process Life Cycle.
Operations on Processes. User mode & Kernel Mode Programs.
Process Management: Process Scheduling – Objectives & Algorithms. Inter Process Communication.
Process Synchronization – Critical Section Problem, S/W & H/W Approaches. Peterson’s Solution.
Semaphores, Monitors. Deadlock: Overview, Characteristics, Prevention, Avoidance, Detection and
Recovery.
Memory Management: Address Spaces – Logical and Physical. Contiguous & Non-Contiguous
Allocation, Fragmentation. Swapping, Paging, Segmentation. Virtual Memory – Demand Paging,
Page Replacement Algorithms, Thrashing.
File Concepts & File Systems: Directory Structure, Access Methods, File Protection. Disk Scheduling
Algorithms. Input/Output: Introduction to Device Drivers.
Concurrent Execution: Creating and managing threads, Communication between threads. Introduction
to Virtualization - Taxonomy of Virtual Machines, Types of Virtualization. Hypervisors and their
types. Overview of Containerization.
*Lab must include introduction to Linux OS, System Calls, GNU, and Shell Scripting.

35
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PCC] 5CSE43A (CSE) – THEORY OF COMPUTATION
3L 3 Hours, 70 Marks
Finite Automata & Regular Expression: Basic Concepts of finite state machine. Deterministic and
Non-deterministic finite automata. Conversion of NDFA to DFA, NFAs with epsilon transitions.
Design regular expressions. Relationship between regular expression & Finite automata.
Minimization of finite automata. Finite automata with output: Mealy & Moore Machines.
Regular Set and Regular Grammar: Formal definition of Regular Language and Grammar. Regular
Sets and Regular Grammars. Equivalence of regular grammar and finite automata. Kleen’s closure
Theorem. Arden’s Theorem. Closure properties of Regular language. Pumping lemma for Regular
language. Myhill-Nerode theorem.
Context Free Grammar/ Language & Pushdown Automata: Context Free Grammars. Derivations,
Parse trees, Ambiguity. Greiback Normal form, Chomsky normal forms. Pushdown Automata:
Definitions, Instantaneous descriptions, Deterministic pushdown automata, Non-deterministic
Pushdown automata. Context Free Language. Closure properties of CFLs. Pumping lemma for CFL.
Linear bounded Automata & Context Sensitive Language: Chomsky Hierarchy of Languages and
automata, Introduction to Linear bounded Automata, Instantaneous descriptions. Properties of
context-sensitive languages. Context sensitive grammar.
Turing Machine: Definition of Turing machine, Instantaneous descriptions. Design of TM, Other
Turing Machine Models. Recursive language and Recursively enumerable languages. Computability.
Universal Turing Machines, Church-Turing Thesis, Halting Problem, Reductions and Undecidability
Proofs. Rice’s Theorem.

[PEC] 5CSE44A (CSE) – ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

3L, 1T 3 Hours, 70 Marks
Introduction to Artificial Intelligence (AI) - Historical foundations, Turing test, AI application areas.
Concepts of Prepositional calculus and Predicate calculus. Searching structures and strategies for state
space search. Heuristic searches and algorithms.
Overview of expert systems, knowledge engineering process, conceptual models. Framework of
organization and applying human knowledge. Knowledge representation and its issues. Introduction
to Soft Computing and Fuzzy rule-based systems.
Machine Learning – Definition and History. Machine Learning tasks. Inductive learning. Training &
Test datasets. Design of experiments and data collection. Bias and Variance in data. Pre-Processing
data: Normalization, Standardization and Dimensionality Reduction (PCA, LDA). Covariance and
Variance Analysis.
Feature Engineering – Extraction, Selection and Defect treatments. Finding features in text and
images. Statistical Inference: Concept of learning, Hypothesis space, Inductive Bias. Bayes theorem,
Priors, Maximum Likelihood Principle, PAC Learning. Naïve Bayes and Bayesian Networks.
Linear and Logistic Regression. Regression Fit Analysis. Introduction to Errors, Distance Metrics &
Similarity Measures. Evaluation of Learning: Overview of confidence intervals, significance level and
Hypothesis testing. Correlation & Higher Order Measures. Bias-Variance trade-off. Cross Validation.
Introduction to Scikit-Learn.

36
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 LIST OF DEPARTMENTAL ELECTIVES – 1

[PEC] 5CSE51A (CSE)– MICROPROCESSORS AND ASSEMBLY PROGRAMMING

3L 3 Hours, 70 Marks
Introduction to Microprocessors, microcontroller; 8085 Microprocessor Architecture, pin description,
Bus concept and organization; concept of multiplexing and de-multiplexing of buses; concept of static
and dynamic RAM, type of ROM, memory map.
Software architecture, registers and signals, Classification of instructions, Instruction set, addressing
modes, Instruction Format and timing.
Assembly Language Programming and Debugging, Programming Technique, Counter and time delay,
Types of Interrupt and their uses, RST instructions and their uses. Stack-implementation and
applications; Memory interfacing and instructions. Introduction to assembly interfaces in C language.
Microprocessor Interfacing: 8259 programmable interrupt controller, 8255 programmable peripheral
interface, 8254 programmable interval timer, 8279 key board/display interface. Introduction to Device
Drivers and Interfacing standards: USART 8251, RS232, RS422, USB, PCI and their variants.
Introduction to 80x86 microprocessor family, Real and Protected mode Operation, S/W model of
80x86 family, processor registers, data organization, Instruction types, addressing modes.
Comparative study of 8086, 80286, 80386, and Pentium processors.

[PEC] 5CSE52A (CSE)- COMPUTER GRAPHICS

3L 3 Hours, 70 Marks
Introduction to computer graphics. Application areas. Taxonomy of Computer Graphics – Raster &
Vector Displays, Frame Buffer, Persistence, Resolution, Refresh Rate, Aspect Ratio. Interactive vs
Passive Graphics Systems.
Visual Synthesis: Basics of Coordinate Systems – Device, Window and World Coordinates.
Generation of Points, Lines and Circles. Antialiasing techniques. Color Generation – RGB, CMYK,
HSV. Representation of polygons and color filling.
Two Dimensional Transformations: Translation, Rotation, Scaling, Shearing, Reflection, Composite
transformations, Raster transformations. Windows, multiple windowing, view-port, viewing
transformation. Clipping algorithm for point, line using Sutherland and Cohen, polygon, text clipping.
Curves and curved surface, interpolation and approximation curve, continuity of curve.
Concept of 3D Graphics, Representation of 3D Objects, 3D Transformations. Parallel, perspective,
isometric projections. Hidden lines and surfaces removal technique. Back face, Z-buffer, painter
algorithm. Overview of OpenGL and Graphics Processing.

[PEC] 5CSE53A (CSE) – JAVA PROGRAMMING

3L 3 Hours, 70 Marks
Evolution of programming languages, generation of programming languages, type of programming
languages. Basic feature of Java, flow control, classes, objects, interfaces, exception and packages.
Java classes and object, access control and inheritance, constructions, inheritance and overloading.
Extension of classes.
Introductory idea of threads and their applications. Basic I/O packages and standard utilities. Basics of
Exception Handling. Java Collections - Data Types, operations on data types.
Building GUI with JAVA: Swing Components & Layout. Events and Handlers. Input Data
Validation. Overview of JavaFX.
Connecting JAVA with SQL Databases: JDBC- ODBC Connectors, Passing SQL Statements to
databases, Displaying data using Tables. Application of Java for system programming. Introduction to
TCL/TK programming language.
37
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 THIRD YEAR VI-SEMESTER

[PCC] 6CSE41A (CSE) - ROBOTICS AND EMBEDDED SYSTEM

3L 3 Hours, 70 Marks
Introduction to Automation and Robotics, present and future applications, classification by coordinate
system. Components of the Industrial Robotics: Function line diagram representation of robot arms,
common types of arms. Components, Architecture, number of degrees of freedom, requirements and
challenges of end effectors, determination of the end effectors, comparison of Electric, Hydraulic and
Pneumatic types of locomotion devices.
Motion Analysis: Homogeneous transformations as applicable to rotation and translation, numerical
problems. Manipulator Kinematics: Specifications of matrices, D-H notation joint coordinates and
world coordinates. Forward and inverse kinematics numerical problems.
Trajectory planning and avoidance of obstacles, path planning, Robot actuators and feedback
components: position sensors – potentiometers, resolvers, encoders and velocity sensors.
Introduction to Embedded systems, Applications of Embedded Systems, Software tools,
Microcontroller Families, Introduction to AVR microcontrollers, Interfacing of: LEDs, Switches,
Relays, LCD, 7 Segment Display, ADC, Stepper Motors, DC Motors, IR
Sensors, Serial Communication, GSM module, GPS module, I2C devices, PWM Techniques, Cross
Compilers. Mini software/hardware/simulation project.

[PCC] 6CSE42A (CSE) - PRINCIPLES OF COMPILER DESIGN

3L 3 Hours, 70 Marks
Introduction to translators, compilers, interpreters, compilation process. Lexical analyzer, input
buffering, specification and recognition of tokens, regular expressions to NFA, minimization of DFA,
keywords and reserve word policies.
Syntax analyzer, context free grammars, top down parsing, Brute force parser, recursive descent
parser, LL (1) parser. Bottom up parsing, operator precedence parsing, LR parser, LALR parser.
Syntax directed translation schemes, implementation of syntax directed translators, synthesized
attributes, inherited attributes, construction of syntax trees, bottom up evaluation of S- attributed
definitions, L- attributed definitions, top down translation of L - attributed definitions.
Intermediate languages, postfix notation, syntax trees, parse trees, three address code- quadruples,
triples and indirect triples. Translation of assignment statements, boolean expressions, control
statements, array references, procedure calls, declarations, case statement, record structures. Run time
storage management, storage allocation and referencing data in block structured languages.
Errors, lexical phase errors, syntactic phase errors. Symbol tables, operation on symbol tables, symbol
table organization for non-block structured languages, symbol table organization for block-structured
languages.
Code optimization, sources of optimization. Code generation, a machine model, next use information,
register allocation and assignment, a simple code generator, code generation from DAG's, peephole
optimization.

38
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 LIST OF DEPARTMENTAL ELECTIVES – 2/3/4

[PEC] 6CSE51A (CSE) – IMAGE PROCESSING

3L, 1T 3 Hours, 70 Marks
Concepts of Imaging Systems. The Pinhole Camera and its properties. Concepts of Aperture, Focal
Length, Depth of Field. Anatomy of a Digital Camera. Storing images – raster and vector images.
Image File Formats – Bitmaps, Lossy and Lossless. Introduction to OpenCV.
Basics of Image Perception: Anatomy of Human Vision. Color Perception – Trichromatic Color
Models and Visible Light Spectrum. Alternative Color Models - HSV, CMYK. Illumination Models –
Ambient, Diffuse, Specular. Density - Halftones and Dithering.
Operations on Images - Histogram, Color and Pixel level operations. Non-Linear and Morphological
Operations – Noise Filtering, Dilation, Erosion, Majority. Geometrical Operations – Rotation,
Scaling, Translation.
Image Filters – Image as a Signal. Processing in Spatial and Frequency Domain. Image Filters -
Convolution and Linear Filters. Blur, Sharpen and Edge Operations. Thresholding and Band Pass
Filters. Gaussian, Wavelet and Gabor Filters.
Advanced Topics: Contour properties & its applications. Overview of Segmentation, Template
Matching, Stereo Imaging and Computational photography. Introduction to Convolutional neural
networks.

[PEC] 6CSE52A (CSE) – SYSTEM PROGRAMMING

3L, 1T 3 Hours, 70 Marks
Overview of System Software – Evolution and Types. Evolution of Computer Architecture, Stored
Program Concept, General register level architecture, CISC vs RISC Machines –instruction and data
formats. Accessing low-level interrupts in C programs. Case study of Pentium and ARM
architectures.
Assemblers: Basic functions, Algorithm and Data Structures. Machine dependent assembler features:
Instruction formats and addressing modes, program relocation. Machine Independent features:
Literals, symbol definitions. Designing an assembler - one pass and multi-pass assemblers, program
blocks, control sections and linking. Case study of Microsoft Macro Assembler (MASM).
Loaders and Linkers: Need, Evolution, Types, Machine dependent and independent features, data
structures and algorithms. Library Search, linkage editors, dynamic and static linking. Case study of
Windows DLL architecture. Microprocessors: Functions, algorithms and data structures, macro-
expansion. Case study of Macros in C.
Introduction to LINUX shell and commands - Overview of Bash shell, Bourne shell and C shell.
General purpose commands - man, who, cat, cd, cp, ls, mv, rm, mkdir, rmdir, echo, more, date, time,
kill, history, chmod, chown, finger, pwd, cal, logout. vi and nano editor. Process management and file
system commands. User management commands.
Introduction to Shell Scripting: Study of .bashrc, /etc/bashrc and Environment variables. Shell script
programming, sed command, grep, awk, perl scripts. Different debug option (verbose, trace, xtrace).

[PEC] 6CSE53A (CSE) – ADVANCED MACHINE LEARNING

3L, 1T 3 Hours, 70 Marks
Review of Bayesian Learning. Introduction to Decision Trees. Variants of Decision Trees for
Regression and Classification. Ensemble Methods & Random Forests – Overview of Bagging and
Boosting. Model Design, Training, Validation & Performance Evaluation in Python.
Non-linearity in data and transformations. Kernel Methods and Support Vector Machines. Neural
Networks - Perceptron Learning, Feed forward & Back Propagation Neural Networks. Activation
39
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
Functions. Error in Learning: MSE, Confusion Matrices and other measures. Precision, Recall,
Accuracy, F1 Score. ROC Curve.
Cross-Validation & Regularization, L1 and L2 regularization. Optimization methods - Gradient
descent, acceleration and subgradient method, Stochastic gradient methods, Optimization Algorithms
– Stochastic Gradient Descent, AdaGrad, RMSProp, Adam.
Unsupervised Learning and Challenges: Clustering, K-means, EM algorithms, Mixture of Gaussians.
Recommender Systems and applications.
Overview of Time Series Analysis - Linear Systems Analysis, Nonlinear Dynamics, Rule Induction,
Forecasting, Anomaly Detection. Introduction to Deep Learning.

[PEC] 6CSE54A (CSE) – GRAPHS AND SOCIAL NETWORKS

3L, 1T 3 Hours, 70 Marks
Introduction to graphs, applications, matrix and list representation of graphs. Walk, Paths and circuits.
Operations on graph, traversals. Spanning trees, Cut-sets, Connectivity and Separability.
Isomorphism. Algorithm for spanning tree, cut vertex.
Planar and Dual graphs, detection of planarity. Coloring, covering and partitioning, chromatic
number. Bipartite graph, four-color problem. Directed graphs, Euler digraph, tournaments, DAGs.
Social Networks: Definition and Types. Modelling Social Networks, Collaboration Graphs, Who-
talks-to-whom Graphs, Information Linkage Graphs, Technology Networks. World Wide Web as a
directed graph. Case studies of different social networks.
Social network analysis: Strength of weak ties, homophily and relationships. Link analysis and Web
Search. Introduction to Game theory and Nash Equilibrium.
Network Dynamics: Cascading behaviour in networks. Power Laws and Small-world Phenomenon.

[PEC] 6ADS42A (CSE) – NATURAL LANGUAGE PROCESSING

3L, 1T 3 Hours, 70 Marks
Review of Chomsky’s Hierarchy of Languages. Regular Expressions, Finite and Non-finite Automata;
Finite State Transducers. Natural Language and Linguistics: Definition and Taxonomy, Syntax and
Structure, Representation of Meaning, Lexical and Semantic Models, Text Corpora.
Natural Language Processing: Text Wrangling and Pre-processing – Tokenization, Removing
unwanted tokens, corrections, stemming, normalization. Parsing the text: Part of Speech Tagging;
Probabilistic Parsing. Shallow, Dependency and Constituency Parsing.
Text Features: Text Corpus, Bag of Words model, Bag of N-Grams Model, TF-IDF Model,
Word2Vec Model, GloVe Model and FastText Model. Building a Text Classifier. Text Similarity and
Document Similarity measures.
Semantic Analysis: Word Sense Disambiguation; Named Entity Recognition, Topic Modelling,
Latent Semantic Indexing. Introduction to Lexicons and Sentiment Analysis. Overview of Word
Embeddings.
Overview of NLP Problems: Speech Recognition, Machine Translation, Q&A, Summarization,
Categorization, Context Identification and Dialog. Introduction to famous Deep Learning based NLP
Models for e.g. Google BERT, GPT-4 etc. Indian Language case studies.

40
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PEC] 6ADS52A (CSE) – ECOMMERCE AND BUSINESS INTELLIGENCE
3L, 1T 3 Hours, 70 Marks
Introduction to Electronic Commerce: Need, History and Evolution. Economic consideration.
Infrastructure for E-Commerce, Intranets and Extranets and various Internet protocols.
E-Commerce Software Requirements- Catalogue display, Shopping cart, Transaction processing, and
Catalogue customization. Electronic payment systems: Introduction to Electronic cash, Electronic
Wallets, Smart cards, Credit and Charge Cards. Business strategies for web: Creating effective web
presence, Identifying and reaching customers, creating and maintaining brands on web. Business
models for selling on web.
Introduction to purchasing, logistics and support activities on web. Introduction to Electronic data
Interchange and web auction. Supply Chain Management. Planning and management of e-commerce
projects. Legal, language, ethical and taxation issues of e-commerce. Mobile-first paradigm.
Overview of installable Web apps, Native apps and Cross-platform apps.
Web Applications - Mailing lists, Discussion forums, Integrating emails to web application, Open
Authentication services. Security Threats to E-Commerce: Intellectual Property threat, client threat,
communication channel threat and server threat. Policy for Protecting E-Commerce Assets. Ensuring
transaction Integrity and security.
Usage Analytics and Concepts of Reach, Engagement, Conversion, Lifetime Value and Segmentation.
Cost Factors – Data, Compute, Bandwidth, and Availability cost. Compliance and Governance.
Introduction to CRM, Cross-selling and Up-selling. Planning large scale campaigns. Case studies of
ecommerce startups.

[PEC] 6IT42A (CSE) – WIRELESS AND MOBILE COMPUTING

3L, 1T 3 Hours, 70 Marks
Basics of Radio Transmission – Signals, Antennas, Signal Propagation. Cellular concept and its
implementation, Analog and Digital cellular mobile system. Channel allocation, Multiple access,
Location management, Handoffs.
Wireless Networks: Signal propagation, multiplexing, modulations, spread spectrum, MAC, SDMA,
FDMA, TDMA, CDMA, WCDMA cellular wireless networks. Telecommunication systems –
Introduction to GSM, GPRS, EDGE, UMTS, 4G and 5G Communication systems.
Wireless LAN: Infrared vs Radio transmission, Infrastructure and Adhoc networks, IEEE 802.11
a/b/g/n – architecture and services. HyperLAN, Bluetooth, BLE, Wi-Max.
Transport and network layer protocols for wireless networks: MAC protocols, Routing, Transport,
Ad-hoc networking. Routing protocols in adhoc networks. Mobile IP, DHCP. WAP, WAP 2.0.
Applications: Mobility adaptations, Disconnected operations, Data broadcasting, Mobile agents.
Security, Energy efficient computing, Impact of mobility on algorithms.

[PEC] 6ITE52A (CSE) - MODERN WEB DEVELOPMENT

3L, 1T 3 Hours, 70 Marks
Components of Web Applications – Business Logic, Application Layer and Presentation Layer.
Modern Web Apps – Fast, Reliable, Integrated, Engaging. Concept of Progressive Web Apps and
Single Page Applications. Advanced concepts in Javascript – Async Execution, Execution Stack,
Callback Queues, Event Loop, Job Queues. Error Handling and Profiling. Object Oriented concepts in
JavaScript. Introduction to ES6 and new features in JS.
Modern Browser APIs: WebStorage -Local and Session Storage, App Cache, Web Workers, Server-
Sent Events, Geolocation, Web Sockets, WebSQL Databases. API First Development – Concepts,
Pros & Cons. RESTful APIs and JSON. Progressive Web Apps – Architecture, Service Workers and
Workbox, Manifest and Installation, Push Notifications, Offline data and updates.

41
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
Web Page Optimization: Page Speed Metrics, HTTP Caching – Cache-Control and ETags, Server-
side Compression – Apache mod_deflate. Other strategies - Minification, CSS Sprites, Redirects, JS
Optimizations, Content Delivery Networks.
Search Engine Optimization – How Search Engines work, Keyword planning, placement and
mapping. Meta and Open Graph Tags, Optimizing App Experience for SEO – Overview of Google
Lighthouse. Key Performance Indicators. User Interaction and SEO. Web Analytics – Reach,
Impressions, Engagement, Conversion, Lifetime Value. User segmentation.
User Experience Design: Globalization – Character Sets, Timezones, Currencies, Translations.
Responsive Page Design – CSS Media Queries, Flexbox API. Designing for User preferences –
Motion, Contrast, Color Scheme, Form Factor, Location. Designing for Accessibility.

42
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 FINAL YEAR VII-SEMESTER

[PCC] 7CSE41A (CSE)– DISTRIBUTED COMPUTING

3L, 1T 3 Hours, 70 Marks
Distributed Computing – History Evolution, architectures. Design issues, advantages and limitations
of distributed systems. Logical clocks, mutual exclusion, casual and total ordering. Distributed
deadlocks.
Distributed scheduling, load distribution, stability, load sharing, task migration. Distributed file
system architecture, design issues, name resolution, cache consistency. Distributed shared memory
architecture, design issues, memory coherence, granularity, page replacement.
Distributed vs. Cloud Computing, Service Models and Types of Clouds, Deployment Models. Cloud
Computing Architecture: Cloud stack, Services provided at various levels, Migration to cloud. Cloud
service providers, properties, characteristics & disadvantages, pros and cons of Cloud Computing.
Introduction to GCP, AWS and Azure.
Introduction to Infrastructure as a Service (IaaS): Architecture of Compute and Storage Clouds,
Virtualization: Hypervisors, Machine Image, Virtual Machine (VM) and Resource Virtualization.
Provisioning Servers, Storage, Network and Virtual Machines, Data storage in cloud, Storage as a
service. Case study of cloud compute and storage providers.
Introduction to Platform as a Service (PaaS): Introduction to PaaS, Service Oriented Architecture
(SOA), Cloud Platform and Management, Pricing Models and Examples. Overview of Google App
Engine, PythonAnywhere and DigitalOcean services. Introduction to Software as a Service (PaaS),
Web services on cloud.

[PCC] 7CSE42A(CSE) – DATA SCIENCE & ANALYTICS

3L, 1T 3 Hours, 70 Marks
Representation of Data: Integers and Floating Point Representation, Character Encoding & Character
Sets (ASCII & UTF variants). Introduction to Data Storage – Types (Binary/Text), Hardware -
Magnetic, Optical and Flash Disks, File Formats. Data Encoding & Aggregation.
History & Evolution of Data Science, Taxonomy. Objectives & Applications of Data Analytics. Data
Driven Business Models and Challenges. Analysis vs Reporting. Data sources, data collection and
feature extraction. Types of Variables, Design of experiments.
Data Operations – Merge, Reshape, Pivot, Aggregation, Mapping, Augmentation, Binning. Dealing
with Anomalies - Dimensionality, Variance, Outliers, Missing Values, Scaling and Translation. Case
studies on datasets from Open Govt. Data (OGD) and Kaggle platforms. Introduction to Python
libraries – numpy, pandas, matplotlib.
Data Analytics & Visualization – Single and Multi-variate methods. Data Visualization: Bar &
Column charts, Histograms & Pareto charts, Line charts & trend lines, Area charts, Pies & Donuts,
Scatter plots & Bubble charts, Box & Whisker charts, Tree Maps & Sunbursts, Waterfall & Funnel
charts, Radar & Stock charts. Introduction to PowerBI and Tableau.
Overview of Data Engineering - Architecture. Establishing Data pipelines – Extract-transform-load
pipelines. Data streams. Tracking change. Introduction to Apache Nifi, Kafka, Spark and AirFlow.

43
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PCC] 7CSE43A (CSE) – CRYPTOGRAPHY AND NETWORK SECURITY
3L 3 Hours, 70 Marks
Introduction to cryptography, Classical Cryptosystem, Block Cipher. Data Encryption Standard
(DES), Triple DES, Modes of Operation, Stream Cipher. LFSR based Stream Cipher, Mathematical
background, Abstract algebra, Number Theory. Modular Inverse, Extended Euclid Algorithm,
Fermat's Little Theorem, Euler Phi-Function, Euler's theorem.
Advanced Encryption Standard (AES), Introduction to Public Key Cryptosystem, Diffie-Hellman Key
Exchange, Knapsack Cryptosystem, RSA Cryptosystem. Primarily Testing, ElGamal Cryptosystem,
Elliptic Curve over the Reals, Elliptic curve Modulo a Prime. Generalized ElGamal Public Key
Cryptosystem, Rabin Cryptosystem.
Message Authentication, Digital Signature, Key Management, Key Exchange, Hash Function.
Cryptographic Hash Function, Secure Hash Algorithm, Digital Signature Standard.
Security Attacks on Internet: HTTP Attacks, DNS Attacks, CSRF Attacks, Sniffers, ARP poisoning
and MAC Flooding, Denial of Service, Session Hijacking, Social Engineering. SQL Injection,
Phishing, Spoofing. Side-channel attacks.
Introduction to Application Security and Penetration Testing. Authorization Mechanisms: Single
Sign-On, Biometrics, OTP, Open Authentication Standards. Overview of Secure Sockets Layer (SSL)
and Pretty Good Privacy (PGP).

44
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 LIST OF DEPARTMENTAL ELECTIVES – 5/6

[PEC] 7CSE51A (CSE) – BLOCKCHAIN

3L, 1T 3 Hours, 70 Marks
Introduction, The consensus problem, Asynchronous Byzantine Agreement, AAP protocol and its
analysis, Nakamoto Consensus on permission-less, nameless, peer-to-peer network, Abstract Models
for Blockchain, GARAY model, RLA Model, Proof of Work (PoW) as random oracle, formal
treatment of consistency, liveness and fairness, Proof of Stake (PoS) based Chains, Hybrid models
(PoW + PoS).
Cryptographic basics for cryptocurrency, a short overview of Hashing, Signature schemes, encryption
schemes, public key crypto, verifiable random functions, Zero-knowledge systems.
Bitcoin, Wallet, Blocks, Bitcoin Data Structures, Merkley Tree, LPV nodes, hardness of mining,
transaction verifiability, anonymity, forks, double spending, Mathematical analysis of properties of
Bitcoin.
Ethereum, Ethereum Virtual Machine (EVM), EVEM Data Structures, Alternative Data Structures,
Wallets for Ethereum, Solidity, Solidity pitfalls and disasters, Smart Contracts, Some attacks on smart
contracts, ICO token, Cryptokitties.
Trends and Topics - Permissioned Blockchains, Hyperledger Fabric, Concurrent Contract Execution,
Zero Knowledge proofs and protocols in Blockchain, Zcash, Succinct non-interactive argument for
Knowledge (SNARK), pairing on Elliptic curves.

[PEC] 7CSE52A (CSE) - BIOMETRICS AND BIO-SIGNAL PROCESSING

3L, 1T 3 Hours, 70 Marks
Biometrics: Definition, History and Evolution. Biometric traits of humans. Different biometric types –
Face, Fingerprint, Voice, Iris, Palm, Gait and Handwriting. Design issues for Biometric Systems –
Data storage, Privacy, Precision vs. recall, Uncontrollable factors, Occlusion and Noise, Aging etc.
Devices and sensing: Capturing and storing Biometric data, File formats for different biometric
information. Architecture and functioning of RGB and IR cameras, fingerprint readers, microphones,
IRIS readers, and motion capture sensors.
Basics of Signal Processing and Pattern Recognition – Data Collection and Pre-processing, Feature
Extraction, Model Design and Training, Validation and Evaluation. Architecture of Biometric
authentication and authorization systems.
Biological signals: Recording and storing biological signals. Introduction to common biological
signals incl. ECG, EGG, EMG, SpO2, Pulse Rate etc. Methods for capturing bio-signals. Storage
formats. Visualizing and interpreting bio-signals. Signal Taxonomy: Frequency, Sample Rate, ADC
method, Artefacts, Noise, Amplification.
Applications of Convolutional Neural Networks, Autoencoders, LSTMs and Siamese Neural Network
architectures in Biometrics and Bio-signal processing. Preparing datasets, cleaning and adding pre-
processing in modern neural networks. Case study of recent works.

45
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PEC] 7CSE53A (CSE) – PARALLEL AND GPU COMPUTING
3L, 1T 3 Hours, 70 Marks
Introduction to parallel processing and trends, Flynn’s classification for parallel computing, Parallel
Programming Paradigms, PRAM Model. Case studies of parallel computers. Principles of pipelining:
parallelism versus pipelining, pipelining principles and classifications, instruction pre-fetch and
branch handling, hazard detection and resolution.
Structure for array processors: SIMD computer organization, masking and data routing mechanism
Inter PE communication, introduction to associative array processing. GPU architectures vs Array
Processors. GPUs in Machine Learning: need, current trends, benchmarks.
Need for GPU Computing, Introduction to NVIDIA GPU architectures. Multiprocessor systems vs
GPUs. Concept of threads, blocks and grids. Memory Management in GPUs. Software Layers,
compatibility, drivers. Choosing a GPU for Data Science/ML. GPU on cloud.
Programming parallel applications: Introduction to Open MP: Programming Model, Memory Model,
Execution Model, Error Handling. Introduction to CUDA: Programming Model, API, Execution
Model, Memory Model, Error Handling. CUDA with Python.
Parallel programming in MATLAB: MATLAB Programming basics, data types, reading/writing data,
Introduction to Parallel Computing toolbox. Parallel computing constructs – parfor, parfeval,
gpuArray, batch. Overview of MATALB workers and cluster computing.

[PEC] 7CSE54A (CSE)– DEEP LEARNING

3L, 1T 3 Hours, 70 Marks
Neural Networks: Basic concepts of artificial neurons, single and multi-layer networks. Perceptron
learning algorithm, its convergence proof, different activation functions, softmax, cross entropy, loss
functions.
Convolutional Neural Networks: Network architecture. Selection of Input size, filter size, number of
filters, read size and mini-batch size. Augment and Preprocess Data, Creating Simple and complex
Deep learning Networks for different problems. Hyperparameter tuning, model optimization,
evaluation. Regularization, Batch normalization and dropouts.
Recurrent Neural Networks: Modelling sequences using RNNs, Network Architecture, Model
Parameters, Training strategies. Introduction to LSTMs. Preparing data for LSTMs. Applications of
RNNs in Natural Language Processing and Video Processing.
AutoEncoders – Learning Representation, architectures, stacking & applications. Generative
Adversarial Networks, AutoEncoders vs GANs, Conditional GANs. Applications of Autoencoders
and GANs. Overview of other deep learning architectures for e.g. Transformers, Siamese networks,
GRUs etc.
Transfer learning approaches: Applying the pretrained networks directly to classification problems,
Using pretrained network as a feature extractor, Case study on state-of-art pretrained architectures.

46
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PEC] 7ADS42A (CSE) - COMPUTER VISION
3L, 1T 3 Hours, 70 Marks
Concepts of Imaging Systems. The Pinhole Camera and its properties. Concepts of Aperture, Focal
Length, Depth of Field. Anatomy of Human Vision – Color Models (RGB HSV, CMYK),
Illumination Models (Ambient, Diffuse, Specular), Density (Halftones and Dithering).
Working with images in MATLAB: Data types, control flow, functions, extensions in MATLAB.
Reading and writing image file formats and displaying images. Operations on Images - Histogram,
Color, Spatial, Morphological and Geometrical Operations. Introduction to Image Filters, Spatial and
Frequency Domain Filters. Comparison with OpenCV.
Computer Vision Concepts. Computer Vision vs Image Processing. Understanding the computer
vision problems - Categorization, Classification, Segmentation, Feature Detection, Object
Recognition & Tracking, Labelling and Annotation, Image Registration, Restoration, Template
Matching and Content Based Retrieval.
Image Features – Local vs Holistic. Finding contours, edges and texture. Feature Extraction –
Template Based, HoG, Haar, Horris, LoG DoG, SIFT, Bag of Words. Dimensionality Reduction in
images. Architecture and Challenges of Image Classification.
Learning features using Convolutional Neural Networks. Using CNNs for Classification, Object
Detection and Segmentation. Applications of other Neural Network Architectures in Computer
Vision. Overview of famous deep computer vision models – AlexNet, ResNet, GoogleNet, Inception,
RCNN, YOLO. Introduction to Transfer Learning.

[PEC] 7IT42A (CSE)- INTERNET OF THINGS

3L, 1T 3 Hours, 70 Marks
Introduction to IoT, Architectural Overview, Design principles and needed capabilities, IoT
Applications. Sensing and Actuation. IoT vs. Wireless Sensor Networks.
IoT sensors – motion (location, acceleration, direction and orientation), environmental (temperature,
humidity, pressure), chemical (water quality and gas), physical (proximity, smoke, water level, reed
switch) and perception (optical, infrared, auditory) sensors. IoT Actuators – Motors (Servo, Stepper,
DC, Linear), Relays, Solenoids.
Basics of Networking. Devices and Gateways. Communication Protocols – BLE, WiFi, ZigBee,
LoRa, NFC. Data Protocols – MQTT, AMQP, CoAP & XMPP. Machine-to-Machine
Communications (M2M). Interoperability in IoT.
Introduction to Arduino Programming, Integration of Sensors and Actuators with Arduino.
Introduction to Raspberry Pi. Implementation of IoT systems using Raspberry Pi. Connecting RPi to
internet. Running Python programs on RPi. Connecting with Server Components – Client-Server and
RESTful architectures.
Introduction to SDN, Cloud Architectures for IoT. Concepts of Energy Efficiency, QoS, QoE and
Everything as a Service (XaaS). Unstructured vs Structured Data Storage. Searching and Data
Analytics in IoT. Introduction to Industry 4.0 and Industrial IoT. Application in the areas of Factories
and Assembly Line, Food Industry, Healthcare, Power Plants, Inventory Management & Quality
Control, Plant Safety and Security etc.

47
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx
 [PEC] 7IT53A (CSE) - INFORMATION RETRIEVAL AND BIG DATA
3L, 1T 3 Hours, 70 Marks
Introduction, Information retrieval V/S Data Retrieval, logical view of documents, retrieval process.
Basic models for IR and their formal characterization. User interfaces and visualizations, Information
access process.
Introduction to Big Data – Traits of Big Data. Need and importance of Big Data. Challenges of
Conventional Systems. Drivers of Big Data. Introduction to Data Pipelines.
Big Data Storage – Introduction to Apache Hadoop, History of Hadoop. Hadoop Distributed File
System (HDFS), Architecture and Goals. Namenodes and Datanodes. Federation. Storing and
Retrieving Data. Hadoop Data flow, Data Ingest with Flume and Sqoop. Hadoop Archives.
Hadoop Ecosystem: MapReduce – Architecture, Goals & Features. MapReduce Jobs & Design
Patterns. Job Scheduling and Failures, Task Execution, Types and Formats. Introduction to YARN –
ResourceManager, NodeManager, ApplicationMaster, Containers. Overview of Hive, Pig, HBase,
ZooKeeper and Cassandra.
Big Data Processing – Stream Data Model and Architecture, Stream Computing, Filtering Streams.
Introduction to Apache Spark: Architecture & Applications. Introduction to Apache Kafka, Spark vs
Kafka, Architecture & Applications. Overview of SparkML.

[PEC] 7IT54A (CSE) - CYBER SECURITY

3L, 1T 3 Hours, 70 Marks
Basics of Cyber Security: Authorization and Authentication - types, policies and techniques. Security
certification and Auditing, Security Requirements Specifications. Firewalls, IDS, Log Files, Honey
Pots. Human factors – Security awareness, training, Email and Internet use policies.
Application security - Key Problems - Buffer Overrun, Format String Problems, Integer Overflow,
and Software Security Fundamentals. Handling user access, Validating user input. Web Application
Security - HTTP Attacks. Attacks on Session Token Generation, Token Handling, Session
Management. Attacking Access Control - Vulnerabilities, Attacks and Countermeasures. Attacking
Application Logic - Fooling a Password Change Function, Abusing a Search Function.
Hacking Fundamentals – Ethics, Reconnaissance, Scanning and Enumeration. Sniffers, ARP
poisoning and MAC Flooding, Denial of Service, Session Hijacking, Social Engineering Web server-
working, vulnerability and attacks.
Security Technologies - PC & Mobile security, Internet Security Systems, Intrusion Detection
Systems, Firewall Security Systems, Storage Area Network Security Systems, Network Disaster
Recovery Systems, Public Key Infrastructure Systems, Wireless Network Security Systems.
Cloud Security - Cloud architecture model – SPI framework, XaaS Services, Deployment models.
Cloud security design principles, Virtualization security Management- Virtual threats, VM security
recommendations, VM security techniques – hardening, securing VM remote access. Strong
Authentication with Single Sign-On (SSO), General Spoofing Techniques.

48
C:\Users\Dell\Desktop\Syllabus New 2023\BE(CSE) 2023-25 Exam 2024-26_New Codes.Docx