Professor and HEAD

Learn and grow

B.Tech

B.Tech 6th SEM

Big Data (BCS061)

1. Introduction to Big Data sybca-bigdata-ppt.pdf

2. Hadoop Modules and Ecosystem.pptx

3.assignment 1 big data.docx

4. Hadoop Streaming.pptx

5. MapReduce.pptx

6. MRUnit.pptx

7. NoSQL.pptx

8. Introduction to Hadoop Scheduler.pptx




B.Tech 5th SEM

Artificial Intelligence BCAI501




AI Lab Syllabus (1).docx

Lab Viva Questions.docx

B.Tech 6th SEM

Deep Learning and its applications CSA303


B.Tech 7th SEM

Computer Vision CSA401





B.Tech 7th Sem

Elective 

Business Intelligence








B.Tech CS/IT  Sem -2

 Design & Creativity  (CSP116)



  1. Syllabus CSP116 Design & Creativity Lab.docx
  2. Plan of Action dcl.docx.pdf
  3. Lab task https://forms.gle/siGXoGTRgbr1fGTJ7


5. 

6.

7.

8.


  • Submit your PPT here






B.Tech 4th SEM 

Human Computer Interaction CSA021

  1. Syllabus CSA021_Human Computer Interaction.docx
  2. HCI_week1.pdf
  3. HCI_week2.pdf
  4. HCI_week3 Lecture   AnswerHCI_ans1.png
  5. HCI_Week4.pdf
  6. IxD 5DimensionsDimensions of intereaction designs.pdf
  7. Interactive System Design.pdf
  8. CSA021 Unit 1 -2 Assignment.pdf         SUBMIT HERE (e.g. name_systemid.pdf)
  9. Design patterns in HCI.pdf
  10. Implementation support in HCI.pdf
  11. HCI - Evaluation.pdf
  12. The Seven Principles of Universal Design.pdf
  13. multimodel in HCI.pdf
  14. Fitts Law and Buxton 3 state model.pdf
  15. GOMS.pdf
  16. The use of Task Analysis in HCI.pdf
  17. Design Process Task Analysis.pdf
  18. Purpose of Task Analysis.pdf
  19. CSA021 assignment 2.pdf
  20. Value Added Material








B.Tech 7th SEM

Computer Vision CSA401

f1.pyf2.pyf3.pyf4.pyf5.pyf6.pyf7.pyf8.pyf9.pyf10.py
f11.pyf12.pyf13.pyf14.pyf15.pyf16.pyf17.pyf18.pyf19.pyf20.py









B.Tech 6th SEM

 Python Summer Training










B.Tech 4th SEM

Industry Oriented Python 2 -BCSE3072


SyllabusIndustry_oriented_Python2.pdf



  1. Introduction to python  (video 1)
  2. What is Python 
  3. Getting Started with Python
  4. Python Data Types
  5. Python Strings
  6. Python Boolean and Operators
  7. Taking input in python
  8. Python Variable Assignment and Memory Location
  9. Python Collections - List (part 1)
  10. Python Tuple
  11. Python Sets
  12. Python Dictionary
  13. Selection control structures/branching (If ..Else)
  14. Python Loops - While loop
  15. Python Loops - For loop
  16. The immutability concept of Tuples
  17. Python Functions
  18. Python Functions with arbitrary arguments
  19. Python Regular Expression Module
  20. Classes and Objects
  21. Python oops concepts
  22. Python Stacks
  23. Bubble Sort
  24. Insertion sort




B. Tech 6th SEM

Python -3





B.Tech 3rd SEM

OOPS LAB





ECE 7th

IoT Application Development


Python Machine Learning Book                                                               

QUIZ 1

QUIZ 2




  1. Domain Specific Application of IoT
  2. Embedded IoT Platform Design Methodology
  3. Cloud Storage Model
  4. Types of cloud storage
  5. BOLT API for IOT products and projects(online material)
  6. RESTful Web API
  7. Some question answers








IT 7

Genetic Algorithm (CS-1741)

Professional Elective - II

Introduction and Course Structure 

Unit 1: 

  • Basics of Optimization
  • Optimization Problems
  • Point to Point Algorithms
  • Simulated Annealing

M.Tech

M.Tech imageM.Tech image
Contains Study material for M.Tech students of computer science
                           CSE642: Soft Computing Techniques


MCA

MCA imageMCA image



Operating System
  1. Introduction
  2. OS Services
  3. OS services and calls
  4. OS Structure
  5. Virtual Machines
  6. Process Management
  7. Process Scheduling
  8. OS scheduling Algorithm
  9. Multithreading
  10. Memory Management
  11. Paging and segmentation
  12. Virtual Memory and Page Replacement
  13. Process Synchronization
  14. Deadlock
  15. IPC
  16. OS File system
  17. OS Security








An Algorithm is a sequence of steps to solve a problem. Design and Analysis of Algorithm is very important for designing algorithm to solve different types of problems in the branch of computer science and information technology.

Books
  1. Book1

DAA
  1. Dynamic Programming and Multistage Graph
  2. Matrix Chain Multiplication
  3. LCS
  4. Knapsack 
  5. Travelling Salesperson Problem
  6. Backtracking- N Queens Problem
  7. Branch and Bound
  8. Amortized Analysis
  9. BFS and DFS
  10. Minimum Spanning Tree
  11. Randomized Algorithm
  12. Problem Classes
  13. Bin Packing and Approximation Algorithm
  14. Job Scheduling
  15. Asymptotic Notations
  16. Recurrence: Master Method
  17. Shortest Path







BSC

BSC 6th SEM (CS & IT)

Python Programming & Pyhton Programming Lab

BOOK 1 python-basics-sample-chapters.pdf  

 Book 2 Tutorial_EDIT.pdf

SyllabusBCA318_Python Programming.docx


  1. Lecture 1Python Programming L1.pdf
  2. Lecture 2Python Programming L2.pdf
  3. Lab Task (23-24 Jan 2022)
  4. Lecture 3Strings.pdf
  5. Python If-else
  6. Python For Loop
  7. Lab Task (31 jan-1 Feb 2022)
  8. Class Assignment     Submit here (pdf only with filename - name_systemid)
  9. Lab task - write examples using all operators studied in class.
  10. Lab task Lab task 14 feb.pdf
  11. Lecture Tuple tuples.pdf
  12. Lab taskLab task 21 feb.pdf
  13. LectureSet & Dictionary.pdf
  14. python_lab(14-15 march 2022).docx
  15. python functions.pdf
  16. Python Lambda.pdf
  17. Map Filter and Reduce.pdf
  18. BCA-318, List of Experiements, FInal.docx


BCA

Introduction to Distributed Systems BCA367   Syllabus                         BOOK
  1. Introduction to distributed systems
  2. Client Server introduction
  3. Synchronization in Distributed Systems
  4. Limitation of Distributed systems
  5. Logical Clock and Lamport's scaler clock
  6. Distributed Algorithms Agreement Protocol
  7. BFT
  8. Fault Tolerance
  9. Distributed DBMS Commit Protocols
  10. Transaction
  11. DBMS Schedules and the Types of Schedules
  12. client Server Model
  13. Deadlock
  14. DDBMS - Security in Distributed Databases
  15. DDBMS - Database Security & Cryptography















Operating System
  1. Introduction
  2. OS Services
  3. OS services and system call
  4. OS Structure
  5. Virtual machines
  6. Process Management
  7. Process Scheduling
  8. OS Scheduling Algorithms
  9. Multi-threading
  10. Memory Management
  11. Paging and Segmentation
  12. Virtual Memory and Page Replacement
  13. Process Synchronization
  14. Deadlock
  15. IPC
  16. OS File System
  17. OS Security




Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous.

Discrete Structures & Graph Theory
  1.  Set Theory
  2. Relation
  3. Relation Matrix and Functions
  4. Principle of Inclusion and Exclusion
  5. Applications of PIE
  6. Solution
  7. Directed Graph
  8. Warshall’s Algorithm- Transitive
    Closure
  9. POSET
  10. Sets, Relations and functions (Reference Material)

Design & Analysis of Algorithms
  1. Dynamic programming and Multistage graph
  2. Matrix Chain Multiplication
  3. LCS
  4. Knapsack
  5. Travelling Salesperson problem
  6. Backtracking - N Queens Problem
  7. Branch and Bound
  8. Amortized Analysis
  9. BFS and DFS and its applications
  10. MST
  11. Randomized Algorithm
  12. Randomized minimum cut
  13. Primality Testing
  14. Bin Packing
  15. Problem Classes
  16. Shortest Path
  17. Asymptotic Notation
  18. Recurrence : Master Theorem 
  19. Lower bound theory (reference material )

Contact

  • university of Allahabad

Info

Info image
I BUILT MY SITE FOR FREE USING