Rose Shukla

Student at Chandigarh group OF Colleges, Mohali

Studied at Army Public School, Roorkee

Environmental Science And It's Concept

Natural resources, renewable and non-renewable resources. Pollution, Biodiversity, Ecosystem, flora and fauna, Water and it's importance, Utilization of water, Level of Biodiversity, Air Pollution, Water Pollution , Aquatic Pollution, Noise pollution, controlling of various pollution. thermal pollution. Disaster Management, Natural Hazard, Earthquake, Tsunami, Dams and Displacement of Dams

Universal Human Values Chapter 1

Difference between Values and human skills. Self-exploration and content of self-exploration, Natural acceptance is innate, universal and invariant. Prosperity and wealth and their difference. Difference between human and animal consciousness.

operating systems lectures

Scheduling algorithm, and it's criteria, CPU utilization, throughput, Turn Around Time , Waiting Time, Response Time. Types Of Scheduling Algorithm. First Come First Served Scheduling, Shortest Job First Scheduling, priority scheduling, Round Robin Scheduling.

Operating System lectures

Concept of Scheduling , Concept Of Thread, Concept of Process, Process Vs Thread, Advantage of thread over process.Context switching and it's use and advantage, multi-threading system, many thread system. CPU scheduling, preemptive scheduling, dispatcher.

Operating Systems Lecture Vise Concepts

Introduction to Operating System , System View, User View, Types of Operating system, Mainframe system, Batch System , Time-sharing system, distributed system, Multiprocessor system. Operating System Generations , System Call , File Management, Kernel of a system , layered approach, micro-kernel, virtual machine and it's implementation . Java and it's concepts, Java Objects, java class file, host system.

Design And Analysis Of Algorithm Ch 3

Introduction - Greedy: Huffman Coding - Knapsack Problem - Minimum Spanning Tree (Kruskals Algorithm). Dynamic Programming: 0/1 Knapsack Problem - Travelling Salesman Problem - Multistage Graph- Forward path and backward path

Design And Analysis Of Algorithm Ch 2

Introduction, Binary Search - Merge sort and its algorithm analysis - Quick sort and its algorithm analysis - Strassen's Matrix multiplication - Finding Maximum and minimum - Algorithm for finding closest pair - Convex Hull Problem

Design And Analysis Of Algorithm Ch 2

Analysis Of Algorithms, Time Complexity of an algorithm and space complexity of an algorithm . Asymptotic notations and it's use. Analysis of linear and binary search with example and algorithm. analysis of Bubble sort with examples and algorithm and psuedocode. Amortized analysis. Sequence of operations performed.

Design And Analysis Of Algorithm Ch 1

Introduction to algorithm design . Characteristics of an algorithm, Algorithm designing techniques, Approaches and design paradigms. Brute-Force, Divide and Conquer, Decrease and Conquer, Greedy Algorithms , dynamic Programming , Back-tracking Methods, Branch and Bound. Analysis Of Algorithms, Time Complexity of an algorithm and space complexity of an algorithm . Asymptotic notations and it's use. Analysis of linear and binary search with example and algorithm. analysis of Bubble sort with examples and algorithm and psuedocode. Insertion Sort analysis with example and algorithm. Mathematical analysis.

Digital Electronics Ch-3

Concepts of digital circuit and logic design, Theorem of boolean algebra. AND law, OR law, De Morgan's Law. Principle of duality, inverse theorem, Universal gates using NAND and NOR gates. Sum Of Products form and Product Of Sum Form.

Graph Theory In Discrete Structures

Graph Theory Basic terminology. Directed Graph And Un-directed Graph . Even and Odd vertex. Complete Graph , Isomorphic Graph, Sub-graph, Order and Size of graph. Weighted Graph , Bipartite Graph, Euler path. Planar graph and the properties of planar graph. Non-planar graph. Coloring of graph, chromatic number. Shortest path in a graph, DIJKSTRA's algorithm of shortest path. Hamilton Path , Hamilton Circuit and Hamilton Graph.

Discrete Structures Chapter 1, Set, Relations and Function

Sets , Set forms, Types of Set. Relations , symmetric transitive and reflexive relations. Laws on set, Demorgan's law , commutative law, associative law. Functions and it's type. One-one function, Onto function, Many-one function, Into Function.