25MT202- ENGINEERING STATISTICS AND PROBABILITY

APPLICATIONS
Hours per week:

L T P SL C
3 2 0 3 4
PREREQUISITE KNOWLEDGE: Basic knowledge in Mathematics and Statistics.

COURSE DESCRIPTION AND OBJECTIVES:

This course explores fundamental mathematical and statistical techniques for data analysis. It
covers probability, random variables, mathematical expectations, and both discrete and
continuous probability distributions. Students will learn parameter estimation, hypothesis
testing for various sample sizes, and regression modeling to analyze relationships between
variables. The course also introduces non-parametric tests, providing a comprehensive
foundation in statistical analysis.

MODULE-1
18L+12T+0P+18SL=48 Hours
UNIT-1
INTRODUCTION TO PROBABILITY THEORY:

Theorem, Random Variables: Distribution function and its properties Discrete and
Continuous, Probability Mass Function, Probability Density Function, Properties,
UNIT-2
RANDOM VARIABLES AND PROBABILITY DISTRIBUTIONS:
Expectation, variance, and moment generating function of a random variable, Discrete
Distributions: Uniform, Binomial, Poisson, Continuous Distributions: Uniform, Exponential,
Cauchy, Logistic, Normal, Gamma, and Beta distributions, Joint, Marginal, and Conditional
Distributions, correlation.
PRACTICES:
Apply probability concepts to Real-world problems.
Analyse and interpret probability distributions.
Identify an appropriate probability distribution for the given data.
Normality checks for the data.
Use to deduce the appropriate probability distribution for engineering
failure rates, such as logically inferring the suitability of Poisson distribution for
mechanical system reliability.

MODULE-2
27L+18T+0P+27SL=72 Hours
UNIT-1
STATISTICAL INFERENCE:
Point Estimation: Methods of moments, maximum likelihood estimation
Hypothesis Testing: one sided, two sided hypotheses, Type I and Type II errors, level of
significance, power of the test, critical region, p-value, confidence intervals, Single sample
and two sample tests for mean, proportion, variance and standard deviation.
UNIT-2
REGRESSION ANALYSIS:
Simple Linear Regression, Hypothesis tests for regression coefficients, Prediction Intervals,
Multiple Linear Regression. Curve fitting by least squares principle.
UNIT-3
DESIGN OF EXPERIMENT:
Analysis of Variance (ANOVA): Assumptions, Types of ANOVA, One-way and Two-way
classifications with replications and without replications, Experimental Design: Basic
Principles, Completely Randomized Design, Randomized Block Design.
PRACTICES:
Apply MoM and MLE to estimate parameters of the well-known probability
distributions.
Performing the suitable hypothesis test for the given practical scenario.
Analysing the correlation and perform regression analysis for real life data sets.
Compare means across multiple groups for different real data sets.
Design a CRD and RBD to study process optimization.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to

CO Blooms Mapping
Course Outcomes
No. Level with POs

Understand and Apply Fundamental Probability Concepts

1. Apply 1, 2, 6
Gain a deep understanding of probability theory

Analyze Random Variables and Distributions Compute

2. Apply 1, 4, 5
expectation, variance, and moment-generating functions

Perform Statistical Inference and Hypothesis Testing

3. Analyze 4, 5, 6
Apply point estimation methods (MLE, MOM)

4. Develop Regression Models and Correlation Analysis Apply 3, 4, 5, 10

Apply Experimental Design and ANOVA Techniques

5. Evaluate 4, 5, 6, 10
Utilize ANOVA

MAPPING OF SUSTAINABLE DEVELOPMENT GOALS (SDGS) AND INDIAN

KNOWLEDGE SYSTEM (IKS):
TEXT BOOKS:
1. Montgomery, D. C., & Runger, G. C. (2019). Applied Statistics and Probability for
Engineers. Wiley.
2. Bluman, A. G. (2017). Elementary Statistics: A Step by Step Approach. McGraw-
Hill.

REFERENCE BOOKS:
1. Gupta, S. C., & Kapoor, V. K. (2014). Fundamentals of Mathematical Statistics.
Sultan Chand & Sons.
2. Gupta, S. C., & Kapoor, V. K. (2014). Fundamentals of Applied Statistics. Sultan
Chand & Sons.
3. Kutner, M. H., Nachtsheim, C. J., & Neter, J. (2004). Applied Linear Regression
Models. McGraw-Hill.
4. Casella, G., & Berger, R. L. (2002). Statistical Inference. Duxbury Press.

SKILLS:
Identifying appropriate probability models based on theoretical concepts covered in the course.
Testing data for acceptance or rejection using statistical hypothesis tests.
Fitting regression lines and predicting confidence intervals for dependent variables.
Understanding and applying non-parametric statistical tests for data analysis.

Image file name: PROBABILITY & STATISTICS

Image source:
[Link]
 25TT201 TEXTILE FIBERS
Hours Per Week :
L T P SL C
2 0 2 2 3
PREREQUISITE KNOWLEDGE: Basics of textile processes.

COURSE DESCRIPTION & OBJECTIVES:

The main objective of this course is to impart the knowledge of different types of natural and
manmade fibers and its principles of formation. It also enables the students to know the
morphological and chemical structure of natural fibres and different fibers structures and its
effects on fiber properties. It also includes the production process of various manmade fibers
and its properties and applications.
MODULE-1
12L+0T+12P+12SL = 36 Hours
UNIT-1
NATURAL FIBRES
Fundamental terms of textile fibre - staple fibre, regenerated fibre; filament, yarn, fabric types,
weave Characteristics of fibre forming polymer; Requirement of fibre formation, Properties of
textile fibers, Degree of polymerization, crystallinity, orientation; Classification of fibres,
Traditional Fiber Knowledge, Advantages and disadvantages of natural & manmade fibres;
sequence of the textile industry.
VEGETABLE FIBRES
Cotton fibre, cultivation and harvesting, Eco-Friendly Practices, structure, properties and
applications; Bast Fibres -Retting and extraction process, properties and applications of Jute
fibres.

UNIT-2
ANIMAL FIBRES
Animal Fibres Wool, types and grading, structure, properties and applications Silk - Types,
life cycle and production, structure, properties and applications; Application of other
sustainable natural fibres in Technical Textiles.
PRACTICES:
Identification of Textile fibers by different methods.
Microscopic test of fibers.
Analysis the textile fibers by Feel test.
Identification of specific natural fiber out of different natural fibers.
Determination of specific cellulosic fiber out of different cellulosic fibers.
Determination of specific protein fiber out of different protein fibers.
Identification of unknown fibre using chemical test.
Burning test of fibers.
MODULE-2
18L+0T+18P+18SL = 54 Hours
UNIT-1
SPIN FINISHES
MANMADE FIBRE
Manmade Fibre Formation Technologies - Types, comparison between different manmade
fibre formation technology, Drawing / Orientation and its effects or properties. Basics of
Regenerated Fibres: Viscose Rayon, Modal & Micro Modal - Cellulose Ester fibres
manufacturing process, properties and applications; Introduction to other regenerated fibres
UNIT-2
TEXTILE POLYMERS
Polyamide fibres (Nylon 6 & Nylon 66),: Polyester, HDPE, Polyolefin Fibres (Polypropylene),
Polyacrylonitrile Polyurethane manufacturing process, properties and applications in
Technical textiles.

UNIT-3
HIGH-PERFORMANCE FIBERS
Application of high-performance fibers; Carbon Fibre, Aramid Nomex, Kevlar , Fibres, Metal
Fibre; Glass Fibre, and Functional Textiles.

PRACTICES:
Identification of specific manmade fiber out of different manmade fibers.
Determination of fibres in P/C blended yarn using phenol method.
Determination of fibres in P/C blended yarn using sulphuric acid.
Determination of fibres in P/V blended yarn using phenol method.
Determination of fibres in P/V blended yarn using sulphuric acid.
Identification fibre from standard FTIR spectra of textile fibers.
Chemical test of fibers.
Model sequential operations in the manmade fibre spinning
Arrange mill visit to manmade fibre production unit.

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to:

CO Mapping
Course Outcomes
No. Level with POs
Predict operations involved in cultivation and
1. Apply 1, 2, 11
harvesting of natural fibres
Integrate all textile machineries for man-made fibre
2. Analyse 1, 2, 5, 11
production.
Find proper methods for fibre production and 1, 2, 3, 5,
3. Analyse
identification 11
4. Categorize various equipment used in find fibres Evaluate 1, 2, 11

5. Assessing performance of different fibres. Evaluate 1, 2, 11

MAPPING OF SUSTAINABLE DEVELOPMENT GOALS (SDGs) AND INDIAN

KNOWLEDGE SYSTEM (IKS):
TEXT BOOK:
rd
1. edition, Chapmen and Hall, New
York, 2004.
2.

REFERENCE BOOKS:
1. w Age International Publishers, New
Delhi, 2000.
2.
nd
3. edition, Publisher-Melbourne: Longman
Cheshire, 1983.

SKILLS:
Understand the textile terminologies
Learn different process sequences involved in fibre production.
Identify the types of equipment for fibre identification.
Choose the appropriate processing technique to produce textile fibres.

Image source :
[Link]
o146UDepDWOu-dufKhCIIkO4cAR0MMA1oNL-
VxM2pTYhj4tD3lIPuECgzn9uDB3DsZJPyDjLMTGcC64BTXxjhrhglr398b3R6AxtgjRCCh
ujGnhs5DwdGFGqtd/s1600/[Link]

Image file name: TEXTILE FIBRES

 25CS201 - DATA STRUCTURES
Hours Per Week:
L T P SL C
2 2 2 2 4
PREREQUISITE KNOWLEDGE: Programming in C
COURSE DESCRIPTION & OBJECTIVES:
This course is aimed at offering fundamental concepts of data structures and explains how to
implement them. It begins with the basic concepts of data, data structures and then introduces
the primitive and non-primitive data structures in detail. It forms the basis for understanding
various ways of representing data and its usage in different computing applications.

MODULE-1
12L+12T+12P+12SL= 48 Hours
UNIT-1
DATA STRUCTURES BASICS:
Basic Terminology data, information, datatype; Data Structures Introduction, storage
structures- sequential and linked storage representations; classification of data structures.
Applications of data structures.
Searching: Linear Search and Binary Search.
Sorting: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort and Merge Sort.

UNIT-2
LINKED LISTS, STACKS & QUEUES:
Linked List: Introduction, Types of linked list Singly linked list, doubly linked list and
circular linked list, representation of linked list, Operations of linked list: Traverse forward/
reverse order, searching, insertion and deletion; Applications of linked lists.
Stack Introduction, array and linked representations, implementation, and their applications;
Queue Introduction, array, and linked representations, implementation; Types Linear,
circular and doubly ended queues operations; Applications of Queues.
PRACTICES:
Problems on Recursion Level 1
Find the product of 2 numbers using recursion.
Find the sum of natural numbers using recursion.
Find the factorial of a number using recursion.
Find the Nth term of the Fibonacci series using recursion.
Calculate the power using recursion.
Write a recursive program for checking if a given number is a prime number.
Given two integers write a function to sum the numbers without using any arithmetic
operators.
Convert a decimal to binary using recursion.
Print all factors using recursion.
Find the maximum product of digits among numbers less than or equal to N.
Problems Recursion Level 2
Implement insertion sort recursively.
Write a program to find the numbers less than N that are product of exactly 2 distinct
prime numbers - using recursion.
Implement selection sort recursively.
 Find the middle of a singly linked list using recursion.
Find the sum of even numbers of an array using recursion.
Check if a given array is in sorted order using recursion.
Print alternate nodes of a linked list using recursion.
Reverse a doubly linked list using recursion.
Write a recursive function that returns all permutations of a given list.
Implement bubble sort recursively.
Problems on Sorting and Searching Level 1
Implement the insertion sort function.
Implement the bubble sort function.
Implement the quick sort function.
Implement the merge sort function.
Implement the selection sort function.
Implement linear search function.
Implement binary search function.
Problems on SLL Level 1
Implement the insert function to insert nodes into a singly linked list (ascending order).
Implement the insert function to insert nodes into a singly linked list (descending order).
Implement the search node function.
Implement the delete node function.
Display forwards function.
Display backwards function.
Count the number of nodes in a singly linked list.
Swap alternate nodes of a singly linked list.
Move last node to the front of the linked list.
Move first node to the last of the linked list.
Problems On Stacks Level 1
Implement two stacks using a single array.
Given an array replace every element with nearest greater element on the right.
Given a stack reverse the elements using only push and pop functions.
Postfix evaluation using stack.
Balance symbols.
Find the middle element in a stack.
Remove the middle element from a stack.
Implement push and pop using a linked list.
Given an array of characters with the middle marked by X, check if the string is a
palindrome.
Maximum sum in sliding window.
Problems On Queues Level 1
Write a program to accept two numbers as input check if they are equal.
Write a program to accept two characters as input and check if they are equal.
Write a program to accept two numbers as input and print the greater of the 2 numbers.
Write a program to accept two numbers as input and print the lesser of the 2 numbers.
Write a program to accept 3 numbers as input and print the maximum of the 3.
Write a program to accept 3 numbers as input and print the minimum of the 3.
Write a program to accept a number as input and print EVEN if it is an even number
and ODD if it is an odd number.
 Write a program to accept a number as input and check if it is divisible by 3. If it is
divisible by 3 print YES else print NO.
Write a program to accept a number as input and check if it is divisible by both 3 & 5.
If it is divisible print YES else print NO.
Write a program to accept a number as input and check if it is positive, negative or zero.
Problems on DLL Level 1
Implement insert function.
Implement display forward function.
Implement display backward function.
Implement a search function.
Implement delete function.
Reverse a doubly linked list from M to N.
Find the sum of the odd and even nodes.
Count odd keys of the linked list.
Merge two sorted lists.
Delete adjacent duplicate nodes.
Problems on CLL Level 1
Insert function (circular doubly linked list).
Search function.
Display forward.
Display backward.
Delete node (circular doubly linked list).
Print the middle N nodes of a circular singly linked list.
Move the last node of a circular singly linked list to the beginning.
Delete adjacent duplicate nodes of a circular singly linked list.
Delete nodes greater than a value from a circular doubly linked list.
Find the sum of the nodes of a circular linked list.
Problems on Linked List Level 2
Given 2 sorted linked lists, print the common elements.
Reverse a list (using Stack).
Given a pointer to a node (not the last node), delete the node.
Reverse a list (Recursive).
Reverse a list (Iterative).
Reverse a singly linked list in pairs (recursive).
Reverse a singly linked list in pairs (iterative).
Check if a singly linked list is a palindrome or not.
Remove the loop if exists.
Given 2 linked lists with data in the ascending order, merge them into a single list.

MODULE-2
18L+18T+18P+18SL=72 Hours
UNIT-1
TREES:
Trees: Basic Terminology, Binary Tree Introduction, properties, array, and linked
representations; Tree traversals and their implementation;
UNIT-2
Huffman coding using Binary Tree, Heap Sort, BST definition and operations, AVL trees
definition and construction; Applications of binary trees.

UNIT-3
GRAPHS & HASHING:
Graphs: Basic Terminology, Traversals - Breath First Search (BFS) and Depth First Search
(DFS); Applications of graphs. Single Source Shortest Path using and
Bellman-Ford Algorithm.
Hashing: Introduction, Different hash functions, collision: avoidance and handling methods.

PRACTICES:
Problems on BST Level 1
Insert function.
Insert function (recursive).
Search function.
Pre order traversal.
Post order traversal.
In order traversal.
Level order traversal.
Delete child node.
Delete parent node.
Delete nodes greater than a value from a circular doubly linked list.
Implement the Heap sort function.
Implement Huffman coding using Binary Tree
Problems on Graphs Level 1
Implement Graph data structure.
Implement BFS - iterative solution.
Implement BFS - recursive solution.
Implement DFS - iterative solution.
Implement DFS - recursive solution.
Check if given graph is strongly connected or not.
Check if given graph is strongly connected or not - using DFS.
Given a graph find the arrival and departure time of its vertices in DFS. Arrival time is
the time when the vertex was explored for the first time, and departure time is the time
at which all the neighbours are explored and are ready to backtrack.
Given a directed acyclic graph and a source vertex, find the cost of the shortest path
from source vertex to all other vertices present in the graph. If a vertex cannot be
reached from given source vertex that distance may be printed as infinite.
Given an undirected graph, check if the graph is 2 edge connected or not.
Problems on Hashing Level 1
Print a binary tree in vertical order.
Find whether an array is subset of another array.
Given an array A [ ] and a number x, check for pair in A [ ] with sum as x.
Minimum operation to make all elements equal in array.
Maximum distance between two occurrences of same element in array.
Check if a given array contains duplicate elements within k distance from each other.
Find duplicates in a given array when elements are not limited to a range.
 Most frequent element in an array.
Smallest subarray with all occurrences of a most frequent element.
First element occurring k times in an array.
Problems on Graphs Level 2
Find the shortest graph distances between every pair vertex in a given path. Assume
that the graph does not have any negative edges.
Find the shortest graph distances between every pair of vertices in a given path. The
graph can have negative edges.
Detect cycle in DFS.
Count the number of connected components of a graph represented in the adjacent
matrix.
Count the number of connected components of a graph represented in the adjacent
matrix - using DFS.
Find a spanning tree - not necessarily a minimum spanning tree.
Detect cycle in an undirected graph.
Given an undirected graph, find its depth.
Determine if a directed graph has a unique topological ordering.
Given a directed acyclic graph and two vertices v and w, find the lowest common
ancestor.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:
CO Blooms Mapping
Course Outcomes
No. Level with POs
Explore the organization of several ADTs and the
1 manipulation (searching, insertion, deletion, traversing) 1,2
Apply
of data stored in various data structures.
2 Apply different data structures to solve a given problem. Apply 1, 3, 4
Analyze the efficiency of using different data structures
3 and choose the efficient data structure for solving a 1, 2
Analyze
given problem.
Assess efficiency trade-offs among different data
4 1, 2
structure implementations or combinations. Analyze
Design programs using a variety of data structures,
5 including hash tables, binary and general tree structures, Create 1, 2
search trees, heaps, graphs, and AVL trees.

MAPPING OF SUSTAINABLE DEVELOPMENT GOALS (SDGs) AND INDIAN

KNOWLEDGE SYSTEM (IKS):
TEXTBOOKS:
nd
1. Edition, Oxford University Press,
2014.
st
2. Edition, McGraw Hill Education,
2017.
REFERENCE BOOKS:
1.
edition, Computer Science Press, 2006.
2. Richar
nd
Edition, CENAGE Learning, 2005.
nd
3. edition, Impression
edition, 1998.

SKILLS:
Experienced to Store data and various types of data to handle.
Ordering and sorting of data.
Indexing and Searching of required data from large data sequences.
Exposed to various characteristics such as Linear or non-linear, Homogeneous or
heterogeneous and Static and Dynamic.

Image:

Image Source: [Link]

 25TT202 - DESIGN THINKING AND ENGINEERING ORIENTATION
Hours per week:
L T P SL C
0 0 2 0 1
PRE-REQUISITE KNOWLEDGE: Basics of fibre, yarn and fabric.
COURSE DESCRIPTION AND OBJECTIVES:
This course is designed to introduce students to the core principles of Design Thinking and
their application in engineering, particularly in textile technology. Through a hands-on
approach, students will learn how to identify user needs, generate ideas, and develop innovative
solutions for real-world problems in textile engineering. The course emphasizes problem-
solving, creativity, and collaboration.
To familiarize students with the design thinking process and its role in innovation.
To introduce basic engineering concepts relevant to textile technology.
To apply user-centred design in the context of textile products.
To develop skills in ideation, prototyping, and testing.

MODULE- 1
0L+0T+12P+0SL= 12 Hours
UNIT 1
INTRODUCTION TO DESIGN THINKING:
Definition, importance, and key principles of design thinking. Difference between design
thinking and traditional engineering approaches. Phases of Design Thinking: Empathize,
Define, Ideate, Prototype, Test. Application of Design Thinking in Textile Technology, User-
centred design for textiles. Sustainability and innovation in textile products.
UNIT 2
EMPATHY AND PROBLEM DEFINITION
Understanding User Needs: Conducting user research through surveys and interviews.
Identifying pain points in textile products. Framing the Design Problem: Synthesizing user
insights into a clear problem statement. Creation of user-centred point of view (POV)
statement.
MODULE- 2
0L+0T+18P+0SL= 18 Hours
UNIT 1
IDEATION AND CONCEPT DEVELOPMENT
Generating Ideas: Brainstorming techniques for innovative textile solutions. Creative
thinking and problem-solving. Evaluating Ideas: Criteria for feasibility, desirability, and
viability in textile design.
Prototyping and Testing: Prototyping Basics: Importance of prototyping in design thinking.
Low-fidelity prototyping techniques in textile technology (simple fabric models, sketches,
etc.).
UNIT 2
DESIGN FOR SUSTAINABILITY IN TEXTILES
Sustainability in Textile Design: Overview of eco-friendly textile materials and processes.
Incorporating sustainable practices into textile product design. Circular Design Principles:
Designing for reuse, recycling, and reducing waste in the textile industry
UNIT 3
Sustainability in Textile Design: Overview of eco-friendly textile materials and processes.
Incorporating sustainable practices into textile product design. Circular Design Principles:
Designing for reuse, recycling, and reducing waste in the textile industry.
Group Exercise: Ideate multiple solutions to the problem identified in textiles. Discussion:
Explore how design thinking can contribute to sustainability in textiles. Reflection and
Project Presentation: Students present their prototype and the design thinking process they
followed. Reflect on the learning outcomes and areas of improvement. Peer Review and
Feedback: Students provide feedback on each other's projects. Discuss how their designs

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:
CO. Blooms Mapping
Course Outcomes
No. Level with POs
Apply core principles of design thinking (such as
empathizing, defining, ideating, prototyping, and testing)
1. Apply 1, 2, 11
to solve real-world textile engineering challenges,
demonstrating a hands-on approach to problem-solving
Analyze user needs and pain points in textile products
through research methods like interviews and surveys, and
2. Analyse 1, 2, 5, 11
synthesize these insights into clear, actionable problem
statements..
Develop innovative, sustainable textile solutions by
integrating eco-friendly practices and circular design
3. Create 1, 2, 11
principles, showing an understanding of feasibility,
desirability, and viability..
Evaluate the effectiveness of prototypes through peer
review and feedback, reflecting on how well the designs
4. Evaluate 1, 2, 5, 11
address user needs and how they can be improved for
greater sustainability and functionality..

MAPPING OF SUSTAINABLE DEVELOPMENT GOALS (SDGs):

TEXT BOOKS:
1. E. Balaguruswa
Publishing House 2023.
2.
0465067107) 2013
SKILLS:
Ability to generate and evaluate innovative ideas..
Conducting interviews, surveys, and analyzing user needs.
Developing and testing low-fidelity models.
Understanding eco-friendly textile materials and circular design principles.

IMAGE SOURCE

Image file: 25TTXXX DESIGN THINKING AND ENGINEERING ORIENTATION

 25TT203 - YARN MANUFACTURING
Hours Per Week :
L T P SL C
3 0 2 3 4
PREREQUISITE KNOWLEDGE: Basic knowledge of Fiber science.

COURSE DESCRIPTION & OBJECTIVES:

This course deals with the concepts, production calculations, different types of available
machines and various developments in yarn manufacturing process. This course is aimed to
impart fundamental knowledge required to understand yarn manufacturing process.

MODULE-1
18L+0T+12+18SL = 48 Hours
UNIT-1
GINNING AND BLOW ROOM:
Effect of fiber parameters on selection of fibers; Ginning: objectives, pre and post ginning
equipment, working principles of gins, factors affecting ginning performance, brief note on
Pressing and baling of cotton, Indigenous Fibers. Need for Mixing and Blending; Objectives,
fibres commonly blended (Different types of blends), Ancient methods of yarn production
Working principle of a typical blow room, accessories in blow room.

UNIT-2
CARDING AND DRAW FRAME:
Introduction to carding, objectives, zones, role of each element, card settings.
Draw Frame: Objects, basic concepts of drawing, principle of roller drafting, different drafting
systems, methods of roller weighing, coiler mechanism, types of drafts, auto levelling in
carding & draw frame (open loop and closed loop) production calculations.

PRACTICES:
Traditional extraction procedures of natural fibres from plants.
Determination of cleaning efficiency of blow room machineries
Determination of production of blow room machineries
Studies of drives and in carding machine
production calculation in carding machine
Method of Card clothing procedure
combing efficiency and production calculation.
Connect modern spinning methods

MODULE-2
27L+0T+18P+27SL = 72 Hours
UNIT-1
COMBER: Introduction to combing, hooks theory, combing preparatory requirements,
passage of material through comber, functions and setting of each part, combing principle,
cycle of combing, back ward and forward combing, production calculations, combing
efficiency.
UNIT-2
SPEED FRAME: Objects, need of speed frame, flyer lead Vs bobbin lead, detailed study of
mechanisms (Drafting, twisting and bobbin building) of speed frame, types of drafts,
calculation of draft, twist & production.

UNIT-3
RING FRAME: Traditional Spinning Methods, Objects of ring spinning, passage of material,
principles, functions of parts, specifications of R/F, types of drafts and drafting systems, brief
study of spindles, ring & travellers, calculation of draft, twist & production.

PRACTICES:
Determination of draft in drawing, roving and ring spinning machines
Determination of twist in roving and ring spinning machines
Production calculations in drawing, roving and ring spinning machines
Studies on end breakage rate causes and remedies
Draw sequential operations in the preparatory spinning mill.
Execute production model for spinning mill.
Hand Spun Yarn Practices using charka

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to:

CO Mapping
Course Outcomes
No. Level with POs
Know the process sequences involved in yarn
1 Apply 1, 2, 11
production

2 Choosing machines for spinning preparatory. Apply 1, 2, 5, 11

Calculate the production and efficiency of spinning

3 Analyse 1, 2, 3, 5, 11
machineries.

4 Outline the spinning machine operations. Analyse 1, 2, 11

5 Assessing the performance of spinning mill Evaluate 1, 2, 11

MAPPING OF SUSTAINABLE DEVELOPMENT GOALS (SDGs) AND INDIAN

KNOWLEDGE SYSTEM (IKS):
TEXT BOOK:
ers, 2005.

Ahmedabad, 2005.

REFERENCE BOOKS:
Technology, Vol-
Komarapalyam, 2003.
2. [Link],

SKILLS:
Capable to produce lap from blow room
Able handle spinning preparatory machines.
Setup a spinning preparatory process for given quality of yarn.
Identify proper spinning operation to produce combed and carded yarn.

Image source: [Link]

[Link]

Image file name: YARN MANUFACTURING

 25TT204 - FABRIC MANUFACTURING
Hours Per Week:
L T P SL C
3 0 2 3 4
PREREQUISITE KNOWLEDGE: Basics of fiber and yarn particulars

COURSE DESCRIPTION & OBJECTIVES:

This course offers basics of preparatory and weaving process. The objective of this course is
to impart knowledge on various techniques and methods of preparatory process and production
of fabric using power loom.

MODULE-1
18L+0T+12P+18SL = 48 Hours
UNIT-1
WINDING
Objects of winding; principles of cheese and cone winding machines; drum and precision
winding; uniform build of yarn package; types of drums half accelerated and fully accelerated
drums; control of balloons; Classification of yarn faults and its removal; concepts in yarn
clearing mechanical, optical and electronic clearers; knotters and splicers, weft winding;
study of modern automatic winders.

UNIT-2
WARPING AND SIZING
Objectives of warping, material flow in beam warping and creels used in warping machines;
sectional warping machines. Sizing objectives of sizing; sizing materials and recipe used for
different types of fibers; sizing machines; sizing filament yarns; concept of single end sizing,
combined dyeing and sizing, eco-friendly sizing paste preparation.

PRACTICES:
Analysis of Yarn faults
Faults in wound packages, their causes and remedies
Studies on quality of knots and splices.
Wind machine calculations
Warping defects and calculations
Sizing defects and production calculations

MODULE-2
27L+0T+18P+27SL = 72 Hours
UNIT-1
INTRODUCTION TO WEAVING
Yarns quality requirements for high-speed automatic shuttle looms and shuttle less loom; warp
and weft preparation for high-speed looms; Principle of weaving, passage of material, motions
in loom primary, secondary and auxiliary motions, plain power loom driving, timing of
motions.
UNIT-2
PRIMARY MOTION
Shedding Motions: Traditional Weaving Techniques, Case study of Handloom Sectors Shed
geometry and shedding requirement. Types of sheds. Shedding mechanisms - positive and
negative. Principles of tappet, dobby and jacquard shedding mechanisms, reversing
mechanisms.
Picking Mechanism: Shuttle picking and checking mechanisms, shuttle flight and timing;
Beat up mechanism: Kinematics of sley, sley eccentricity

UNIT-3
SECONDARY AND AUXILIARY MOTIONS
Take up and let - off motions used in plain power looms; warp protector and warp and weft
stop motion; plain power loom accessories. Automatic weft replenishment in shuttle looms
Weft feeler types; design of shuttle, three try motions; multi shuttle looms- box changing
principle, Automatic pirn changing in multi shuttle loom. Weft arrival control in looms;
Temples.

PRACTICES:
Study of jacquard shedding mechanism
Study of picking mechanisms in looms
Preparation of pattern card for dobby shedding mechanism
Study of let-off mechanisms
Study of weft replenishment mechanism in shuttle looms
Method of achieving the required colour patterns in 4 X 1 drop box motion
Study of warp protector mechanism
Industrial visit to weaving mills.
Execute production model for weaving shed

COURSE OUTCOMES:
Upon successful completion of this course, students will be able to:

Mapping
CO No. Course Outcomes
Level with POs
1 Guess operations involved in weaving industries Apply 1, 2, 10

2 Assimilate all weaving machineries for production. Analyse 1, 2, 5, 11

3 Innovate new concepts for fabric production Analyse 1, 2, 3, 5, 11

Categorize various Secondary and auxiliary motions
4 Evaluate 1, 2, 11
involved in weaving.

MAPPING OF SUSTAINABLE DEVELOPMENT GOALS (SDGs) AND INDIAN

KNOWLEDGE SYSTEM (IKS):
TEXT BOOKS:
1.
2.

REFERENCE BOOKS:
1. M. K. Talukdar, D. B. Ajgonk
Institute, 1998.
2.
3.
Gujarat, 2007.

SKILLS:
Capable to wind spinning bobbin to cone
Able to prepare size paste preparation for given yarn.
Setup a weaving preparatory process for given quality.
Identify the yarn faults, causes and remedies of particular fault.

Image source:
[Link]

Image file name: FABRIC MANUFACTURING

 25TT205 TESTING OF FIBERS AND YARNS
Hours Per Week :
L T P SL C
3 0 2 3 4

PREREQUISITE KNOWLEDGE: Fiber science and Yarn Manufacturing.

COURSE DESCRIPTION & OBJECTIVES:
This course offers testing procedures for measurement of essential fiber properties,
measurement principle and techniques for yarn dimensions and essential yarn properties. The
objective of this course is to impart skill required for testing of fibers and yarns.

MODULE-1
18L+0T+12P+18SL = 48 Hours
UNIT-1
QUALITY CONTROL AND TESTING OF FIBERS
Introduction to textile testing and quality control: Objectives of testing, Sample types,
selection of Samples for different tests and no. of tests. Fiber parameters effecting yarn
properties and common tests to be carried out on cotton and other fibers. Fiber Quality index
and spin ability of cotton.

UNIT-2
COTTON FIBER TESTING
Tests related to humidity and fiber moisture, cotton staple length, 2.5% span length, strength
and elongation, fineness and maturity, Neps, Color. Advanced fiber testing instruments.
Other tests: Honeydew, Blend Analysis, organic cotton, fiber selection and yarn grading by
feel, visual inspection, and hand testing.

PRACTICES:
Natural Indicators - traditional Indian practices of testing fiber maturity, cleanliness, and
strength without machines, such as cotton "pull test"
Determination of moisture regain of different fibers.
Determination of Fiber maturity by NaOH swelling method.
Determination of Fiber length by bear sorter and interpretations of results.
Determination of Fiber fineness by ATIRA fineness tester.
Studies on tensile properties of fiber measuring CRL, CRE and CRT principles
Studies on AFIS and HVI instruments

MODULE-2
27L+0T+18P+27SL = 72 Hours
UNIT-1
TESTING OF YARN COUNT, TWIST
Yarn dimensions: Yarn numbering system; Measurement of linear density; Twist and
measurement of twist

UNIT-2
STRENGTH
Measurement of yarn strength by single yarn test and lea test, CSP and RKM, effect of yarn
evenness, friction and hairiness.