Scribd
Upload
34 views2 pages

Cse357 Combinatorial Studies

CSE357: Combinatorial Studies is a 3-credit course designed to prepare students for technical interviews by covering fundamental concepts in computer science, including operating systems, databases, computer networks, object-oriented programming, data structures, and algorithms. The course outcomes focus on analyzing interrelationships among these concepts, evaluating problem-solving approaches, and practicing interview scenarios. Practical sessions include hands-on experience with Linux commands, SQL, and data structures to enhance students' coding skills and interview readiness.

Uploaded by

Ashutosh Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views2 pages

Cse357 Combinatorial Studies

CSE357: Combinatorial Studies is a 3-credit course designed to prepare students for technical interviews by covering fundamental concepts in computer science, including operating systems, databases, computer networks, object-oriented programming, data structures, and algorithms. The course outcomes focus on analyzing interrelationships among these concepts, evaluating problem-solving approaches, and practicing interview scenarios. Practical sessions include hands-on experience with Linux commands, SQL, and data structures to enhance students' coding skills and interview readiness.

Uploaded by

Ashutosh Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

CSE357:COMBINATORIAL STUDIES

L:2 T:0 P:2 Credits:3

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.

Unit I
Operating Systems : Foundation of Operating Systems, Types of Operating System, Memory
Management, Processor Scheduling Algorithms, Process Synchronization, Inter-process
Communication, Disc Structure and Scheduling
Unit II
Database Management Systems : Introduction to Databases and RDBMS, Data Definitions: Tables,
Fields, Records, SQL and Data Manipulation, Database Keys and Data Integrity, Normalization in
DBMS, Transaction Management in DBMS
Unit III
Computer Networks : Foundation of Computer Networks, Types of Network, Network Topologies
and Transmission Mediums, Understanding OSI and TCP/IP Reference Models, Subnetting and
Routing, Key Protocols: HTTP, SMTP, POP/IMAP, FTP, DNS, ARP, RARP, DHCP etc., Working of TCP/IP
Model (Internet)
Unit IV
Fundamentals of Object Oriented Programming : Introduction to Object-Oriented Programming,
Compiler and Interpreter Basics, Understanding Process Loading and Linking, Techniques of
Parameter Passing and Binding, Storage Organization and Storage Classes, Memory Handling in OOP
Languages
Unit V
Data Structures : Introduction to Data Structures, Types of data Structures, Arrays (Operations and
Sorting Algorithms), Linked Lists (Types and Operations), Stacks and Queues (Operations and
Applications), Trees(Binary Trees and Balanced Trees), Graphs (Representation and Algorithms),
Hashing (Applications and Functions), Heaps(Applications and Operations)
Unit VI
Algorithms : Understanding Algorithms and Analysis, Running Time Analysis and Rate of Growth,
Asymptotic Notation: Big-O Notation, Recursion and Backtracking, Dynamic Programming Strategies,
Greedy Algorithms

List of Practicals / Experiments:

List of Practicals
• 1. Introduction to Linux Commands

• 2. Shell Programming

• 3. System Calls (File / Directory/ Process)

• 4. Multi Thread Process using Pthread Library

Session 2024-25 Page:1/2


• 5. SQL Commands ( DDL/DML/ TCL)

• 6. PL/SQL Triggers, Procedures, Functions

• 7. Subnetting

• 8. Arrays and Linked List

• 9. Stacks and Queues

• 10. Trees and Binary Search Trees

Text Books:
1. IT INTERVIEW QUESTIONS by NARASIMHA KARUMANCHI, CAREERMONK PUBLICATIONS

References:
1. SQL IN 10 MINUTES, SAMS TEACH YOURSELF by BEN FORTA, SAMS PUBLISHING

2. CRACKING THE CODING INTERVIEW by MCDOWELL GAYLE LAAKMANN, CAREERCUP

3. CRACKING THE IT INTERVIEW by M BALASUBRAMANIAM, K. R BAALAJI, KIRAN. G


RANGANATH, NANDAWAT RAVINDRA K, M SELVAGURU, T COMERICA SUBASH, RAGHAVAN S
VENKAT, S ANBAZHAGAN VIKRAM, MC GRAW HILL
4. MCQS IN COMPUTER SCIENCE by TIMOTHY WILLIAMS, MC GRAW HILL

Session 2024-25 Page:2/2

You might also like