Podcast
Questions and Answers
What is a defining characteristic of a microkernel operating system?
What is a defining characteristic of a microkernel operating system?
- It only supports one application at a time.
- It includes most services in the kernel space.
- It is designed for real-time processing exclusively.
- It minimizes the functions in the kernel space. (correct)
Which scheduling algorithm is characterized as pre-emptive?
Which scheduling algorithm is characterized as pre-emptive?
- Shortest Remaining Time First (SRTF) (correct)
- Shortest Job First (SJF)
- Round Robin (RR) (correct)
- First-Come, First-Served (FCFS)
In process management, what is a Process Control Block (PCB) primarily used for?
In process management, what is a Process Control Block (PCB) primarily used for?
- To track memory allocation.
- To store data permanently.
- To manage the CPU state.
- To maintain information about processes. (correct)
Which of the following is not a criterion for scheduling algorithms?
Which of the following is not a criterion for scheduling algorithms?
Which concept refers to a situation where multiple processes access a shared resource and manipulate it simultaneously, leading to data inconsistency?
Which concept refers to a situation where multiple processes access a shared resource and manipulate it simultaneously, leading to data inconsistency?
What is the primary function of semaphores in inter-process communication?
What is the primary function of semaphores in inter-process communication?
Which operating system structure is most rigid and lacks modularity?
Which operating system structure is most rigid and lacks modularity?
In context switching, what happens to the current process?
In context switching, what happens to the current process?
Which of the following correctly describes a zombie process?
Which of the following correctly describes a zombie process?
Which semaphore functions are commonly used for signaling between processes?
Which semaphore functions are commonly used for signaling between processes?
What is the purpose of the pthread_join function in POSIX Threads?
What is the purpose of the pthread_join function in POSIX Threads?
Which of the following describes message passing in inter-process communication?
Which of the following describes message passing in inter-process communication?
In object-oriented programming, what defines encapsulation?
In object-oriented programming, what defines encapsulation?
Which programming function is used to create a pipe for inter-process communication?
Which programming function is used to create a pipe for inter-process communication?
What key feature distinguishes polymorphism in object-oriented programming?
What key feature distinguishes polymorphism in object-oriented programming?
What is the primary purpose of implementing Bagging using Random Forests?
What is the primary purpose of implementing Bagging using Random Forests?
Which of the following statements is NOT a feature of object-oriented programming?
Which of the following statements is NOT a feature of object-oriented programming?
K-means clustering is best used for which of the following tasks?
K-means clustering is best used for which of the following tasks?
Which statement accurately describes Gaussian Mixture Model (GMM)?
Which statement accurately describes Gaussian Mixture Model (GMM)?
What is the main advantage of using Association Rule Mining with FP Growth?
What is the main advantage of using Association Rule Mining with FP Growth?
When comparing machine learning algorithms, which factor is crucial?
When comparing machine learning algorithms, which factor is crucial?
What is the role of the k-nearest neighbor algorithm in machine learning?
What is the role of the k-nearest neighbor algorithm in machine learning?
Which clustering method is best suited for categorical data?
Which clustering method is best suited for categorical data?
What is a key characteristic of evaluating ML algorithms with unbalanced datasets?
What is a key characteristic of evaluating ML algorithms with unbalanced datasets?
What are the six stages of the lifecycle management of cloud services?
What are the six stages of the lifecycle management of cloud services?
Which aspect is NOT a concern related to cloud security?
Which aspect is NOT a concern related to cloud security?
What does Service Oriented Architecture (SOA) primarily utilize for transactions?
What does Service Oriented Architecture (SOA) primarily utilize for transactions?
Which of the following options correctly describes cloud storage?
Which of the following options correctly describes cloud storage?
What is one of the key features of cloud management systems?
What is one of the key features of cloud management systems?
Which protocol stack is involved in an Event-driven Service Oriented Architecture?
Which protocol stack is involved in an Event-driven Service Oriented Architecture?
Which one of the following is a characteristic of cloud APIs?
Which one of the following is a characteristic of cloud APIs?
What is the function of syndication services in webmail?
What is the function of syndication services in webmail?
What is a primary focus of non-metric methods in pattern classification?
What is a primary focus of non-metric methods in pattern classification?
Which of the following is NOT an algorithm used for clustering?
Which of the following is NOT an algorithm used for clustering?
What does unsupervised learning primarily involve?
What does unsupervised learning primarily involve?
What is the objective of learning about vertex coloring in graph theory?
What is the objective of learning about vertex coloring in graph theory?
Which of the following concepts is NOT covered under the basics of graph theory?
Which of the following concepts is NOT covered under the basics of graph theory?
In the context of clustering, what do criterion functions do?
In the context of clustering, what do criterion functions do?
What is the primary purpose of set covering in graph theory?
What is the primary purpose of set covering in graph theory?
What is the relation between K-means clustering and the properties of the data?
What is the relation between K-means clustering and the properties of the data?
What does the chromatic number of a graph represent?
What does the chromatic number of a graph represent?
Which theorem pertains to the coloring of chordal graphs?
Which theorem pertains to the coloring of chordal graphs?
In which type of graph is edge-coloring specifically relevant?
In which type of graph is edge-coloring specifically relevant?
What characteristic distinguishes Class-1 graphs from Class-2 graphs?
What characteristic distinguishes Class-1 graphs from Class-2 graphs?
What does the Greedy coloring algorithm aim to achieve?
What does the Greedy coloring algorithm aim to achieve?
Which kind of networks does Maarten van Steen's book focus on?
Which kind of networks does Maarten van Steen's book focus on?
What is the primary focus of the Gupta-Vizing theorem?
What is the primary focus of the Gupta-Vizing theorem?
What can Mycielski's theorem help to construct?
What can Mycielski's theorem help to construct?
Flashcards
System Calls
System Calls
The basic building blocks of an operating system, these routines provide access to system resources like memory, files, and peripherals.
Context switching
Context switching
A way to run multiple programs or tasks concurrently on a single processor. It gives the illusion of multitasking by quickly switching between different processes.
Mutual Exclusion
Mutual Exclusion
A fundamental principle of operating systems that prevents multiple processes from interfering with each other's critical data. It ensures that shared data is accessed and modified in a controlled manner.
Dining Philosophers Problem
Dining Philosophers Problem
Signup and view all the flashcards
Semaphores
Semaphores
Signup and view all the flashcards
Layered Operating System
Layered Operating System
Signup and view all the flashcards
Threads
Threads
Signup and view all the flashcards
Process States
Process States
Signup and view all the flashcards
Abstract Data Type (ADT)
Abstract Data Type (ADT)
Signup and view all the flashcards
Encapsulation
Encapsulation
Signup and view all the flashcards
Polymorphism
Polymorphism
Signup and view all the flashcards
Inheritance
Inheritance
Signup and view all the flashcards
Design Patterns
Design Patterns
Signup and view all the flashcards
Object Identity
Object Identity
Signup and view all the flashcards
Concrete Invariant
Concrete Invariant
Signup and view all the flashcards
Abstraction Function
Abstraction Function
Signup and view all the flashcards
System Concept
System Concept
Signup and view all the flashcards
Management Definition
Management Definition
Signup and view all the flashcards
Management Functions
Management Functions
Signup and view all the flashcards
Bagging
Bagging
Signup and view all the flashcards
K-Means Clustering
K-Means Clustering
Signup and view all the flashcards
Hierarchical Clustering
Hierarchical Clustering
Signup and view all the flashcards
K-Modes Clustering
K-Modes Clustering
Signup and view all the flashcards
Association Rule Mining using FP-Growth
Association Rule Mining using FP-Growth
Signup and view all the flashcards
Cloud Computing
Cloud Computing
Signup and view all the flashcards
Cloud Management
Cloud Management
Signup and view all the flashcards
Service Oriented Architecture (SOA)
Service Oriented Architecture (SOA)
Signup and view all the flashcards
Enterprise Service Bus (ESB)
Enterprise Service Bus (ESB)
Signup and view all the flashcards
Cloud-based Storage
Cloud-based Storage
Signup and view all the flashcards
Manned Cloud storage
Manned Cloud storage
Signup and view all the flashcards
Unmanned cloud storage
Unmanned cloud storage
Signup and view all the flashcards
Cloud Mail Services
Cloud Mail Services
Signup and view all the flashcards
Non-numeric data
Non-numeric data
Signup and view all the flashcards
Decision trees
Decision trees
Signup and view all the flashcards
Unsupervised learning
Unsupervised learning
Signup and view all the flashcards
Criterion functions for clustering
Criterion functions for clustering
Signup and view all the flashcards
Algorithms for clustering
Algorithms for clustering
Signup and view all the flashcards
Graph theory
Graph theory
Signup and view all the flashcards
Cycle in a graph
Cycle in a graph
Signup and view all the flashcards
Shortest path problem
Shortest path problem
Signup and view all the flashcards
Chromatic Number
Chromatic Number
Signup and view all the flashcards
Clique
Clique
Signup and view all the flashcards
Chordal Graph
Chordal Graph
Signup and view all the flashcards
Greedy Coloring Algorithm
Greedy Coloring Algorithm
Signup and view all the flashcards
Brooks' Theorem
Brooks' Theorem
Signup and view all the flashcards
Edge Colorings
Edge Colorings
Signup and view all the flashcards
Gupta-Vizing Theorem
Gupta-Vizing Theorem
Signup and view all the flashcards
Class-1 Graph
Class-1 Graph
Signup and view all the flashcards
Study Notes
Probability & Statistics (PCCAIML 501)
- Course Semester: V
- Maximum Marks: 100
- Examination Scheme:
- End Semester Exam: 70 marks
- Attendance: 5 marks
- Continuous Assessment: 25 marks
- Teaching Scheme: 3 hours/week theory
- Course Aim: Equip students with standard concepts and tools in probability and statistics to tackle problems in the discipline.
- Course Objective: Familiarize students with statistical techniques. Students should demonstrate understanding of probability & statistics by learning:
- Probability and random variables (discrete and continuous) and their properties
- Basic ideas of statistics (central tendency, correlation, regression)
- Statistical methods for studying data samples
Object Oriented Programming (PCC-CS503)
- Semester: V
- Maximum Marks: 100
- Examination Scheme:
- Mid Semester Exam: 15 marks
- Assignment and Quiz: 10 marks
- Attendance: 5 marks
- End Semester Exam: 70 marks
Object Oriented Programming Lab (PCC-CS592)
- Semester: V
- Maximum Marks: 100
- Credit Points: 2
- Teaching Scheme: 4 hours/week
Introduction to Machine Learning (PCCAIML 502)
- Semester: V
- Maximum Marks: 100
- Credit Points: 3
- L: 3, T: 0, P: 0, C: 3
- Course Objectives: Students will comprehend supervised and unsupervised techniques, differentiate regression/classification/clustering, analyze the performance of various machine learning techniques and select appropriate features.
- Module 1: Introduction to Machine Learning, Feature Engineering, Learning Paradigm, Generalization of Hypothesis, VC Dimension, PAC Learning, Applications of ML.
- Module 2: Data Handling and ANN, Feature Selection Mechanisms, Imbalanced Data, Outlier Detection. Artificial Neural Network details including backpropagation.
- Module 3: ML Models and Evaluation, Regression (Multi-variable Regression, Model evaluation, Least squares regression, Regularization, LASSO), Classification (KNN, Naive Bayes, SVM, Decision Tree). Training and testing classifier models, Cross-validation, Model evaluation (precision, recall, F1-mesure, accuracy, area under curve), Statistical decision theory (discriminant functions, decision surfaces). Models assessment and inference.
- Module 4: Model Assessment and Inference,Model assessment and Selection Ensemble Learning (Boosting, Bagging). Bayesian Theory, EM Algorithm.
- Module 5: Hidden Markov Models
- Module 6: Association Rules
- Pre-requisites: NIL
Machine Learning Lab (PCCAIML 592)
- Semester: V
- Maximum Marks: 100
- Credit Points: 2
- Lab Experiments: Implement Decision Tree learning, Logistic Regression, Classification using Multilayer perceptron, Classification using SVM, Implement Adaboost, Implement Bagging(Random forests), Implement K-means Clustering, Implement Hierarchical Clustering, Implement K-mode clustering, Implement Association Rule Mining using FP Growth, Classification based on association rules, Implement Gaussian Mixture Model using the EM algorithm, Evaluating ML algorithm with balanced and unbalanced datasets, Comparison of machine learning algorithms. Implement K-nearest neighbour algorithms.
- Total Lecture hours: 30 hours
Graph Theory (PECAIML501C)
- Semester: V
- Credit Points: 3
- Teaching Scheme: 3 hours theory/week
- Aim: Understanding graph theory, paths, walks and cycles, set covering, matching problem, vertex coloring.
- Module details: 1. Introduction, 2. Connected Graphs & shortest paths, 3. Trees, 4. Independent sets & coverings, 5.Vertex Colouring.
Pattern Recognition (PECAIML501B)
- Semester: V
- Credit Points: 3
- Teaching scheme: 3 hours theory/week
- Aim: Understand Bayesian decision theory, classifiers, discriminant functions, normal/density/discriminant functions.
- Module details: basics of pattern recognition, Bayesian decision theory, parameter estimation methods, Hidden Markov Models, dimension reduction methods, non-parametric techniques, linear discriminant function based classifier (Perceptron, Support Vector Machines).
Introduction to Industrial Management (HSMC-501)
- Semester: V
- Credit Points: 3
- Teaching Scheme: 2 hours theory/week
- Course Objectives: Students should acquire knowledge of the basic principles of industrial management and organizational structure. Topics include definition, types and factors in organization structures, and the concept of division of labor.
- Module Details: Introduction to Industrial Management; Concepts; types, parameters, variables and behaviour; Management definitions; organizational structure, definitions, goals, factors considered in formulating structure; Types of organizations; Advantages/Disadvantages/Applications; Division of labour, span of control, delegation; Organizational culture and climate; Moral factors; Job satisfaction; Factory acts and labour la
Cloud Computing (PECAIML501A)
- Semester: V
- Credit Points: 3
- Teaching Scheme: 3 hrs./week theory
- Unit 1: Definition of Cloud computing and its basics (cloud types, deployment types, service models- IaaS, PaaS, SaaS). Cloud Reference Model, Infrastructure, Platforms, Virtual Appliances, Communication Protocols, Application development; Usage of PaaS; Application frameworks; Google applications portfolio.
- Unit 2: Use of platforms in Cloud computing (Mobility patterns, Load balancing, Application Delivery Controllers and Networks, Hypervisors); Porting of applications into the Cloud;Concepts of Platform as a Service, PaaS, and Distinction between SaaS and PaaS (examples of Salesforce.com and Force.com);
- Unit 3: Cloud Management: Overview of network management, Lifecycle Management of Cloud services; Concept of Security concerns, Security mapping, data security, storage, and identity management; Cloud Transactions; functionality mapping.
- Unit 4: Cloud infrastructure; Cloud Management; Concepts of services and applications-Service Oriented Architecture.
Studying That Suits You
Use AI to generate personalized quizzes and flashcards to suit your learning preferences.