Lovely Professional University, Punjab

Course Code Course Title Lectures Tutorials Practicals Credits Course Planner
CSE357 COMBINATORIAL STUDIES 2 0 2 3 28208::Prince Rana
Course Weightage ATT: 5 CA: 25 MTT: 20 ETT: 50

Course Outcomes :Through this course students should be able to

CO1 :: analyze the interrelationships between fundamental computer science concepts, including data structures, algorithms, databases, operating systems, and computer
networks, to effectively prepare for and succeed in technical interviews.
CO2 :: evaluate the effectiveness of various problem-solving approaches (e.g., top-down, bottom-up, divide-and-conquer) when applied to coding challenges and
algorithmic problems commonly encountered in technical interviews.
CO3 :: analyze network scenarios and troubleshoot basic connectivity issues by applying knowledge of network protocols (e.g., TCP/IP, HTTP, SMTP).
CO4 :: design effective strategies for addressing technical interview inquiries posed by service-oriented IT companies, demonstrating proficiency in applying knowledge
and skills across diverse technical domains.
CO5 :: practice sessions, including mock interviews, whiteboard coding exercises, and simulations of behavioral interview scenarios, fostering confidence and
preparedness for different stages of technical interviews.
CO6 :: create well-structured code that effectively demonstrates a comprehensive command of Object-Oriented Programming principles, preparing students to excel in
technical interviews.

TextBooks ( T )
Sr No Title Author Publisher Name
T-1 IT INTERVIEW QUESTIONS NARASIMHA CAREERMONK PUBLICATIONS
KARUMANCHI
Reference Books ( R )
Sr No Title Author Publisher Name
R-1 CRACKING THE CODING MCDOWELL GAYLE CAREERCUP
INTERVIEW LAAKMANN

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 R-2 CRACKING THE IT INTERVIEW M MC GRAW HILL
BALASUBRAMANIAM,
K. R BAALAJI, KIRAN.
G RANGANATH,
NANDAWAT
RAVINDRA K, M
SELVAGURU, T
COMERICA SUBASH,
RAGHAVAN S
VENKAT, S
ANBAZHAGAN
VIKRAM
R-3 SQL IN 10 MINUTES, SAMS BEN FORTA SAMS PUBLISHING
TEACH YOURSELF
R-4 MCQS IN COMPUTER SCIENCE TIMOTHY WILLIAMS MC GRAW HILL

Relevant Websites ( RW )
Sr No (Web address) (only if relevant to the course) Salient Features
RW-1 https://www.tutorialspoint.com/operating_system/os_overview.htm Operating System Concepts

RW-2 https://www.javatpoint.com/dbms-tutorial DBMS Concepts

RW-3 https://www.tutorialspoint.com/data_communication_computer_network/index.htm Computer Network Concepts

RW-4 https://techdevguide.withgoogle.com/paths/foundational/ OOP Concepts

RW-5 https://www.tutorialspoint.com/data_structures_algorithms/index.htm Algorithms Concepts

RW-6 https://www.javatpoint.com/data-structure-tutorial Data Structure Concepts

Audio Visual Aids ( AV )

Sr No (AV aids) (only if relevant to the course) Salient Features
AV-1 https://www.youtube.com/watch? Operating System Introduction and Eploring all the topics
v=a2B69vCtjOU&list=PLyqSpQzTE6M9SYI5RqwFYtFYab94gJpWk&index=3
AV-2 https://www.youtube.com/watch?v=lnU-Zw3NEEQ&list=PLbRMhDVUMngf- Computer Networking Full course
peFloB7kyiA40EptH1up&index=3
AV-3 https://www.youtube.com/watch?v=sEaYXwmsLw0&list=PLyqSpQzTE6M- DBMS Concepts and understandings
xymXgqewlzcC3U4cdRoSu
AV-4 https://www.youtube.com/watch?v=zWg7U0OEAoE&list=PLBF3763AF2E1C572F Lecture Series on Data Structures and Algorithms
AV-5 ttps://www.youtube.com/watch? Programming In Modern C++
v=vmxTUhn2fBg&list=PLqu1LEUz3ju04dXn0JOgKYPHHnV2at-lG

LTP week distribution: (LTP Weeks)

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 Weeks before MTE
Weeks After MTE
Spill Over (Lecture)

Detailed Plan For Lectures

Week Lecture Broad Topic(Sub Topic) Chapters/Sections of Other Readings, Lecture Description Learning Outcomes Pedagogical Tool Live Examples
Number Number Text/reference Relevant Websites, Demonstration/
books Audio Visual Aids, Case Study /
software and Virtual Images /
Labs animation / ppt
etc. Planned
Week 1 Lecture 1 Operating Systems T-1 Foundations of Students will be able PPT
(Foundation of Operating Operating Systems, to understand the
Systems) History of Operating basics of Operating
System systems

Lecture 2 Operating Systems(Types of T-1 AV-1 Types of Operating Students will be able PPT
Operating System) R-4 Systems, Memory to understand the
Management basics of Operating
systems and types,
brief about memory
management
Operating Systems(Memory T-1 Types of Operating Students will be able PPT
Management) R-4 Systems, Memory to understand the
Management basics of Operating
systems and types,
brief about memory
management
Week 2 Lecture 3 Operating Systems T-1 RW-1 Job Scheduling and Student remembers PPT
(Processor Scheduling R-2 Process Loading, and apply the concept
Algorithms) Processor Scheduling
Algorithms, Process of OS in Problem
Synchronization and solving
Inter-process
Communication,
Operating Systems(Process T-1 Job Scheduling and Student remembers PPT
Synchronization) R-2 Process Loading, and apply the concept
Processor Scheduling
Algorithms, Process of OS in Problem
Synchronization and solving
Inter-process
Communication,

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 2 Lecture 4 Operating Systems(Inter- T-1 Resource Management, Student will be PPT/Discussion
process Communication) R-3 Inter process knowing the
communication, Resource
Disc structure and Management, Disc
Protection structure, inter
mechanisms process
communication and
Protection
mechanisms
Operating Systems(Disc T-1 Resource Management, Student will be PPT/Discussion
Structure and R-3 Inter process knowing the
Scheduling) communication, Resource
Disc structure and Management, Disc
Protection structure, inter
mechanisms process
communication and
Protection
mechanisms
Week 3 Lecture 5 Database Management T-1 Introduction to Students will PPT/Discussion
Systems(Introduction to Databases and RDBMS, understand the
Databases and RDBMS) Fundamentals of
Basics of Databases and DBMS and RDBMS
RDBMS, Data
Definitions: Tables,
Fields, Records,
Lecture 6 Database Management T-1 RW-2 SQL and Data Students will learn PPT/Discussion
Systems(Data Definitions: Manipulation, Database about SQL and Data
Tables, Fields, Records, Keys and Data Integrity, Manipulation,
SQL and Data Database Keys and
Manipulation) Data Integrity
Database Management T-1 SQL and Data Students will learn PPT/Discussion
Systems(Database Keys and Manipulation, Database about SQL and Data
Data Integrity) Keys and Data Integrity, Manipulation,
Database Keys and
Data Integrity
Week 4 Lecture 7 Database Management T-1 Fundamentals of Students will learn PPT/Discussion
Systems(Normalization in Normalization in DBMS and apply the
DBMS) Fundamentals of
Normalization in
DBMS
Lecture 8 Database Management T-1 AV-3 Fundamentals of Students will learn PPT/Discussion
Systems(Transaction Transaction and apply the
Management in DBMS) Management in DBMS Fundamentals of
Transaction
Management in
DBMS
Week 5 Lecture 9 Test - Code based

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 5 Lecture 10 Computer Networks T-1 Foundations of Student can PPT/Discussion
(Foundation of Computer R-4 Computer Networks, understand and
Networks) Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network
Topologies and and types of
Transmission Medium, Networking
Network Models and
Protocols
Computer Networks(Types T-1 AV-2 Foundations of Student can PPT/Discussion
of R-4 Computer Networks, understand and
Network) Elements and Types of Analyze the
Networks, Data and Networking Protocols
Signals, Network
Topologies and and types of
Transmission Medium, Networking
Network Models and
Protocols
Week 6 Lecture 11 Computer Networks T-1 Data and Student can PPT/Discussion
(Network Topologies and R-3 Signals, Network understand network
Transmission Mediums) Topologies and topologies and
Transmission Medium Analyze the
various transmission
mediums
Computer Networks T-1 Data and Student can PPT/Discussion
(Subnetting R-3 Signals, Network understand network
and Routing) Topologies and topologies and
Transmission Medium Analyze the
various transmission
mediums
Lecture 12 Computer Networks T-1 Understanding OSI and Students will learn PPT/Discussion
(Understanding OSI and R-4 TCP/IP Models, about Understanding
TCP/IP Reference Models) Working of TCP/IP OSI and TCP/IP
Model (Internet) Models, Working of
TCP/IP Model
(Internet)
Computer Networks T-1 RW-3 Understanding OSI and Students will learn PPT/Discussion
(Working of TCP/IP Model R-4 TCP/IP Models, about Understanding
(Internet)) Working of TCP/IP OSI and TCP/IP
Model (Internet) Models, Working of
TCP/IP Model
(Internet)

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 7 Lecture 13 Computer Networks(Key T-1 Key Protocols: HTTP, Students will PPT/Discussion
Protocols: HTTP, SMTP, R-3 SMTP, POP/IMAP, understand and gain
POP/IMAP, FTP, DNS, FTP, DNS, DHCP, knowledge about
ARP, RARP, DHCP etc.) Overview of Routing, Subnetting and
Traceroute Routing, Key
and Ping Protocols: HTTP,
SMTP, POP/IMAP,
FTP, DNS, DHCP

SPILL OVER
Week 7 Lecture 14 Spill Over

MID-TERM
Week 8 Lecture 15 Fundamentals of Object T-1 Introduction to Students will learn PPT/Discussion
Oriented Programming R-4 ObjectOriented about Introduction to
(Introduction to Object- Programming Object-Oriented
Oriented (OOP), Compiler and Programming (OOP),
Programming) Interpreter Basics,
Understanding Process Compiler and
Loading and Linking Interpreter Basics,
Understanding
Process Loading and
Linking
Fundamentals of Object T-1 Introduction to Students will learn PPT/Discussion
Oriented Programming R-4 ObjectOriented about Introduction to
(Compiler and Interpreter Programming Object-Oriented
Basics) (OOP), Compiler and Programming (OOP),
Interpreter Basics,
Understanding Process Compiler and
Loading and Linking Interpreter Basics,
Understanding
Process Loading and
Linking
Lecture 16 Fundamentals of Object AV-5 Techniques of Students will PPT/Discussion
Oriented Programming Parameter Passing and understand and apply
(Understanding Process Binding, Storage the concepts of
Loading and Linking) Organization and Techniques of
Storage Classes, Parameter Passing
and Binding, Storage
Organization and
Storage Classes,
Advanced OOP
Concepts and Data
Structures, Abstract
Data Types (ADTs)

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 8 Lecture 16 Fundamentals of Object AV-5 Techniques of Students will PPT/Discussion
Oriented Programming Parameter Passing and understand and apply
(Techniques of Parameter Binding, Storage the concepts of
Passing and Binding) Organization and Techniques of
Storage Classes, Parameter Passing
and Binding, Storage
Organization and
Storage Classes,
Advanced OOP
Concepts and Data
Structures, Abstract
Data Types (ADTs)
Week 9 Lecture 17 Fundamentals of Object T-1 Storage Classes, Students will PPT/Discussion
Oriented Programming Advanced OOP understand and apply
(Storage Organization and Concepts and Data the concepts of
Storage Classes) Structures, Abstract Storage
Data Types (ADTs) Organization and
Storage Classes,
Advanced OOP
Concepts and Data
Structures, Abstract
Data Types (ADTs)
Lecture 18 Fundamentals of Object RW-4 Dynamic Memory Student will PPT/Discussion
Oriented Programming Management and understand the
(Memory Handling in OOP Memory handling concept of dynamic
Languages) memory management
Week 10 Lecture 19 Data Structures(Introduction T-1 Data Structure Students will learn PPT/Discusion
to Data Structures) Principles and apply Data
Structure Principles
Data Structures(Types of T-1 Data Structure Students will learn PPT/Discusion
data Structures) Principles and apply Data
Structure Principles
Lecture 20 Data Structures(Arrays T-1 AV-4 Array One dimensional Students will learn PPT/Discussion
(Operations and Sorting two dimensional and and apply Data
Algorithms)) linked list Structure Principles,
Advanced
Programming
Techniques
Week 11 Lecture 21 Data Structures(Linked Lists T-1 Linked List , Single, Students will learn PPT/Discussion
(Types and Operations)) Double, Stacks ,Queue and apply Data
Structure Principles,
Advanced
Programming
Techniques

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 11 Lecture 21 Data Structures(Stacks and T-1 Linked List , Single, Students will learn PPT/Discussion
Queues (Operations and Double, Stacks ,Queue and apply Data
Applications)) Structure Principles,
Advanced
Programming
Techniques
Lecture 22 Data Structures(Trees T-1 RW-6 Trees Students will learn PPT/Discussion
(Binary Trees and Balanced and apply Data
Trees)) Structure Principles,
Advanced
Programming
Techniques
Data Structures(Hashing T-1 RW-6 Trees Students will learn PPT/Discussion
(Applications and and apply Data
Functions)) Structure Principles,
Advanced
Programming
Techniques
Data Structures(Heaps T-1 RW-6 Trees Students will learn PPT/Discussion
(Applications and and apply Data
Operations)) Structure Principles,
Advanced
Programming
Techniques
Week 12 Lecture 23 Data Structures(Graphs T-1 Graphs and its Students will learn PPT/Discussion
(Representation and R-4 operations and apply Data
Algorithms)) Structure Principles,
Advanced
Programming
Techniques
Week 13 Lecture 25 Algorithms(Understanding T-1 Understanding Students will learn PPT/Discussion
Algorithms and Analysis) Algorithms and about Understanding
Analysis, Running Time Algorithms and
Analysis, Running
Analysis and Rate of Time Analysis and
Growth, Asymptotic Rate of Growth,
Notation: Big-O Asymptotic Notation:
Notation,
Big-O Notation
Algorithms(Running Time T-1 Understanding Students will learn PPT/Discussion
Analysis Algorithms and about Understanding
and Rate of Growth) Analysis, Running Time Algorithms and
Analysis, Running
Analysis and Rate of Time Analysis and
Growth, Asymptotic Rate of Growth,
Notation: Big-O Asymptotic Notation:
Notation,
Big-O Notation

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Week 13 Lecture 26 Algorithms(Asymptotic T-1 RW-5 Data Structures and Students will PPT/Discussion
Notation: Big-O Notation) R-1 Recursive Algorithms, understand Data
Recursion and Structures and
Backtracking, Recursive
Algorithms,
Recursion and
Backtracking
Algorithms(Recursion and T-1 RW-5 Data Structures and Students will PPT/Discussion
Backtracking) R-1 Recursive Algorithms, understand Data
Recursion and Structures and
Backtracking, Recursive
Algorithms,
Recursion and
Backtracking
Week 14 Lecture 27 Algorithms(Dynamic T-1 RW-5 Sorting and Searching Students will recall PPT/Discussion
Programming Strategies) Algorithms, and understand
Classification and Sorting and
Comparison of Sorting Searching
Algorithms, Linear and Algorithms,
Non-Linear Searching Classification and
Techniques, Comparison of
Sorting Algorithms,
Linear and
NonLinear
Searching
Techniques
Algorithms(Greedy T-1 RW-5 Sorting and Searching Students will recall PPT/Discussion
Algorithms) Algorithms, and understand
Classification and Sorting and
Comparison of Sorting Searching
Algorithms, Linear and Algorithms,
Non-Linear Searching Classification and
Techniques, Comparison of
Sorting Algorithms,
Linear and
NonLinear
Searching
Techniques

SPILL OVER
Week 14 Lecture 28 Spill Over
Week 15 Lecture 29 Spill Over
Lecture 30 Spill Over

Scheme for CA:

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
 CA Category of this Course Code is:A0202 (2 out of 2)

Component Weightage (%) Mapped CO(s)

Interview 50 CO1, CO2,
CO3, CO4,
CO5, CO6
Test - Code based 50 CO1, CO2, CO6

Details of Academic Task(s)

Academic Task Objective Detail of Academic Task Nature of Academic Academic Task Marks Allottment /
Task Mode submission
(group/individuals) Week
Interview To test answering Technical Questions based on Service based companies(Proficiency Individual Offline 30 2 / 10
skills and abilities of
students in in Technical Skills,Effective use of Technical Terminologies,
interview Engagement and Confidence and Problem Solving Approach)

Test - Code based To test Based on Database Management System and programming Individual Offline 30 4/5
implementation problems(6 Questions, Each Carries
skills of the students 5 marks)
based on SQL and
problem solving.

Detailed Plan For Practicals

Practical No Broad topic Subtopic Other Readings Learning Outcomes

Practical 1 List of Practicals 1. Introduction to Linux Commands RW-1 Basic Linux Commands
AV-1

Practical 2 List of Practicals 2. Shell Programming RW-1 Shell Programming

AV-1

Practical 3 List of Practicals 3. System Calls (File / Directory/ RW-1 Students will be able to handle System Calls.
Process) AV-1

Practical 4 List of Practicals 4. Multi Thread Process using Pthread RW-1 Students will be able to do multi threading.
Library AV-1

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.
Practical 5 List of Practicals 5. SQL Commands ( DDL/DML/ RW-2 Students will be able to write SQL queries.
TCL) AV-3

Practical 6 List of Practicals 6. PL/SQL Triggers, Procedures, RW-2 Students will be able to handle database using SQL
Functions AV-3 queries.

Practical 7 List of Practicals 7. Subnetting RW-3 Students will be able to handle network.
AV-2

Practical 8 Interview
Practical 9 List of Practicals 9. Stacks and Queues RW-6 Students can write codes for stacks and queues with
AV-4 some programming language.

Practical 10 List of Practicals 8. Arrays and Linked List RW-5 Students will be able to write codes for arrays and
RW-6 trees.
AV-4

List of Practicals 10. Trees and Binary Search Trees RW-5 Students will be able to write codes for arrays and
RW-6 trees.
AV-4

SPILL OVER
Practical 11 Spill Over

An instruction plan is only a tentative plan. The teacher may make some changes in his/her teaching plan. The students are advised to use syllabus for preparation of all examinations. The students are expected to keep themselves
updated on the contemporary issues related to the course. Upto 20% of the questions in any examination/Academic tasks can be asked from such issues even if not explicitly mentioned in the instruction plan.